855 lines
156 KiB
HTML
855 lines
156 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.3"/>
|
|
<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">9.3</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(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 id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" 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 id="l00003" 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 id="l00004" 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 id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" 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 id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" 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 id="l00009" 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 id="l00010" 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 id="l00011" 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 id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" 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 id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <functional></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span> </div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include "absl/container/btree_map.h"</span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include "absl/types/span.h"</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</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 id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "<a class="code" href="sat_2model_8h.html">ortools/sat/model.h</a>"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</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 id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include "<a class="code" href="sort_8h.html">ortools/util/sort.h</a>"</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include "<a class="code" href="strong__integers_8h.html">ortools/util/strong_integers.h</a>"</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> </div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> </div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a9d6526e2b6f684e7c3c80172b598b7cb"> 37</a></span>std::function<void(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a9d6526e2b6f684e7c3c80172b598b7cb">AllDifferentBinary</a>(</div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <span class="keyword">const</span> std::vector<IntegerVariable>& vars) {</div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keywordflow">return</span> [=](<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// Fully encode all the given variables and construct a mapping value -></span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// List of literal each indicating that a given variable takes this value.</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</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 id="l00044" name="l00044"></a><span class="lineno"> 44</span> absl::btree_map<IntegerValue, std::vector<Literal>> value_to_literals;</div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>* encoder = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0185d084af6ad784edced90f45174133">FullyEncodeVariable</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& entry : encoder-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_encoder.html#a9a9cf2e23271baad10b6e66f569049f0">FullDomainEncoding</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> value_to_literals[entry.value].push_back(entry.literal);</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> }</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> }</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> </div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// Add an at most one constraint for each value.</span></div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</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 id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">if</span> (entry.second.size() > 1) {</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8a759583ee01f89ea955f23368976482">AtMostOneConstraint</a>(entry.second));</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> }</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> }</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> </div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// If the number of values is equal to the number of variables, we have</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// a permutation. We can add a bool_or for each literals attached to a</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// value.</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">if</span> (value_to_literals.size() == vars.size()) {</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</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 id="l00065" name="l00065"></a><span class="lineno"> 65</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a37093a0df3cca500d5f58b1d5482bdc6">ClauseConstraint</a>(entry.second));</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> }</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> }</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> };</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span>}</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> </div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#aee7948e4ec576c5102f5f09028388d4c"> 71</a></span>std::function<void(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aee7948e4ec576c5102f5f09028388d4c">AllDifferentOnBounds</a>(</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keyword">const</span> std::vector<AffineExpression>& expressions) {</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keywordflow">return</span> [=](<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordflow">if</span> (expressions.empty()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keyword">auto</span>* constraint = <span class="keyword">new</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html">AllDifferentBoundsPropagator</a>(</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> expressions, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>());</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> constraint->RegisterWith(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> };</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span>}</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> </div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a467d0c8bf263413aae5e5e530d4c5259"> 82</a></span>std::function<void(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aee7948e4ec576c5102f5f09028388d4c">AllDifferentOnBounds</a>(</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keyword">const</span> std::vector<IntegerVariable>& vars) {</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">return</span> [=](<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">if</span> (vars.empty()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> std::vector<AffineExpression> expressions;</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> expressions.reserve(vars.size());</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> expressions.push_back(<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> }</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keyword">auto</span>* constraint = <span class="keyword">new</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html">AllDifferentBoundsPropagator</a>(</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> expressions, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>());</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> constraint->RegisterWith(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> };</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span>}</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> </div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a0f570bf53aae0cd9303912d273425428"> 98</a></span>std::function<void(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0f570bf53aae0cd9303912d273425428">AllDifferentAC</a>(</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keyword">const</span> std::vector<IntegerVariable>& variables) {</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keywordflow">return</span> [=](<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keywordflow">if</span> (variables.size() < 3) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> </div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_all_different_constraint.html">AllDifferentConstraint</a>* constraint = <span class="keyword">new</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_all_different_constraint.html">AllDifferentConstraint</a>(</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> variables, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>(),</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>(), <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>());</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> constraint-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_all_different_constraint.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> };</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span>}</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> </div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_all_different_constraint.html#aa93f9022262acc95180e6483878d95d5"> 111</a></span><a class="code hl_function" href="classoperations__research_1_1sat_1_1_all_different_constraint.html#aa93f9022262acc95180e6483878d95d5">AllDifferentConstraint::AllDifferentConstraint</a>(</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> std::vector<IntegerVariable> variables, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>* encoder,</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail)</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> : num_variables_(variables.size()),</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> variables_(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(variables)),</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> trail_(trail),</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> integer_trail_(integer_trail) {</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// Initialize literals cache.</span></div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> int64_t min_value = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> int64_t max_value = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> variable_min_value_.resize(num_variables_);</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> variable_max_value_.resize(num_variables_);</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> variable_literal_index_.resize(num_variables_);</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordtype">int</span> num_fixed_variables = 0;</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < num_variables_; x++) {</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> variable_min_value_[x] = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(variables_[x]).value();</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> variable_max_value_[x] = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(variables_[x]).value();</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> </div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// Compute value range of all variables.</span></div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> min_value = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_value, variable_min_value_[x]);</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> max_value = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_value, variable_max_value_[x]);</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> </div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="comment">// FullyEncode does not like 1-value domains, handle this case first.</span></div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// TODO(user): Prune now, ignore these variables during solving.</span></div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="keywordflow">if</span> (variable_min_value_[x] == variable_max_value_[x]) {</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> num_fixed_variables++;</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> variable_literal_index_[x].push_back(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a7ab45c5256e605ee3da3bf3abd1df2e1">kTrueLiteralIndex</a>);</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> }</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> </div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="comment">// Force full encoding if not already done.</span></div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keywordflow">if</span> (!encoder-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_encoder.html#ac9e262bbda19ec4b7d51bd77b70bb363">VariableIsFullyEncoded</a>(variables_[x])) {</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> encoder-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_encoder.html#a1fc2c45d01fd348f668c2f7407015a20">FullyEncodeVariable</a>(variables_[x]);</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> }</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> </div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// Fill cache with literals, default value is kFalseLiteralIndex.</span></div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> int64_t size = variable_max_value_[x] - variable_min_value_[x] + 1;</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> variable_literal_index_[x].resize(size, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a969b5056550d96847f8c35f19fd17f50">kFalseLiteralIndex</a>);</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& entry : encoder-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_encoder.html#a9a9cf2e23271baad10b6e66f569049f0">FullDomainEncoding</a>(variables_[x])) {</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> int64_t <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = entry.value.value();</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// Can happen because of initial propagation!</span></div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> < variable_min_value_[x] || variable_max_value_[x] < <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> }</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> variable_literal_index_[x][<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - variable_min_value_[x]] =</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> entry.literal.Index();</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> }</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> }</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> min_all_values_ = min_value;</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> num_all_values_ = max_value - min_value + 1;</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> </div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> successor_.resize(num_variables_);</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> variable_to_value_.assign(num_variables_, -1);</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> visiting_.resize(num_variables_);</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> variable_visited_from_.resize(num_variables_);</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> residual_graph_successors_.resize(num_variables_ + num_all_values_ + 1);</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> component_number_.resize(num_variables_ + num_all_values_ + 1);</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span>}</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> </div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_all_different_constraint.html#a6ee8ed57254aec3ae99d399bae5b3736"> 170</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_all_different_constraint.html#a6ee8ed57254aec3ae99d399bae5b3736">AllDifferentConstraint::RegisterWith</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = watcher-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">Register</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> watcher-><a class="code hl_function" 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 id="l00173" name="l00173"></a><span class="lineno"> 173</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 id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> LiteralIndex li : literal_indices) {</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="comment">// Watch only unbound literals.</span></div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="keywordflow">if</span> (li >= 0 &&</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> !trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_trail.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(li).Variable())) {</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> watcher-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8f6dd74a841475ccb390614d2b212170">WatchLiteral</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(li), <span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> watcher-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8f6dd74a841475ccb390614d2b212170">WatchLiteral</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(li).Negated(), <span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> }</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> }</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> }</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span>}</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> </div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span>LiteralIndex AllDifferentConstraint::VariableLiteralIndexOf(<span class="keywordtype">int</span> x,</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> int64_t <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="keywordflow">return</span> (<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> < variable_min_value_[x] || variable_max_value_[x] < <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> ? <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a969b5056550d96847f8c35f19fd17f50">kFalseLiteralIndex</a></div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> : variable_literal_index_[x][<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - variable_min_value_[x]];</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span>}</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> </div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> AllDifferentConstraint::VariableHasPossibleValue(<span class="keywordtype">int</span> x,</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> int64_t <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> LiteralIndex li = VariableLiteralIndexOf(x, <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="keywordflow">if</span> (li == <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a969b5056550d96847f8c35f19fd17f50">kFalseLiteralIndex</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="keywordflow">if</span> (li == <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a7ab45c5256e605ee3da3bf3abd1df2e1">kTrueLiteralIndex</a>) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(li, 0);</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="keywordflow">return</span> !trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_trail.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(Literal(li));</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span>}</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> </div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span><span class="keywordtype">bool</span> AllDifferentConstraint::MakeAugmentingPath(<span class="keywordtype">int</span> <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>) {</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="comment">// Do a BFS and use visiting_ as a queue, with num_visited pointing</span></div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="comment">// at its begin() and num_to_visit its end().</span></div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <span class="comment">// To switch to the augmenting path once a nonmatched value was found,</span></div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="comment">// we remember the BFS tree in variable_visited_from_.</span></div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="keywordtype">int</span> num_to_visit = 0;</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="keywordtype">int</span> num_visited = 0;</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="comment">// Enqueue start.</span></div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> visiting_[num_to_visit++] = <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>;</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> variable_visited_[<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> variable_visited_from_[<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>] = -1;</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> </div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="keywordflow">while</span> (num_visited < num_to_visit) {</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="comment">// Dequeue node to visit.</span></div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="keyword">const</span> <span class="keywordtype">int</span> node = visiting_[num_visited++];</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> </div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : successor_[node]) {</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="keywordflow">if</span> (value_visited_[<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> value_visited_[<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="keywordflow">if</span> (value_to_variable_[<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>] == -1) {</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <span class="comment">// value is not matched: change path from node to start, and return.</span></div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="keywordtype">int</span> path_node = node;</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="keywordtype">int</span> path_value = <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="keywordflow">while</span> (path_node != -1) {</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="keywordtype">int</span> old_value = variable_to_value_[path_node];</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> variable_to_value_[path_node] = path_value;</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> value_to_variable_[path_value] = path_node;</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> path_node = variable_visited_from_[path_node];</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> path_value = old_value;</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> }</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="comment">// Enqueue node matched to value.</span></div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="keyword">const</span> <span class="keywordtype">int</span> next_node = value_to_variable_[<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>];</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> variable_visited_[next_node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> visiting_[num_to_visit++] = next_node;</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> variable_visited_from_[next_node] = node;</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> }</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> }</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> }</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span>}</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> </div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span><span class="comment">// The algorithm copies the solver state to successor_, which is used to compute</span></div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span><span class="comment">// a matching. If all variables can be matched, it generates the residual graph</span></div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span><span class="comment">// in separate vectors, computes its SCCs, and filters variable -> value if</span></div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span><span class="comment">// variable is not in the same SCC as value.</span></div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span><span class="comment">// Explanations for failure and filtering are fine-grained:</span></div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span><span class="comment">// failure is explained by a Hall set, i.e. dom(variables) \subseteq {values},</span></div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span><span class="comment">// with |variables| < |values|; filtering is explained by the Hall set that</span></div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span><span class="comment">// would happen if the variable was assigned to the value.</span></div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span><span class="comment">// TODO(user): If needed, there are several ways performance could be</span></div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span><span class="comment">// improved.</span></div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span><span class="comment">// If copying the variable state is too costly, it could be maintained instead.</span></div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span><span class="comment">// If the propagator has too many fruitless calls (without failing/pruning),</span></div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</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 id="l00258" name="l00258"></a><span class="lineno"> 258</span><span class="comment">// and guard calls to Propagate() if these arcs are still valid.</span></div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_all_different_constraint.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 259</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_all_different_constraint.html#ac1fe9b1f2b978c4283e42f12e586eb1e">AllDifferentConstraint::Propagate</a>() {</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="comment">// Copy variable state to graph state.</span></div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> prev_matching_ = variable_to_value_;</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> value_to_variable_.assign(num_all_values_, -1);</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> variable_to_value_.assign(num_variables_, -1);</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < num_variables_; x++) {</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> successor_[x].clear();</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <span class="keyword">const</span> int64_t min_value = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(variables_[x]).value();</div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="keyword">const</span> int64_t max_value = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(variables_[x]).value();</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="keywordflow">for</span> (int64_t <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = min_value; <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> <= max_value; <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>++) {</div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="keywordflow">if</span> (VariableHasPossibleValue(x, <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)) {</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> <span class="keyword">const</span> <span class="keywordtype">int</span> offset_value = <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - min_all_values_;</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="comment">// Forward-checking should propagate x != value.</span></div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> successor_[x].push_back(offset_value);</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> }</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> }</div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="keywordflow">if</span> (successor_[x].size() == 1) {</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="keyword">const</span> <span class="keywordtype">int</span> offset_value = successor_[x][0];</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="keywordflow">if</span> (value_to_variable_[offset_value] == -1) {</div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> value_to_variable_[offset_value] = x;</div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> variable_to_value_[x] = offset_value;</div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> }</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> }</div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> }</div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> </div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> <span class="comment">// Because we currently propagates all clauses before entering this</span></div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="comment">// propagator, we known that this can't happen.</span></div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < num_variables_; x++) {</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</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 id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="keywordflow">if</span> (value_to_variable_[offset_value] != -1 &&</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> value_to_variable_[offset_value] != x) {</div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should have been propagated by AllDifferentBinary()!"</span>;</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> }</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> }</div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> }</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> }</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> </div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="comment">// Seed with previous matching.</span></div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < num_variables_; x++) {</div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="keywordflow">if</span> (variable_to_value_[x] != -1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <span class="keyword">const</span> <span class="keywordtype">int</span> prev_value = prev_matching_[x];</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</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 id="l00302" name="l00302"></a><span class="lineno"> 302</span> </div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> <span class="keywordflow">if</span> (VariableHasPossibleValue(x, prev_matching_[x] + min_all_values_)) {</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> variable_to_value_[x] = prev_matching_[x];</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> value_to_variable_[prev_matching_[x]] = x;</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> }</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> }</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> </div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="comment">// Compute max matching.</span></div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> <span class="keywordtype">int</span> x = 0;</div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="keywordflow">for</span> (; x < num_variables_; x++) {</div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="keywordflow">if</span> (variable_to_value_[x] == -1) {</div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> value_visited_.assign(num_all_values_, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> variable_visited_.assign(num_variables_, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> MakeAugmentingPath(x);</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> }</div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</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 id="l00318" name="l00318"></a><span class="lineno"> 318</span> }</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> </div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> <span class="comment">// Fail if covering variables impossible.</span></div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> <span class="comment">// Explain with the forbidden parts of the graph that prevent</span></div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> <span class="comment">// MakeAugmentingPath from increasing the matching size.</span></div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <span class="keywordflow">if</span> (x < num_variables_) {</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> <span class="comment">// For now explain all forbidden arcs.</span></div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> std::vector<Literal>* conflict = trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_trail.html#ab932e215c6dff3fe8f077d4d6a409c0c">MutableConflict</a>();</div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> conflict->clear();</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> y = 0; y < num_variables_; y++) {</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <span class="keywordflow">if</span> (!variable_visited_[y]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = variable_min_value_[y]; <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> <= variable_max_value_[y];</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>++) {</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> <span class="keyword">const</span> LiteralIndex li = VariableLiteralIndexOf(y, <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> <span class="keywordflow">if</span> (li >= 0 && !value_visited_[<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - min_all_values_]) {</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_trail.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(li)));</div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> conflict->push_back(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(li));</div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> }</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> }</div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> }</div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> }</div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> </div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> <span class="comment">// The current matching is a valid solution, now try to filter values.</span></div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> <span class="comment">// Build residual graph, compute its SCCs.</span></div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < num_variables_; x++) {</div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> residual_graph_successors_[x].clear();</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> succ : successor_[x]) {</div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <span class="keywordflow">if</span> (succ != variable_to_value_[x]) {</div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> residual_graph_successors_[x].push_back(num_variables_ + succ);</div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> }</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> }</div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> }</div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</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 id="l00352" name="l00352"></a><span class="lineno"> 352</span> residual_graph_successors_[num_variables_ + offset_value].clear();</div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> <span class="keywordflow">if</span> (value_to_variable_[offset_value] != -1) {</div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> residual_graph_successors_[num_variables_ + offset_value].push_back(</div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> value_to_variable_[offset_value]);</div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> }</div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> }</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <span class="keyword">const</span> <span class="keywordtype">int</span> dummy_node = num_variables_ + num_all_values_;</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> residual_graph_successors_[dummy_node].clear();</div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> <span class="keywordflow">if</span> (num_variables_ < num_all_values_) {</div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < num_variables_; x++) {</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> residual_graph_successors_[dummy_node].push_back(x);</div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> }</div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</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 id="l00365" name="l00365"></a><span class="lineno"> 365</span> <span class="keywordflow">if</span> (value_to_variable_[offset_value] == -1) {</div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> residual_graph_successors_[num_variables_ + offset_value].push_back(</div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> dummy_node);</div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> }</div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> }</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> }</div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> </div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> <span class="comment">// Compute SCCs, make node -> component map.</span></div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> <span class="keyword">struct </span>SccOutput {</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> <span class="keyword">explicit</span> SccOutput(std::vector<int>* c) : components(c) {}</div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> <span class="keywordtype">void</span> emplace_back(<span class="keywordtype">int</span> <span class="keyword">const</span>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, <span class="keywordtype">int</span> <span class="keyword">const</span>* e) {</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <span class="keyword">const</span>* it = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>; it < e; ++it) {</div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> (*components)[*it] = num_components;</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> }</div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> ++num_components;</div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> }</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> <span class="keywordtype">int</span> num_components = 0;</div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> std::vector<int>* components;</div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> };</div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> SccOutput scc_output(&component_number_);</div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> <a class="code hl_function" href="strongly__connected__components_8h.html#aafab5785b250e1013c13511ce478f36b">FindStronglyConnectedComponents</a>(</div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</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 id="l00387" name="l00387"></a><span class="lineno"> 387</span> residual_graph_successors_, &scc_output);</div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> </div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> <span class="comment">// Remove arcs var -> val where SCC(var) -/->* SCC(val).</span></div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < num_variables_; x++) {</div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> <span class="keywordflow">if</span> (successor_[x].size() == 1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</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 id="l00393" name="l00393"></a><span class="lineno"> 393</span> <span class="keyword">const</span> <span class="keywordtype">int</span> value_node = offset_value + num_variables_;</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> <span class="keywordflow">if</span> (variable_to_value_[x] != offset_value &&</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> component_number_[x] != component_number_[value_node] &&</div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> VariableHasPossibleValue(x, offset_value + min_all_values_)) {</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> <span class="comment">// We can deduce that x != value. To explain, force x == offset_value,</span></div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> <span class="comment">// then find another assignment for the variable matched to</span></div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> <span class="comment">// offset_value. It will fail: explaining why is the same as</span></div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> <span class="comment">// explaining failure as above, and it is an explanation of x != value.</span></div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> value_visited_.assign(num_all_values_, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> variable_visited_.assign(num_variables_, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> <span class="comment">// Undo x -> old_value and old_variable -> offset_value.</span></div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> <span class="keyword">const</span> <span class="keywordtype">int</span> old_variable = value_to_variable_[offset_value];</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> variable_to_value_[old_variable] = -1;</div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> <span class="keyword">const</span> <span class="keywordtype">int</span> old_value = variable_to_value_[x];</div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> value_to_variable_[old_value] = -1;</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> variable_to_value_[x] = offset_value;</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> value_to_variable_[offset_value] = x;</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> </div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> value_visited_[offset_value] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> MakeAugmentingPath(old_variable);</div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> <a class="code hl_define" 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 id="l00414" name="l00414"></a><span class="lineno"> 414</span> </div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> std::vector<Literal>* reason = trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_trail.html#a39e628d11fd17d1fd771210f8c8b1d2d">GetEmptyVectorToStoreReason</a>();</div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> y = 0; y < num_variables_; y++) {</div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> <span class="keywordflow">if</span> (!variable_visited_[y]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = variable_min_value_[y];</div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> <= variable_max_value_[y]; <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>++) {</div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> <span class="keyword">const</span> LiteralIndex li = VariableLiteralIndexOf(y, <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> <span class="keywordflow">if</span> (li >= 0 && !value_visited_[<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - min_all_values_]) {</div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!VariableHasPossibleValue(y, <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>));</div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> reason->push_back(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(li));</div>
|
|
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> }</div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> }</div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> }</div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> </div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> <span class="keyword">const</span> LiteralIndex li =</div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> VariableLiteralIndexOf(x, offset_value + min_all_values_);</div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(li, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a7ab45c5256e605ee3da3bf3abd1df2e1">kTrueLiteralIndex</a>);</div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(li, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a969b5056550d96847f8c35f19fd17f50">kFalseLiteralIndex</a>);</div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> <span class="keywordflow">return</span> trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_trail.html#aa390738a7cb0521a9c1951f3108c0251">EnqueueWithStoredReason</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(li).Negated());</div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> }</div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> }</div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> }</div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> </div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span>}</div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> </div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#a78dfacd9548d8e380a976e1034c41c13"> 440</a></span><a class="code hl_function" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#a78dfacd9548d8e380a976e1034c41c13">AllDifferentBoundsPropagator::AllDifferentBoundsPropagator</a>(</div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> <span class="keyword">const</span> std::vector<AffineExpression>& expressions,</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail)</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> : integer_trail_(integer_trail) {</div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!expressions.empty());</div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> </div>
|
|
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> <span class="comment">// We need +2 for sentinels.</span></div>
|
|
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a> = expressions.size() + 2;</div>
|
|
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> index_to_start_index_.resize(<a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>);</div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> index_to_end_index_.resize(<a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>);</div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> index_is_present_.resize(<a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> index_to_expr_.resize(<a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>);</div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> </div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < expressions.size(); ++i) {</div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> bounds_.push_back({expressions[i]});</div>
|
|
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> negated_bounds_.push_back({expressions[i].Negated()});</div>
|
|
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> }</div>
|
|
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span>}</div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> </div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 459</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">AllDifferentBoundsPropagator::Propagate</a>() {</div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> <span class="keywordflow">if</span> (!PropagateLowerBounds()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> </div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> <span class="comment">// Note that it is not required to swap back bounds_ and negated_bounds_.</span></div>
|
|
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> <span class="comment">// TODO(user): investigate the impact.</span></div>
|
|
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(bounds_, negated_bounds_);</div>
|
|
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> result = PropagateLowerBounds();</div>
|
|
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(bounds_, negated_bounds_);</div>
|
|
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span>}</div>
|
|
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> </div>
|
|
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span><span class="keywordtype">void</span> AllDifferentBoundsPropagator::FillHallReason(IntegerValue hall_lb,</div>
|
|
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> IntegerValue hall_ub) {</div>
|
|
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> integer_reason_.clear();</div>
|
|
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> <span class="keyword">const</span> <span class="keywordtype">int</span> limit = GetIndex(hall_ub);</div>
|
|
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = GetIndex(hall_lb); i <= limit; ++i) {</div>
|
|
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> expr = index_to_expr_[i];</div>
|
|
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> integer_reason_.push_back(expr.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(hall_lb));</div>
|
|
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> integer_reason_.push_back(expr.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(hall_ub));</div>
|
|
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> }</div>
|
|
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span>}</div>
|
|
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> </div>
|
|
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span><span class="keywordtype">int</span> AllDifferentBoundsPropagator::FindStartIndexAndCompressPath(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> <span class="comment">// First, walk the pointer until we find one pointing to itself.</span></div>
|
|
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> <span class="keywordtype">int</span> start_index = <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = index_to_start_index_[start_index];</div>
|
|
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> <span class="keywordflow">if</span> (start_index == <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> start_index = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> }</div>
|
|
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> </div>
|
|
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> <span class="comment">// Second, redo the same thing and make everyone point to the representative.</span></div>
|
|
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = index_to_start_index_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> <span class="keywordflow">if</span> (start_index == <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> index_to_start_index_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = start_index;</div>
|
|
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> }</div>
|
|
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> <span class="keywordflow">return</span> start_index;</div>
|
|
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span>}</div>
|
|
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> </div>
|
|
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span><span class="keywordtype">bool</span> AllDifferentBoundsPropagator::PropagateLowerBounds() {</div>
|
|
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span> <span class="comment">// Start by filling the cached bounds and sorting by increasing lb.</span></div>
|
|
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> <span class="keywordflow">for</span> (CachedBounds& entry : bounds_) {</div>
|
|
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span> entry.lb = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(entry.expr);</div>
|
|
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> entry.ub = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(entry.expr);</div>
|
|
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> }</div>
|
|
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> <a class="code hl_function" href="namespaceoperations__research.html#a793092fb9f25552acabb89ee399bbd81">IncrementalSort</a>(bounds_.begin(), bounds_.end(),</div>
|
|
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> [](CachedBounds <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, CachedBounds <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) { return a.lb < b.lb; });</div>
|
|
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> </div>
|
|
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> <span class="comment">// We will split the affine epressions in vars sorted by lb in contiguous</span></div>
|
|
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> <span class="comment">// subset with index of the form [start, start + num_in_window).</span></div>
|
|
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = 0;</div>
|
|
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> <span class="keywordtype">int</span> num_in_window = 1;</div>
|
|
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> </div>
|
|
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> <span class="comment">// Minimum lower bound in the current window.</span></div>
|
|
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> IntegerValue min_lb = bounds_.front().lb;</div>
|
|
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> </div>
|
|
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size = bounds_.size();</div>
|
|
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < size; ++i) {</div>
|
|
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> <span class="keyword">const</span> IntegerValue lb = bounds_[i].lb;</div>
|
|
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> </div>
|
|
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> <span class="comment">// If the lower bounds of all the other variables is greater, then it can</span></div>
|
|
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> <span class="comment">// never fall into a potential hall interval formed by the variable in the</span></div>
|
|
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> <span class="comment">// current window, so we can split the problem into independent parts.</span></div>
|
|
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> <span class="keywordflow">if</span> (lb <= min_lb + IntegerValue(num_in_window - 1)) {</div>
|
|
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> ++num_in_window;</div>
|
|
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> }</div>
|
|
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> </div>
|
|
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span> <span class="comment">// Process the current window.</span></div>
|
|
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> <span class="keywordflow">if</span> (num_in_window > 1) {</div>
|
|
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> absl::Span<CachedBounds> window(&bounds_[<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>], num_in_window);</div>
|
|
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> <span class="keywordflow">if</span> (!PropagateLowerBoundsInternal(min_lb, window)) {</div>
|
|
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> }</div>
|
|
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"> 535</span> }</div>
|
|
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> </div>
|
|
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> <span class="comment">// Start of the next window.</span></div>
|
|
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = i;</div>
|
|
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> num_in_window = 1;</div>
|
|
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> min_lb = lb;</div>
|
|
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> }</div>
|
|
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> </div>
|
|
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> <span class="comment">// Take care of the last window.</span></div>
|
|
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> <span class="keywordflow">if</span> (num_in_window > 1) {</div>
|
|
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> absl::Span<CachedBounds> window(&bounds_[<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>], num_in_window);</div>
|
|
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> <span class="keywordflow">return</span> PropagateLowerBoundsInternal(min_lb, window);</div>
|
|
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> }</div>
|
|
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> </div>
|
|
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span>}</div>
|
|
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> </div>
|
|
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span><span class="keywordtype">bool</span> AllDifferentBoundsPropagator::PropagateLowerBoundsInternal(</div>
|
|
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> IntegerValue min_lb, absl::Span<CachedBounds> <a class="code hl_variable" href="cp__model__solver_8cc.html#a06dad0852d85b0686e01c084207c03a7">bounds</a>) {</div>
|
|
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span> hall_starts_.clear();</div>
|
|
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> hall_ends_.clear();</div>
|
|
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> </div>
|
|
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> <span class="comment">// All cached lb in bounds will be in [min_lb, min_lb + bounds_.size()).</span></div>
|
|
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> <span class="comment">// Make sure we change our base_ so that GetIndex() fit in our buffers.</span></div>
|
|
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> base_ = min_lb - IntegerValue(1);</div>
|
|
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span> </div>
|
|
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> <span class="comment">// Sparse cleaning of index_is_present_.</span></div>
|
|
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</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 id="l00563" name="l00563"></a><span class="lineno"> 563</span> index_is_present_[i] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span> }</div>
|
|
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> indices_to_clear_.clear();</div>
|
|
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> </div>
|
|
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> <span class="comment">// Sort bounds by increasing ub.</span></div>
|
|
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span> std::sort(<a class="code hl_variable" href="cp__model__solver_8cc.html#a06dad0852d85b0686e01c084207c03a7">bounds</a>.begin(), <a class="code hl_variable" href="cp__model__solver_8cc.html#a06dad0852d85b0686e01c084207c03a7">bounds</a>.end(),</div>
|
|
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> [](CachedBounds <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, CachedBounds <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) { return a.ub < b.ub; });</div>
|
|
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> CachedBounds entry : <a class="code hl_variable" href="cp__model__solver_8cc.html#a06dad0852d85b0686e01c084207c03a7">bounds</a>) {</div>
|
|
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> <span class="keyword">const</span> AffineExpression expr = entry.expr;</div>
|
|
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> </div>
|
|
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno"> 573</span> <span class="comment">// Note that it is important to use the cache to make sure GetIndex() is</span></div>
|
|
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno"> 574</span> <span class="comment">// not out of bound in case integer_trail_->LowerBound() changed when we</span></div>
|
|
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> <span class="comment">// pushed something.</span></div>
|
|
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> <span class="keyword">const</span> IntegerValue lb = entry.lb;</div>
|
|
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</span> <span class="keyword">const</span> <span class="keywordtype">int</span> lb_index = GetIndex(lb);</div>
|
|
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno"> 578</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> value_is_covered = index_is_present_[lb_index];</div>
|
|
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> </div>
|
|
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</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 id="l00581" name="l00581"></a><span class="lineno"> 581</span> <span class="keywordflow">if</span> (value_is_covered) {</div>
|
|
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span> <span class="keyword">const</span> <span class="keywordtype">int</span> hall_index =</div>
|
|
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span> <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">std::lower_bound</a>(hall_ends_.begin(), hall_ends_.end(), lb) -</div>
|
|
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno"> 584</span> hall_ends_.begin();</div>
|
|
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"> 585</span> <span class="keywordflow">if</span> (hall_index < hall_ends_.size() && hall_starts_[hall_index] <= lb) {</div>
|
|
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno"> 586</span> <span class="keyword">const</span> IntegerValue hs = hall_starts_[hall_index];</div>
|
|
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"> 587</span> <span class="keyword">const</span> IntegerValue he = hall_ends_[hall_index];</div>
|
|
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"> 588</span> FillHallReason(hs, he);</div>
|
|
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span> integer_reason_.push_back(expr.GreaterOrEqual(hs));</div>
|
|
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> <span class="keywordflow">if</span> (!integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(expr.GreaterOrEqual(he + 1),</div>
|
|
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span> integer_reason_)) {</div>
|
|
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> }</div>
|
|
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> }</div>
|
|
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> }</div>
|
|
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> </div>
|
|
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span> <span class="comment">// Update our internal representation of the non-consecutive intervals.</span></div>
|
|
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</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 id="l00600" name="l00600"></a><span class="lineno"> 600</span> <span class="comment">// right of the interval that contains lb. In both cases, if there is an</span></div>
|
|
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> <span class="comment">// interval to the left (resp. right) we merge them.</span></div>
|
|
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> <span class="keywordtype">int</span> new_index = lb_index;</div>
|
|
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> <span class="keywordtype">int</span> start_index = lb_index;</div>
|
|
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"> 604</span> <span class="keywordtype">int</span> end_index = lb_index;</div>
|
|
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"> 605</span> <span class="keywordflow">if</span> (value_is_covered) {</div>
|
|
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> start_index = FindStartIndexAndCompressPath(new_index);</div>
|
|
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span> new_index = index_to_end_index_[start_index] + 1;</div>
|
|
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> end_index = new_index;</div>
|
|
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"> 609</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> <span class="keywordflow">if</span> (index_is_present_[new_index - 1]) {</div>
|
|
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno"> 611</span> start_index = FindStartIndexAndCompressPath(new_index - 1);</div>
|
|
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno"> 612</span> }</div>
|
|
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> }</div>
|
|
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> <span class="keywordflow">if</span> (index_is_present_[new_index + 1]) {</div>
|
|
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> end_index = index_to_end_index_[new_index + 1];</div>
|
|
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> index_to_start_index_[new_index + 1] = start_index;</div>
|
|
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> }</div>
|
|
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</span> </div>
|
|
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno"> 619</span> <span class="comment">// Update the end of the representative.</span></div>
|
|
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span> index_to_end_index_[start_index] = end_index;</div>
|
|
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> </div>
|
|
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> <span class="comment">// This is the only place where we "add" a new node.</span></div>
|
|
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> {</div>
|
|
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span> index_to_start_index_[new_index] = start_index;</div>
|
|
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span> index_to_expr_[new_index] = expr;</div>
|
|
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"> 626</span> index_is_present_[new_index] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> indices_to_clear_.push_back(new_index);</div>
|
|
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span> }</div>
|
|
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> </div>
|
|
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> <span class="comment">// In most situation, we cannot have a conflict now, because it should have</span></div>
|
|
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span> <span class="comment">// been detected before by pushing an interval lower bound past its upper</span></div>
|
|
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> <span class="comment">// bound. However, it is possible that when we push one bound, other bounds</span></div>
|
|
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span> <span class="comment">// change. So if the upper bound is smaller than the current interval end,</span></div>
|
|
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span> <span class="comment">// we abort so that the conflit reason will be better on the next call to</span></div>
|
|
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span> <span class="comment">// the propagator.</span></div>
|
|
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = GetValue(end_index);</div>
|
|
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> > integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(expr)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span> </div>
|
|
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</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 id="l00640" name="l00640"></a><span class="lineno"> 640</span> <span class="comment">// always be last, and if it overlaps some previous Hall intervals, it</span></div>
|
|
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span> <span class="comment">// always overlaps them fully.</span></div>
|
|
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"> 643</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 id="l00644" name="l00644"></a><span class="lineno"> 644</span> <span class="comment">// value, but in practice it shouldn't really change when we push a</span></div>
|
|
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno"> 645</span> <span class="comment">// lower_bound and it is faster to use the cached entry.</span></div>
|
|
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno"> 646</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> == entry.ub) {</div>
|
|
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno"> 647</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = GetValue(start_index);</div>
|
|
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> <span class="keywordflow">while</span> (!hall_starts_.empty() && <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> <= hall_starts_.back()) {</div>
|
|
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"> 649</span> hall_starts_.pop_back();</div>
|
|
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno"> 650</span> hall_ends_.pop_back();</div>
|
|
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"> 651</span> }</div>
|
|
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno"> 652</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(hall_ends_.empty() || hall_ends_.back() < <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>);</div>
|
|
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno"> 653</span> hall_starts_.push_back(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>);</div>
|
|
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> hall_ends_.push_back(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>);</div>
|
|
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> }</div>
|
|
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno"> 656</span> }</div>
|
|
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno"> 657</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"> 658</span>}</div>
|
|
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno"> 659</span> </div>
|
|
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736"> 660</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">AllDifferentBoundsPropagator::RegisterWith</a>(</div>
|
|
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno"> 661</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div>
|
|
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno"> 662</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = watcher-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">Register</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno"> 663</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> CachedBounds& entry : bounds_) {</div>
|
|
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"> 664</span> watcher-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">WatchAffineExpression</a>(entry.expr, <span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</span> }</div>
|
|
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno"> 666</span> watcher-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aef66ce77e5b87afecf1c5696f44d4d1c">NotifyThatPropagatorMayNotReachFixedPointInOnePass</a>(<span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno"> 667</span>}</div>
|
|
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> </div>
|
|
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno"> 669</span>} <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno"> 670</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_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="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_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#l00892">base/logging.h:892</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#l00895">base/logging.h:895</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#l00890">base/logging.h:890</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#l00891">base/logging.h:891</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#l00153">all_different.h:153</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#l00660">all_different.cc:660</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_all_different_bounds_propagator_html_a78dfacd9548d8e380a976e1034c41c13"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#a78dfacd9548d8e380a976e1034c41c13">operations_research::sat::AllDifferentBoundsPropagator::AllDifferentBoundsPropagator</a></div><div class="ttdeci">AllDifferentBoundsPropagator(const std::vector< AffineExpression > &expressions, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="all__different_8cc_source.html#l00440">all_different.cc:440</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#l00459">all_different.cc:459</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#l00068">all_different.h:68</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#l00170">all_different.cc:170</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#l00111">all_different.cc:111</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#l00259">all_different.cc:259</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#l01228">integer.h:1228</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#l01561">integer.h:1561</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_abaec50ed809d8f0a1754c9a9225d3b5e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">operations_research::sat::GenericLiteralWatcher::WatchAffineExpression</a></div><div class="ttdeci">void WatchAffineExpression(AffineExpression e, int id)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01278">integer.h:1278</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#l02051">integer.cc:2051</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#l02028">integer.cc:2028</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#l02058">integer.cc:2058</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#l00362">integer.h:362</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#l00066">integer.cc:66</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_encoder_html_a9a9cf2e23271baad10b6e66f569049f0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html#a9a9cf2e23271baad10b6e66f569049f0">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#l00131">integer.cc:131</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#l00096">integer.cc:96</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#l00620">integer.h:620</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#l01449">integer.h:1449</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a9393fc2c24f073a494687363af790b39"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">operations_research::sat::IntegerTrail::SafeEnqueue</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool SafeEnqueue(IntegerLiteral i_lit, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01030">integer.cc:1030</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#l01445">integer.h:1445</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#l00067">sat_base.h:67</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#l00042">sat/model.h:42</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#l00236">sat_base.h:236</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a39e628d11fd17d1fd771210f8c8b1d2d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a39e628d11fd17d1fd771210f8c8b1d2d">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#l00323">sat_base.h:323</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a4793952607a98dfddfbcc17abfabbb4b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a4793952607a98dfddfbcc17abfabbb4b">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#l00383">sat_base.h:383</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#l00287">sat_base.h:287</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_ab932e215c6dff3fe8f077d4d6a409c0c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#ab932e215c6dff3fe8f077d4d6a409c0c">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#l00364">sat_base.h:364</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#l00161">sat_base.h:161</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#l00150">sat_base.h:150</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_acb18315d548212835cd8ed4287e6c0b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a></div><div class="ttdeci">int64_t a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00046">constraint_solver/table.cc:46</a></div></div>
|
|
<div 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#l00678">constraint_solver.cc:678</a></div></div>
|
|
<div class="ttc" id="acp__model__solver_8cc_html_a06dad0852d85b0686e01c084207c03a7"><div class="ttname"><a href="cp__model__solver_8cc.html#a06dad0852d85b0686e01c084207c03a7">bounds</a></div><div class="ttdeci">SharedBoundsManager * bounds</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02051">cp_model_solver.cc:2051</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="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#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="agscip__solver_8cc_html_a1e2f9a2352c1d9a6cada9544898fceec"><div class="ttname"><a href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a></div><div class="ttdeci">double lower_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00136">gscip_solver.cc:136</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#l00274">gurobi_interface.cc:274</a></div></div>
|
|
<div class="ttc" id="ainteger_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="alocal__search_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l02750">local_search.cc:2750</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="anamespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap< K, V > &a, IdMap< K, V > &b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00262">id_map.h:262</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a0185d084af6ad784edced90f45174133"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0185d084af6ad784edced90f45174133">operations_research::sat::FullyEncodeVariable</a></div><div class="ttdeci">std::function< std::vector< ValueLiteralPair >(Model *)> FullyEncodeVariable(IntegerVariable var)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01783">integer.h:1783</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#l00098">all_different.cc:98</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a37093a0df3cca500d5f58b1d5482bdc6"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a37093a0df3cca500d5f58b1d5482bdc6">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#l00935">sat_solver.h:935</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_a8a759583ee01f89ea955f23368976482"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8a759583ee01f89ea955f23368976482">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#l00921">sat_solver.h:921</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a969b5056550d96847f8c35f19fd17f50"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a969b5056550d96847f8c35f19fd17f50">operations_research::sat::kFalseLiteralIndex</a></div><div class="ttdeci">const LiteralIndex kFalseLiteralIndex(-3)</div></div>
|
|
<div class="ttc" id="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#l00037">all_different.cc:37</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aee7948e4ec576c5102f5f09028388d4c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aee7948e4ec576c5102f5f09028388d4c">operations_research::sat::AllDifferentOnBounds</a></div><div class="ttdeci">std::function< void(Model *)> AllDifferentOnBounds(const std::vector< AffineExpression > &expressions)</div><div class="ttdef"><b>Definition:</b> <a href="all__different_8cc_source.html#l00071">all_different.cc:71</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">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="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="anamespacestd_html"><div class="ttname"><a href="namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a2acb49f4df5288066c43610bede123ec"><div class="ttname"><a href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a></div><div class="ttdeci">int64_t capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00151">routing_flow.cc:151</a></div></div>
|
|
<div class="ttc" id="asat_2model_8h_html"><div class="ttname"><a href="sat_2model_8h.html">model.h</a></div></div>
|
|
<div class="ttc" id="asat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</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="asparse__submatrix_8cc_html_a4d53eac2ef2732c28fa9fb663e0c19a7"><div class="ttname"><a href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a></div><div class="ttdeci">std::optional< int64_t > end</div><div class="ttdef"><b>Definition:</b> <a href="sparse__submatrix_8cc_source.html#l00036">sparse_submatrix.cc:36</a></div></div>
|
|
<div class="ttc" id="asparse__submatrix_8cc_html_a9b7656b922ea4ec96097d7380c0e61fe"><div class="ttname"><a href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a></div><div class="ttdeci">int64_t start</div><div class="ttdef"><b>Definition:</b> <a href="sparse__submatrix_8cc_source.html#l00035">sparse_submatrix.cc:35</a></div></div>
|
|
<div class="ttc" id="astrong__integers_8h_html"><div class="ttname"><a href="strong__integers_8h.html">strong_integers.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#l00212">strongly_connected_components.h:212</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_affine_expression_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html">operations_research::sat::AffineExpression</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00233">integer.h:233</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_affine_expression_html_a5d6f020504838c2d57528f47cd1fe164"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">operations_research::sat::AffineExpression::GreaterOrEqual</a></div><div class="ttdeci">IntegerLiteral GreaterOrEqual(IntegerValue bound) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01416">integer.h:1416</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_affine_expression_html_a8d484cfa3afefda70ef152313dffdc27"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">operations_research::sat::AffineExpression::LowerOrEqual</a></div><div class="ttdeci">IntegerLiteral LowerOrEqual(IntegerValue bound) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01432">integer.h:1432</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.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|