1463 lines
256 KiB
HTML
1463 lines
256 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: table.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.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('constraint__solver_2table_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">constraint_solver/table.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="constraint__solver_2table_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// This file implements the table constraints.</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  </div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  </div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "absl/strings/str_format.h"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "absl/strings/str_join.h"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="commandlineflags_8h.html">ortools/base/commandlineflags.h</a>"</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="constraint__solver_8h.html">ortools/constraint_solver/constraint_solver.h</a>"</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include "<a class="code" href="constraint__solveri_8h.html">ortools/constraint_solver/constraint_solveri.h</a>"</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include "<a class="code" href="bitset_8h.html">ortools/util/bitset.h</a>"</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "<a class="code" href="string__array_8h.html">ortools/util/string_array.h</a>"</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include "<a class="code" href="tuple__set_8h.html">ortools/util/tuple_set.h</a>"</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  </div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// ----- Presolve helpers -----</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// TODO(user): Move this out of this file.</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="keyword">struct </span>AffineTransformation { <span class="comment">// y == a*x + b.</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  AffineTransformation() : <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>(1), <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>(0) {}</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  AffineTransformation(int64_t aa, int64_t bb) : <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>(aa), <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>(bb) {</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, 0);</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  }</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6"> 46</a></span>  int64_t <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>;</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683"> 47</a></span>  int64_t <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>;</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  </div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordtype">bool</span> <a class="code" href="namespaceutil.html#a1e2d5c05e25343bc8e4fbccce0000d51">Reverse</a>(int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, int64_t* <span class="keyword">const</span> reverse)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">const</span> int64_t temp = <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>;</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">if</span> (temp % <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> == 0) {</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  *reverse = temp / <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>;</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(Forward(*reverse), <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  }</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  }</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  </div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  int64_t Forward(int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> * <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> + <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>; }</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  </div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  int64_t UnsafeReverse(int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) / <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>; }</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  </div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordtype">void</span> Clear() {</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> = 1;</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = 0;</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  }</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  </div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  std::string DebugString()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"(%d * x + %d)"</span>, <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  }</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> };</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  </div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// TODO(user): Move this out too.</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="keyword">class </span>VarLinearizer : <span class="keyword">public</span> ModelParser {</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  VarLinearizer() : <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>(nullptr), transformation_(nullptr) {}</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  ~VarLinearizer()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  </div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordtype">void</span> VisitIntegerVariable(<span class="keyword">const</span> IntVar* <span class="keyword">const</span> variable,</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">const</span> std::string& operation, int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>,</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  IntVar* <span class="keyword">const</span> delegate)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">if</span> (operation == <a class="code" href="classoperations__research_1_1_model_visitor.html#aa9467b78ab6f4dcdff8101e452224034">ModelVisitor::kSumOperation</a>) {</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  AddConstant(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  delegate->Accept(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (operation == <a class="code" href="classoperations__research_1_1_model_visitor.html#aa8d099e997964231052692ee19e80d6c">ModelVisitor::kDifferenceOperation</a>) {</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  AddConstant(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  PushMultiplier(-1);</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  delegate->Accept(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  PopMultiplier();</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (operation == <a class="code" href="classoperations__research_1_1_model_visitor.html#a6319006b7a88ede6de0a7e7f54db4f46">ModelVisitor::kProductOperation</a>) {</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  PushMultiplier(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  delegate->Accept(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  PopMultiplier();</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (operation == <a class="code" href="classoperations__research_1_1_model_visitor.html#a7ca935997c56b391df120e44c7dd7961">ModelVisitor::kTraceOperation</a>) {</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  *<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a> = <span class="keyword">const_cast<</span>IntVar*<span class="keyword">></span>(variable);</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  transformation_->a = multipliers_.back();</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  }</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  }</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  </div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordtype">void</span> VisitIntegerVariable(<span class="keyword">const</span> IntVar* <span class="keyword">const</span> variable,</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  IntExpr* <span class="keyword">const</span> delegate)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  *<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a> = <span class="keyword">const_cast<</span>IntVar*<span class="keyword">></span>(variable);</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  transformation_->a = multipliers_.back();</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  </div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordtype">void</span> Visit(<span class="keyword">const</span> IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, IntVar** <span class="keyword">const</span> target_var,</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  AffineTransformation* <span class="keyword">const</span> transformation) {</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a> = target_var;</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  transformation_ = transformation;</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  transformation->Clear();</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  PushMultiplier(1);</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Accept(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  PopMultiplier();</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(multipliers_.empty());</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  }</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  </div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  std::string DebugString()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"VarLinearizer"</span>; }</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  </div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordtype">void</span> AddConstant(int64_t constant) {</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  transformation_->b += constant * multipliers_.back();</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  }</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  </div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordtype">void</span> PushMultiplier(int64_t multiplier) {</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">if</span> (multipliers_.empty()) {</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  multipliers_.push_back(multiplier);</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  multipliers_.push_back(multiplier * multipliers_.back());</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  }</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  }</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  </div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordtype">void</span> PopMultiplier() { multipliers_.pop_back(); }</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  </div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  std::vector<int64_t> multipliers_;</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  IntVar** <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>;</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  AffineTransformation* transformation_;</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> };</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  </div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kBitsInUint64 = 64;</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  </div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// ----- Positive Table Constraint -----</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  </div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// Structure of the constraint:</span></div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  </div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// Tuples are indexed, we maintain a bitset for active tuples.</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  </div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// For each var and each value, we maintain a bitset mask of tuples</span></div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// containing this value for this variable.</span></div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  </div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// Propagation: When a value is removed, blank all active tuples using the</span></div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment">// var-value mask.</span></div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// Then we scan all other variable/values to see if there is an active</span></div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// tuple that supports it.</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  </div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="keyword">class </span>BasePositiveTableConstraint : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  BasePositiveTableConstraint(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keyword">const</span> IntTupleSet& tuples)</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  : Constraint(s),</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <a class="code" href="constraint__solver_2table_8cc.html#ab2444961c97f3001b2af69be5100a69c">tuple_count_</a>(tuples.NumTuples()),</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>(vars.size()),</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>),</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9ea6e0a7e183dca3a31ee9e998d8b4df">holes_</a>(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>),</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>),</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  tuples_(tuples),</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  transformations_(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>) {</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// This constraint is intensive on domain and holes iterations on</span></div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// variables. Thus we can visit all variables to get to the</span></div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// boolean or domain int var beneath it. Then we can reverse</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// process the tupleset to move in parallel to the simplifications</span></div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// of the variables. This way, we can keep the memory efficient</span></div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// nature of shared tuplesets (especially important for</span></div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">// transitions constraints which are a chain of table</span></div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">// constraints). The cost in running time is small as the tuples</span></div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">// are read only once to construct the bitset data structures.</span></div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  VarLinearizer linearizer;</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++i) {</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  linearizer.Visit(vars[i], &<a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[i], &transformations_[i]);</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  }</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// Create hole iterators</span></div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++i) {</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9ea6e0a7e183dca3a31ee9e998d8b4df">holes_</a>[i] = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[i]->MakeHoleIterator(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>[i] = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[i]->MakeDomainIterator(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  }</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  }</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  </div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  ~BasePositiveTableConstraint()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  </div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"AllowedAssignments(arity = %d, tuple_count = %d)"</span>,</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>, <a class="code" href="constraint__solver_2table_8cc.html#ab2444961c97f3001b2af69be5100a69c">tuple_count_</a>);</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  </div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordtype">void</span> Accept(ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa32c8eca7abdafccc3b770bda9847af9">ModelVisitor::kAllowedAssignments</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>);</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  visitor->VisitIntegerMatrixArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a9c6fd6988c30e89f6678e4a687a66585">ModelVisitor::kTuplesArgument</a>, tuples_);</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa32c8eca7abdafccc3b770bda9847af9">ModelVisitor::kAllowedAssignments</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  </div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">protected</span>:</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordtype">bool</span> TupleValue(<span class="keywordtype">int</span> tuple_index, <span class="keywordtype">int</span> var_index, int64_t* <span class="keyword">const</span> <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">return</span> transformations_[var_index].Reverse(</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  tuples_.Value(tuple_index, var_index), <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  }</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  </div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  int64_t UnsafeTupleValue(<span class="keywordtype">int</span> tuple_index, <span class="keywordtype">int</span> var_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">return</span> transformations_[var_index].UnsafeReverse(</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  tuples_.Value(tuple_index, var_index));</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  }</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  </div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordtype">bool</span> IsTupleSupported(<span class="keywordtype">int</span> tuple_index) {</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = 0;</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">if</span> (!TupleValue(tuple_index, var_index, &<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) ||</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  !<a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[var_index]->Contains(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)) {</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  }</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  }</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  }</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  </div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#ab2444961c97f3001b2af69be5100a69c"> 225</a></span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#ab2444961c97f3001b2af69be5100a69c">tuple_count_</a>;</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3"> 226</a></span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>;</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61"> 227</a></span>  std::vector<IntVar*> <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>;</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#a9ea6e0a7e183dca3a31ee9e998d8b4df"> 228</a></span>  std::vector<IntVarIterator*> <a class="code" href="constraint__solver_2table_8cc.html#a9ea6e0a7e183dca3a31ee9e998d8b4df">holes_</a>;</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd"> 229</a></span>  std::vector<IntVarIterator*> <a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>;</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39"> 230</a></span>  std::vector<int64_t> <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>;</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  </div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="comment">// All allowed tuples.</span></div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">const</span> IntTupleSet tuples_;</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="comment">// The set of affine transformations that describe the</span></div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="comment">// simplification of the variables.</span></div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  std::vector<AffineTransformation> transformations_;</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span> };</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  </div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="keyword">class </span>PositiveTableConstraint : <span class="keyword">public</span> BasePositiveTableConstraint {</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keyword">typedef</span> absl::flat_hash_map<int, std::vector<uint64_t>> ValueBitset;</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  </div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  PositiveTableConstraint(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keyword">const</span> IntTupleSet& tuples)</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  : BasePositiveTableConstraint(s, vars, tuples),</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a>(<a class="code" href="namespaceoperations__research.html#ade9a654d04b140bd2c2fbfb502c3999c">BitLength64</a>(tuples.NumTuples())),</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>(tuples.NumTuples()) {}</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  </div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  ~PositiveTableConstraint()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  </div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  Demon* d = <a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  solver(), <span class="keyword">this</span>, &PositiveTableConstraint::Propagate, <span class="stringliteral">"Propagate"</span>);</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++i) {</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[i]->WhenDomain(d);</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  Demon* u = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  solver(), <span class="keyword">this</span>, &PositiveTableConstraint::Update, <span class="stringliteral">"Update"</span>, i);</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[i]->WhenDomain(u);</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">// Initialize masks.</span></div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>.clear();</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>.resize(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>);</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="constraint__solver_2table_8cc.html#ab2444961c97f3001b2af69be5100a69c">tuple_count_</a>; ++i) {</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  InitializeMask(i);</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  }</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">// Initialize the active tuple bitset.</span></div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  std::vector<uint64_t> actives(<a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a>, 0);</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> tuple_index = 0; tuple_index < <a class="code" href="constraint__solver_2table_8cc.html#ab2444961c97f3001b2af69be5100a69c">tuple_count_</a>; ++tuple_index) {</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">if</span> (IsTupleSupported(tuple_index)) {</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <a class="code" href="namespaceoperations__research.html#aeb19de8c81811a72d9f39aeec6dd60ef">SetBit64</a>(actives.data(), tuple_index);</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  }</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  }</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.Init(solver(), actives);</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  }</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  </div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// Build active_ structure.</span></div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& it : <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index]) {</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordflow">if</span> (!<a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[var_index]->Contains(it.first)) {</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.RevSubtract(solver(), it.second);</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  }</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  }</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  }</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.Empty()) {</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  }</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="comment">// Remove unreached values.</span></div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keyword">const</span> ValueBitset& mask = <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index];</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[var_index];</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.clear();</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : InitAndGetValues(<a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>[var_index])) {</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(mask, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)) {</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.push_back(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  }</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  }</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">if</span> (!<a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.empty()) {</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->RemoveValues(<a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>);</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  }</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  }</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  </div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordtype">void</span> Propagate() {</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[var_index];</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.clear();</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : InitAndGetValues(<a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>[var_index])) {</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">if</span> (!Supported(var_index, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)) {</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.push_back(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  }</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">if</span> (!<a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.empty()) {</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->RemoveValues(<a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>);</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  }</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  }</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  }</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  </div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordtype">void</span> Update(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keyword">const</span> ValueBitset& var_masks = <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keyword">const</span> int64_t old_max = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->OldMax();</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keyword">const</span> int64_t vmin = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min();</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keyword">const</span> int64_t vmax = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max();</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">for</span> (int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->OldMin(); <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> < vmin; ++<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& it = var_masks.find(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">if</span> (it != var_masks.end()) {</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  BlankActives(it->second);</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  }</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  }</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : InitAndGetValues(<a class="code" href="constraint__solver_2table_8cc.html#a9ea6e0a7e183dca3a31ee9e998d8b4df">holes_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>])) {</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& it = var_masks.find(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordflow">if</span> (it != var_masks.end()) {</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  BlankActives(it->second);</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  }</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  }</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">for</span> (int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = vmax + 1; <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> <= old_max; ++<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& it = var_masks.find(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">if</span> (it != var_masks.end()) {</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  BlankActives(it->second);</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  }</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  }</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  }</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  </div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordtype">void</span> BlankActives(<span class="keyword">const</span> std::vector<uint64_t>& mask) {</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">if</span> (!mask.empty()) {</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.RevSubtract(solver(), mask);</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.Empty()) {</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  }</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  }</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  }</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  </div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordtype">bool</span> Supported(<span class="keywordtype">int</span> var_index, int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(var_index, 0);</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(var_index, <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>);</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(<a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index], <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>));</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keyword">const</span> std::vector<uint64_t>& mask = <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>];</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordtype">int</span> tmp = 0;</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">return</span> <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.Intersects(mask, &tmp);</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  }</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  </div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"PositiveTableConstraint([%s], %d tuples)"</span>,</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>, <span class="stringliteral">", "</span>), <a class="code" href="constraint__solver_2table_8cc.html#ab2444961c97f3001b2af69be5100a69c">tuple_count_</a>);</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  }</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  </div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keyword">protected</span>:</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordtype">void</span> InitializeMask(<span class="keywordtype">int</span> tuple_index) {</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  std::vector<int64_t> cache(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>);</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">if</span> (!TupleValue(tuple_index, var_index, &cache[var_index])) {</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  }</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  }</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = cache[var_index];</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  std::vector<uint64_t>& mask = <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>];</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordflow">if</span> (mask.empty()) {</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  mask.assign(<a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a>, 0);</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  }</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <a class="code" href="namespaceoperations__research.html#aeb19de8c81811a72d9f39aeec6dd60ef">SetBit64</a>(mask.data(), tuple_index);</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  }</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  }</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  </div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459"> 387</a></span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a>;</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4"> 388</a></span>  UnsortedNullableRevBitset <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>;</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d"> 389</a></span>  std::vector<ValueBitset> <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>;</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#ad74a8a202ac114f6cd7a00a1345fbf66"> 390</a></span>  std::vector<uint64_t> <a class="code" href="constraint__solver_2table_8cc.html#ad74a8a202ac114f6cd7a00a1345fbf66">temp_mask_</a>;</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span> };</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  </div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span> <span class="comment">// ----- Compact Tables -----</span></div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  </div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span> <span class="keyword">class </span>CompactPositiveTableConstraint : <span class="keyword">public</span> BasePositiveTableConstraint {</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  CompactPositiveTableConstraint(Solver* <span class="keyword">const</span> s,</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keyword">const</span> IntTupleSet& tuples)</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  : BasePositiveTableConstraint(s, vars, tuples),</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a>(<a class="code" href="namespaceoperations__research.html#ade9a654d04b140bd2c2fbfb502c3999c">BitLength64</a>(tuples.NumTuples())),</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>(tuples.NumTuples()),</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>),</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  mask_starts_(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>),</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  mask_ends_(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>),</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  original_min_(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>, 0),</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <a class="code" href="constraint__solver_2table_8cc.html#ad74a8a202ac114f6cd7a00a1345fbf66">temp_mask_</a>(<a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a>, 0),</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>),</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  demon_(<span class="keyword">nullptr</span>),</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  touched_var_(-1),</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  var_sizes_(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>, 0) {}</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  </div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  ~CompactPositiveTableConstraint()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  </div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  demon_ = solver()->RegisterDemon(<a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  solver(), <span class="keyword">this</span>, &CompactPositiveTableConstraint::Propagate,</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="stringliteral">"Propagate"</span>));</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++i) {</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  Demon* <span class="keyword">const</span> u = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  solver(), <span class="keyword">this</span>, &CompactPositiveTableConstraint::Update, <span class="stringliteral">"Update"</span>, i);</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[i]->WhenDomain(u);</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  }</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++i) {</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  var_sizes_.SetValue(solver(), i, <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[i]->Size());</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  }</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  }</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  </div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  BuildMasks();</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  FillMasksAndActiveTuples();</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  ComputeMasksBoundaries();</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  BuildSupports();</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  RemoveUnsupportedValues();</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  }</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  </div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="comment">// ----- Propagation -----</span></div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  </div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordtype">void</span> Propagate() {</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">// Reset touch_var_ if in mode (more than 1 variable was modified).</span></div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordflow">if</span> (touched_var_ == -2) {</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  touched_var_ = -1;</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  }</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="comment">// This methods scans all values of all variables to see if they</span></div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="comment">// are still supported.</span></div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="comment">// This method is not attached to any particular variable, but is pushed</span></div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="comment">// at a delayed priority after Update(var_index) is called.</span></div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="comment">// This demons runs in low priority. Thus we know all the</span></div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="comment">// variables that have changed since the last time it was run.</span></div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="comment">// In that case, if only one var was touched, as propagation is</span></div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="comment">// exact, we do not need to recheck that variable.</span></div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordflow">if</span> (var_index == touched_var_) {</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  touched_var_ = -1; <span class="comment">// Clean now, it is a 1 time flag.</span></div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  }</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[var_index];</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keyword">const</span> int64_t original_min = original_min_[var_index];</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keyword">const</span> int64_t var_size = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Size();</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="comment">// The domain iterator is very slow, let's try to see if we can</span></div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="comment">// work our way around.</span></div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordflow">switch</span> (var_size) {</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keywordflow">case</span> 1: {</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">if</span> (!Supported(var_index, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min() - original_min)) {</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  }</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  }</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">case</span> 2: {</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keyword">const</span> int64_t var_min = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min();</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keyword">const</span> int64_t var_max = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max();</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> min_support = Supported(var_index, var_min - original_min);</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> max_support = Supported(var_index, var_max - original_min);</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keywordflow">if</span> (!min_support) {</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordflow">if</span> (!max_support) {</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetValue(var_max);</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  var_sizes_.SetValue(solver(), var_index, 1);</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  }</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!max_support) {</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetValue(var_min);</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  var_sizes_.SetValue(solver(), var_index, 1);</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  }</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  }</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keywordflow">default</span>: {</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.clear();</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keyword">const</span> int64_t var_min = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min();</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keyword">const</span> int64_t var_max = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max();</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  int64_t new_min = var_min;</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  int64_t new_max = var_max;</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="comment">// If the domain of a variable is an interval, it is much</span></div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">// faster to iterate on that interval instead of using the</span></div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="comment">// iterator.</span></div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">if</span> (var_max - var_min + 1 == var_size) {</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordflow">for</span> (; new_min <= var_max; ++new_min) {</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordflow">if</span> (Supported(var_index, new_min - original_min)) {</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  }</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  }</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">for</span> (; new_max >= new_min; --new_max) {</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordflow">if</span> (Supported(var_index, new_max - original_min)) {</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  }</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetRange(new_min, new_max);</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordflow">for</span> (int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = new_min + 1; <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> < new_max; ++<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordflow">if</span> (!Supported(var_index, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - original_min)) {</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.push_back(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  }</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  }</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  } <span class="keywordflow">else</span> { <span class="comment">// Domain is sparse.</span></div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="comment">// Let's not collect all values below the first supported</span></div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="comment">// value as this can easily and more rapidly be taken care</span></div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="comment">// of by a SetRange() call.</span></div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  new_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>(); <span class="comment">// escape value.</span></div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> :</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  InitAndGetValues(<a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>[var_index])) {</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">if</span> (!Supported(var_index, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - original_min)) {</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.push_back(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">if</span> (new_min == <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  new_min = <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="comment">// This will be covered by the SetRange.</span></div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.clear();</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  }</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  new_max = <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  }</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  }</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetRange(new_min, new_max);</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="comment">// Trim the to_remove vector.</span></div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.size() - 1;</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">while</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> >= 0 && <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] > new_max) {</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>--;</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  }</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.resize(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + 1);</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  }</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->RemoveValues(<a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>);</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  var_sizes_.SetValue(solver(), var_index, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Size());</div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  }</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  }</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  }</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  }</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  </div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordtype">void</span> Update(<span class="keywordtype">int</span> var_index) {</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[var_index]->Size() == var_sizes_.Value(var_index)) {</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  }</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="comment">// This method will update the set of active tuples by masking out all</span></div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="comment">// tuples attached to values of the variables that have been removed.</span></div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  </div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="comment">// We first collect the complete set of tuples to blank out in temp_mask_.</span></div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[var_index];</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordtype">bool</span> changed = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keyword">const</span> int64_t omin = original_min_[var_index];</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keyword">const</span> int64_t var_size = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Size();</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keyword">const</span> int64_t var_min = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min();</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keyword">const</span> int64_t var_max = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max();</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  </div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">switch</span> (var_size) {</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keywordflow">case</span> 1: {</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  changed = AndMaskWithActive(<a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][var_min - omin]);</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  }</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keywordflow">case</span> 2: {</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  SetTempMask(var_index, var_min - omin);</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  OrTempMask(var_index, var_max - omin);</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  changed = AndMaskWithActive(<a class="code" href="constraint__solver_2table_8cc.html#ad74a8a202ac114f6cd7a00a1345fbf66">temp_mask_</a>);</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  }</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keywordflow">default</span>: {</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keyword">const</span> int64_t estimated_hole_size =</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  var_sizes_.Value(var_index) - var_size;</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="keyword">const</span> int64_t old_min = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->OldMin();</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keyword">const</span> int64_t old_max = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->OldMax();</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="comment">// Rough estimation of the number of operation if we scan</span></div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">// deltas in the domain of the variable.</span></div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keyword">const</span> int64_t number_of_operations =</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  estimated_hole_size + var_min - old_min + old_max - var_max;</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keywordflow">if</span> (number_of_operations < var_size) {</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// Let's scan the removed values since last run.</span></div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">for</span> (int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = old_min; <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> < var_min; ++<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  changed |= SubtractMaskFromActive(<a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - omin]);</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  }</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : InitAndGetValues(<a class="code" href="constraint__solver_2table_8cc.html#a9ea6e0a7e183dca3a31ee9e998d8b4df">holes_</a>[var_index])) {</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  changed |= SubtractMaskFromActive(<a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - omin]);</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  }</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">for</span> (int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = var_max + 1; <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> <= old_max; ++<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  changed |= SubtractMaskFromActive(<a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - omin]);</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  }</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  ClearTempMask();</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">// Let's build the mask of supported tuples from the current</span></div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="comment">// domain.</span></div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordflow">if</span> (var_max - var_min + 1 == var_size) { <span class="comment">// Contiguous.</span></div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">for</span> (int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = var_min; <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> <= var_max; ++<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  OrTempMask(var_index, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - omin);</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  }</div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> :</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  InitAndGetValues(<a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>[var_index])) {</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  OrTempMask(var_index, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - omin);</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  }</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  }</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="comment">// Then we and this mask with active_tuples_.</span></div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  changed = AndMaskWithActive(<a class="code" href="constraint__solver_2table_8cc.html#ad74a8a202ac114f6cd7a00a1345fbf66">temp_mask_</a>);</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  }</div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="comment">// We maintain the size of the variables incrementally (when it</span></div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">// is > 2).</span></div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  var_sizes_.SetValue(solver(), var_index, var_size);</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  }</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  }</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="comment">// We push the propagate method only if something has changed.</span></div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordflow">if</span> (changed) {</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keywordflow">if</span> (touched_var_ == -1 || touched_var_ == var_index) {</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  touched_var_ = var_index;</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  touched_var_ = -2; <span class="comment">// more than one var.</span></div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  }</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  EnqueueDelayedDemon(demon_);</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  }</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  }</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  </div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"CompactPositiveTableConstraint([%s], %d tuples)"</span>,</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>, <span class="stringliteral">", "</span>), <a class="code" href="constraint__solver_2table_8cc.html#ab2444961c97f3001b2af69be5100a69c">tuple_count_</a>);</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  }</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  </div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="comment">// ----- Initialization -----</span></div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  </div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keywordtype">void</span> BuildMasks() {</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="comment">// Build masks.</span></div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++i) {</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  original_min_[i] = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[i]->Min();</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keyword">const</span> int64_t span = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[i]->Max() - original_min_[i] + 1;</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[i].resize(span);</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  }</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  }</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  </div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keywordtype">void</span> FillMasksAndActiveTuples() {</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  std::vector<uint64_t> actives(<a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a>, 0);</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> tuple_index = 0; tuple_index < <a class="code" href="constraint__solver_2table_8cc.html#ab2444961c97f3001b2af69be5100a69c">tuple_count_</a>; ++tuple_index) {</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keywordflow">if</span> (IsTupleSupported(tuple_index)) {</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <a class="code" href="namespaceoperations__research.html#aeb19de8c81811a72d9f39aeec6dd60ef">SetBit64</a>(actives.data(), tuple_index);</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="comment">// Fill in all masks.</span></div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = UnsafeTupleValue(tuple_index, var_index);</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keyword">const</span> int64_t value_index = <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - original_min_[var_index];</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(value_index, 0);</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(value_index, <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index].size());</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][value_index].empty()) {</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][value_index].assign(<a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a>, 0);</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  }</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <a class="code" href="namespaceoperations__research.html#aeb19de8c81811a72d9f39aeec6dd60ef">SetBit64</a>(<a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][value_index].data(), tuple_index);</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  }</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  }</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  }</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.Init(solver(), actives);</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  }</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  </div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keywordtype">void</span> RemoveUnsupportedValues() {</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="comment">// remove unreached values.</span></div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[var_index];</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.clear();</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : InitAndGetValues(<a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>[var_index])) {</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - original_min_[var_index]].empty()) {</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.push_back(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  }</div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  }</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keywordflow">if</span> (!<a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.empty()) {</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->RemoveValues(<a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>);</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  }</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  }</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  }</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  </div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keywordtype">void</span> ComputeMasksBoundaries() {</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  mask_starts_[var_index].resize(<a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index].size());</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  mask_ends_[var_index].resize(<a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index].size());</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> value_index = 0; value_index < <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index].size();</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  ++value_index) {</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keyword">const</span> std::vector<uint64_t>& mask = <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][value_index];</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="keywordflow">if</span> (mask.empty()) {</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  }</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="keywordtype">int</span> start = 0;</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keywordflow">while</span> (start < <a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a> && mask[start] == 0) {</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  start++;</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  }</div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(start, <a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a>);</div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keywordtype">int</span> end = <a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a> - 1;</div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keywordflow">while</span> (end > start && mask[end] == 0) {</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  end--;</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  }</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(start, end);</div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(mask[start], 0);</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(mask[end], 0);</div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  mask_starts_[var_index][value_index] = start;</div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  mask_ends_[var_index][value_index] = end;</div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  }</div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  }</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  }</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  </div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="keywordtype">void</span> BuildSupports() {</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>[var_index].resize(<a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index].size());</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  }</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  }</div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  </div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="comment">// ----- Helpers during propagation -----</span></div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  </div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keywordtype">bool</span> AndMaskWithActive(<span class="keyword">const</span> std::vector<uint64_t>& mask) {</div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> result = <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.RevAnd(solver(), mask);</div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.Empty()) {</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  }</div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  }</div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  </div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keywordtype">bool</span> SubtractMaskFromActive(<span class="keyword">const</span> std::vector<uint64_t>& mask) {</div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> result = <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.RevSubtract(solver(), mask);</div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.Empty()) {</div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  }</div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  }</div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  </div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keywordtype">bool</span> Supported(<span class="keywordtype">int</span> var_index, int64_t value_index) {</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(var_index, 0);</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(var_index, <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>);</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(value_index, 0);</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(value_index, <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index].size());</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keyword">const</span> std::vector<uint64_t>& mask = <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][value_index];</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!mask.empty());</div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="keywordflow">return</span> <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.Intersects(mask, &<a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>[var_index][value_index]);</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  }</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  </div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="keywordtype">void</span> OrTempMask(<span class="keywordtype">int</span> var_index, int64_t value_index) {</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keyword">const</span> std::vector<uint64_t>& mask = <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][value_index];</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keywordflow">if</span> (!mask.empty()) {</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> mask_span = mask_ends_[var_index][value_index] -</div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  mask_starts_[var_index][value_index] + 1;</div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.ActiveWordSize() < mask_span) {</div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.active_words()) {</div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <a class="code" href="constraint__solver_2table_8cc.html#ad74a8a202ac114f6cd7a00a1345fbf66">temp_mask_</a>[i] |= mask[i];</div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  }</div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = mask_starts_[var_index][value_index];</div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  i <= mask_ends_[var_index][value_index]; ++i) {</div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <a class="code" href="constraint__solver_2table_8cc.html#ad74a8a202ac114f6cd7a00a1345fbf66">temp_mask_</a>[i] |= mask[i];</div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  }</div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  }</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  }</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  }</div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  </div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keywordtype">void</span> SetTempMask(<span class="keywordtype">int</span> var_index, int64_t value_index) {</div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="comment">// We assume memset is much faster that looping and assigning.</span></div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="comment">// Still we do want to stay sparse if possible.</span></div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="comment">// Thus we switch between dense and sparse initialization by</span></div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="comment">// comparing the number of operations in both case, with constant factor.</span></div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="comment">// TODO(user): experiment with different constant values.</span></div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.ActiveWordSize() < <a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a> / 4) {</div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.active_words()) {</div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <a class="code" href="constraint__solver_2table_8cc.html#ad74a8a202ac114f6cd7a00a1345fbf66">temp_mask_</a>[i] = <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][value_index][i];</div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  }</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <a class="code" href="constraint__solver_2table_8cc.html#ad74a8a202ac114f6cd7a00a1345fbf66">temp_mask_</a> = <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][value_index];</div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  }</div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  }</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  </div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keywordtype">void</span> ClearTempMask() {</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="comment">// See comment above.</span></div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.ActiveWordSize() < <a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a> / 4) {</div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>.active_words()) {</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <a class="code" href="constraint__solver_2table_8cc.html#ad74a8a202ac114f6cd7a00a1345fbf66">temp_mask_</a>[i] = 0;</div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  }</div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <a class="code" href="constraint__solver_2table_8cc.html#ad74a8a202ac114f6cd7a00a1345fbf66">temp_mask_</a>.assign(<a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a>, 0);</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  }</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  }</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  </div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="comment">// The length in 64 bit words of the number of tuples.</span></div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  int64_t <a class="code" href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a>;</div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="comment">// The active bitset.</span></div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  UnsortedNullableRevBitset <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>;</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="comment">// The masks per value per variable.</span></div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  std::vector<std::vector<std::vector<uint64_t>>> <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>;</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="comment">// The range of active indices in the masks.</span></div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  std::vector<std::vector<int>> mask_starts_;</div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  std::vector<std::vector<int>> mask_ends_;</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="comment">// The min on the vars at creation time.</span></div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  std::vector<int64_t> original_min_;</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="comment">// A temporary mask use for computation.</span></div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  std::vector<uint64_t> <a class="code" href="constraint__solver_2table_8cc.html#ad74a8a202ac114f6cd7a00a1345fbf66">temp_mask_</a>;</div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="comment">// The index of the word in the active bitset supporting each value per</span></div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="comment">// variable.</span></div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  std::vector<std::vector<int>> <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>;</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  Demon* demon_;</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keywordtype">int</span> touched_var_;</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  RevArray<int64_t> var_sizes_;</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span> };</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  </div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span> <span class="comment">// ----- Small Compact Table. -----</span></div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  </div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span> <span class="comment">// TODO(user): regroup code with CompactPositiveTableConstraint.</span></div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  </div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span> <span class="keyword">class </span>SmallCompactPositiveTableConstraint : <span class="keyword">public</span> BasePositiveTableConstraint {</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  SmallCompactPositiveTableConstraint(Solver* <span class="keyword">const</span> s,</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keyword">const</span> IntTupleSet& tuples)</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  : BasePositiveTableConstraint(s, vars, tuples),</div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>(0),</div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <a class="code" href="search_8cc.html#aea630e5fb2cf8a83bf43f5b43d187cda">stamp_</a>(0),</div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>),</div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  original_min_(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>, 0),</div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  demon_(nullptr),</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  touched_var_(-1) {</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(<a class="code" href="constraint__solver_2table_8cc.html#ab2444961c97f3001b2af69be5100a69c">tuple_count_</a>, 0);</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>, 0);</div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(tuples.NumTuples(), kBitsInUint64);</div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  }</div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  </div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  ~SmallCompactPositiveTableConstraint()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  </div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  demon_ = solver()->RegisterDemon(<a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  solver(), <span class="keyword">this</span>, &SmallCompactPositiveTableConstraint::Propagate,</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="stringliteral">"Propagate"</span>));</div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++i) {</div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keywordflow">if</span> (!<a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[i]->Bound()) {</div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  Demon* <span class="keyword">const</span> update_demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  solver(), <span class="keyword">this</span>, &SmallCompactPositiveTableConstraint::Update,</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="stringliteral">"Update"</span>, i);</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[i]->WhenDomain(update_demon);</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  }</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  }</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <a class="code" href="search_8cc.html#aea630e5fb2cf8a83bf43f5b43d187cda">stamp_</a> = 0;</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  }</div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  </div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keywordtype">void</span> InitMasks() {</div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="comment">// Build masks.</span></div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++i) {</div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  original_min_[i] = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[i]->Min();</div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="keyword">const</span> int64_t span = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[i]->Max() - original_min_[i] + 1;</div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[i].assign(span, 0);</div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  }</div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  }</div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  </div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="keywordtype">bool</span> IsTupleSupported(<span class="keywordtype">int</span> tuple_index) {</div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = 0;</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keywordflow">if</span> (!TupleValue(tuple_index, var_index, &<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) ||</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  !<a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[var_index]->Contains(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)) {</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  }</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  }</div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  }</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  </div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keywordtype">void</span> ComputeActiveTuples() {</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a> = 0;</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <span class="comment">// Compute active_tuples_ and update masks.</span></div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> tuple_index = 0; tuple_index < <a class="code" href="constraint__solver_2table_8cc.html#ab2444961c97f3001b2af69be5100a69c">tuple_count_</a>; ++tuple_index) {</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="keywordflow">if</span> (IsTupleSupported(tuple_index)) {</div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="keyword">const</span> uint64_t local_mask = <a class="code" href="namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71">OneBit64</a>(tuple_index);</div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a> |= local_mask;</div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = UnsafeTupleValue(tuple_index, var_index);</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - original_min_[var_index]] |= local_mask;</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  }</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  }</div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  }</div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="keywordflow">if</span> (!<a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>) {</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  }</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  }</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  </div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="keywordtype">void</span> RemoveUnsupportedValues() {</div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="comment">// remove unreached values.</span></div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[var_index];</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="keyword">const</span> int64_t original_min = original_min_[var_index];</div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.clear();</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : InitAndGetValues(<a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>[var_index])) {</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - original_min] == 0) {</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.push_back(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  }</div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  }</div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <span class="keywordflow">if</span> (!<a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.empty()) {</div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->RemoveValues(<a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>);</div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  }</div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  }</div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  }</div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  </div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  InitMasks();</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  ComputeActiveTuples();</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  RemoveUnsupportedValues();</div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  }</div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  </div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="keywordtype">void</span> Propagate() {</div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="comment">// This methods scans all the values of all the variables to see if they</span></div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="comment">// are still supported.</span></div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <span class="comment">// This method is not attached to any particular variable, but is pushed</span></div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="comment">// at a delayed priority and awakened by Update(var_index).</span></div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  </div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="comment">// Reset touch_var_ if in mode (more than 1 variable was modified).</span></div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keywordflow">if</span> (touched_var_ == -2) {</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  touched_var_ = -1;</div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  }</div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  </div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="comment">// We cache active_tuples_.</span></div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keyword">const</span> uint64_t actives = <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>;</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  </div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="comment">// We scan all variables and check their domains.</span></div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++var_index) {</div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="comment">// This demons runs in low priority. Thus we know all the</span></div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="comment">// variables that have changed since the last time it was run.</span></div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="comment">// In that case, if only one var was touched, as propagation is</span></div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="comment">// exact, we do not need to recheck that variable.</span></div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="keywordflow">if</span> (var_index == touched_var_) {</div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  touched_var_ = -1; <span class="comment">// Clean it, it is a one time flag.</span></div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  }</div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  <span class="keyword">const</span> std::vector<uint64_t>& var_mask = <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index];</div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="keyword">const</span> int64_t original_min = original_min_[var_index];</div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[var_index];</div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keyword">const</span> int64_t var_size = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Size();</div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="keywordflow">switch</span> (var_size) {</div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="keywordflow">case</span> 1: {</div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keywordflow">if</span> ((var_mask[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min() - original_min] & actives) == 0) {</div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="comment">// The difference with the non-small version of the table</span></div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="comment">// is that checking the validity of the resulting active</span></div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="comment">// tuples is cheap. Therefore we do not delay the check</span></div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="comment">// code.</span></div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  }</div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  }</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <span class="keywordflow">case</span> 2: {</div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keyword">const</span> int64_t var_min = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min();</div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="keyword">const</span> int64_t var_max = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max();</div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> min_support =</div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  (var_mask[var_min - original_min] & actives) != 0;</div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> max_support =</div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  (var_mask[var_max - original_min] & actives) != 0;</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  <span class="keywordflow">if</span> (!min_support && !max_support) {</div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!min_support) {</div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetValue(var_max);</div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!max_support) {</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetValue(var_min);</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  }</div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  }</div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="keywordflow">default</span>: {</div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.clear();</div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keyword">const</span> int64_t var_min = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min();</div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <span class="keyword">const</span> int64_t var_max = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max();</div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  int64_t new_min = var_min;</div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  int64_t new_max = var_max;</div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="keywordflow">if</span> (var_max - var_min + 1 == var_size) {</div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="comment">// Contiguous case.</span></div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <span class="keywordflow">for</span> (; new_min <= var_max; ++new_min) {</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keywordflow">if</span> ((var_mask[new_min - original_min] & actives) != 0) {</div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  }</div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  }</div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  <span class="keywordflow">for</span> (; new_max >= new_min; --new_max) {</div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  <span class="keywordflow">if</span> ((var_mask[new_max - original_min] & actives) != 0) {</div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  }</div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  }</div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetRange(new_min, new_max);</div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  <span class="keywordflow">for</span> (int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = new_min + 1; <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> < new_max; ++<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keywordflow">if</span> ((var_mask[<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - original_min] & actives) == 0) {</div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.push_back(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  }</div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  }</div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="keywordtype">bool</span> min_set = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="keywordtype">int</span> last_size = 0;</div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> :</div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  InitAndGetValues(<a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>[var_index])) {</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  <span class="comment">// The iterator is not safe w.r.t. deletion. Thus we</span></div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="comment">// postpone all value removals.</span></div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <span class="keywordflow">if</span> ((var_mask[<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - original_min] & actives) == 0) {</div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="keywordflow">if</span> (min_set) {</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.push_back(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  }</div>
|
|
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  <span class="keywordflow">if</span> (!min_set) {</div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  new_min = <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  min_set = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  }</div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  new_max = <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  last_size = <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.size();</div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  }</div>
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  }</div>
|
|
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="keywordflow">if</span> (min_set) {</div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetRange(new_min, new_max);</div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  }</div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  <a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>.resize(last_size);</div>
|
|
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  }</div>
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->RemoveValues(<a class="code" href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a>);</div>
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  }</div>
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  }</div>
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  }</div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  }</div>
|
|
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  </div>
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="keywordtype">void</span> Update(<span class="keywordtype">int</span> var_index) {</div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="comment">// This method updates the set of active tuples by masking out all</span></div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="comment">// tuples attached to values of the variables that have been removed.</span></div>
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  </div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[var_index];</div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <span class="keyword">const</span> int64_t original_min = original_min_[var_index];</div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="keyword">const</span> int64_t var_size = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Size();</div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <span class="keywordflow">switch</span> (var_size) {</div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  <span class="keywordflow">case</span> 1: {</div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  ApplyMask(var_index, <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min() - original_min]);</div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  }</div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keywordflow">case</span> 2: {</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  ApplyMask(var_index, <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min() - original_min] |</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index][<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max() - original_min]);</div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  }</div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <span class="keywordflow">default</span>: {</div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  <span class="comment">// We first collect the complete set of tuples to blank out in</span></div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  <span class="comment">// temp_mask.</span></div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="keyword">const</span> std::vector<uint64_t>& var_mask = <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>[var_index];</div>
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="keyword">const</span> int64_t old_min = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->OldMin();</div>
|
|
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="keyword">const</span> int64_t old_max = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->OldMax();</div>
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <span class="keyword">const</span> int64_t var_min = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min();</div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="keyword">const</span> int64_t var_max = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max();</div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> contiguous = var_size == var_max - var_min + 1;</div>
|
|
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> nearly_contiguous =</div>
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  var_size > (var_max - var_min + 1) * 7 / 10;</div>
|
|
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  </div>
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  <span class="comment">// Count the number of masks to collect to compare the deduction</span></div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="comment">// vs the construction of the new active bitset.</span></div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="comment">// TODO(user): Implement HolesSize() on IntVar* and use it</span></div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="comment">// to remove this code and the var_sizes in the non_small</span></div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="comment">// version.</span></div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  uint64_t hole_mask = 0;</div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  <span class="keywordflow">if</span> (!contiguous) {</div>
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : InitAndGetValues(<a class="code" href="constraint__solver_2table_8cc.html#a9ea6e0a7e183dca3a31ee9e998d8b4df">holes_</a>[var_index])) {</div>
|
|
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  hole_mask |= var_mask[<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - original_min];</div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  }</div>
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  }</div>
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="keyword">const</span> int64_t hole_operations = var_min - old_min + old_max - var_max;</div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  <span class="comment">// We estimate the domain iterator to be 4x slower.</span></div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="keyword">const</span> int64_t domain_operations = contiguous ? var_size : 4 * var_size;</div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <span class="keywordflow">if</span> (hole_operations < domain_operations) {</div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  <span class="keywordflow">for</span> (int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = old_min; <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> < var_min; ++<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  hole_mask |= var_mask[<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - original_min];</div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  }</div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="keywordflow">for</span> (int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = var_max + 1; <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> <= old_max; ++<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  hole_mask |= var_mask[<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - original_min];</div>
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  }</div>
|
|
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="comment">// We reverse the mask as this was negative information.</span></div>
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  ApplyMask(var_index, ~hole_mask);</div>
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  uint64_t domain_mask = 0;</div>
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keywordflow">if</span> (contiguous) {</div>
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <span class="keywordflow">for</span> (int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = var_min; <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> <= var_max; ++<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  domain_mask |= var_mask[<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - original_min];</div>
|
|
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  }</div>
|
|
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (nearly_contiguous) {</div>
|
|
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="keywordflow">for</span> (int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = var_min; <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> <= var_max; ++<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Contains(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)) {</div>
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  domain_mask |= var_mask[<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - original_min];</div>
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  }</div>
|
|
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  }</div>
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> :</div>
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  InitAndGetValues(<a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>[var_index])) {</div>
|
|
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  domain_mask |= var_mask[<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - original_min];</div>
|
|
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  }</div>
|
|
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  }</div>
|
|
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  ApplyMask(var_index, domain_mask);</div>
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  }</div>
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  }</div>
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  }</div>
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  }</div>
|
|
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  </div>
|
|
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="keywordflow">return</span> absl::StrFormat(</div>
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="stringliteral">"SmallCompactPositiveTableConstraint([%s], %d tuples)"</span>,</div>
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>, <span class="stringliteral">", "</span>), <a class="code" href="constraint__solver_2table_8cc.html#ab2444961c97f3001b2af69be5100a69c">tuple_count_</a>);</div>
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  }</div>
|
|
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  </div>
|
|
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <span class="keywordtype">void</span> ApplyMask(<span class="keywordtype">int</span> var_index, uint64_t mask) {</div>
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keywordflow">if</span> ((~mask & <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>) != 0) {</div>
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="comment">// Check if we need to save the active_tuples in this node.</span></div>
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <span class="keyword">const</span> uint64_t current_stamp = solver()->stamp();</div>
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  <span class="keywordflow">if</span> (<a class="code" href="search_8cc.html#aea630e5fb2cf8a83bf43f5b43d187cda">stamp_</a> < current_stamp) {</div>
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <a class="code" href="search_8cc.html#aea630e5fb2cf8a83bf43f5b43d187cda">stamp_</a> = current_stamp;</div>
|
|
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  solver()->SaveValue(&<a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>);</div>
|
|
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  }</div>
|
|
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a> &= mask;</div>
|
|
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>) {</div>
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="comment">// Maintain touched_var_.</span></div>
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="keywordflow">if</span> (touched_var_ == -1 || touched_var_ == var_index) {</div>
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  touched_var_ = var_index;</div>
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  touched_var_ = -2; <span class="comment">// more than one var.</span></div>
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  }</div>
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  EnqueueDelayedDemon(demon_);</div>
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="comment">// Clean it before failing.</span></div>
|
|
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  touched_var_ = -1;</div>
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  }</div>
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  }</div>
|
|
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  }</div>
|
|
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  </div>
|
|
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <span class="comment">// Bitset of active tuples.</span></div>
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  uint64_t <a class="code" href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a>;</div>
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="comment">// Stamp of the active_tuple bitset.</span></div>
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  uint64_t <a class="code" href="search_8cc.html#aea630e5fb2cf8a83bf43f5b43d187cda">stamp_</a>;</div>
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <span class="comment">// The masks per value per variable.</span></div>
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  std::vector<std::vector<uint64_t>> <a class="code" href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a>;</div>
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  <span class="comment">// The min on the vars at creation time.</span></div>
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  std::vector<int64_t> original_min_;</div>
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  Demon* demon_;</div>
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keywordtype">int</span> touched_var_;</div>
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span> };</div>
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  </div>
|
|
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span> <span class="keywordtype">bool</span> HasCompactDomains(<span class="keyword">const</span> std::vector<IntVar*>& vars) {</div>
|
|
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>; <span class="comment">// Always assume compact table.</span></div>
|
|
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span> }</div>
|
|
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  </div>
|
|
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span> <span class="comment">// ---------- Deterministic Finite Automaton ----------</span></div>
|
|
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  </div>
|
|
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span> <span class="comment">// This constraint implements a finite automaton when transitions are</span></div>
|
|
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span> <span class="comment">// the values of the variables in the array.</span></div>
|
|
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span> <span class="comment">// that is state[i+1] = transition[var[i]][state[i]] if</span></div>
|
|
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span> <span class="comment">// (state[i], var[i], state[i+1]) in the transition table.</span></div>
|
|
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span> <span class="comment">// There is only one possible transition for a state/value pair.</span></div>
|
|
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span> <span class="keyword">class </span><a class="code" href="namespaceoperations__research_1_1sat.html#aa92109463578df5bbbcd9d26f8975045">TransitionConstraint</a> : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01150"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#a4bec3c5af89f109dcb01e906c4f77d1d"> 1150</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a4bec3c5af89f109dcb01e906c4f77d1d">kStatePosition</a>;</div>
|
|
<div class="line"><a name="l01151"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#a5c9905f38264be04312eef081d629645"> 1151</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a5c9905f38264be04312eef081d629645">kNextStatePosition</a>;</div>
|
|
<div class="line"><a name="l01152"></a><span class="lineno"><a class="line" href="constraint__solver_2table_8cc.html#a11cdf0be64beeb101ad0e11c316424e5"> 1152</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a11cdf0be64beeb101ad0e11c316424e5">kTransitionTupleSize</a>;</div>
|
|
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#aa92109463578df5bbbcd9d26f8975045">TransitionConstraint</a>(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  <span class="keyword">const</span> IntTupleSet& transition_table,</div>
|
|
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  int64_t initial_state,</div>
|
|
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <span class="keyword">const</span> std::vector<int64_t>& final_states)</div>
|
|
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  : Constraint(s),</div>
|
|
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>(vars),</div>
|
|
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  transition_table_(transition_table),</div>
|
|
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  initial_state_(initial_state),</div>
|
|
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  final_states_(final_states) {}</div>
|
|
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  </div>
|
|
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#aa92109463578df5bbbcd9d26f8975045">TransitionConstraint</a>(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  <span class="keyword">const</span> IntTupleSet& transition_table,</div>
|
|
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  int64_t initial_state,</div>
|
|
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  <span class="keyword">const</span> std::vector<int>& final_states)</div>
|
|
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  : Constraint(s),</div>
|
|
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>(vars),</div>
|
|
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  transition_table_(transition_table),</div>
|
|
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  initial_state_(initial_state),</div>
|
|
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  final_states_(final_states.size()) {</div>
|
|
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < final_states.size(); ++i) {</div>
|
|
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  final_states_[i] = final_states[i];</div>
|
|
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  }</div>
|
|
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  }</div>
|
|
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  </div>
|
|
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  ~<a class="code" href="namespaceoperations__research_1_1sat.html#aa92109463578df5bbbcd9d26f8975045">TransitionConstraint</a>()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  </div>
|
|
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  Solver* <span class="keyword">const</span> s = solver();</div>
|
|
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  int64_t state_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  int64_t state_max = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> nb_vars = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>.size();</div>
|
|
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < transition_table_.NumTuples(); ++i) {</div>
|
|
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  state_max =</div>
|
|
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(state_max, transition_table_.Value(i, <a class="code" href="constraint__solver_2table_8cc.html#a4bec3c5af89f109dcb01e906c4f77d1d">kStatePosition</a>));</div>
|
|
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  state_max =</div>
|
|
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(state_max, transition_table_.Value(i, <a class="code" href="constraint__solver_2table_8cc.html#a5c9905f38264be04312eef081d629645">kNextStatePosition</a>));</div>
|
|
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  state_min =</div>
|
|
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(state_min, transition_table_.Value(i, <a class="code" href="constraint__solver_2table_8cc.html#a4bec3c5af89f109dcb01e906c4f77d1d">kStatePosition</a>));</div>
|
|
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  state_min =</div>
|
|
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(state_min, transition_table_.Value(i, <a class="code" href="constraint__solver_2table_8cc.html#a5c9905f38264be04312eef081d629645">kNextStatePosition</a>));</div>
|
|
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  }</div>
|
|
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  </div>
|
|
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  std::vector<IntVar*> states;</div>
|
|
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  states.push_back(s->MakeIntConst(initial_state_));</div>
|
|
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 1; var_index < nb_vars; ++var_index) {</div>
|
|
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  states.push_back(s->MakeIntVar(state_min, state_max));</div>
|
|
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  }</div>
|
|
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  states.push_back(s->MakeIntVar(final_states_));</div>
|
|
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(nb_vars + 1, states.size());</div>
|
|
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  </div>
|
|
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tuples = transition_table_.NumTuples();</div>
|
|
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  </div>
|
|
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < nb_vars; ++var_index) {</div>
|
|
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  std::vector<IntVar*> tmp_vars(3);</div>
|
|
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  tmp_vars[0] = states[var_index];</div>
|
|
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  tmp_vars[1] = <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>[var_index];</div>
|
|
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  tmp_vars[2] = states[var_index + 1];</div>
|
|
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  <span class="comment">// We always build the compact versions of the tables.</span></div>
|
|
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  <span class="keywordflow">if</span> (num_tuples <= kBitsInUint64) {</div>
|
|
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  s->AddConstraint(s->RevAlloc(<span class="keyword">new</span> SmallCompactPositiveTableConstraint(</div>
|
|
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  s, tmp_vars, transition_table_)));</div>
|
|
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  s->AddConstraint(s->RevAlloc(<span class="keyword">new</span> CompactPositiveTableConstraint(</div>
|
|
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  s, tmp_vars, transition_table_)));</div>
|
|
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  }</div>
|
|
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  }</div>
|
|
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  }</div>
|
|
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  </div>
|
|
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  </div>
|
|
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  <span class="keywordtype">void</span> Accept(ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a938ba082d25b344f54d9dd7d2bb700fc">ModelVisitor::kTransition</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div>
|
|
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>);</div>
|
|
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  visitor->VisitIntegerArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aef3891d34b3f1428edf4984d0ca037bd">ModelVisitor::kInitialState</a>, initial_state_);</div>
|
|
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  visitor->VisitIntegerArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a188ca3b4a3e145c9ab85bc2b129903b7">ModelVisitor::kFinalStatesArgument</a>,</div>
|
|
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  final_states_);</div>
|
|
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  visitor->VisitIntegerMatrixArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a9c6fd6988c30e89f6678e4a687a66585">ModelVisitor::kTuplesArgument</a>,</div>
|
|
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  transition_table_);</div>
|
|
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a938ba082d25b344f54d9dd7d2bb700fc">ModelVisitor::kTransition</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  }</div>
|
|
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  </div>
|
|
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  <span class="keywordflow">return</span> absl::StrFormat(</div>
|
|
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  <span class="stringliteral">"TransitionConstraint([%s], %d transitions, initial = %d, final = "</span></div>
|
|
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  <span class="stringliteral">"[%s])"</span>,</div>
|
|
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>, <span class="stringliteral">", "</span>), transition_table_.NumTuples(),</div>
|
|
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  initial_state_, absl::StrJoin(final_states_, <span class="stringliteral">", "</span>));</div>
|
|
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  }</div>
|
|
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  </div>
|
|
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  <span class="comment">// Variable representing transitions between states. See header file.</span></div>
|
|
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  <span class="keyword">const</span> std::vector<IntVar*> <a class="code" href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a>;</div>
|
|
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  <span class="comment">// The transition as tuples (state, value, next_state).</span></div>
|
|
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  <span class="keyword">const</span> IntTupleSet transition_table_;</div>
|
|
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  <span class="comment">// The initial state before the first transition.</span></div>
|
|
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  <span class="keyword">const</span> int64_t initial_state_;</div>
|
|
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  <span class="comment">// Vector of final state after the last transision.</span></div>
|
|
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  std::vector<int64_t> final_states_;</div>
|
|
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span> };</div>
|
|
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  </div>
|
|
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a4bec3c5af89f109dcb01e906c4f77d1d">TransitionConstraint::kStatePosition</a> = 0;</div>
|
|
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a5c9905f38264be04312eef081d629645">TransitionConstraint::kNextStatePosition</a> = 2;</div>
|
|
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a11cdf0be64beeb101ad0e11c316424e5">TransitionConstraint::kTransitionTupleSize</a> = 3;</div>
|
|
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  </div>
|
|
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span> <span class="comment">// --------- API ----------</span></div>
|
|
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  </div>
|
|
<div class="line"><a name="l01261"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#af4c960f5d46ac35f537ade04ff7e2cc3"> 1261</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#af4c960f5d46ac35f537ade04ff7e2cc3">Solver::MakeAllowedAssignments</a>(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html">IntTupleSet</a>& tuples) {</div>
|
|
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  <span class="keywordflow">if</span> (HasCompactDomains(vars)) {</div>
|
|
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  <span class="keywordflow">if</span> (tuples.<a class="code" href="classoperations__research_1_1_int_tuple_set.html#ac2a5be9e740d5b60e848ee87eccf3a48">NumTuples</a>() < kBitsInUint64 && parameters_.use_small_table()) {</div>
|
|
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(</div>
|
|
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  <span class="keyword">new</span> SmallCompactPositiveTableConstraint(<span class="keyword">this</span>, vars, tuples));</div>
|
|
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> CompactPositiveTableConstraint(<span class="keyword">this</span>, vars, tuples));</div>
|
|
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  }</div>
|
|
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  }</div>
|
|
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> PositiveTableConstraint(<span class="keyword">this</span>, vars, tuples));</div>
|
|
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span> }</div>
|
|
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  </div>
|
|
<div class="line"><a name="l01274"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a7f1d4e45e25d6c7c4c373e5a9677393d"> 1274</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a7f1d4e45e25d6c7c4c373e5a9677393d">Solver::MakeTransitionConstraint</a>(</div>
|
|
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  <span class="keyword">const</span> std::vector<IntVar*>& vars, <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html">IntTupleSet</a>& transition_table,</div>
|
|
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  int64_t initial_state, <span class="keyword">const</span> std::vector<int64_t>& final_states) {</div>
|
|
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aa92109463578df5bbbcd9d26f8975045">TransitionConstraint</a>(<span class="keyword">this</span>, vars, transition_table,</div>
|
|
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  initial_state, final_states));</div>
|
|
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span> }</div>
|
|
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  </div>
|
|
<div class="line"><a name="l01281"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a2d98d0213497868803af4120f7bdb082"> 1281</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a7f1d4e45e25d6c7c4c373e5a9677393d">Solver::MakeTransitionConstraint</a>(</div>
|
|
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  <span class="keyword">const</span> std::vector<IntVar*>& vars, <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html">IntTupleSet</a>& transition_table,</div>
|
|
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  int64_t initial_state, <span class="keyword">const</span> std::vector<int>& final_states) {</div>
|
|
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aa92109463578df5bbbcd9d26f8975045">TransitionConstraint</a>(<span class="keyword">this</span>, vars, transition_table,</div>
|
|
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  initial_state, final_states));</div>
|
|
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span> }</div>
|
|
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  </div>
|
|
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span> } <span class="comment">// namespace operations_research</span></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#l00498">base/logging.h:498</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a4395e95bab44e222cb2e77251017a0e2"><div class="ttname"><a href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a></div><div class="ttdeci">#define DCHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00895">base/logging.h:895</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#l00894">base/logging.h:894</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00705">base/logging.h:705</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00709">base/logging.h:709</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#l00897">base/logging.h:897</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab25e01a2942b821d66371fc68d53f2eb"><div class="ttname"><a href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a></div><div class="ttdeci">#define CHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00706">base/logging.h:706</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00896">base/logging.h:896</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#l00892">base/logging.h:892</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae4db23f10f5d4aad6d735f5a74cd6f8c"><div class="ttname"><a href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a></div><div class="ttdeci">#define CHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00707">base/logging.h:707</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#l00893">base/logging.h:893</a></div></div>
|
|
<div class="ttc" id="abitset_8h_html"><div class="ttname"><a href="bitset_8h.html">bitset.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_constraint_html"><div class="ttname"><a href="classoperations__research_1_1_constraint.html">operations_research::Constraint</a></div><div class="ttdoc">A constraint is the main modeling object.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03587">constraint_solver.h:3587</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html">operations_research::IntTupleSet</a></div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00049">tuple_set.h:49</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_ac2a5be9e740d5b60e848ee87eccf3a48"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#ac2a5be9e740d5b60e848ee87eccf3a48">operations_research::IntTupleSet::NumTuples</a></div><div class="ttdeci">int NumTuples() const</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00348">tuple_set.h:348</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_a188ca3b4a3e145c9ab85bc2b129903b7"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a188ca3b4a3e145c9ab85bc2b129903b7">operations_research::ModelVisitor::kFinalStatesArgument</a></div><div class="ttdeci">static const char kFinalStatesArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03456">constraint_solver.h:3456</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_a6319006b7a88ede6de0a7e7f54db4f46"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a6319006b7a88ede6de0a7e7f54db4f46">operations_research::ModelVisitor::kProductOperation</a></div><div class="ttdeci">static const char kProductOperation[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03505">constraint_solver.h:3505</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_a7ca935997c56b391df120e44c7dd7961"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a7ca935997c56b391df120e44c7dd7961">operations_research::ModelVisitor::kTraceOperation</a></div><div class="ttdeci">static const char kTraceOperation[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03508">constraint_solver.h:3508</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_a938ba082d25b344f54d9dd7d2bb700fc"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a938ba082d25b344f54d9dd7d2bb700fc">operations_research::ModelVisitor::kTransition</a></div><div class="ttdeci">static const char kTransition[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03417">constraint_solver.h:3417</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_a9c6fd6988c30e89f6678e4a687a66585"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a9c6fd6988c30e89f6678e4a687a66585">operations_research::ModelVisitor::kTuplesArgument</a></div><div class="ttdeci">static const char kTuplesArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03492">constraint_solver.h:3492</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_aa32c8eca7abdafccc3b770bda9847af9"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#aa32c8eca7abdafccc3b770bda9847af9">operations_research::ModelVisitor::kAllowedAssignments</a></div><div class="ttdeci">static const char kAllowedAssignments[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03342">constraint_solver.h:3342</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_aa8d099e997964231052692ee19e80d6c"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#aa8d099e997964231052692ee19e80d6c">operations_research::ModelVisitor::kDifferenceOperation</a></div><div class="ttdeci">static const char kDifferenceOperation[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03504">constraint_solver.h:3504</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_aa9175e7f7c9d2598d26293435ecd89ce"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">operations_research::ModelVisitor::kVarsArgument</a></div><div class="ttdeci">static const char kVarsArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03496">constraint_solver.h:3496</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_aa9467b78ab6f4dcdff8101e452224034"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#aa9467b78ab6f4dcdff8101e452224034">operations_research::ModelVisitor::kSumOperation</a></div><div class="ttdeci">static const char kSumOperation[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03503">constraint_solver.h:3503</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_aef3891d34b3f1428edf4984d0ca037bd"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#aef3891d34b3f1428edf4984d0ca037bd">operations_research::ModelVisitor::kInitialState</a></div><div class="ttdeci">static const char kInitialState[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03460">constraint_solver.h:3460</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a7f1d4e45e25d6c7c4c373e5a9677393d"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a7f1d4e45e25d6c7c4c373e5a9677393d">operations_research::Solver::MakeTransitionConstraint</a></div><div class="ttdeci">Constraint * MakeTransitionConstraint(const std::vector< IntVar * > &vars, const IntTupleSet &transition_table, int64_t initial_state, const std::vector< int64_t > &final_states)</div><div class="ttdoc">This constraint create a finite automaton that will check the sequence of variables vars.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l01274">constraint_solver/table.cc:1274</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_ab741cb25dd32d1cbe02fbfb36337d9bb"><div class="ttname"><a href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">operations_research::Solver::RevAlloc</a></div><div class="ttdeci">T * RevAlloc(T *object)</div><div class="ttdoc">Registers the given object as being reversible.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00789">constraint_solver.h:789</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_af4c960f5d46ac35f537ade04ff7e2cc3"><div class="ttname"><a href="classoperations__research_1_1_solver.html#af4c960f5d46ac35f537ade04ff7e2cc3">operations_research::Solver::MakeAllowedAssignments</a></div><div class="ttdeci">Constraint * MakeAllowedAssignments(const std::vector< IntVar * > &vars, const IntTupleSet &tuples)</div><div class="ttdoc">This method creates a constraint where the graph of the relation between the variables is given in ex...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l01261">constraint_solver/table.cc:1261</a></div></div>
|
|
<div class="ttc" id="acommandlineflags_8h_html"><div class="ttname"><a href="commandlineflags_8h.html">commandlineflags.h</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a11cdf0be64beeb101ad0e11c316424e5"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a11cdf0be64beeb101ad0e11c316424e5">kTransitionTupleSize</a></div><div class="ttdeci">static const int kTransitionTupleSize</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l01152">constraint_solver/table.cc:1152</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a1c800eeef507295e3374f6f1c97d5459"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a1c800eeef507295e3374f6f1c97d5459">word_length_</a></div><div class="ttdeci">const int word_length_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00387">constraint_solver/table.cc:387</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a4bec3c5af89f109dcb01e906c4f77d1d"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a4bec3c5af89f109dcb01e906c4f77d1d">kStatePosition</a></div><div class="ttdeci">static const int kStatePosition</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l01150">constraint_solver/table.cc:1150</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a5889398aa7aa6ccf7b24b80bdd95e9c3"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a></div><div class="ttdeci">const int arity_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00226">constraint_solver/table.cc:226</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a5c9905f38264be04312eef081d629645"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a5c9905f38264be04312eef081d629645">kNextStatePosition</a></div><div class="ttdeci">static const int kNextStatePosition</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l01151">constraint_solver/table.cc:1151</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a70ab13fe6fc1facd5b81e3ea4127203d"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a70ab13fe6fc1facd5b81e3ea4127203d">masks_</a></div><div class="ttdeci">std::vector< ValueBitset > masks_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00389">constraint_solver/table.cc:389</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_a9b229f7e8aa2b819b08a9eef9b39df61"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9b229f7e8aa2b819b08a9eef9b39df61">vars_</a></div><div class="ttdeci">std::vector< IntVar * > vars_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00227">constraint_solver/table.cc:227</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a9ea6e0a7e183dca3a31ee9e998d8b4df"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9ea6e0a7e183dca3a31ee9e998d8b4df">holes_</a></div><div class="ttdeci">std::vector< IntVarIterator * > holes_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00228">constraint_solver/table.cc:228</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_ab2444961c97f3001b2af69be5100a69c"><div class="ttname"><a href="constraint__solver_2table_8cc.html#ab2444961c97f3001b2af69be5100a69c">tuple_count_</a></div><div class="ttdeci">const int tuple_count_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00225">constraint_solver/table.cc:225</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_2table_8cc_html_ace49187800bab1a967e655278e69ca39"><div class="ttname"><a href="constraint__solver_2table_8cc.html#ace49187800bab1a967e655278e69ca39">to_remove_</a></div><div class="ttdeci">std::vector< int64_t > to_remove_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00230">constraint_solver/table.cc:230</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_ad74a8a202ac114f6cd7a00a1345fbf66"><div class="ttname"><a href="constraint__solver_2table_8cc.html#ad74a8a202ac114f6cd7a00a1345fbf66">temp_mask_</a></div><div class="ttdeci">std::vector< uint64_t > temp_mask_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00390">constraint_solver/table.cc:390</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_add5bd7902ae98c66c7af7c7bdd639bf4"><div class="ttname"><a href="constraint__solver_2table_8cc.html#add5bd7902ae98c66c7af7c7bdd639bf4">active_tuples_</a></div><div class="ttdeci">UnsortedNullableRevBitset active_tuples_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00388">constraint_solver/table.cc:388</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_af6a9149207c05695bc2e26a658461abd"><div class="ttname"><a href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a></div><div class="ttdeci">std::vector< IntVarIterator * > iterators_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00229">constraint_solver/table.cc:229</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_8h_html"><div class="ttname"><a href="constraint__solver_8h.html">constraint_solver.h</a></div></div>
|
|
<div class="ttc" id="aconstraint__solveri_8h_html"><div class="ttname"><a href="constraint__solveri_8h.html">constraint_solveri.h</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="agraph__constraints_8cc_html_adee0f668fb19c3cd4247a4fc74bca2d6"><div class="ttname"><a href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a></div><div class="ttdeci">std::vector< int > supports_</div><div class="ttdef"><b>Definition:</b> <a href="graph__constraints_8cc_source.html#l00673">graph_constraints.cc:673</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="amap__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_aae28e97bd1fa93cb0032642550da7455"><div class="ttname"><a href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a></div><div class="ttdeci">bool ContainsKey(const Collection &collection, const Key &key)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00200">map_util.h:200</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aa92109463578df5bbbcd9d26f8975045"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa92109463578df5bbbcd9d26f8975045">operations_research::sat::TransitionConstraint</a></div><div class="ttdeci">std::function< void(Model *)> TransitionConstraint(const std::vector< IntegerVariable > &vars, const std::vector< std::vector< int64_t >> &automaton, int64_t initial_state, const std::vector< int64_t > &final_states)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2table_8cc_source.html#l00594">sat/table.cc:594</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_a4fb750da00c784e5ffd1763fd3ce88f7"><div class="ttname"><a href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">operations_research::MakeConstraintDemon1</a></div><div class="ttdeci">Demon * MakeConstraintDemon1(Solver *const s, T *const ct, void(T::*method)(P), const std::string &name, P param1)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00559">constraint_solveri.h:559</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a82110ba1f45aa29ffc933102880dbd82"><div class="ttname"><a href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">operations_research::MakeDelayedConstraintDemon0</a></div><div class="ttdeci">Demon * MakeDelayedConstraintDemon0(Solver *const s, T *const ct, void(T::*method)(), const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00681">constraint_solveri.h:681</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a9be76edcbd5ccb982d92c8d90421a73c"><div class="ttname"><a href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">operations_research::JoinDebugStringPtr</a></div><div class="ttdeci">std::string JoinDebugStringPtr(const std::vector< T > &v, const std::string &separator)</div><div class="ttdef"><b>Definition:</b> <a href="string__array_8h_source.html#l00045">string_array.h:45</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ace10d9b6a07c87e11942df49bb04fc71"><div class="ttname"><a href="namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71">operations_research::OneBit64</a></div><div class="ttdeci">uint64_t OneBit64(int pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00038">bitset.h:38</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ade9a654d04b140bd2c2fbfb502c3999c"><div class="ttname"><a href="namespaceoperations__research.html#ade9a654d04b140bd2c2fbfb502c3999c">operations_research::BitLength64</a></div><div class="ttdeci">uint64_t BitLength64(uint64_t size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00338">bitset.h:338</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aeb19de8c81811a72d9f39aeec6dd60ef"><div class="ttname"><a href="namespaceoperations__research.html#aeb19de8c81811a72d9f39aeec6dd60ef">operations_research::SetBit64</a></div><div class="ttdeci">void SetBit64(uint64_t *const bitset, uint64_t pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00354">bitset.h:354</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_a1e2d5c05e25343bc8e4fbccce0000d51"><div class="ttname"><a href="namespaceutil.html#a1e2d5c05e25343bc8e4fbccce0000d51">util::Reverse</a></div><div class="ttdeci">BeginEndReverseIteratorWrapper< Container > Reverse(const Container &c)</div><div class="ttdef"><b>Definition:</b> <a href="iterators_8h_source.html#l00098">iterators.h:98</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_a527571de51e3f4b1fc9945f3a374faad"><div class="ttname"><a href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a></div><div class="ttdeci">IntervalVar *const target_var_</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00232">sched_constraints.cc:232</a></div></div>
|
|
<div class="ttc" id="asearch_8cc_html_aea630e5fb2cf8a83bf43f5b43d187cda"><div class="ttname"><a href="search_8cc.html#aea630e5fb2cf8a83bf43f5b43d187cda">stamp_</a></div><div class="ttdeci">const int64_t stamp_</div><div class="ttdef"><b>Definition:</b> <a href="search_8cc_source.html#l03054">search.cc:3054</a></div></div>
|
|
<div class="ttc" id="astring__array_8h_html"><div class="ttname"><a href="string__array_8h.html">string_array.h</a></div></div>
|
|
<div class="ttc" id="atuple__set_8h_html"><div class="ttname"><a href="tuple__set_8h.html">tuple_set.h</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_afbb39f66221aac28bbdefd1dca2b2b0.html">constraint_solver</a></li><li class="navelem"><a class="el" href="constraint__solver_2table_8cc.html">table.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|