3753 lines
612 KiB
HTML
3753 lines
612 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: expr_array.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('expr__array_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">expr_array.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="expr__array_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">// Array Expression 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 <cmath></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <limits></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/strings/str_format.h"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "absl/strings/str_join.h"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</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="l00027"></a><span class="lineno"> 27</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="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="mathutil_8h.html">ortools/base/mathutil.h</a>"</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</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="l00030"></a><span class="lineno"> 30</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="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</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="l00033"></a><span class="lineno"> 33</span>  </div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// ----- Tree Array Constraint -----</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  </div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="keyword">class </span>TreeArrayConstraint : <span class="keyword">public</span> CastConstraint {</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  TreeArrayConstraint(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  IntVar* <span class="keyword">const</span> sum_var)</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  : CastConstraint(solver, sum_var),</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  block_size_(solver-><a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>().array_split_size()) {</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  std::vector<int> lengths;</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  lengths.push_back(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size());</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">while</span> (lengths.back() > 1) {</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> current = lengths.back();</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  lengths.push_back((current + block_size_ - 1) / block_size_);</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  }</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  tree_.resize(lengths.size());</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < lengths.size(); ++i) {</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  tree_[i].resize(lengths[lengths.size() - i - 1]);</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  }</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(tree_.size(), 1);</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(1, tree_[0].size());</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  root_node_ = &tree_[0][0];</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>  std::string DebugStringInternal(<span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"%s(%s) == %s"</span>, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>,</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, <span class="stringliteral">", "</span>),</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->DebugString());</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  }</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  </div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordtype">void</span> AcceptInternal(<span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>,</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  visitor->BeginVisitConstraint(<a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  visitor->VisitIntegerExpressionArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a489f38dd601db8d045efae4d9ae7d754">ModelVisitor::kTargetArgument</a>,</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>);</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  visitor->EndVisitConstraint(<a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  </div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// Increases min by delta_min, reduces max by delta_max.</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordtype">void</span> ReduceRange(<span class="keywordtype">int</span> depth, <span class="keywordtype">int</span> position, int64_t delta_min,</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  int64_t delta_max) {</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  NodeInfo* <span class="keyword">const</span> info = &tree_[depth][position];</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (delta_min > 0) {</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  info->node_min.SetValue(solver(),</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(info->node_min.Value(), delta_min));</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">if</span> (delta_max > 0) {</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  info->node_max.SetValue(solver(),</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(info->node_max.Value(), delta_max));</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  }</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  </div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// Sets the range on the given node.</span></div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordtype">void</span> SetRange(<span class="keywordtype">int</span> depth, <span class="keywordtype">int</span> position, int64_t new_min, int64_t new_max) {</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  NodeInfo* <span class="keyword">const</span> info = &tree_[depth][position];</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">if</span> (new_min > info->node_min.Value()) {</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  info->node_min.SetValue(solver(), new_min);</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span> (new_max < info-><a class="code" href="expr__array_8cc.html#a6338e469375ab701689733df320f8a3d">node_max</a>.Value()) {</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  info->node_max.SetValue(solver(), new_max);</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> InitLeaf(<span class="keywordtype">int</span> position, int64_t var_min, int64_t var_max) {</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  InitNode(MaxDepth(), position, var_min, var_max);</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  }</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  </div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordtype">void</span> InitNode(<span class="keywordtype">int</span> depth, <span class="keywordtype">int</span> position, int64_t <a class="code" href="expr__array_8cc.html#af1270f025dc2ffc2c07aff435ce41005">node_min</a>, int64_t <a class="code" href="expr__array_8cc.html#a6338e469375ab701689733df320f8a3d">node_max</a>) {</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  tree_[depth][position].node_min.SetValue(solver(), <a class="code" href="expr__array_8cc.html#af1270f025dc2ffc2c07aff435ce41005">node_min</a>);</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  tree_[depth][position].node_max.SetValue(solver(), <a class="code" href="expr__array_8cc.html#a6338e469375ab701689733df320f8a3d">node_max</a>);</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  </div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  int64_t Min(<span class="keywordtype">int</span> depth, <span class="keywordtype">int</span> position)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">return</span> tree_[depth][position].node_min.Value();</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  </div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  int64_t Max(<span class="keywordtype">int</span> depth, <span class="keywordtype">int</span> position)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">return</span> tree_[depth][position].node_max.Value();</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>  int64_t RootMin()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> root_node_->node_min.Value(); }</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>  int64_t RootMax()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> root_node_->node_max.Value(); }</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  </div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordtype">int</span> Parent(<span class="keywordtype">int</span> position)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> position / block_size_; }</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  </div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordtype">int</span> ChildStart(<span class="keywordtype">int</span> position)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> position * block_size_; }</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  </div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordtype">int</span> ChildEnd(<span class="keywordtype">int</span> depth, <span class="keywordtype">int</span> position)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(depth + 1, tree_.size());</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">return</span> <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>((position + 1) * block_size_ - 1, Width(depth + 1) - 1);</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  }</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>  <span class="keywordtype">bool</span> IsLeaf(<span class="keywordtype">int</span> depth)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> depth == MaxDepth(); }</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">int</span> MaxDepth()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> tree_.size() - 1; }</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  </div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordtype">int</span> Width(<span class="keywordtype">int</span> depth)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> tree_[depth].size(); }</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  </div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">protected</span>:</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"><a class="line" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb"> 138</a></span>  <span class="keyword">const</span> std::vector<IntVar*> <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</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">private</span>:</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">struct </span>NodeInfo {</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  NodeInfo() : <a class="code" href="expr__array_8cc.html#af1270f025dc2ffc2c07aff435ce41005">node_min</a>(0), <a class="code" href="expr__array_8cc.html#a6338e469375ab701689733df320f8a3d">node_max</a>(0) {}</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"><a class="line" href="expr__array_8cc.html#af1270f025dc2ffc2c07aff435ce41005"> 143</a></span>  Rev<int64_t> <a class="code" href="expr__array_8cc.html#af1270f025dc2ffc2c07aff435ce41005">node_min</a>;</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"><a class="line" href="expr__array_8cc.html#a6338e469375ab701689733df320f8a3d"> 144</a></span>  Rev<int64_t> <a class="code" href="expr__array_8cc.html#a6338e469375ab701689733df320f8a3d">node_max</a>;</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>  </div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  std::vector<std::vector<NodeInfo> > tree_;</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_size_;</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  NodeInfo* root_node_;</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>  </div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment">// ---------- Sum Array ----------</span></div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  </div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// Some of these optimizations here are described in:</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment">// "Bounds consistency techniques for long linear constraints". In</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment">// Workshop on Techniques for Implementing Constraint Programming</span></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// Systems (TRICS), a workshop of CP 2002, N. Beldiceanu, W. Harvey,</span></div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment">// Martin Henz, Francois Laburthe, Eric Monfroy, Tobias Müller,</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment">// Laurent Perron and Christian Schulte editors, pages 39-46, 2002.</span></div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  </div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// ----- SumConstraint -----</span></div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  </div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment">// This constraint implements sum(vars) == sum_var.</span></div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="keyword">class </span>SumConstraint : <span class="keyword">public</span> TreeArrayConstraint {</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  SumConstraint(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  IntVar* <span class="keyword">const</span> sum_var)</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  : TreeArrayConstraint(solver, vars, sum_var), sum_demon_(<span class="keyword">nullptr</span>) {}</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  </div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  ~SumConstraint()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  </div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  Demon* <span class="keyword">const</span> demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  solver(), <span class="keyword">this</span>, &SumConstraint::LeafChanged, <span class="stringliteral">"LeafChanged"</span>, i);</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenRange(demon);</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  }</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  sum_demon_ = solver()->RegisterDemon(<a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  solver(), <span class="keyword">this</span>, &SumConstraint::SumChanged, <span class="stringliteral">"SumChanged"</span>));</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->WhenRange(sum_demon_);</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  }</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  </div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">// Copy vars to leaf nodes.</span></div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  InitLeaf(i, <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min(), <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max());</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>  <span class="comment">// Compute up.</span></div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = MaxDepth() - 1; i >= 0; --i) {</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < Width(i); ++j) {</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  int64_t sum_min = 0;</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  int64_t sum_max = 0;</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_start = ChildStart(j);</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_end = ChildEnd(i, j);</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = block_start; k <= block_end; ++k) {</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  sum_min = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_min, Min(i + 1, k));</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  sum_max = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_max, Max(i + 1, k));</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  }</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  InitNode(i, j, sum_min, sum_max);</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</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>  <span class="comment">// Propagate to sum_var.</span></div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(RootMin(), RootMax());</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  </div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="comment">// Push down.</span></div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  SumChanged();</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>  <span class="keywordtype">void</span> SumChanged() {</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max() == RootMin() &&</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max() != <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="comment">// We can fix all terms to min.</span></div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetValue(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min());</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  }</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min() == RootMax() &&</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min() != <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>()) {</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// We can fix all terms to max.</span></div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetValue(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max());</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">else</span> {</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  PushDown(0, 0, <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min(), <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max());</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  </div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordtype">void</span> PushDown(<span class="keywordtype">int</span> depth, <span class="keywordtype">int</span> position, int64_t new_min, int64_t new_max) {</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">// Nothing to do?</span></div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">if</span> (new_min <= Min(depth, position) && new_max >= Max(depth, position)) {</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  }</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  </div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="comment">// Leaf node -> push to leaf var.</span></div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordflow">if</span> (IsLeaf(depth)) {</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[position]->SetRange(new_min, new_max);</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  }</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  </div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">// Standard propagation from the bounds of the sum to the</span></div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// individuals terms.</span></div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  </div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">// These are maintained automatically in the tree structure.</span></div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keyword">const</span> int64_t sum_min = Min(depth, position);</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">const</span> int64_t sum_max = Max(depth, position);</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  </div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// Intersect the new bounds with the computed bounds.</span></div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  new_max = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(sum_max, new_max);</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  new_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(sum_min, new_min);</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>  <span class="comment">// Detect failure early.</span></div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">if</span> (new_max < sum_min || new_min > sum_max) {</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  }</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  </div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="comment">// Push to children nodes.</span></div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_start = ChildStart(position);</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_end = ChildEnd(depth, position);</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = block_start; i <= block_end; ++i) {</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keyword">const</span> int64_t target_var_min = Min(depth + 1, i);</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keyword">const</span> int64_t target_var_max = Max(depth + 1, i);</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keyword">const</span> int64_t residual_min = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(sum_min, target_var_min);</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keyword">const</span> int64_t residual_max = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(sum_max, target_var_max);</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  PushDown(depth + 1, i, <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(new_min, residual_max),</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(new_max, residual_min));</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  }</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="comment">// TODO(user) : Is the diameter optimization (see reference</span></div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">// above, rule 5) useful?</span></div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  }</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  </div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordtype">void</span> LeafChanged(<span class="keywordtype">int</span> term_index) {</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[term_index];</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  PushUp(term_index, <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min(), <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->OldMin()),</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->OldMax(), <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max()));</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  EnqueueDelayedDemon(sum_demon_); <span class="comment">// TODO(user): Is this needed?</span></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> PushUp(<span class="keywordtype">int</span> position, int64_t delta_min, int64_t delta_max) {</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(delta_max, 0);</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(delta_min, 0);</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(<a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(delta_min, delta_max), 0);</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> depth = MaxDepth(); depth >= 0; --depth) {</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  ReduceRange(depth, position, delta_min, delta_max);</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  position = Parent(position);</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>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, position);</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(RootMin(), RootMax());</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  </div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordflow">return</span> DebugStringInternal(<span class="stringliteral">"Sum"</span>);</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  }</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  </div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <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="l00294"></a><span class="lineno"> 294</span>  AcceptInternal(<a class="code" href="classoperations__research_1_1_model_visitor.html#a28e3cf762a241bdf2838651120aa98cf">ModelVisitor::kSumEqual</a>, visitor);</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  }</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  </div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  Demon* sum_demon_;</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span> };</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  </div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="comment">// This constraint implements sum(vars) == target_var.</span></div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span> <span class="keyword">class </span>SmallSumConstraint : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  SmallSumConstraint(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  IntVar* <span class="keyword">const</span> target_var)</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  : Constraint(solver),</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>(target_var),</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  computed_min_(0),</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  computed_max_(0),</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  sum_demon_(nullptr) {}</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>  ~SmallSumConstraint()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  </div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Bound()) {</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  Demon* <span class="keyword">const</span> demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  solver(), <span class="keyword">this</span>, &SmallSumConstraint::VarChanged, <span class="stringliteral">"VarChanged"</span>,</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]);</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenRange(demon);</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  }</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  }</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  sum_demon_ = solver()->RegisterDemon(<a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  solver(), <span class="keyword">this</span>, &SmallSumConstraint::SumChanged, <span class="stringliteral">"SumChanged"</span>));</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->WhenRange(sum_demon_);</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  }</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  </div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// Compute up.</span></div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  int64_t sum_min = 0;</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  int64_t sum_max = 0;</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">for</span> (IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>) {</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  sum_min = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_min, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min());</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  sum_max = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_max, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max());</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="comment">// Propagate to sum_var.</span></div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  computed_min_.SetValue(solver(), sum_min);</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  computed_max_.SetValue(solver(), sum_max);</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(sum_min, sum_max);</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>  <span class="comment">// Push down.</span></div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  SumChanged();</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>  </div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordtype">void</span> SumChanged() {</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  int64_t new_min = <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min();</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  int64_t new_max = <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max();</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keyword">const</span> int64_t sum_min = computed_min_.Value();</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">const</span> int64_t sum_max = computed_max_.Value();</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">if</span> (new_max == sum_min && new_max != <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="comment">// We can fix all terms to min.</span></div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetValue(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min());</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  }</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (new_min == sum_max &&</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  new_min != <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>()) {</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="comment">// We can fix all terms to max.</span></div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetValue(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max());</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>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">if</span> (new_min > sum_min || new_max < sum_max) { <span class="comment">// something to do.</span></div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="comment">// Intersect the new bounds with the computed bounds.</span></div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  new_max = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(sum_max, new_max);</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  new_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(sum_min, new_min);</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="comment">// Detect failure early.</span></div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">if</span> (new_max < sum_min || new_min > sum_max) {</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  }</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  </div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="comment">// Push to variables.</span></div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordflow">for</span> (IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>) {</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</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="l00377"></a><span class="lineno"> 377</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="l00378"></a><span class="lineno"> 378</span>  <span class="keyword">const</span> int64_t residual_min = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(sum_min, var_min);</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keyword">const</span> int64_t residual_max = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(sum_max, var_max);</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetRange(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(new_min, residual_max),</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(new_max, residual_min));</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>  }</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"> 387</span>  <span class="keywordtype">void</span> VarChanged(IntVar* <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keyword">const</span> int64_t delta_min = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min(), <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->OldMin());</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keyword">const</span> int64_t delta_max = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->OldMax(), <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max());</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  computed_min_.Add(solver(), delta_min);</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  computed_max_.Add(solver(), -delta_max);</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordflow">if</span> (computed_max_.Value() < <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max() ||</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  computed_min_.Value() > <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min()) {</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(computed_min_.Value(), computed_max_.Value());</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  EnqueueDelayedDemon(sum_demon_);</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  }</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  }</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  </div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"SmallSum(%s) == %s"</span>,</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, <span class="stringliteral">", "</span>),</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->DebugString());</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  }</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  </div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordtype">void</span> Accept(ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a28e3cf762a241bdf2838651120aa98cf">ModelVisitor::kSumEqual</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  visitor->VisitIntegerExpressionArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a489f38dd601db8d045efae4d9ae7d754">ModelVisitor::kTargetArgument</a>,</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>);</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a28e3cf762a241bdf2838651120aa98cf">ModelVisitor::kSumEqual</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  }</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  </div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keyword">const</span> std::vector<IntVar*> <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  IntVar* <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>;</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  NumericalRev<int64_t> computed_min_;</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  NumericalRev<int64_t> computed_max_;</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  Demon* sum_demon_;</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span> };</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="comment">// ----- SafeSumConstraint -----</span></div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  </div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="keywordtype">bool</span> DetectSumOverflow(<span class="keyword">const</span> std::vector<IntVar*>& vars) {</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  int64_t sum_min = 0;</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  int64_t sum_max = 0;</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vars.size(); ++i) {</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  sum_min = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_min, vars[i]->Min());</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  sum_max = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_max, vars[i]->Max());</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">if</span> (sum_min == <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>() ||</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  sum_max == <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  }</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  }</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keywordflow">return</span> <span class="keyword">false</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>  </div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="comment">// This constraint implements sum(vars) == sum_var.</span></div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="keyword">class </span>SafeSumConstraint : <span class="keyword">public</span> TreeArrayConstraint {</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  SafeSumConstraint(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  IntVar* <span class="keyword">const</span> sum_var)</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  : TreeArrayConstraint(solver, vars, sum_var), sum_demon_(nullptr) {}</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  </div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  ~SafeSumConstraint()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  </div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  Demon* <span class="keyword">const</span> demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  solver(), <span class="keyword">this</span>, &SafeSumConstraint::LeafChanged, <span class="stringliteral">"LeafChanged"</span>, i);</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenRange(demon);</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  }</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  sum_demon_ = solver()->RegisterDemon(<a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  solver(), <span class="keyword">this</span>, &SafeSumConstraint::SumChanged, <span class="stringliteral">"SumChanged"</span>));</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->WhenRange(sum_demon_);</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>  </div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keywordtype">void</span> SafeComputeNode(<span class="keywordtype">int</span> depth, <span class="keywordtype">int</span> position, int64_t* <span class="keyword">const</span> sum_min,</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  int64_t* <span class="keyword">const</span> sum_max) {</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(depth, MaxDepth());</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_start = ChildStart(position);</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_end = ChildEnd(depth, position);</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = block_start; k <= block_end; ++k) {</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">if</span> (*sum_min != <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>()) {</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  *sum_min = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(*sum_min, Min(depth + 1, k));</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">if</span> (*sum_max != <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  *sum_max = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(*sum_max, Max(depth + 1, k));</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  }</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordflow">if</span> (*sum_min == <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>() &&</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  *sum_max == <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  }</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  }</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  }</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  </div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="comment">// Copy vars to leaf nodes.</span></div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  InitLeaf(i, <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min(), <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max());</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  }</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="comment">// Compute up.</span></div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = MaxDepth() - 1; i >= 0; --i) {</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < Width(i); ++j) {</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  int64_t sum_min = 0;</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  int64_t sum_max = 0;</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  SafeComputeNode(i, j, &sum_min, &sum_max);</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  InitNode(i, j, sum_min, sum_max);</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  }</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  }</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="comment">// Propagate to sum_var.</span></div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(RootMin(), RootMax());</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  </div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">// Push down.</span></div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  SumChanged();</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  }</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  </div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordtype">void</span> SumChanged() {</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(CheckInternalState());</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max() == RootMin()) {</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">// We can fix all terms to min.</span></div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetValue(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min());</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  }</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min() == RootMax()) {</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="comment">// We can fix all terms to max.</span></div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetValue(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max());</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  }</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  PushDown(0, 0, <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min(), <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max());</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>  }</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  </div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordtype">void</span> PushDown(<span class="keywordtype">int</span> depth, <span class="keywordtype">int</span> position, int64_t new_min, int64_t new_max) {</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="comment">// Nothing to do?</span></div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">if</span> (new_min <= Min(depth, position) && new_max >= Max(depth, position)) {</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  }</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  </div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="comment">// Leaf node -> push to leaf var.</span></div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordflow">if</span> (IsLeaf(depth)) {</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[position]->SetRange(new_min, new_max);</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  }</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  </div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="comment">// Standard propagation from the bounds of the sum to the</span></div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="comment">// individuals terms.</span></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>  <span class="comment">// These are maintained automatically in the tree structure.</span></div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keyword">const</span> int64_t sum_min = Min(depth, position);</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keyword">const</span> int64_t sum_max = Max(depth, position);</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  </div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="comment">// Intersect the new bounds with the computed bounds.</span></div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  new_max = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(sum_max, new_max);</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  new_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(sum_min, new_min);</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  </div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="comment">// Detect failure early.</span></div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keywordflow">if</span> (new_max < sum_min || new_min > sum_max) {</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  solver()->Fail();</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>  <span class="comment">// Push to children nodes.</span></div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_start = ChildStart(position);</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_end = ChildEnd(depth, position);</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = block_start; pos <= block_end; ++pos) {</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keyword">const</span> int64_t target_var_min = Min(depth + 1, pos);</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keyword">const</span> int64_t residual_min =</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  sum_min != <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>()</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  ? <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(sum_min, target_var_min)</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  : std::numeric_limits<int64_t>::<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a>();</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keyword">const</span> int64_t target_var_max = Max(depth + 1, pos);</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keyword">const</span> int64_t residual_max =</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  sum_max != <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  ? <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(sum_max, target_var_max)</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  : std::numeric_limits<int64_t>::<a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a>();</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  PushDown(depth + 1, pos,</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  (residual_max == <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>()</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  ? <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>()</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  : <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(new_min, residual_max)),</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  (residual_min == <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  ? <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>()</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  : <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(new_max, residual_min)));</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  }</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="comment">// TODO(user) : Is the diameter optimization (see reference</span></div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="comment">// above, rule 5) useful?</span></div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  }</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  </div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordtype">void</span> LeafChanged(<span class="keywordtype">int</span> term_index) {</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[term_index];</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  PushUp(term_index, <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min(), <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->OldMin()),</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->OldMax(), <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max()));</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  EnqueueDelayedDemon(sum_demon_); <span class="comment">// TODO(user): Is this needed?</span></div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  }</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  </div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keywordtype">void</span> PushUp(<span class="keywordtype">int</span> position, int64_t delta_min, int64_t delta_max) {</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(delta_max, 0);</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(delta_min, 0);</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(delta_min, delta_max) == 0) {</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="comment">// This may happen if the computation of old min/max has under/overflowed</span></div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="comment">// resulting in no actual change in min and max.</span></div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  }</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordtype">bool</span> delta_corrupted = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> depth = MaxDepth(); depth >= 0; --depth) {</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordflow">if</span> (Min(depth, position) != <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>() &&</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  Max(depth, position) != <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>() &&</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  delta_min != <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>() &&</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  delta_max != <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>() &&</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  !delta_corrupted) { <span class="comment">// No overflow.</span></div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  ReduceRange(depth, position, delta_min, delta_max);</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (depth == MaxDepth()) { <span class="comment">// Leaf.</span></div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  SetRange(depth, position, <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[position]->Min(),</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[position]->Max());</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  delta_corrupted = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  } <span class="keywordflow">else</span> { <span class="comment">// Recompute.</span></div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  int64_t sum_min = 0;</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  int64_t sum_max = 0;</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  SafeComputeNode(depth, position, &sum_min, &sum_max);</div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keywordflow">if</span> (sum_min == <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>() &&</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  sum_max == <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keywordflow">return</span>; <span class="comment">// Nothing to do upward.</span></div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  }</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  SetRange(depth, position, sum_min, sum_max);</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  delta_corrupted = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  }</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  position = Parent(position);</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>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, position);</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(RootMin(), RootMax());</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  }</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  </div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keywordflow">return</span> DebugStringInternal(<span class="stringliteral">"Sum"</span>);</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  }</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  </div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</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="l00618"></a><span class="lineno"> 618</span>  AcceptInternal(<a class="code" href="classoperations__research_1_1_model_visitor.html#a28e3cf762a241bdf2838651120aa98cf">ModelVisitor::kSumEqual</a>, visitor);</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  }</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  </div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keywordtype">bool</span> CheckInternalState() {</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  CheckLeaf(i, <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min(), <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max());</div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  }</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="comment">// Check up.</span></div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = MaxDepth() - 1; i >= 0; --i) {</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < Width(i); ++j) {</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  int64_t sum_min = 0;</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  int64_t sum_max = 0;</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  SafeComputeNode(i, j, &sum_min, &sum_max);</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  CheckNode(i, j, sum_min, sum_max);</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  }</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  }</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  }</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  </div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keywordtype">void</span> CheckLeaf(<span class="keywordtype">int</span> position, int64_t var_min, int64_t var_max) {</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  CheckNode(MaxDepth(), position, var_min, var_max);</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> CheckNode(<span class="keywordtype">int</span> depth, <span class="keywordtype">int</span> position, int64_t <a class="code" href="expr__array_8cc.html#af1270f025dc2ffc2c07aff435ce41005">node_min</a>, int64_t <a class="code" href="expr__array_8cc.html#a6338e469375ab701689733df320f8a3d">node_max</a>) {</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(Min(depth, position), <a class="code" href="expr__array_8cc.html#af1270f025dc2ffc2c07aff435ce41005">node_min</a>);</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(Max(depth, position), <a class="code" href="expr__array_8cc.html#a6338e469375ab701689733df320f8a3d">node_max</a>);</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  }</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  </div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  Demon* sum_demon_;</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span> };</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  </div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span> <span class="comment">// ---------- Min Array ----------</span></div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  </div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span> <span class="comment">// This constraint implements min(vars) == min_var.</span></div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span> <span class="keyword">class </span>MinConstraint : <span class="keyword">public</span> TreeArrayConstraint {</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  MinConstraint(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  IntVar* <span class="keyword">const</span> min_var)</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  : TreeArrayConstraint(solver, vars, min_var), min_demon_(nullptr) {}</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>  ~MinConstraint()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  </div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  Demon* <span class="keyword">const</span> demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  solver(), <span class="keyword">this</span>, &MinConstraint::LeafChanged, <span class="stringliteral">"LeafChanged"</span>, i);</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenRange(demon);</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  }</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  min_demon_ = solver()->RegisterDemon(<a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  solver(), <span class="keyword">this</span>, &MinConstraint::MinVarChanged, <span class="stringliteral">"MinVarChanged"</span>));</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->WhenRange(min_demon_);</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  }</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>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="comment">// Copy vars to leaf nodes.</span></div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  InitLeaf(i, <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min(), <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max());</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>  <span class="comment">// Compute up.</span></div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = MaxDepth() - 1; i >= 0; --i) {</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < Width(i); ++j) {</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  int64_t min_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  int64_t min_max = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_start = ChildStart(j);</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_end = ChildEnd(i, j);</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = block_start; k <= block_end; ++k) {</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  min_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_min, Min(i + 1, k));</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  min_max = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_max, Max(i + 1, k));</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>  InitNode(i, j, min_min, min_max);</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  }</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  }</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="comment">// Propagate to min_var.</span></div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(RootMin(), RootMax());</div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  </div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="comment">// Push down.</span></div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  MinVarChanged();</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>  </div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keywordtype">void</span> MinVarChanged() {</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  PushDown(0, 0, <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min(), <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max());</div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  }</div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  </div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keywordtype">void</span> PushDown(<span class="keywordtype">int</span> depth, <span class="keywordtype">int</span> position, int64_t new_min, int64_t new_max) {</div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="comment">// Nothing to do?</span></div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="keywordflow">if</span> (new_min <= Min(depth, position) && new_max >= Max(depth, position)) {</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  }</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  </div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="comment">// Leaf node -> push to leaf var.</span></div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keywordflow">if</span> (IsLeaf(depth)) {</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[position]->SetRange(new_min, new_max);</div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</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="keyword">const</span> int64_t <a class="code" href="expr__array_8cc.html#af1270f025dc2ffc2c07aff435ce41005">node_min</a> = Min(depth, position);</div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keyword">const</span> int64_t <a class="code" href="expr__array_8cc.html#a6338e469375ab701689733df320f8a3d">node_max</a> = Max(depth, position);</div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  </div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keywordtype">int</span> candidate = -1;</div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keywordtype">int</span> active = 0;</div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_start = ChildStart(position);</div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_end = ChildEnd(depth, position);</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="keywordflow">if</span> (new_max < <a class="code" href="expr__array_8cc.html#a6338e469375ab701689733df320f8a3d">node_max</a>) {</div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="comment">// Look if only one candidat to push the max down.</span></div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = block_start; i <= block_end; ++i) {</div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keywordflow">if</span> (Min(depth + 1, i) <= new_max) {</div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="keywordflow">if</span> (active++ >= 1) {</div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="keywordflow">break</span>;</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>  candidate = i;</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  }</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  }</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keywordflow">if</span> (active == 0) {</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  }</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  }</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  </div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#af1270f025dc2ffc2c07aff435ce41005">node_min</a> < new_min) {</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = block_start; i <= block_end; ++i) {</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keywordflow">if</span> (i == candidate && active == 1) {</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  PushDown(depth + 1, i, new_min, new_max);</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  PushDown(depth + 1, i, new_min, Max(depth + 1, i));</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  }</div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  }</div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (active == 1) {</div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  PushDown(depth + 1, candidate, Min(depth + 1, candidate), new_max);</div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  }</div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  }</div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  </div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="comment">// TODO(user): Regroup code between Min and Max constraints.</span></div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keywordtype">void</span> LeafChanged(<span class="keywordtype">int</span> term_index) {</div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[term_index];</div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  SetRange(MaxDepth(), term_index, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min(), <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max());</div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> parent_depth = MaxDepth() - 1;</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> parent = Parent(term_index);</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</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="l00758"></a><span class="lineno"> 758</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="l00759"></a><span class="lineno"> 759</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="l00760"></a><span class="lineno"> 760</span>  <span class="keywordflow">if</span> ((old_min == Min(parent_depth, parent) && old_min != var_min) ||</div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  var_max < Max(parent_depth, parent)) {</div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="comment">// Can influence the parent bounds.</span></div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  PushUp(term_index);</div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  }</div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  }</div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  </div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keywordtype">void</span> PushUp(<span class="keywordtype">int</span> position) {</div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="keywordtype">int</span> depth = MaxDepth();</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="keywordflow">while</span> (depth > 0) {</div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> parent = Parent(position);</div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> parent_depth = depth - 1;</div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  int64_t min_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  int64_t min_max = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_start = ChildStart(parent);</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_end = ChildEnd(parent_depth, parent);</div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = block_start; k <= block_end; ++k) {</div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  min_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_min, Min(depth, k));</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  min_max = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_max, Max(depth, k));</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">if</span> (min_min > Min(parent_depth, parent) ||</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  min_max < Max(parent_depth, parent)) {</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  SetRange(parent_depth, parent, min_min, min_max);</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  }</div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  depth = parent_depth;</div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  position = parent;</div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  }</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordflow">if</span> (depth == 0) { <span class="comment">// We have pushed all the way up.</span></div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(RootMin(), RootMax());</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  }</div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  MinVarChanged();</div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  }</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  </div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keywordflow">return</span> DebugStringInternal(<span class="stringliteral">"Min"</span>);</div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  }</div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  </div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</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="l00800"></a><span class="lineno"> 800</span>  AcceptInternal(<a class="code" href="classoperations__research_1_1_model_visitor.html#adeea8c62c6003b04a723e309ffc792ca">ModelVisitor::kMinEqual</a>, visitor);</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  }</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  </div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  Demon* min_demon_;</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>  </div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span> <span class="keyword">class </span>SmallMinConstraint : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  SmallMinConstraint(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  IntVar* <span class="keyword">const</span> target_var)</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  : Constraint(solver),</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>(target_var),</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  computed_min_(0),</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  computed_max_(0) {}</div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  </div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  ~SmallMinConstraint()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  </div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Bound()) {</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  Demon* <span class="keyword">const</span> demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  solver(), <span class="keyword">this</span>, &SmallMinConstraint::VarChanged, <span class="stringliteral">"VarChanged"</span>,</div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]);</div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenRange(demon);</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>  }</div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  Demon* <span class="keyword">const</span> mdemon = solver()->RegisterDemon(<a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  solver(), <span class="keyword">this</span>, &SmallMinConstraint::MinVarChanged, <span class="stringliteral">"MinVarChanged"</span>));</div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->WhenRange(mdemon);</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  }</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  </div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  int64_t min_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  int64_t min_max = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <span class="keywordflow">for</span> (IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>) {</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  min_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_min, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min());</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  min_max = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_max, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max());</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>  computed_min_.SetValue(solver(), min_min);</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  computed_max_.SetValue(solver(), min_max);</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="comment">// Propagate to min_var.</span></div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(min_min, min_max);</div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  </div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="comment">// Push down.</span></div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  MinVarChanged();</div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  }</div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  </div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"SmallMin(%s) == %s"</span>,</div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, <span class="stringliteral">", "</span>),</div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->DebugString());</div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  }</div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  </div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <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="l00856"></a><span class="lineno"> 856</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#adeea8c62c6003b04a723e309ffc792ca">ModelVisitor::kMinEqual</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  visitor->VisitIntegerExpressionArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a489f38dd601db8d045efae4d9ae7d754">ModelVisitor::kTargetArgument</a>,</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>);</div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#adeea8c62c6003b04a723e309ffc792ca">ModelVisitor::kMinEqual</a>, <span class="keyword">this</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="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="keywordtype">void</span> VarChanged(IntVar* <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</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="l00867"></a><span class="lineno"> 867</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="l00868"></a><span class="lineno"> 868</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="l00869"></a><span class="lineno"> 869</span>  <span class="keywordflow">if</span> ((old_min == computed_min_.Value() && old_min != var_min) ||</div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  var_max < computed_max_.Value()) {</div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="comment">// Can influence the min var bounds.</span></div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  int64_t min_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  int64_t min_max = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="keywordflow">for</span> (IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>) {</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  min_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_min, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min());</div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  min_max = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_max, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max());</div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  }</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="keywordflow">if</span> (min_min > computed_min_.Value() || min_max < computed_max_.Value()) {</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  computed_min_.SetValue(solver(), min_min);</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  computed_max_.SetValue(solver(), min_max);</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(computed_min_.Value(), computed_max_.Value());</div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  }</div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  }</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  MinVarChanged();</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  }</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  </div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keywordtype">void</span> MinVarChanged() {</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keyword">const</span> int64_t new_min = <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min();</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keyword">const</span> int64_t new_max = <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max();</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="comment">// Nothing to do?</span></div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="keywordflow">if</span> (new_min <= computed_min_.Value() && new_max >= computed_max_.Value()) {</div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  }</div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  </div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  IntVar* candidate = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordtype">int</span> active = 0;</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>  <span class="keywordflow">if</span> (new_max < computed_max_.Value()) {</div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <span class="comment">// Look if only one candidate to push the max down.</span></div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="keywordflow">for</span> (IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>) {</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min() <= new_max) {</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="keywordflow">if</span> (active++ >= 1) {</div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="keywordflow">break</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>  candidate = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>;</div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  }</div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  }</div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <span class="keywordflow">if</span> (active == 0) {</div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  solver()->Fail();</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>  }</div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keywordflow">if</span> (computed_min_.Value() < new_min) {</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keywordflow">if</span> (active == 1) {</div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  candidate->SetRange(new_min, new_max);</div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="keywordflow">for</span> (IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>) {</div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetMin(new_min);</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  }</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  }</div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (active == 1) {</div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  candidate->SetMax(new_max);</div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  }</div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  }</div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  </div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  std::vector<IntVar*> <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  IntVar* <span class="keyword">const</span> <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>;</div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  Rev<int64_t> computed_min_;</div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  Rev<int64_t> computed_max_;</div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span> };</div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  </div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span> <span class="comment">// ---------- Max Array ----------</span></div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  </div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span> <span class="comment">// This constraint implements max(vars) == max_var.</span></div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span> <span class="keyword">class </span>MaxConstraint : <span class="keyword">public</span> TreeArrayConstraint {</div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  MaxConstraint(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  IntVar* <span class="keyword">const</span> max_var)</div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  : TreeArrayConstraint(solver, vars, max_var), max_demon_(nullptr) {}</div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  </div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  ~MaxConstraint()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  </div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  Demon* <span class="keyword">const</span> demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  solver(), <span class="keyword">this</span>, &MaxConstraint::LeafChanged, <span class="stringliteral">"LeafChanged"</span>, i);</div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenRange(demon);</div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  }</div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  max_demon_ = solver()->RegisterDemon(<a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  solver(), <span class="keyword">this</span>, &MaxConstraint::MaxVarChanged, <span class="stringliteral">"MaxVarChanged"</span>));</div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->WhenRange(max_demon_);</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  }</div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  </div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="comment">// Copy vars to leaf nodes.</span></div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  InitLeaf(i, <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min(), <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max());</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  }</div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  </div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="comment">// Compute up.</span></div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = MaxDepth() - 1; i >= 0; --i) {</div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < Width(i); ++j) {</div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  int64_t max_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  int64_t max_max = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_start = ChildStart(j);</div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_end = ChildEnd(i, j);</div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = block_start; k <= block_end; ++k) {</div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  max_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_min, Min(i + 1, k));</div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  max_max = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_max, Max(i + 1, k));</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  }</div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  InitNode(i, j, max_min, max_max);</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="comment">// Propagate to min_var.</span></div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(RootMin(), RootMax());</div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  </div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="comment">// Push down.</span></div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  MaxVarChanged();</div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  }</div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  </div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keywordtype">void</span> MaxVarChanged() {</div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  PushDown(0, 0, <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min(), <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max());</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="keywordtype">void</span> PushDown(<span class="keywordtype">int</span> depth, <span class="keywordtype">int</span> position, int64_t new_min, int64_t new_max) {</div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="comment">// Nothing to do?</span></div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="keywordflow">if</span> (new_min <= Min(depth, position) && new_max >= Max(depth, position)) {</div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  }</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  </div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="comment">// Leaf node -> push to leaf var.</span></div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <span class="keywordflow">if</span> (IsLeaf(depth)) {</div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[position]->SetRange(new_min, new_max);</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="keywordflow">return</span>;</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>  </div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  <span class="keyword">const</span> int64_t <a class="code" href="expr__array_8cc.html#af1270f025dc2ffc2c07aff435ce41005">node_min</a> = Min(depth, position);</div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="keyword">const</span> int64_t <a class="code" href="expr__array_8cc.html#a6338e469375ab701689733df320f8a3d">node_max</a> = Max(depth, position);</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  </div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="keywordtype">int</span> candidate = -1;</div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="keywordtype">int</span> active = 0;</div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_start = ChildStart(position);</div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_end = ChildEnd(depth, position);</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> (<a class="code" href="expr__array_8cc.html#af1270f025dc2ffc2c07aff435ce41005">node_min</a> < new_min) {</div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <span class="comment">// Look if only one candidat to push the max down.</span></div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = block_start; i <= block_end; ++i) {</div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="keywordflow">if</span> (Max(depth + 1, i) >= new_min) {</div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="keywordflow">if</span> (active++ >= 1) {</div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  <span class="keywordflow">break</span>;</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>  candidate = i;</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>  <span class="keywordflow">if</span> (active == 0) {</div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  solver()->Fail();</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>  }</div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  </div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a6338e469375ab701689733df320f8a3d">node_max</a> > new_max) {</div>
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = block_start; i <= block_end; ++i) {</div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  <span class="keywordflow">if</span> (i == candidate && active == 1) {</div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  PushDown(depth + 1, i, new_min, new_max);</div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  PushDown(depth + 1, i, Min(depth + 1, i), new_max);</div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  }</div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  }</div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (active == 1) {</div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  PushDown(depth + 1, candidate, new_min, Max(depth + 1, candidate));</div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  }</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  }</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  </div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="keywordtype">void</span> LeafChanged(<span class="keywordtype">int</span> term_index) {</div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[term_index];</div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  SetRange(MaxDepth(), term_index, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min(), <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max());</div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> parent_depth = MaxDepth() - 1;</div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> parent = Parent(term_index);</div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</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="l01038"></a><span class="lineno"> 1038</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="l01039"></a><span class="lineno"> 1039</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="l01040"></a><span class="lineno"> 1040</span>  <span class="keywordflow">if</span> ((old_max == Max(parent_depth, parent) && old_max != var_max) ||</div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  var_min > Min(parent_depth, parent)) {</div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  <span class="comment">// Can influence the parent bounds.</span></div>
|
|
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  PushUp(term_index);</div>
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  }</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>  </div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="keywordtype">void</span> PushUp(<span class="keywordtype">int</span> position) {</div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="keywordtype">int</span> depth = MaxDepth();</div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="keywordflow">while</span> (depth > 0) {</div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> parent = Parent(position);</div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> parent_depth = depth - 1;</div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  int64_t max_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  int64_t max_max = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_start = ChildStart(parent);</div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> block_end = ChildEnd(parent_depth, parent);</div>
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = block_start; k <= block_end; ++k) {</div>
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  max_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_min, Min(depth, k));</div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  max_max = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_max, Max(depth, k));</div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  }</div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <span class="keywordflow">if</span> (max_min > Min(parent_depth, parent) ||</div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  max_max < Max(parent_depth, parent)) {</div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  SetRange(parent_depth, parent, max_min, max_max);</div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  }</div>
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  depth = parent_depth;</div>
|
|
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  position = parent;</div>
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  }</div>
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="keywordflow">if</span> (depth == 0) { <span class="comment">// We have pushed all the way up.</span></div>
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(RootMin(), RootMax());</div>
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  }</div>
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  MaxVarChanged();</div>
|
|
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  }</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>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="keywordflow">return</span> DebugStringInternal(<span class="stringliteral">"Max"</span>);</div>
|
|
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  }</div>
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  </div>
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</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="l01080"></a><span class="lineno"> 1080</span>  AcceptInternal(<a class="code" href="classoperations__research_1_1_model_visitor.html#a9b6934d34d2fdafca6a9c43f6087dc5c">ModelVisitor::kMaxEqual</a>, visitor);</div>
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  }</div>
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  </div>
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  Demon* max_demon_;</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> <span class="keyword">class </span>SmallMaxConstraint : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  SmallMaxConstraint(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  IntVar* <span class="keyword">const</span> target_var)</div>
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  : Constraint(solver),</div>
|
|
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div>
|
|
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>(target_var),</div>
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  computed_min_(0),</div>
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  computed_max_(0) {}</div>
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  </div>
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  ~SmallMaxConstraint()<span class="keyword"> override </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="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Bound()) {</div>
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  Demon* <span class="keyword">const</span> demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  solver(), <span class="keyword">this</span>, &SmallMaxConstraint::VarChanged, <span class="stringliteral">"VarChanged"</span>,</div>
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]);</div>
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenRange(demon);</div>
|
|
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  }</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>  Demon* <span class="keyword">const</span> mdemon = solver()->RegisterDemon(<a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  solver(), <span class="keyword">this</span>, &SmallMaxConstraint::MaxVarChanged, <span class="stringliteral">"MinVarChanged"</span>));</div>
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->WhenRange(mdemon);</div>
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  }</div>
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  </div>
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  int64_t max_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  int64_t max_max = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  <span class="keywordflow">for</span> (IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>) {</div>
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  max_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_min, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min());</div>
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  max_max = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_max, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max());</div>
|
|
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  }</div>
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  computed_min_.SetValue(solver(), max_min);</div>
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  computed_max_.SetValue(solver(), max_max);</div>
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="comment">// Propagate to min_var.</span></div>
|
|
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(max_min, max_max);</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">// Push down.</span></div>
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  MaxVarChanged();</div>
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  }</div>
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  </div>
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"SmallMax(%s) == %s"</span>,</div>
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, <span class="stringliteral">", "</span>),</div>
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->DebugString());</div>
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  }</div>
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  </div>
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  <span class="keywordtype">void</span> Accept(ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a9b6934d34d2fdafca6a9c43f6087dc5c">ModelVisitor::kMaxEqual</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div>
|
|
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div>
|
|
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  visitor->VisitIntegerExpressionArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a489f38dd601db8d045efae4d9ae7d754">ModelVisitor::kTargetArgument</a>,</div>
|
|
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>);</div>
|
|
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a9b6934d34d2fdafca6a9c43f6087dc5c">ModelVisitor::kMaxEqual</a>, <span class="keyword">this</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>  </div>
|
|
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="keywordtype">void</span> VarChanged(IntVar* <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</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="l01147"></a><span class="lineno"> 1147</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="l01148"></a><span class="lineno"> 1148</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="l01149"></a><span class="lineno"> 1149</span>  <span class="keywordflow">if</span> ((old_max == computed_max_.Value() && old_max != var_max) ||</div>
|
|
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  var_min > computed_min_.Value()) { <span class="comment">// REWRITE</span></div>
|
|
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  <span class="comment">// Can influence the min var bounds.</span></div>
|
|
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  int64_t max_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  int64_t max_max = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  <span class="keywordflow">for</span> (IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>) {</div>
|
|
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  max_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_min, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min());</div>
|
|
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  max_max = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_max, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max());</div>
|
|
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  }</div>
|
|
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  <span class="keywordflow">if</span> (max_min > computed_min_.Value() || max_max < computed_max_.Value()) {</div>
|
|
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  computed_min_.SetValue(solver(), max_min);</div>
|
|
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  computed_max_.SetValue(solver(), max_max);</div>
|
|
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(computed_min_.Value(), computed_max_.Value());</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>  }</div>
|
|
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  MaxVarChanged();</div>
|
|
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  }</div>
|
|
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  </div>
|
|
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  <span class="keywordtype">void</span> MaxVarChanged() {</div>
|
|
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <span class="keyword">const</span> int64_t new_min = <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min();</div>
|
|
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  <span class="keyword">const</span> int64_t new_max = <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max();</div>
|
|
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  <span class="comment">// Nothing to do?</span></div>
|
|
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  <span class="keywordflow">if</span> (new_min <= computed_min_.Value() && new_max >= computed_max_.Value()) {</div>
|
|
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  }</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>  IntVar* candidate = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="keywordtype">int</span> active = 0;</div>
|
|
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  </div>
|
|
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  <span class="keywordflow">if</span> (new_min > computed_min_.Value()) {</div>
|
|
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="comment">// Look if only one candidate to push the max down.</span></div>
|
|
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <span class="keywordflow">for</span> (IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>) {</div>
|
|
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max() >= new_min) {</div>
|
|
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  <span class="keywordflow">if</span> (active++ >= 1) {</div>
|
|
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  }</div>
|
|
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  candidate = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>;</div>
|
|
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  }</div>
|
|
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  }</div>
|
|
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  <span class="keywordflow">if</span> (active == 0) {</div>
|
|
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  }</div>
|
|
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  }</div>
|
|
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="keywordflow">if</span> (computed_max_.Value() > new_max) {</div>
|
|
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="keywordflow">if</span> (active == 1) {</div>
|
|
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  candidate->SetRange(new_min, new_max);</div>
|
|
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  <span class="keywordflow">for</span> (IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>) {</div>
|
|
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetMax(new_max);</div>
|
|
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  }</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>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (active == 1) {</div>
|
|
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  candidate->SetMin(new_min);</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>  }</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>  std::vector<IntVar*> <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div>
|
|
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  IntVar* <span class="keyword">const</span> <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>;</div>
|
|
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  Rev<int64_t> computed_min_;</div>
|
|
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  Rev<int64_t> computed_max_;</div>
|
|
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span> };</div>
|
|
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  </div>
|
|
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span> <span class="comment">// Boolean And and Ors</span></div>
|
|
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  </div>
|
|
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span> <span class="keyword">class </span>ArrayBoolAndEq : <span class="keyword">public</span> CastConstraint {</div>
|
|
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  ArrayBoolAndEq(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  IntVar* <span class="keyword">const</span> target)</div>
|
|
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  : CastConstraint(s, target),</div>
|
|
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div>
|
|
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  demons_(vars.size()),</div>
|
|
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  unbounded_(0) {}</div>
|
|
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  </div>
|
|
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  ~ArrayBoolAndEq()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  </div>
|
|
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Bound()) {</div>
|
|
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  demons_[i] =</div>
|
|
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(solver(), <span class="keyword">this</span>, &ArrayBoolAndEq::PropagateVar,</div>
|
|
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  <span class="stringliteral">"PropagateVar"</span>, <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]);</div>
|
|
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenBound(demons_[i]);</div>
|
|
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  }</div>
|
|
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  }</div>
|
|
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  <span class="keywordflow">if</span> (!<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Bound()) {</div>
|
|
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  Demon* <span class="keyword">const</span> target_demon = <a class="code" href="namespaceoperations__research.html#a3ea6af6581e6922832918c97753146a7">MakeConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  solver(), <span class="keyword">this</span>, &ArrayBoolAndEq::PropagateTarget, <span class="stringliteral">"PropagateTarget"</span>);</div>
|
|
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->WhenBound(target_demon);</div>
|
|
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  }</div>
|
|
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  }</div>
|
|
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  </div>
|
|
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(0, 1);</div>
|
|
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min() == 1) {</div>
|
|
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetMin(1);</div>
|
|
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  }</div>
|
|
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  <span class="keywordtype">int</span> possible_zero = -1;</div>
|
|
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  <span class="keywordtype">int</span> ones = 0;</div>
|
|
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  <span class="keywordtype">int</span> unbounded = 0;</div>
|
|
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Bound()) {</div>
|
|
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  unbounded++;</div>
|
|
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  possible_zero = i;</div>
|
|
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max() == 0) {</div>
|
|
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  InhibitAll();</div>
|
|
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetMax(0);</div>
|
|
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(1, <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min());</div>
|
|
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  ones++;</div>
|
|
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  }</div>
|
|
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  }</div>
|
|
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  <span class="keywordflow">if</span> (unbounded == 0) {</div>
|
|
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetMin(1);</div>
|
|
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max() == 0 && unbounded == 1) {</div>
|
|
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(-1, possible_zero);</div>
|
|
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[possible_zero]->SetMax(0);</div>
|
|
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  unbounded_.<a class="code" href="classoperations__research_1_1_rev.html#a95da6a138a3b56de0cf0c3c4ba7c4688">SetValue</a>(solver(), unbounded);</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>  }</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"> 1274</span>  <span class="keywordtype">void</span> PropagateVar(IntVar* <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min() == 1) {</div>
|
|
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  unbounded_.<a class="code" href="classoperations__research_1_1_numerical_rev.html#a83c8a2812799fd87becd114374fb1d36">Decr</a>(solver());</div>
|
|
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  <span class="keywordflow">if</span> (unbounded_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>() == 0 && !decided_.Switched()) {</div>
|
|
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetMin(1);</div>
|
|
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  decided_.Switch(solver());</div>
|
|
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max() == 0 && unbounded_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>() == 1 &&</div>
|
|
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  !decided_.Switched()) {</div>
|
|
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  ForceToZero();</div>
|
|
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  }</div>
|
|
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  InhibitAll();</div>
|
|
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetMax(0);</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>  }</div>
|
|
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  </div>
|
|
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <span class="keywordtype">void</span> PropagateTarget() {</div>
|
|
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min() == 1) {</div>
|
|
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetMin(1);</div>
|
|
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  }</div>
|
|
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  <span class="keywordflow">if</span> (unbounded_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>() == 1 && !decided_.Switched()) {</div>
|
|
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  ForceToZero();</div>
|
|
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  }</div>
|
|
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  }</div>
|
|
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  }</div>
|
|
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  </div>
|
|
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"And(%s) == %s"</span>, <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, <span class="stringliteral">", "</span>),</div>
|
|
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->DebugString());</div>
|
|
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  }</div>
|
|
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  </div>
|
|
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</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="l01308"></a><span class="lineno"> 1308</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#adeea8c62c6003b04a723e309ffc792ca">ModelVisitor::kMinEqual</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div>
|
|
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div>
|
|
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  visitor->VisitIntegerExpressionArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a489f38dd601db8d045efae4d9ae7d754">ModelVisitor::kTargetArgument</a>,</div>
|
|
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>);</div>
|
|
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#adeea8c62c6003b04a723e309ffc792ca">ModelVisitor::kMinEqual</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  }</div>
|
|
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  </div>
|
|
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  <span class="keywordtype">void</span> InhibitAll() {</div>
|
|
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < demons_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  <span class="keywordflow">if</span> (demons_[i] != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  demons_[i]->inhibit(solver());</div>
|
|
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  }</div>
|
|
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  }</div>
|
|
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  }</div>
|
|
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  </div>
|
|
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  <span class="keywordtype">void</span> ForceToZero() {</div>
|
|
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min() == 0) {</div>
|
|
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetValue(0);</div>
|
|
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  decided_.Switch(solver());</div>
|
|
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  }</div>
|
|
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  }</div>
|
|
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  }</div>
|
|
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  </div>
|
|
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  <span class="keyword">const</span> std::vector<IntVar*> <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div>
|
|
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  std::vector<Demon*> demons_;</div>
|
|
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  NumericalRev<int> unbounded_;</div>
|
|
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  RevSwitch decided_;</div>
|
|
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span> };</div>
|
|
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  </div>
|
|
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span> <span class="keyword">class </span>ArrayBoolOrEq : <span class="keyword">public</span> CastConstraint {</div>
|
|
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  ArrayBoolOrEq(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  IntVar* <span class="keyword">const</span> target)</div>
|
|
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  : CastConstraint(s, target),</div>
|
|
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div>
|
|
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  demons_(vars.size()),</div>
|
|
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  unbounded_(0) {}</div>
|
|
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  </div>
|
|
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  ~ArrayBoolOrEq()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  </div>
|
|
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Bound()) {</div>
|
|
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  demons_[i] =</div>
|
|
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(solver(), <span class="keyword">this</span>, &ArrayBoolOrEq::PropagateVar,</div>
|
|
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  <span class="stringliteral">"PropagateVar"</span>, <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]);</div>
|
|
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenBound(demons_[i]);</div>
|
|
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  }</div>
|
|
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  }</div>
|
|
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  <span class="keywordflow">if</span> (!<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Bound()) {</div>
|
|
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  Demon* <span class="keyword">const</span> target_demon = <a class="code" href="namespaceoperations__research.html#a3ea6af6581e6922832918c97753146a7">MakeConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  solver(), <span class="keyword">this</span>, &ArrayBoolOrEq::PropagateTarget, <span class="stringliteral">"PropagateTarget"</span>);</div>
|
|
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->WhenBound(target_demon);</div>
|
|
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  }</div>
|
|
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  }</div>
|
|
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  </div>
|
|
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(0, 1);</div>
|
|
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max() == 0) {</div>
|
|
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetMax(0);</div>
|
|
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  }</div>
|
|
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  <span class="keywordtype">int</span> zeros = 0;</div>
|
|
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  <span class="keywordtype">int</span> possible_one = -1;</div>
|
|
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  <span class="keywordtype">int</span> unbounded = 0;</div>
|
|
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Bound()) {</div>
|
|
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  unbounded++;</div>
|
|
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  possible_one = i;</div>
|
|
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min() == 1) {</div>
|
|
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  InhibitAll();</div>
|
|
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetMin(1);</div>
|
|
<div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max());</div>
|
|
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  zeros++;</div>
|
|
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  }</div>
|
|
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  }</div>
|
|
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  <span class="keywordflow">if</span> (unbounded == 0) {</div>
|
|
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetMax(0);</div>
|
|
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min() == 1 && unbounded == 1) {</div>
|
|
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(-1, possible_one);</div>
|
|
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[possible_one]->SetMin(1);</div>
|
|
<div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  unbounded_.<a class="code" href="classoperations__research_1_1_rev.html#a95da6a138a3b56de0cf0c3c4ba7c4688">SetValue</a>(solver(), unbounded);</div>
|
|
<div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  }</div>
|
|
<div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  }</div>
|
|
<div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  }</div>
|
|
<div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  </div>
|
|
<div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  <span class="keywordtype">void</span> PropagateVar(IntVar* <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min() == 0) {</div>
|
|
<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  unbounded_.<a class="code" href="classoperations__research_1_1_numerical_rev.html#a83c8a2812799fd87becd114374fb1d36">Decr</a>(solver());</div>
|
|
<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  <span class="keywordflow">if</span> (unbounded_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>() == 0 && !decided_.Switched()) {</div>
|
|
<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetMax(0);</div>
|
|
<div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  decided_.Switch(solver());</div>
|
|
<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  }</div>
|
|
<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min() == 1 && unbounded_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>() == 1 &&</div>
|
|
<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  !decided_.Switched()) {</div>
|
|
<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  ForceToOne();</div>
|
|
<div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  }</div>
|
|
<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  InhibitAll();</div>
|
|
<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetMin(1);</div>
|
|
<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  }</div>
|
|
<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  }</div>
|
|
<div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  </div>
|
|
<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  <span class="keywordtype">void</span> PropagateTarget() {</div>
|
|
<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max() == 0) {</div>
|
|
<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetMax(0);</div>
|
|
<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  }</div>
|
|
<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  <span class="keywordflow">if</span> (unbounded_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>() == 1 && !decided_.Switched()) {</div>
|
|
<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  ForceToOne();</div>
|
|
<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  }</div>
|
|
<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  }</div>
|
|
<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  }</div>
|
|
<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  </div>
|
|
<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"Or(%s) == %s"</span>, <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, <span class="stringliteral">", "</span>),</div>
|
|
<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->DebugString());</div>
|
|
<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  }</div>
|
|
<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  </div>
|
|
<div class="line"><a name="l01437"></a><span class="lineno"> 1437</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="l01438"></a><span class="lineno"> 1438</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a9b6934d34d2fdafca6a9c43f6087dc5c">ModelVisitor::kMaxEqual</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div>
|
|
<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div>
|
|
<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  visitor->VisitIntegerExpressionArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a489f38dd601db8d045efae4d9ae7d754">ModelVisitor::kTargetArgument</a>,</div>
|
|
<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>);</div>
|
|
<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a9b6934d34d2fdafca6a9c43f6087dc5c">ModelVisitor::kMaxEqual</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>  }</div>
|
|
<div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  </div>
|
|
<div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  <span class="keywordtype">void</span> InhibitAll() {</div>
|
|
<div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < demons_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  <span class="keywordflow">if</span> (demons_[i] != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  demons_[i]->inhibit(solver());</div>
|
|
<div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  }</div>
|
|
<div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  }</div>
|
|
<div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  }</div>
|
|
<div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  </div>
|
|
<div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  <span class="keywordtype">void</span> ForceToOne() {</div>
|
|
<div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max() == 1) {</div>
|
|
<div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetValue(1);</div>
|
|
<div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  decided_.Switch(solver());</div>
|
|
<div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  }</div>
|
|
<div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  }</div>
|
|
<div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  }</div>
|
|
<div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  </div>
|
|
<div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  <span class="keyword">const</span> std::vector<IntVar*> <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div>
|
|
<div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  std::vector<Demon*> demons_;</div>
|
|
<div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  NumericalRev<int> unbounded_;</div>
|
|
<div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  RevSwitch decided_;</div>
|
|
<div class="line"><a name="l01470"></a><span class="lineno"> 1470</span> };</div>
|
|
<div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  </div>
|
|
<div class="line"><a name="l01472"></a><span class="lineno"> 1472</span> <span class="comment">// ---------- Specialized cases ----------</span></div>
|
|
<div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  </div>
|
|
<div class="line"><a name="l01474"></a><span class="lineno"> 1474</span> <span class="keyword">class </span>BaseSumBooleanConstraint : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  BaseSumBooleanConstraint(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars)</div>
|
|
<div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  : Constraint(s), <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars) {}</div>
|
|
<div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  </div>
|
|
<div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  ~BaseSumBooleanConstraint()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  </div>
|
|
<div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  <span class="keyword">protected</span>:</div>
|
|
<div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  std::string DebugStringInternal(<span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"%s(%s)"</span>, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>, <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, <span class="stringliteral">", "</span>));</div>
|
|
<div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  }</div>
|
|
<div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  </div>
|
|
<div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  <span class="keyword">const</span> std::vector<IntVar*> <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div>
|
|
<div class="line"><a name="l01487"></a><span class="lineno"><a class="line" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161"> 1487</a></span>  RevSwitch <a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>;</div>
|
|
<div class="line"><a name="l01488"></a><span class="lineno"> 1488</span> };</div>
|
|
<div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  </div>
|
|
<div class="line"><a name="l01490"></a><span class="lineno"> 1490</span> <span class="comment">// ----- Sum of Boolean <= 1 -----</span></div>
|
|
<div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  </div>
|
|
<div class="line"><a name="l01492"></a><span class="lineno"> 1492</span> <span class="keyword">class </span>SumBooleanLessOrEqualToOne : <span class="keyword">public</span> BaseSumBooleanConstraint {</div>
|
|
<div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  SumBooleanLessOrEqualToOne(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars)</div>
|
|
<div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  : BaseSumBooleanConstraint(s, vars) {}</div>
|
|
<div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  </div>
|
|
<div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  ~SumBooleanLessOrEqualToOne()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  </div>
|
|
<div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Bound()) {</div>
|
|
<div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  Demon* u = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(solver(), <span class="keyword">this</span>,</div>
|
|
<div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  &SumBooleanLessOrEqualToOne::Update,</div>
|
|
<div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  <span class="stringliteral">"Update"</span>, <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]);</div>
|
|
<div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenBound(u);</div>
|
|
<div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  }</div>
|
|
<div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  }</div>
|
|
<div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  }</div>
|
|
<div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  </div>
|
|
<div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min() == 1) {</div>
|
|
<div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  PushAllToZeroExcept(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]);</div>
|
|
<div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  }</div>
|
|
<div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  }</div>
|
|
<div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  }</div>
|
|
<div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  </div>
|
|
<div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  <span class="keywordtype">void</span> Update(IntVar* <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>.Switched()) {</div>
|
|
<div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Bound());</div>
|
|
<div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min() == 1) {</div>
|
|
<div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  PushAllToZeroExcept(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  }</div>
|
|
<div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  }</div>
|
|
<div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  }</div>
|
|
<div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  </div>
|
|
<div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  <span class="keywordtype">void</span> PushAllToZeroExcept(IntVar* <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  <a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>.Switch(solver());</div>
|
|
<div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  IntVar* <span class="keyword">const</span> other = <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i];</div>
|
|
<div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  <span class="keywordflow">if</span> (other != <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> && other->Max() != 0) {</div>
|
|
<div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  other->SetMax(0);</div>
|
|
<div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  }</div>
|
|
<div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  }</div>
|
|
<div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  }</div>
|
|
<div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  </div>
|
|
<div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  <span class="keywordflow">return</span> DebugStringInternal(<span class="stringliteral">"SumBooleanLessOrEqualToOne"</span>);</div>
|
|
<div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  }</div>
|
|
<div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  </div>
|
|
<div class="line"><a name="l01542"></a><span class="lineno"> 1542</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="l01543"></a><span class="lineno"> 1543</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a9bafcebba3b66bac587ce7060c7ae0c6">ModelVisitor::kSumLessOrEqual</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div>
|
|
<div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div>
|
|
<div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  visitor->VisitIntegerArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a7899dfe8b41c6b2b13546d921114f8d2">ModelVisitor::kValueArgument</a>, 1);</div>
|
|
<div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a9bafcebba3b66bac587ce7060c7ae0c6">ModelVisitor::kSumLessOrEqual</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  }</div>
|
|
<div class="line"><a name="l01549"></a><span class="lineno"> 1549</span> };</div>
|
|
<div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  </div>
|
|
<div class="line"><a name="l01551"></a><span class="lineno"> 1551</span> <span class="comment">// ----- Sum of Boolean >= 1 -----</span></div>
|
|
<div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  </div>
|
|
<div class="line"><a name="l01553"></a><span class="lineno"> 1553</span> <span class="comment">// We implement this one as a Max(array) == 1.</span></div>
|
|
<div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  </div>
|
|
<div class="line"><a name="l01555"></a><span class="lineno"> 1555</span> <span class="keyword">class </span>SumBooleanGreaterOrEqualToOne : <span class="keyword">public</span> BaseSumBooleanConstraint {</div>
|
|
<div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  SumBooleanGreaterOrEqualToOne(Solver* <span class="keyword">const</span> s,</div>
|
|
<div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  <span class="keyword">const</span> std::vector<IntVar*>& vars);</div>
|
|
<div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  ~SumBooleanGreaterOrEqualToOne()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  </div>
|
|
<div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  <span class="keywordtype">void</span> Post() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  <span class="keywordtype">void</span> InitialPropagate() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  </div>
|
|
<div class="line"><a name="l01564"></a><span class="lineno"> 1564</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="l01565"></a><span class="lineno"> 1565</span>  <span class="keywordtype">void</span> UpdateVar();</div>
|
|
<div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  </div>
|
|
<div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  std::string DebugString() <span class="keyword">const override</span>;</div>
|
|
<div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  </div>
|
|
<div class="line"><a name="l01569"></a><span class="lineno"> 1569</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="l01570"></a><span class="lineno"> 1570</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#ae2d9a127eb9ef5891d0cf5e480574fec">ModelVisitor::kSumGreaterOrEqual</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div>
|
|
<div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div>
|
|
<div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  visitor->VisitIntegerArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a7899dfe8b41c6b2b13546d921114f8d2">ModelVisitor::kValueArgument</a>, 1);</div>
|
|
<div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#ae2d9a127eb9ef5891d0cf5e480574fec">ModelVisitor::kSumGreaterOrEqual</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  }</div>
|
|
<div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  </div>
|
|
<div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  RevBitSet bits_;</div>
|
|
<div class="line"><a name="l01579"></a><span class="lineno"> 1579</span> };</div>
|
|
<div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  </div>
|
|
<div class="line"><a name="l01581"></a><span class="lineno"> 1581</span> SumBooleanGreaterOrEqualToOne::SumBooleanGreaterOrEqualToOne(</div>
|
|
<div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars)</div>
|
|
<div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  : BaseSumBooleanConstraint(s, vars), bits_(vars.size()) {}</div>
|
|
<div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  </div>
|
|
<div class="line"><a name="l01585"></a><span class="lineno"> 1585</span> <span class="keywordtype">void</span> SumBooleanGreaterOrEqualToOne::Post() {</div>
|
|
<div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  Demon* d = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  solver(), <span class="keyword">this</span>, &SumBooleanGreaterOrEqualToOne::Update, <span class="stringliteral">"Update"</span>, i);</div>
|
|
<div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenRange(d);</div>
|
|
<div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  }</div>
|
|
<div class="line"><a name="l01591"></a><span class="lineno"> 1591</span> }</div>
|
|
<div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  </div>
|
|
<div class="line"><a name="l01593"></a><span class="lineno"> 1593</span> <span class="keywordtype">void</span> SumBooleanGreaterOrEqualToOne::InitialPropagate() {</div>
|
|
<div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i];</div>
|
|
<div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min() == 1LL) {</div>
|
|
<div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  <a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>.Switch(solver());</div>
|
|
<div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  }</div>
|
|
<div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max() == 1LL) {</div>
|
|
<div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  bits_.SetToOne(solver(), i);</div>
|
|
<div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>  }</div>
|
|
<div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  }</div>
|
|
<div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  <span class="keywordflow">if</span> (bits_.IsCardinalityZero()) {</div>
|
|
<div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (bits_.IsCardinalityOne()) {</div>
|
|
<div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[bits_.GetFirstBit(0)]->SetValue(int64_t{1});</div>
|
|
<div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  <a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>.Switch(solver());</div>
|
|
<div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  }</div>
|
|
<div class="line"><a name="l01610"></a><span class="lineno"> 1610</span> }</div>
|
|
<div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  </div>
|
|
<div class="line"><a name="l01612"></a><span class="lineno"> 1612</span> <span class="keywordtype">void</span> SumBooleanGreaterOrEqualToOne::Update(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>.Switched()) {</div>
|
|
<div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min() == 1LL) { <span class="comment">// Bound to 1.</span></div>
|
|
<div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  <a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>.Switch(solver());</div>
|
|
<div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  bits_.SetToZero(solver(), <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  <span class="keywordflow">if</span> (bits_.IsCardinalityZero()) {</div>
|
|
<div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (bits_.IsCardinalityOne()) {</div>
|
|
<div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[bits_.GetFirstBit(0)]->SetValue(int64_t{1});</div>
|
|
<div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  <a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>.Switch(solver());</div>
|
|
<div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  }</div>
|
|
<div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>  }</div>
|
|
<div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  }</div>
|
|
<div class="line"><a name="l01626"></a><span class="lineno"> 1626</span> }</div>
|
|
<div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  </div>
|
|
<div class="line"><a name="l01628"></a><span class="lineno"> 1628</span> std::string SumBooleanGreaterOrEqualToOne::DebugString()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  <span class="keywordflow">return</span> DebugStringInternal(<span class="stringliteral">"SumBooleanGreaterOrEqualToOne"</span>);</div>
|
|
<div class="line"><a name="l01630"></a><span class="lineno"> 1630</span> }</div>
|
|
<div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>  </div>
|
|
<div class="line"><a name="l01632"></a><span class="lineno"> 1632</span> <span class="comment">// ----- Sum of Boolean == 1 -----</span></div>
|
|
<div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  </div>
|
|
<div class="line"><a name="l01634"></a><span class="lineno"> 1634</span> <span class="keyword">class </span>SumBooleanEqualToOne : <span class="keyword">public</span> BaseSumBooleanConstraint {</div>
|
|
<div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  SumBooleanEqualToOne(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars)</div>
|
|
<div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  : BaseSumBooleanConstraint(s, vars), active_vars_(0) {}</div>
|
|
<div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  </div>
|
|
<div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  ~SumBooleanEqualToOne()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  </div>
|
|
<div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>  Demon* u = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  solver(), <span class="keyword">this</span>, &SumBooleanEqualToOne::Update, <span class="stringliteral">"Update"</span>, i);</div>
|
|
<div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenBound(u);</div>
|
|
<div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>  }</div>
|
|
<div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  }</div>
|
|
<div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  </div>
|
|
<div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  <span class="keywordtype">int</span> min1 = 0;</div>
|
|
<div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  <span class="keywordtype">int</span> max1 = 0;</div>
|
|
<div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>  <span class="keywordtype">int</span> index_min = -1;</div>
|
|
<div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>  <span class="keywordtype">int</span> index_max = -1;</div>
|
|
<div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>  <span class="keyword">const</span> IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i];</div>
|
|
<div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min() == 1) {</div>
|
|
<div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>  min1++;</div>
|
|
<div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  index_min = i;</div>
|
|
<div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>  }</div>
|
|
<div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max() == 1) {</div>
|
|
<div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>  max1++;</div>
|
|
<div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  index_max = i;</div>
|
|
<div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>  }</div>
|
|
<div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  }</div>
|
|
<div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>  <span class="keywordflow">if</span> (min1 > 1 || max1 == 0) {</div>
|
|
<div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (min1 == 1) {</div>
|
|
<div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(-1, index_min);</div>
|
|
<div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>  PushAllToZeroExcept(index_min);</div>
|
|
<div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (max1 == 1) {</div>
|
|
<div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(-1, index_max);</div>
|
|
<div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[index_max]->SetValue(1);</div>
|
|
<div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  <a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>.Switch(solver());</div>
|
|
<div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>  active_vars_.<a class="code" href="classoperations__research_1_1_rev.html#a95da6a138a3b56de0cf0c3c4ba7c4688">SetValue</a>(solver(), max1);</div>
|
|
<div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  }</div>
|
|
<div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>  }</div>
|
|
<div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>  </div>
|
|
<div class="line"><a name="l01679"></a><span class="lineno"> 1679</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="l01680"></a><span class="lineno"> 1680</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>.Switched()) {</div>
|
|
<div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound());</div>
|
|
<div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min(); <span class="comment">// Faster than Value().</span></div>
|
|
<div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == 0) {</div>
|
|
<div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>  active_vars_.<a class="code" href="classoperations__research_1_1_numerical_rev.html#a83c8a2812799fd87becd114374fb1d36">Decr</a>(solver());</div>
|
|
<div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(active_vars_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>(), 0);</div>
|
|
<div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  <span class="keywordflow">if</span> (active_vars_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>() == 0) {</div>
|
|
<div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (active_vars_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>() == 1) {</div>
|
|
<div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  <span class="keywordtype">bool</span> found = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i];</div>
|
|
<div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max() == 1) {</div>
|
|
<div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetValue(1);</div>
|
|
<div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>  PushAllToZeroExcept(i);</div>
|
|
<div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>  found = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  }</div>
|
|
<div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>  }</div>
|
|
<div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>  <span class="keywordflow">if</span> (!found) {</div>
|
|
<div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>  }</div>
|
|
<div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>  }</div>
|
|
<div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  PushAllToZeroExcept(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>  }</div>
|
|
<div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>  }</div>
|
|
<div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  }</div>
|
|
<div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>  </div>
|
|
<div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>  <span class="keywordtype">void</span> PushAllToZeroExcept(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>  <a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>.Switch(solver());</div>
|
|
<div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01712"></a><span class="lineno"> 1712</span>  <span class="keywordflow">if</span> (i != <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> && <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max() != 0) {</div>
|
|
<div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetMax(0);</div>
|
|
<div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  }</div>
|
|
<div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  }</div>
|
|
<div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  }</div>
|
|
<div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>  </div>
|
|
<div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  <span class="keywordflow">return</span> DebugStringInternal(<span class="stringliteral">"SumBooleanEqualToOne"</span>);</div>
|
|
<div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>  }</div>
|
|
<div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  </div>
|
|
<div class="line"><a name="l01722"></a><span class="lineno"> 1722</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="l01723"></a><span class="lineno"> 1723</span>  visitor->BeginVisitConstraint(ModelVisitor::kSumEqual, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kVarsArgument,</div>
|
|
<div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div>
|
|
<div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  visitor->VisitIntegerArgument(ModelVisitor::kValueArgument, 1);</div>
|
|
<div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>  visitor->EndVisitConstraint(ModelVisitor::kSumEqual, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>  }</div>
|
|
<div class="line"><a name="l01729"></a><span class="lineno"> 1729</span>  </div>
|
|
<div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  NumericalRev<int> active_vars_;</div>
|
|
<div class="line"><a name="l01732"></a><span class="lineno"> 1732</span> };</div>
|
|
<div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>  </div>
|
|
<div class="line"><a name="l01734"></a><span class="lineno"> 1734</span> <span class="comment">// ----- Sum of Boolean Equal To Var -----</span></div>
|
|
<div class="line"><a name="l01735"></a><span class="lineno"> 1735</span>  </div>
|
|
<div class="line"><a name="l01736"></a><span class="lineno"> 1736</span> <span class="keyword">class </span>SumBooleanEqualToVar : <span class="keyword">public</span> BaseSumBooleanConstraint {</div>
|
|
<div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  SumBooleanEqualToVar(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& bool_vars,</div>
|
|
<div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>  IntVar* <span class="keyword">const</span> sum_var)</div>
|
|
<div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>  : BaseSumBooleanConstraint(s, bool_vars),</div>
|
|
<div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>  num_possible_true_vars_(0),</div>
|
|
<div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>  num_always_true_vars_(0),</div>
|
|
<div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  sum_var_(sum_var) {}</div>
|
|
<div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  </div>
|
|
<div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>  ~SumBooleanEqualToVar()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  </div>
|
|
<div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>  Demon* <span class="keyword">const</span> u = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  solver(), <span class="keyword">this</span>, &SumBooleanEqualToVar::Update, <span class="stringliteral">"Update"</span>, i);</div>
|
|
<div class="line"><a name="l01751"></a><span class="lineno"> 1751</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenBound(u);</div>
|
|
<div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  }</div>
|
|
<div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>  <span class="keywordflow">if</span> (!sum_var_->Bound()) {</div>
|
|
<div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>  Demon* <span class="keyword">const</span> u = <a class="code" href="namespaceoperations__research.html#a3ea6af6581e6922832918c97753146a7">MakeConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>  solver(), <span class="keyword">this</span>, &SumBooleanEqualToVar::UpdateVar, <span class="stringliteral">"UpdateVar"</span>);</div>
|
|
<div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>  sum_var_->WhenRange(u);</div>
|
|
<div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>  }</div>
|
|
<div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>  }</div>
|
|
<div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>  </div>
|
|
<div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  <span class="keywordtype">int</span> num_always_true_vars = 0;</div>
|
|
<div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>  <span class="keywordtype">int</span> possible_true = 0;</div>
|
|
<div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  <span class="keyword">const</span> IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i];</div>
|
|
<div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min() == 1) {</div>
|
|
<div class="line"><a name="l01766"></a><span class="lineno"> 1766</span>  num_always_true_vars++;</div>
|
|
<div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>  }</div>
|
|
<div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max() == 1) {</div>
|
|
<div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>  possible_true++;</div>
|
|
<div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  }</div>
|
|
<div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  }</div>
|
|
<div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  sum_var_->SetRange(num_always_true_vars, possible_true);</div>
|
|
<div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>  <span class="keyword">const</span> int64_t var_min = sum_var_->Min();</div>
|
|
<div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>  <span class="keyword">const</span> int64_t var_max = sum_var_->Max();</div>
|
|
<div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  <span class="keywordflow">if</span> (num_always_true_vars == var_max && possible_true > var_max) {</div>
|
|
<div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>  PushAllUnboundToZero();</div>
|
|
<div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (possible_true == var_min && num_always_true_vars < var_min) {</div>
|
|
<div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>  PushAllUnboundToOne();</div>
|
|
<div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  num_possible_true_vars_.<a class="code" href="classoperations__research_1_1_rev.html#a95da6a138a3b56de0cf0c3c4ba7c4688">SetValue</a>(solver(), possible_true);</div>
|
|
<div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>  num_always_true_vars_.<a class="code" href="classoperations__research_1_1_rev.html#a95da6a138a3b56de0cf0c3c4ba7c4688">SetValue</a>(solver(), num_always_true_vars);</div>
|
|
<div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>  }</div>
|
|
<div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  }</div>
|
|
<div class="line"><a name="l01784"></a><span class="lineno"> 1784</span>  </div>
|
|
<div class="line"><a name="l01785"></a><span class="lineno"> 1785</span>  <span class="keywordtype">void</span> UpdateVar() {</div>
|
|
<div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>.Switched()) {</div>
|
|
<div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  <span class="keywordflow">if</span> (num_possible_true_vars_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>() == sum_var_->Min()) {</div>
|
|
<div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  PushAllUnboundToOne();</div>
|
|
<div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>  sum_var_->SetValue(num_possible_true_vars_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>());</div>
|
|
<div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (num_always_true_vars_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>() == sum_var_->Max()) {</div>
|
|
<div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>  PushAllUnboundToZero();</div>
|
|
<div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>  sum_var_->SetValue(num_always_true_vars_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>());</div>
|
|
<div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>  }</div>
|
|
<div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>  }</div>
|
|
<div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>  }</div>
|
|
<div class="line"><a name="l01796"></a><span class="lineno"> 1796</span>  </div>
|
|
<div class="line"><a name="l01797"></a><span class="lineno"> 1797</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="l01798"></a><span class="lineno"> 1798</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>.Switched()) {</div>
|
|
<div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound());</div>
|
|
<div class="line"><a name="l01800"></a><span class="lineno"> 1800</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min(); <span class="comment">// Faster than Value().</span></div>
|
|
<div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == 0) {</div>
|
|
<div class="line"><a name="l01802"></a><span class="lineno"> 1802</span>  num_possible_true_vars_.<a class="code" href="classoperations__research_1_1_numerical_rev.html#a83c8a2812799fd87becd114374fb1d36">Decr</a>(solver());</div>
|
|
<div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>  sum_var_->SetRange(num_always_true_vars_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>(),</div>
|
|
<div class="line"><a name="l01804"></a><span class="lineno"> 1804</span>  num_possible_true_vars_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>());</div>
|
|
<div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>  <span class="keywordflow">if</span> (num_possible_true_vars_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>() == sum_var_->Min()) {</div>
|
|
<div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>  PushAllUnboundToOne();</div>
|
|
<div class="line"><a name="l01807"></a><span class="lineno"> 1807</span>  }</div>
|
|
<div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(1, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>  num_always_true_vars_.<a class="code" href="classoperations__research_1_1_numerical_rev.html#ac8beef1ef5cd6ce8bdfb3f48016ff72b">Incr</a>(solver());</div>
|
|
<div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>  sum_var_->SetRange(num_always_true_vars_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>(),</div>
|
|
<div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>  num_possible_true_vars_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>());</div>
|
|
<div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>  <span class="keywordflow">if</span> (num_always_true_vars_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>() == sum_var_->Max()) {</div>
|
|
<div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>  PushAllUnboundToZero();</div>
|
|
<div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>  }</div>
|
|
<div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>  }</div>
|
|
<div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>  }</div>
|
|
<div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>  }</div>
|
|
<div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>  </div>
|
|
<div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  <span class="keywordtype">void</span> PushAllUnboundToZero() {</div>
|
|
<div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>  int64_t counter = 0;</div>
|
|
<div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>  <a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>.Switch(solver());</div>
|
|
<div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min() == 0) {</div>
|
|
<div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetValue(0);</div>
|
|
<div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  counter++;</div>
|
|
<div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>  }</div>
|
|
<div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  }</div>
|
|
<div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>  <span class="keywordflow">if</span> (counter < sum_var_->Min() || counter > sum_var_->Max()) {</div>
|
|
<div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  }</div>
|
|
<div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  }</div>
|
|
<div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  </div>
|
|
<div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  <span class="keywordtype">void</span> PushAllUnboundToOne() {</div>
|
|
<div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  int64_t counter = 0;</div>
|
|
<div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>  <a class="code" href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a>.Switch(solver());</div>
|
|
<div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max() == 1) {</div>
|
|
<div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetValue(1);</div>
|
|
<div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  counter++;</div>
|
|
<div class="line"><a name="l01842"></a><span class="lineno"> 1842</span>  }</div>
|
|
<div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  }</div>
|
|
<div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  <span class="keywordflow">if</span> (counter < sum_var_->Min() || counter > sum_var_->Max()) {</div>
|
|
<div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>  }</div>
|
|
<div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>  }</div>
|
|
<div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>  </div>
|
|
<div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"%s == %s"</span>, DebugStringInternal(<span class="stringliteral">"SumBoolean"</span>),</div>
|
|
<div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>  sum_var_->DebugString());</div>
|
|
<div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>  }</div>
|
|
<div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  </div>
|
|
<div class="line"><a name="l01854"></a><span class="lineno"> 1854</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="l01855"></a><span class="lineno"> 1855</span>  visitor->BeginVisitConstraint(ModelVisitor::kSumEqual, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kVarsArgument,</div>
|
|
<div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div>
|
|
<div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  visitor->VisitIntegerExpressionArgument(ModelVisitor::kTargetArgument,</div>
|
|
<div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  sum_var_);</div>
|
|
<div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>  visitor->EndVisitConstraint(ModelVisitor::kSumEqual, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>  }</div>
|
|
<div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>  </div>
|
|
<div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>  NumericalRev<int> num_possible_true_vars_;</div>
|
|
<div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>  NumericalRev<int> num_always_true_vars_;</div>
|
|
<div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>  IntVar* <span class="keyword">const</span> sum_var_;</div>
|
|
<div class="line"><a name="l01867"></a><span class="lineno"> 1867</span> };</div>
|
|
<div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  </div>
|
|
<div class="line"><a name="l01869"></a><span class="lineno"> 1869</span> <span class="comment">// ---------- ScalProd ----------</span></div>
|
|
<div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>  </div>
|
|
<div class="line"><a name="l01871"></a><span class="lineno"> 1871</span> <span class="comment">// ----- Boolean Scal Prod -----</span></div>
|
|
<div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  </div>
|
|
<div class="line"><a name="l01873"></a><span class="lineno"> 1873</span> <span class="keyword">struct </span>Container {</div>
|
|
<div class="line"><a name="l01874"></a><span class="lineno"><a class="line" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465"> 1874</a></span>  IntVar* <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>;</div>
|
|
<div class="line"><a name="l01875"></a><span class="lineno"><a class="line" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31"> 1875</a></span>  int64_t <a class="code" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a>;</div>
|
|
<div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  Container(IntVar* v, int64_t c) : <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(v), <a class="code" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a>(c) {}</div>
|
|
<div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>  <span class="keywordtype">bool</span> operator<(<span class="keyword">const</span> Container& c)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (<a class="code" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a> < c.coef); }</div>
|
|
<div class="line"><a name="l01878"></a><span class="lineno"> 1878</span> };</div>
|
|
<div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>  </div>
|
|
<div class="line"><a name="l01880"></a><span class="lineno"> 1880</span> <span class="comment">// This method will sort both vars and coefficients in increasing</span></div>
|
|
<div class="line"><a name="l01881"></a><span class="lineno"> 1881</span> <span class="comment">// coefficient order. Vars with null coefficients will be</span></div>
|
|
<div class="line"><a name="l01882"></a><span class="lineno"> 1882</span> <span class="comment">// removed. Bound vars will be collected and the sum of the</span></div>
|
|
<div class="line"><a name="l01883"></a><span class="lineno"> 1883</span> <span class="comment">// corresponding products (when the var is bound to 1) is returned by</span></div>
|
|
<div class="line"><a name="l01884"></a><span class="lineno"> 1884</span> <span class="comment">// this method.</span></div>
|
|
<div class="line"><a name="l01885"></a><span class="lineno"> 1885</span> <span class="comment">// If keep_inside is true, the constant will be added back into the</span></div>
|
|
<div class="line"><a name="l01886"></a><span class="lineno"> 1886</span> <span class="comment">// scalprod as IntConst(1) * constant.</span></div>
|
|
<div class="line"><a name="l01887"></a><span class="lineno"> 1887</span> int64_t SortBothChangeConstant(std::vector<IntVar*>* <span class="keyword">const</span> vars,</div>
|
|
<div class="line"><a name="l01888"></a><span class="lineno"> 1888</span>  std::vector<int64_t>* <span class="keyword">const</span> coefs,</div>
|
|
<div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>  <span class="keywordtype">bool</span> keep_inside) {</div>
|
|
<div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(vars != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l01891"></a><span class="lineno"> 1891</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(coefs != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>  <span class="keywordflow">if</span> (vars->empty()) {</div>
|
|
<div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l01894"></a><span class="lineno"> 1894</span>  }</div>
|
|
<div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>  int64_t cst = 0;</div>
|
|
<div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>  std::vector<Container> to_sort;</div>
|
|
<div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < vars->size(); ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l01898"></a><span class="lineno"> 1898</span>  <span class="keywordflow">if</span> ((*vars)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound()) {</div>
|
|
<div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>  cst = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(cst, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>((*coefs)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>], (*vars)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min()));</div>
|
|
<div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*coefs)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] != 0) {</div>
|
|
<div class="line"><a name="l01901"></a><span class="lineno"> 1901</span>  to_sort.push_back(Container((*vars)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>], (*coefs)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]));</div>
|
|
<div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>  }</div>
|
|
<div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>  }</div>
|
|
<div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>  <span class="keywordflow">if</span> (keep_inside && cst != 0) {</div>
|
|
<div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(to_sort.size(), vars->size());</div>
|
|
<div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>  Solver* <span class="keyword">const</span> solver = (*vars)[0]->solver();</div>
|
|
<div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>  to_sort.push_back(Container(solver->MakeIntConst(1), cst));</div>
|
|
<div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>  cst = 0;</div>
|
|
<div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>  }</div>
|
|
<div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>  std::sort(to_sort.begin(), to_sort.end());</div>
|
|
<div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < to_sort.size(); ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>  (*vars)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = to_sort[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].var;</div>
|
|
<div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>  (*coefs)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = to_sort[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].coef;</div>
|
|
<div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>  }</div>
|
|
<div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>  vars->resize(to_sort.size());</div>
|
|
<div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>  coefs->resize(to_sort.size());</div>
|
|
<div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  <span class="keywordflow">return</span> cst;</div>
|
|
<div class="line"><a name="l01918"></a><span class="lineno"> 1918</span> }</div>
|
|
<div class="line"><a name="l01919"></a><span class="lineno"> 1919</span>  </div>
|
|
<div class="line"><a name="l01920"></a><span class="lineno"> 1920</span> <span class="comment">// This constraint implements sum(vars) == var. It is delayed such</span></div>
|
|
<div class="line"><a name="l01921"></a><span class="lineno"> 1921</span> <span class="comment">// that propagation only occurs when all variables have been touched.</span></div>
|
|
<div class="line"><a name="l01922"></a><span class="lineno"> 1922</span> <span class="keyword">class </span>BooleanScalProdLessConstant : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>  BooleanScalProdLessConstant(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l01925"></a><span class="lineno"> 1925</span>  <span class="keyword">const</span> std::vector<int64_t>& coefs,</div>
|
|
<div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>  int64_t <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>)</div>
|
|
<div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>  : Constraint(s),</div>
|
|
<div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div>
|
|
<div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>  coefs_(coefs),</div>
|
|
<div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>  upper_bound_(<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>),</div>
|
|
<div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>  first_unbound_backward_(vars.size() - 1),</div>
|
|
<div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  sum_of_bound_variables_(0LL),</div>
|
|
<div class="line"><a name="l01933"></a><span class="lineno"> 1933</span>  max_coefficient_(0) {</div>
|
|
<div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!vars.empty());</div>
|
|
<div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(coefs_[i], 0);</div>
|
|
<div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>  }</div>
|
|
<div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>  upper_bound_ =</div>
|
|
<div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, SortBothChangeConstant(&<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, &coefs_, <span class="keyword">false</span>));</div>
|
|
<div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>  max_coefficient_.SetValue(s, coefs_[<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size() - 1]);</div>
|
|
<div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>  }</div>
|
|
<div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>  </div>
|
|
<div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>  ~BooleanScalProdLessConstant()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>  </div>
|
|
<div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++var_index) {</div>
|
|
<div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[var_index]->Bound()) {</div>
|
|
<div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>  }</div>
|
|
<div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>  Demon* d = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(solver(), <span class="keyword">this</span>,</div>
|
|
<div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>  &BooleanScalProdLessConstant::Update,</div>
|
|
<div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>  <span class="stringliteral">"InitialPropagate"</span>, var_index);</div>
|
|
<div class="line"><a name="l01953"></a><span class="lineno"> 1953</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[var_index]->WhenRange(d);</div>
|
|
<div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>  }</div>
|
|
<div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>  }</div>
|
|
<div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>  </div>
|
|
<div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>  <span class="keywordtype">void</span> PushFromTop() {</div>
|
|
<div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>  <span class="keyword">const</span> int64_t slack = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(upper_bound_, sum_of_bound_variables_.Value());</div>
|
|
<div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>  <span class="keywordflow">if</span> (slack < 0) {</div>
|
|
<div class="line"><a name="l01960"></a><span class="lineno"> 1960</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>  }</div>
|
|
<div class="line"><a name="l01962"></a><span class="lineno"> 1962</span>  <span class="keywordflow">if</span> (slack < max_coefficient_.Value()) {</div>
|
|
<div class="line"><a name="l01963"></a><span class="lineno"> 1963</span>  int64_t last_unbound = first_unbound_backward_.Value();</div>
|
|
<div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>  <span class="keywordflow">for</span> (; last_unbound >= 0; --last_unbound) {</div>
|
|
<div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[last_unbound]->Bound()) {</div>
|
|
<div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  <span class="keywordflow">if</span> (coefs_[last_unbound] <= slack) {</div>
|
|
<div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>  max_coefficient_.SetValue(solver(), coefs_[last_unbound]);</div>
|
|
<div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[last_unbound]->SetValue(0);</div>
|
|
<div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>  }</div>
|
|
<div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>  }</div>
|
|
<div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>  }</div>
|
|
<div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>  first_unbound_backward_.SetValue(solver(), last_unbound);</div>
|
|
<div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>  }</div>
|
|
<div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>  }</div>
|
|
<div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>  </div>
|
|
<div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>  Solver* <span class="keyword">const</span> s = solver();</div>
|
|
<div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>  <span class="keywordtype">int</span> last_unbound = -1;</div>
|
|
<div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>  int64_t sum = 0LL;</div>
|
|
<div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound()) {</div>
|
|
<div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min();</div>
|
|
<div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>  sum = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, coefs_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]));</div>
|
|
<div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>  last_unbound = <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>  }</div>
|
|
<div class="line"><a name="l01989"></a><span class="lineno"> 1989</span>  }</div>
|
|
<div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>  sum_of_bound_variables_.SetValue(s, sum);</div>
|
|
<div class="line"><a name="l01991"></a><span class="lineno"> 1991</span>  first_unbound_backward_.SetValue(s, last_unbound);</div>
|
|
<div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>  PushFromTop();</div>
|
|
<div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>  }</div>
|
|
<div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>  </div>
|
|
<div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>  <span class="keywordtype">void</span> Update(<span class="keywordtype">int</span> var_index) {</div>
|
|
<div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[var_index]->Min() == 1) {</div>
|
|
<div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>  sum_of_bound_variables_.SetValue(</div>
|
|
<div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>  solver(), <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_of_bound_variables_.Value(), coefs_[var_index]));</div>
|
|
<div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>  PushFromTop();</div>
|
|
<div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>  }</div>
|
|
<div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>  }</div>
|
|
<div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>  </div>
|
|
<div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"BooleanScalProd([%s], [%s]) <= %d)"</span>,</div>
|
|
<div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, <span class="stringliteral">", "</span>),</div>
|
|
<div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>  absl::StrJoin(coefs_, <span class="stringliteral">", "</span>), upper_bound_);</div>
|
|
<div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>  }</div>
|
|
<div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>  </div>
|
|
<div class="line"><a name="l02009"></a><span class="lineno"> 2009</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="l02010"></a><span class="lineno"> 2010</span>  visitor->BeginVisitConstraint(ModelVisitor::kScalProdLessOrEqual, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kVarsArgument,</div>
|
|
<div class="line"><a name="l02012"></a><span class="lineno"> 2012</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div>
|
|
<div class="line"><a name="l02013"></a><span class="lineno"> 2013</span>  visitor->VisitIntegerArrayArgument(ModelVisitor::kCoefficientsArgument,</div>
|
|
<div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>  coefs_);</div>
|
|
<div class="line"><a name="l02015"></a><span class="lineno"> 2015</span>  visitor->VisitIntegerArgument(ModelVisitor::kValueArgument, upper_bound_);</div>
|
|
<div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>  visitor->EndVisitConstraint(ModelVisitor::kScalProdLessOrEqual, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02017"></a><span class="lineno"> 2017</span>  }</div>
|
|
<div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>  </div>
|
|
<div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>  std::vector<IntVar*> <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div>
|
|
<div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>  std::vector<int64_t> coefs_;</div>
|
|
<div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>  int64_t upper_bound_;</div>
|
|
<div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>  Rev<int> first_unbound_backward_;</div>
|
|
<div class="line"><a name="l02024"></a><span class="lineno"> 2024</span>  Rev<int64_t> sum_of_bound_variables_;</div>
|
|
<div class="line"><a name="l02025"></a><span class="lineno"> 2025</span>  Rev<int64_t> max_coefficient_;</div>
|
|
<div class="line"><a name="l02026"></a><span class="lineno"> 2026</span> };</div>
|
|
<div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>  </div>
|
|
<div class="line"><a name="l02028"></a><span class="lineno"> 2028</span> <span class="comment">// ----- PositiveBooleanScalProdEqVar -----</span></div>
|
|
<div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  </div>
|
|
<div class="line"><a name="l02030"></a><span class="lineno"> 2030</span> <span class="keyword">class </span>PositiveBooleanScalProdEqVar : <span class="keyword">public</span> CastConstraint {</div>
|
|
<div class="line"><a name="l02031"></a><span class="lineno"> 2031</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>  PositiveBooleanScalProdEqVar(Solver* <span class="keyword">const</span> s,</div>
|
|
<div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>  <span class="keyword">const</span> std::vector<int64_t>& coefs,</div>
|
|
<div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)</div>
|
|
<div class="line"><a name="l02036"></a><span class="lineno"> 2036</span>  : CastConstraint(s, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>),</div>
|
|
<div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div>
|
|
<div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>  coefs_(coefs),</div>
|
|
<div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>  first_unbound_backward_(vars.size() - 1),</div>
|
|
<div class="line"><a name="l02040"></a><span class="lineno"> 2040</span>  sum_of_bound_variables_(0LL),</div>
|
|
<div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>  sum_of_all_variables_(0LL),</div>
|
|
<div class="line"><a name="l02042"></a><span class="lineno"> 2042</span>  max_coefficient_(0) {</div>
|
|
<div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>  SortBothChangeConstant(&<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, &coefs_, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>  max_coefficient_.SetValue(s, coefs_[<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size() - 1]);</div>
|
|
<div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>  }</div>
|
|
<div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>  </div>
|
|
<div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>  ~PositiveBooleanScalProdEqVar()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>  </div>
|
|
<div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++var_index) {</div>
|
|
<div class="line"><a name="l02051"></a><span class="lineno"> 2051</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[var_index]->Bound()) {</div>
|
|
<div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  }</div>
|
|
<div class="line"><a name="l02054"></a><span class="lineno"> 2054</span>  Demon* <span class="keyword">const</span> d = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l02055"></a><span class="lineno"> 2055</span>  solver(), <span class="keyword">this</span>, &PositiveBooleanScalProdEqVar::Update, <span class="stringliteral">"Update"</span>,</div>
|
|
<div class="line"><a name="l02056"></a><span class="lineno"> 2056</span>  var_index);</div>
|
|
<div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[var_index]->WhenRange(d);</div>
|
|
<div class="line"><a name="l02058"></a><span class="lineno"> 2058</span>  }</div>
|
|
<div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>  <span class="keywordflow">if</span> (!<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Bound()) {</div>
|
|
<div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>  Demon* <span class="keyword">const</span> uv = <a class="code" href="namespaceoperations__research.html#a3ea6af6581e6922832918c97753146a7">MakeConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>  solver(), <span class="keyword">this</span>, &PositiveBooleanScalProdEqVar::Propagate,</div>
|
|
<div class="line"><a name="l02062"></a><span class="lineno"> 2062</span>  <span class="stringliteral">"Propagate"</span>);</div>
|
|
<div class="line"><a name="l02063"></a><span class="lineno"> 2063</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->WhenRange(uv);</div>
|
|
<div class="line"><a name="l02064"></a><span class="lineno"> 2064</span>  }</div>
|
|
<div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  }</div>
|
|
<div class="line"><a name="l02066"></a><span class="lineno"> 2066</span>  </div>
|
|
<div class="line"><a name="l02067"></a><span class="lineno"> 2067</span>  <span class="keywordtype">void</span> Propagate() {</div>
|
|
<div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->SetRange(sum_of_bound_variables_.Value(),</div>
|
|
<div class="line"><a name="l02069"></a><span class="lineno"> 2069</span>  sum_of_all_variables_.Value());</div>
|
|
<div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>  <span class="keyword">const</span> int64_t slack_up =</div>
|
|
<div class="line"><a name="l02071"></a><span class="lineno"> 2071</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Max(), sum_of_bound_variables_.Value());</div>
|
|
<div class="line"><a name="l02072"></a><span class="lineno"> 2072</span>  <span class="keyword">const</span> int64_t slack_down =</div>
|
|
<div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(sum_of_all_variables_.Value(), <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->Min());</div>
|
|
<div class="line"><a name="l02074"></a><span class="lineno"> 2074</span>  <span class="keyword">const</span> int64_t max_coeff = max_coefficient_.Value();</div>
|
|
<div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>  <span class="keywordflow">if</span> (slack_down < max_coeff || slack_up < max_coeff) {</div>
|
|
<div class="line"><a name="l02076"></a><span class="lineno"> 2076</span>  int64_t last_unbound = first_unbound_backward_.Value();</div>
|
|
<div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>  <span class="keywordflow">for</span> (; last_unbound >= 0; --last_unbound) {</div>
|
|
<div class="line"><a name="l02078"></a><span class="lineno"> 2078</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[last_unbound]->Bound()) {</div>
|
|
<div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>  <span class="keywordflow">if</span> (coefs_[last_unbound] > slack_up) {</div>
|
|
<div class="line"><a name="l02080"></a><span class="lineno"> 2080</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[last_unbound]->SetValue(0);</div>
|
|
<div class="line"><a name="l02081"></a><span class="lineno"> 2081</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs_[last_unbound] > slack_down) {</div>
|
|
<div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[last_unbound]->SetValue(1);</div>
|
|
<div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02084"></a><span class="lineno"> 2084</span>  max_coefficient_.SetValue(solver(), coefs_[last_unbound]);</div>
|
|
<div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>  }</div>
|
|
<div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>  }</div>
|
|
<div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>  }</div>
|
|
<div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>  first_unbound_backward_.SetValue(solver(), last_unbound);</div>
|
|
<div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>  }</div>
|
|
<div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>  }</div>
|
|
<div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>  </div>
|
|
<div class="line"><a name="l02093"></a><span class="lineno"> 2093</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>  Solver* <span class="keyword">const</span> s = solver();</div>
|
|
<div class="line"><a name="l02095"></a><span class="lineno"> 2095</span>  <span class="keywordtype">int</span> last_unbound = -1;</div>
|
|
<div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>  int64_t sum_bound = 0;</div>
|
|
<div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>  int64_t sum_all = 0;</div>
|
|
<div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l02099"></a><span class="lineno"> 2099</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Max(), coefs_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a name="l02100"></a><span class="lineno"> 2100</span>  sum_all = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_all, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound()) {</div>
|
|
<div class="line"><a name="l02102"></a><span class="lineno"> 2102</span>  sum_bound = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_bound, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l02103"></a><span class="lineno"> 2103</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02104"></a><span class="lineno"> 2104</span>  last_unbound = <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l02105"></a><span class="lineno"> 2105</span>  }</div>
|
|
<div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>  }</div>
|
|
<div class="line"><a name="l02107"></a><span class="lineno"> 2107</span>  sum_of_bound_variables_.SetValue(s, sum_bound);</div>
|
|
<div class="line"><a name="l02108"></a><span class="lineno"> 2108</span>  sum_of_all_variables_.SetValue(s, sum_all);</div>
|
|
<div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>  first_unbound_backward_.SetValue(s, last_unbound);</div>
|
|
<div class="line"><a name="l02110"></a><span class="lineno"> 2110</span>  Propagate();</div>
|
|
<div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>  }</div>
|
|
<div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>  </div>
|
|
<div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>  <span class="keywordtype">void</span> Update(<span class="keywordtype">int</span> var_index) {</div>
|
|
<div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[var_index]->Min() == 1) {</div>
|
|
<div class="line"><a name="l02115"></a><span class="lineno"> 2115</span>  sum_of_bound_variables_.SetValue(</div>
|
|
<div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>  solver(), <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_of_bound_variables_.Value(), coefs_[var_index]));</div>
|
|
<div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02118"></a><span class="lineno"> 2118</span>  sum_of_all_variables_.SetValue(</div>
|
|
<div class="line"><a name="l02119"></a><span class="lineno"> 2119</span>  solver(), <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(sum_of_all_variables_.Value(), coefs_[var_index]));</div>
|
|
<div class="line"><a name="l02120"></a><span class="lineno"> 2120</span>  }</div>
|
|
<div class="line"><a name="l02121"></a><span class="lineno"> 2121</span>  Propagate();</div>
|
|
<div class="line"><a name="l02122"></a><span class="lineno"> 2122</span>  }</div>
|
|
<div class="line"><a name="l02123"></a><span class="lineno"> 2123</span>  </div>
|
|
<div class="line"><a name="l02124"></a><span class="lineno"> 2124</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l02125"></a><span class="lineno"> 2125</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"PositiveBooleanScal([%s], [%s]) == %s"</span>,</div>
|
|
<div class="line"><a name="l02126"></a><span class="lineno"> 2126</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, <span class="stringliteral">", "</span>),</div>
|
|
<div class="line"><a name="l02127"></a><span class="lineno"> 2127</span>  absl::StrJoin(coefs_, <span class="stringliteral">", "</span>),</div>
|
|
<div class="line"><a name="l02128"></a><span class="lineno"> 2128</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>->DebugString());</div>
|
|
<div class="line"><a name="l02129"></a><span class="lineno"> 2129</span>  }</div>
|
|
<div class="line"><a name="l02130"></a><span class="lineno"> 2130</span>  </div>
|
|
<div class="line"><a name="l02131"></a><span class="lineno"> 2131</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="l02132"></a><span class="lineno"> 2132</span>  visitor->BeginVisitConstraint(ModelVisitor::kScalProdEqual, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02133"></a><span class="lineno"> 2133</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kVarsArgument,</div>
|
|
<div class="line"><a name="l02134"></a><span class="lineno"> 2134</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div>
|
|
<div class="line"><a name="l02135"></a><span class="lineno"> 2135</span>  visitor->VisitIntegerArrayArgument(ModelVisitor::kCoefficientsArgument,</div>
|
|
<div class="line"><a name="l02136"></a><span class="lineno"> 2136</span>  coefs_);</div>
|
|
<div class="line"><a name="l02137"></a><span class="lineno"> 2137</span>  visitor->VisitIntegerExpressionArgument(ModelVisitor::kTargetArgument,</div>
|
|
<div class="line"><a name="l02138"></a><span class="lineno"> 2138</span>  <a class="code" href="sched__constraints_8cc.html#a527571de51e3f4b1fc9945f3a374faad">target_var_</a>);</div>
|
|
<div class="line"><a name="l02139"></a><span class="lineno"> 2139</span>  visitor->EndVisitConstraint(ModelVisitor::kScalProdEqual, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02140"></a><span class="lineno"> 2140</span>  }</div>
|
|
<div class="line"><a name="l02141"></a><span class="lineno"> 2141</span>  </div>
|
|
<div class="line"><a name="l02142"></a><span class="lineno"> 2142</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l02143"></a><span class="lineno"> 2143</span>  std::vector<IntVar*> <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div>
|
|
<div class="line"><a name="l02144"></a><span class="lineno"> 2144</span>  std::vector<int64_t> coefs_;</div>
|
|
<div class="line"><a name="l02145"></a><span class="lineno"> 2145</span>  Rev<int> first_unbound_backward_;</div>
|
|
<div class="line"><a name="l02146"></a><span class="lineno"> 2146</span>  Rev<int64_t> sum_of_bound_variables_;</div>
|
|
<div class="line"><a name="l02147"></a><span class="lineno"> 2147</span>  Rev<int64_t> sum_of_all_variables_;</div>
|
|
<div class="line"><a name="l02148"></a><span class="lineno"> 2148</span>  Rev<int64_t> max_coefficient_;</div>
|
|
<div class="line"><a name="l02149"></a><span class="lineno"> 2149</span> };</div>
|
|
<div class="line"><a name="l02150"></a><span class="lineno"> 2150</span>  </div>
|
|
<div class="line"><a name="l02151"></a><span class="lineno"> 2151</span> <span class="comment">// ----- PositiveBooleanScalProd -----</span></div>
|
|
<div class="line"><a name="l02152"></a><span class="lineno"> 2152</span>  </div>
|
|
<div class="line"><a name="l02153"></a><span class="lineno"> 2153</span> <span class="keyword">class </span>PositiveBooleanScalProd : <span class="keyword">public</span> BaseIntExpr {</div>
|
|
<div class="line"><a name="l02154"></a><span class="lineno"> 2154</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l02155"></a><span class="lineno"> 2155</span>  <span class="comment">// this constructor will copy the array. The caller can safely delete the</span></div>
|
|
<div class="line"><a name="l02156"></a><span class="lineno"> 2156</span>  <span class="comment">// exprs array himself</span></div>
|
|
<div class="line"><a name="l02157"></a><span class="lineno"> 2157</span>  PositiveBooleanScalProd(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l02158"></a><span class="lineno"> 2158</span>  <span class="keyword">const</span> std::vector<int64_t>& coefs)</div>
|
|
<div class="line"><a name="l02159"></a><span class="lineno"> 2159</span>  : BaseIntExpr(s), <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars), coefs_(coefs) {</div>
|
|
<div class="line"><a name="l02160"></a><span class="lineno"> 2160</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!vars.empty());</div>
|
|
<div class="line"><a name="l02161"></a><span class="lineno"> 2161</span>  SortBothChangeConstant(&<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, &coefs_, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l02162"></a><span class="lineno"> 2162</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l02163"></a><span class="lineno"> 2163</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(coefs_[i], 0);</div>
|
|
<div class="line"><a name="l02164"></a><span class="lineno"> 2164</span>  }</div>
|
|
<div class="line"><a name="l02165"></a><span class="lineno"> 2165</span>  }</div>
|
|
<div class="line"><a name="l02166"></a><span class="lineno"> 2166</span>  </div>
|
|
<div class="line"><a name="l02167"></a><span class="lineno"> 2167</span>  ~PositiveBooleanScalProd()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l02168"></a><span class="lineno"> 2168</span>  </div>
|
|
<div class="line"><a name="l02169"></a><span class="lineno"> 2169</span>  int64_t Min()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l02170"></a><span class="lineno"> 2170</span>  int64_t <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a> = 0;</div>
|
|
<div class="line"><a name="l02171"></a><span class="lineno"> 2171</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l02172"></a><span class="lineno"> 2172</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min()) {</div>
|
|
<div class="line"><a name="l02173"></a><span class="lineno"> 2173</span>  <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a> = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a>, coefs_[i]);</div>
|
|
<div class="line"><a name="l02174"></a><span class="lineno"> 2174</span>  }</div>
|
|
<div class="line"><a name="l02175"></a><span class="lineno"> 2175</span>  }</div>
|
|
<div class="line"><a name="l02176"></a><span class="lineno"> 2176</span>  <span class="keywordflow">return</span> <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a>;</div>
|
|
<div class="line"><a name="l02177"></a><span class="lineno"> 2177</span>  }</div>
|
|
<div class="line"><a name="l02178"></a><span class="lineno"> 2178</span>  </div>
|
|
<div class="line"><a name="l02179"></a><span class="lineno"> 2179</span>  <span class="keywordtype">void</span> SetMin(int64_t m)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02180"></a><span class="lineno"> 2180</span>  SetRange(m, <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div>
|
|
<div class="line"><a name="l02181"></a><span class="lineno"> 2181</span>  }</div>
|
|
<div class="line"><a name="l02182"></a><span class="lineno"> 2182</span>  </div>
|
|
<div class="line"><a name="l02183"></a><span class="lineno"> 2183</span>  int64_t Max()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l02184"></a><span class="lineno"> 2184</span>  int64_t <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a> = 0;</div>
|
|
<div class="line"><a name="l02185"></a><span class="lineno"> 2185</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l02186"></a><span class="lineno"> 2186</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max()) {</div>
|
|
<div class="line"><a name="l02187"></a><span class="lineno"> 2187</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a> = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a>, coefs_[i]);</div>
|
|
<div class="line"><a name="l02188"></a><span class="lineno"> 2188</span>  }</div>
|
|
<div class="line"><a name="l02189"></a><span class="lineno"> 2189</span>  }</div>
|
|
<div class="line"><a name="l02190"></a><span class="lineno"> 2190</span>  <span class="keywordflow">return</span> <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a>;</div>
|
|
<div class="line"><a name="l02191"></a><span class="lineno"> 2191</span>  }</div>
|
|
<div class="line"><a name="l02192"></a><span class="lineno"> 2192</span>  </div>
|
|
<div class="line"><a name="l02193"></a><span class="lineno"> 2193</span>  <span class="keywordtype">void</span> SetMax(int64_t m)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02194"></a><span class="lineno"> 2194</span>  SetRange(<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>(), m);</div>
|
|
<div class="line"><a name="l02195"></a><span class="lineno"> 2195</span>  }</div>
|
|
<div class="line"><a name="l02196"></a><span class="lineno"> 2196</span>  </div>
|
|
<div class="line"><a name="l02197"></a><span class="lineno"> 2197</span>  <span class="keywordtype">void</span> SetRange(int64_t l, int64_t u)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02198"></a><span class="lineno"> 2198</span>  int64_t current_min = 0;</div>
|
|
<div class="line"><a name="l02199"></a><span class="lineno"> 2199</span>  int64_t current_max = 0;</div>
|
|
<div class="line"><a name="l02200"></a><span class="lineno"> 2200</span>  int64_t diameter = -1;</div>
|
|
<div class="line"><a name="l02201"></a><span class="lineno"> 2201</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l02202"></a><span class="lineno"> 2202</span>  <span class="keyword">const</span> int64_t <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> = coefs_[i];</div>
|
|
<div class="line"><a name="l02203"></a><span class="lineno"> 2203</span>  <span class="keyword">const</span> int64_t var_min = <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min(), <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>);</div>
|
|
<div class="line"><a name="l02204"></a><span class="lineno"> 2204</span>  <span class="keyword">const</span> int64_t var_max = <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max(), <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>);</div>
|
|
<div class="line"><a name="l02205"></a><span class="lineno"> 2205</span>  current_min = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(current_min, var_min);</div>
|
|
<div class="line"><a name="l02206"></a><span class="lineno"> 2206</span>  current_max = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(current_max, var_max);</div>
|
|
<div class="line"><a name="l02207"></a><span class="lineno"> 2207</span>  <span class="keywordflow">if</span> (var_min != var_max) { <span class="comment">// Coefficients are increasing.</span></div>
|
|
<div class="line"><a name="l02208"></a><span class="lineno"> 2208</span>  diameter = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(var_max, var_min);</div>
|
|
<div class="line"><a name="l02209"></a><span class="lineno"> 2209</span>  }</div>
|
|
<div class="line"><a name="l02210"></a><span class="lineno"> 2210</span>  }</div>
|
|
<div class="line"><a name="l02211"></a><span class="lineno"> 2211</span>  <span class="keywordflow">if</span> (u >= current_max && l <= current_min) {</div>
|
|
<div class="line"><a name="l02212"></a><span class="lineno"> 2212</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l02213"></a><span class="lineno"> 2213</span>  }</div>
|
|
<div class="line"><a name="l02214"></a><span class="lineno"> 2214</span>  <span class="keywordflow">if</span> (u < current_min || l > current_max) {</div>
|
|
<div class="line"><a name="l02215"></a><span class="lineno"> 2215</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l02216"></a><span class="lineno"> 2216</span>  }</div>
|
|
<div class="line"><a name="l02217"></a><span class="lineno"> 2217</span>  </div>
|
|
<div class="line"><a name="l02218"></a><span class="lineno"> 2218</span>  u = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(current_max, u);</div>
|
|
<div class="line"><a name="l02219"></a><span class="lineno"> 2219</span>  l = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(l, current_min);</div>
|
|
<div class="line"><a name="l02220"></a><span class="lineno"> 2220</span>  </div>
|
|
<div class="line"><a name="l02221"></a><span class="lineno"> 2221</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(u, l) > diameter) {</div>
|
|
<div class="line"><a name="l02222"></a><span class="lineno"> 2222</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l02223"></a><span class="lineno"> 2223</span>  }</div>
|
|
<div class="line"><a name="l02224"></a><span class="lineno"> 2224</span>  </div>
|
|
<div class="line"><a name="l02225"></a><span class="lineno"> 2225</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l02226"></a><span class="lineno"> 2226</span>  <span class="keyword">const</span> int64_t <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> = coefs_[i];</div>
|
|
<div class="line"><a name="l02227"></a><span class="lineno"> 2227</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i];</div>
|
|
<div class="line"><a name="l02228"></a><span class="lineno"> 2228</span>  <span class="keyword">const</span> int64_t new_min =</div>
|
|
<div class="line"><a name="l02229"></a><span class="lineno"> 2229</span>  <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(l, current_max), <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max(), <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>));</div>
|
|
<div class="line"><a name="l02230"></a><span class="lineno"> 2230</span>  <span class="keyword">const</span> int64_t new_max =</div>
|
|
<div class="line"><a name="l02231"></a><span class="lineno"> 2231</span>  <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(u, current_min), <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min(), <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>));</div>
|
|
<div class="line"><a name="l02232"></a><span class="lineno"> 2232</span>  <span class="keywordflow">if</span> (new_max < 0 || new_min > <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> || new_min > new_max) {</div>
|
|
<div class="line"><a name="l02233"></a><span class="lineno"> 2233</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l02234"></a><span class="lineno"> 2234</span>  }</div>
|
|
<div class="line"><a name="l02235"></a><span class="lineno"> 2235</span>  <span class="keywordflow">if</span> (new_min > 0LL) {</div>
|
|
<div class="line"><a name="l02236"></a><span class="lineno"> 2236</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetMin(int64_t{1});</div>
|
|
<div class="line"><a name="l02237"></a><span class="lineno"> 2237</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (new_max < <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>) {</div>
|
|
<div class="line"><a name="l02238"></a><span class="lineno"> 2238</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetMax(int64_t{0});</div>
|
|
<div class="line"><a name="l02239"></a><span class="lineno"> 2239</span>  }</div>
|
|
<div class="line"><a name="l02240"></a><span class="lineno"> 2240</span>  }</div>
|
|
<div class="line"><a name="l02241"></a><span class="lineno"> 2241</span>  }</div>
|
|
<div class="line"><a name="l02242"></a><span class="lineno"> 2242</span>  </div>
|
|
<div class="line"><a name="l02243"></a><span class="lineno"> 2243</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l02244"></a><span class="lineno"> 2244</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"PositiveBooleanScalProd([%s], [%s])"</span>,</div>
|
|
<div class="line"><a name="l02245"></a><span class="lineno"> 2245</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, <span class="stringliteral">", "</span>),</div>
|
|
<div class="line"><a name="l02246"></a><span class="lineno"> 2246</span>  absl::StrJoin(coefs_, <span class="stringliteral">", "</span>));</div>
|
|
<div class="line"><a name="l02247"></a><span class="lineno"> 2247</span>  }</div>
|
|
<div class="line"><a name="l02248"></a><span class="lineno"> 2248</span>  </div>
|
|
<div class="line"><a name="l02249"></a><span class="lineno"> 2249</span>  <span class="keywordtype">void</span> WhenRange(Demon* d)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02250"></a><span class="lineno"> 2250</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l02251"></a><span class="lineno"> 2251</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenRange(d);</div>
|
|
<div class="line"><a name="l02252"></a><span class="lineno"> 2252</span>  }</div>
|
|
<div class="line"><a name="l02253"></a><span class="lineno"> 2253</span>  }</div>
|
|
<div class="line"><a name="l02254"></a><span class="lineno"> 2254</span>  IntVar* CastToVar()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02255"></a><span class="lineno"> 2255</span>  Solver* <span class="keyword">const</span> s = solver();</div>
|
|
<div class="line"><a name="l02256"></a><span class="lineno"> 2256</span>  int64_t vmin = 0LL;</div>
|
|
<div class="line"><a name="l02257"></a><span class="lineno"> 2257</span>  int64_t vmax = 0LL;</div>
|
|
<div class="line"><a name="l02258"></a><span class="lineno"> 2258</span>  Range(&vmin, &vmax);</div>
|
|
<div class="line"><a name="l02259"></a><span class="lineno"> 2259</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = solver()->MakeIntVar(vmin, vmax);</div>
|
|
<div class="line"><a name="l02260"></a><span class="lineno"> 2260</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.empty()) {</div>
|
|
<div class="line"><a name="l02261"></a><span class="lineno"> 2261</span>  CastConstraint* <span class="keyword">const</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> =</div>
|
|
<div class="line"><a name="l02262"></a><span class="lineno"> 2262</span>  s->RevAlloc(<span class="keyword">new</span> PositiveBooleanScalProdEqVar(s, <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, coefs_, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l02263"></a><span class="lineno"> 2263</span>  s->AddCastConstraint(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02264"></a><span class="lineno"> 2264</span>  }</div>
|
|
<div class="line"><a name="l02265"></a><span class="lineno"> 2265</span>  <span class="keywordflow">return</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>;</div>
|
|
<div class="line"><a name="l02266"></a><span class="lineno"> 2266</span>  }</div>
|
|
<div class="line"><a name="l02267"></a><span class="lineno"> 2267</span>  </div>
|
|
<div class="line"><a name="l02268"></a><span class="lineno"> 2268</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="l02269"></a><span class="lineno"> 2269</span>  visitor->BeginVisitIntegerExpression(ModelVisitor::kScalProd, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02270"></a><span class="lineno"> 2270</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kVarsArgument,</div>
|
|
<div class="line"><a name="l02271"></a><span class="lineno"> 2271</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div>
|
|
<div class="line"><a name="l02272"></a><span class="lineno"> 2272</span>  visitor->VisitIntegerArrayArgument(ModelVisitor::kCoefficientsArgument,</div>
|
|
<div class="line"><a name="l02273"></a><span class="lineno"> 2273</span>  coefs_);</div>
|
|
<div class="line"><a name="l02274"></a><span class="lineno"> 2274</span>  visitor->EndVisitIntegerExpression(ModelVisitor::kScalProd, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02275"></a><span class="lineno"> 2275</span>  }</div>
|
|
<div class="line"><a name="l02276"></a><span class="lineno"> 2276</span>  </div>
|
|
<div class="line"><a name="l02277"></a><span class="lineno"> 2277</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l02278"></a><span class="lineno"> 2278</span>  std::vector<IntVar*> <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div>
|
|
<div class="line"><a name="l02279"></a><span class="lineno"> 2279</span>  std::vector<int64_t> coefs_;</div>
|
|
<div class="line"><a name="l02280"></a><span class="lineno"> 2280</span> };</div>
|
|
<div class="line"><a name="l02281"></a><span class="lineno"> 2281</span>  </div>
|
|
<div class="line"><a name="l02282"></a><span class="lineno"> 2282</span> <span class="comment">// ----- PositiveBooleanScalProdEqCst ----- (all constants >= 0)</span></div>
|
|
<div class="line"><a name="l02283"></a><span class="lineno"> 2283</span>  </div>
|
|
<div class="line"><a name="l02284"></a><span class="lineno"> 2284</span> <span class="keyword">class </span>PositiveBooleanScalProdEqCst : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l02285"></a><span class="lineno"> 2285</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l02286"></a><span class="lineno"> 2286</span>  PositiveBooleanScalProdEqCst(Solver* <span class="keyword">const</span> s,</div>
|
|
<div class="line"><a name="l02287"></a><span class="lineno"> 2287</span>  <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l02288"></a><span class="lineno"> 2288</span>  <span class="keyword">const</span> std::vector<int64_t>& coefs,</div>
|
|
<div class="line"><a name="l02289"></a><span class="lineno"> 2289</span>  int64_t constant)</div>
|
|
<div class="line"><a name="l02290"></a><span class="lineno"> 2290</span>  : Constraint(s),</div>
|
|
<div class="line"><a name="l02291"></a><span class="lineno"> 2291</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div>
|
|
<div class="line"><a name="l02292"></a><span class="lineno"> 2292</span>  coefs_(coefs),</div>
|
|
<div class="line"><a name="l02293"></a><span class="lineno"> 2293</span>  first_unbound_backward_(vars.size() - 1),</div>
|
|
<div class="line"><a name="l02294"></a><span class="lineno"> 2294</span>  sum_of_bound_variables_(0LL),</div>
|
|
<div class="line"><a name="l02295"></a><span class="lineno"> 2295</span>  sum_of_all_variables_(0LL),</div>
|
|
<div class="line"><a name="l02296"></a><span class="lineno"> 2296</span>  constant_(constant),</div>
|
|
<div class="line"><a name="l02297"></a><span class="lineno"> 2297</span>  max_coefficient_(0) {</div>
|
|
<div class="line"><a name="l02298"></a><span class="lineno"> 2298</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!vars.empty());</div>
|
|
<div class="line"><a name="l02299"></a><span class="lineno"> 2299</span>  constant_ =</div>
|
|
<div class="line"><a name="l02300"></a><span class="lineno"> 2300</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(constant_, SortBothChangeConstant(&<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, &coefs_, <span class="keyword">false</span>));</div>
|
|
<div class="line"><a name="l02301"></a><span class="lineno"> 2301</span>  max_coefficient_.SetValue(s, coefs_[<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size() - 1]);</div>
|
|
<div class="line"><a name="l02302"></a><span class="lineno"> 2302</span>  }</div>
|
|
<div class="line"><a name="l02303"></a><span class="lineno"> 2303</span>  </div>
|
|
<div class="line"><a name="l02304"></a><span class="lineno"> 2304</span>  ~PositiveBooleanScalProdEqCst()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l02305"></a><span class="lineno"> 2305</span>  </div>
|
|
<div class="line"><a name="l02306"></a><span class="lineno"> 2306</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02307"></a><span class="lineno"> 2307</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++var_index) {</div>
|
|
<div class="line"><a name="l02308"></a><span class="lineno"> 2308</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[var_index]->Bound()) {</div>
|
|
<div class="line"><a name="l02309"></a><span class="lineno"> 2309</span>  Demon* <span class="keyword">const</span> d = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l02310"></a><span class="lineno"> 2310</span>  solver(), <span class="keyword">this</span>, &PositiveBooleanScalProdEqCst::Update, <span class="stringliteral">"Update"</span>,</div>
|
|
<div class="line"><a name="l02311"></a><span class="lineno"> 2311</span>  var_index);</div>
|
|
<div class="line"><a name="l02312"></a><span class="lineno"> 2312</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[var_index]->WhenRange(d);</div>
|
|
<div class="line"><a name="l02313"></a><span class="lineno"> 2313</span>  }</div>
|
|
<div class="line"><a name="l02314"></a><span class="lineno"> 2314</span>  }</div>
|
|
<div class="line"><a name="l02315"></a><span class="lineno"> 2315</span>  }</div>
|
|
<div class="line"><a name="l02316"></a><span class="lineno"> 2316</span>  </div>
|
|
<div class="line"><a name="l02317"></a><span class="lineno"> 2317</span>  <span class="keywordtype">void</span> Propagate() {</div>
|
|
<div class="line"><a name="l02318"></a><span class="lineno"> 2318</span>  <span class="keywordflow">if</span> (sum_of_bound_variables_.Value() > constant_ ||</div>
|
|
<div class="line"><a name="l02319"></a><span class="lineno"> 2319</span>  sum_of_all_variables_.Value() < constant_) {</div>
|
|
<div class="line"><a name="l02320"></a><span class="lineno"> 2320</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l02321"></a><span class="lineno"> 2321</span>  }</div>
|
|
<div class="line"><a name="l02322"></a><span class="lineno"> 2322</span>  <span class="keyword">const</span> int64_t slack_up = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(constant_, sum_of_bound_variables_.Value());</div>
|
|
<div class="line"><a name="l02323"></a><span class="lineno"> 2323</span>  <span class="keyword">const</span> int64_t slack_down = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(sum_of_all_variables_.Value(), constant_);</div>
|
|
<div class="line"><a name="l02324"></a><span class="lineno"> 2324</span>  <span class="keyword">const</span> int64_t max_coeff = max_coefficient_.Value();</div>
|
|
<div class="line"><a name="l02325"></a><span class="lineno"> 2325</span>  <span class="keywordflow">if</span> (slack_down < max_coeff || slack_up < max_coeff) {</div>
|
|
<div class="line"><a name="l02326"></a><span class="lineno"> 2326</span>  int64_t last_unbound = first_unbound_backward_.Value();</div>
|
|
<div class="line"><a name="l02327"></a><span class="lineno"> 2327</span>  <span class="keywordflow">for</span> (; last_unbound >= 0; --last_unbound) {</div>
|
|
<div class="line"><a name="l02328"></a><span class="lineno"> 2328</span>  <span class="keywordflow">if</span> (!<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[last_unbound]->Bound()) {</div>
|
|
<div class="line"><a name="l02329"></a><span class="lineno"> 2329</span>  <span class="keywordflow">if</span> (coefs_[last_unbound] > slack_up) {</div>
|
|
<div class="line"><a name="l02330"></a><span class="lineno"> 2330</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[last_unbound]->SetValue(0);</div>
|
|
<div class="line"><a name="l02331"></a><span class="lineno"> 2331</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs_[last_unbound] > slack_down) {</div>
|
|
<div class="line"><a name="l02332"></a><span class="lineno"> 2332</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[last_unbound]->SetValue(1);</div>
|
|
<div class="line"><a name="l02333"></a><span class="lineno"> 2333</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02334"></a><span class="lineno"> 2334</span>  max_coefficient_.SetValue(solver(), coefs_[last_unbound]);</div>
|
|
<div class="line"><a name="l02335"></a><span class="lineno"> 2335</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02336"></a><span class="lineno"> 2336</span>  }</div>
|
|
<div class="line"><a name="l02337"></a><span class="lineno"> 2337</span>  }</div>
|
|
<div class="line"><a name="l02338"></a><span class="lineno"> 2338</span>  }</div>
|
|
<div class="line"><a name="l02339"></a><span class="lineno"> 2339</span>  first_unbound_backward_.SetValue(solver(), last_unbound);</div>
|
|
<div class="line"><a name="l02340"></a><span class="lineno"> 2340</span>  }</div>
|
|
<div class="line"><a name="l02341"></a><span class="lineno"> 2341</span>  }</div>
|
|
<div class="line"><a name="l02342"></a><span class="lineno"> 2342</span>  </div>
|
|
<div class="line"><a name="l02343"></a><span class="lineno"> 2343</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02344"></a><span class="lineno"> 2344</span>  Solver* <span class="keyword">const</span> s = solver();</div>
|
|
<div class="line"><a name="l02345"></a><span class="lineno"> 2345</span>  <span class="keywordtype">int</span> last_unbound = -1;</div>
|
|
<div class="line"><a name="l02346"></a><span class="lineno"> 2346</span>  int64_t sum_bound = 0LL;</div>
|
|
<div class="line"><a name="l02347"></a><span class="lineno"> 2347</span>  int64_t sum_all = 0LL;</div>
|
|
<div class="line"><a name="l02348"></a><span class="lineno"> 2348</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l02349"></a><span class="lineno"> 2349</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Max(), coefs_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a name="l02350"></a><span class="lineno"> 2350</span>  sum_all = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_all, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l02351"></a><span class="lineno"> 2351</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound()) {</div>
|
|
<div class="line"><a name="l02352"></a><span class="lineno"> 2352</span>  sum_bound = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_bound, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l02353"></a><span class="lineno"> 2353</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02354"></a><span class="lineno"> 2354</span>  last_unbound = <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l02355"></a><span class="lineno"> 2355</span>  }</div>
|
|
<div class="line"><a name="l02356"></a><span class="lineno"> 2356</span>  }</div>
|
|
<div class="line"><a name="l02357"></a><span class="lineno"> 2357</span>  sum_of_bound_variables_.SetValue(s, sum_bound);</div>
|
|
<div class="line"><a name="l02358"></a><span class="lineno"> 2358</span>  sum_of_all_variables_.SetValue(s, sum_all);</div>
|
|
<div class="line"><a name="l02359"></a><span class="lineno"> 2359</span>  first_unbound_backward_.SetValue(s, last_unbound);</div>
|
|
<div class="line"><a name="l02360"></a><span class="lineno"> 2360</span>  Propagate();</div>
|
|
<div class="line"><a name="l02361"></a><span class="lineno"> 2361</span>  }</div>
|
|
<div class="line"><a name="l02362"></a><span class="lineno"> 2362</span>  </div>
|
|
<div class="line"><a name="l02363"></a><span class="lineno"> 2363</span>  <span class="keywordtype">void</span> Update(<span class="keywordtype">int</span> var_index) {</div>
|
|
<div class="line"><a name="l02364"></a><span class="lineno"> 2364</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[var_index]->Min() == 1) {</div>
|
|
<div class="line"><a name="l02365"></a><span class="lineno"> 2365</span>  sum_of_bound_variables_.SetValue(</div>
|
|
<div class="line"><a name="l02366"></a><span class="lineno"> 2366</span>  solver(), <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_of_bound_variables_.Value(), coefs_[var_index]));</div>
|
|
<div class="line"><a name="l02367"></a><span class="lineno"> 2367</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02368"></a><span class="lineno"> 2368</span>  sum_of_all_variables_.SetValue(</div>
|
|
<div class="line"><a name="l02369"></a><span class="lineno"> 2369</span>  solver(), <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(sum_of_all_variables_.Value(), coefs_[var_index]));</div>
|
|
<div class="line"><a name="l02370"></a><span class="lineno"> 2370</span>  }</div>
|
|
<div class="line"><a name="l02371"></a><span class="lineno"> 2371</span>  Propagate();</div>
|
|
<div class="line"><a name="l02372"></a><span class="lineno"> 2372</span>  }</div>
|
|
<div class="line"><a name="l02373"></a><span class="lineno"> 2373</span>  </div>
|
|
<div class="line"><a name="l02374"></a><span class="lineno"> 2374</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l02375"></a><span class="lineno"> 2375</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"PositiveBooleanScalProd([%s], [%s]) == %d"</span>,</div>
|
|
<div class="line"><a name="l02376"></a><span class="lineno"> 2376</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, <span class="stringliteral">", "</span>),</div>
|
|
<div class="line"><a name="l02377"></a><span class="lineno"> 2377</span>  absl::StrJoin(coefs_, <span class="stringliteral">", "</span>), constant_);</div>
|
|
<div class="line"><a name="l02378"></a><span class="lineno"> 2378</span>  }</div>
|
|
<div class="line"><a name="l02379"></a><span class="lineno"> 2379</span>  </div>
|
|
<div class="line"><a name="l02380"></a><span class="lineno"> 2380</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="l02381"></a><span class="lineno"> 2381</span>  visitor->BeginVisitConstraint(ModelVisitor::kScalProdEqual, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02382"></a><span class="lineno"> 2382</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kVarsArgument,</div>
|
|
<div class="line"><a name="l02383"></a><span class="lineno"> 2383</span>  <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div>
|
|
<div class="line"><a name="l02384"></a><span class="lineno"> 2384</span>  visitor->VisitIntegerArrayArgument(ModelVisitor::kCoefficientsArgument,</div>
|
|
<div class="line"><a name="l02385"></a><span class="lineno"> 2385</span>  coefs_);</div>
|
|
<div class="line"><a name="l02386"></a><span class="lineno"> 2386</span>  visitor->VisitIntegerArgument(ModelVisitor::kValueArgument, constant_);</div>
|
|
<div class="line"><a name="l02387"></a><span class="lineno"> 2387</span>  visitor->EndVisitConstraint(ModelVisitor::kScalProdEqual, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02388"></a><span class="lineno"> 2388</span>  }</div>
|
|
<div class="line"><a name="l02389"></a><span class="lineno"> 2389</span>  </div>
|
|
<div class="line"><a name="l02390"></a><span class="lineno"> 2390</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l02391"></a><span class="lineno"> 2391</span>  std::vector<IntVar*> <a class="code" href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div>
|
|
<div class="line"><a name="l02392"></a><span class="lineno"> 2392</span>  std::vector<int64_t> coefs_;</div>
|
|
<div class="line"><a name="l02393"></a><span class="lineno"> 2393</span>  Rev<int> first_unbound_backward_;</div>
|
|
<div class="line"><a name="l02394"></a><span class="lineno"> 2394</span>  Rev<int64_t> sum_of_bound_variables_;</div>
|
|
<div class="line"><a name="l02395"></a><span class="lineno"> 2395</span>  Rev<int64_t> sum_of_all_variables_;</div>
|
|
<div class="line"><a name="l02396"></a><span class="lineno"> 2396</span>  int64_t constant_;</div>
|
|
<div class="line"><a name="l02397"></a><span class="lineno"> 2397</span>  Rev<int64_t> max_coefficient_;</div>
|
|
<div class="line"><a name="l02398"></a><span class="lineno"> 2398</span> };</div>
|
|
<div class="line"><a name="l02399"></a><span class="lineno"> 2399</span>  </div>
|
|
<div class="line"><a name="l02400"></a><span class="lineno"> 2400</span> <span class="comment">// ----- Linearizer -----</span></div>
|
|
<div class="line"><a name="l02401"></a><span class="lineno"> 2401</span>  </div>
|
|
<div class="line"><a name="l02402"></a><span class="lineno"><a class="line" href="expr__array_8cc.html#a7ace0bd24fca8b7eecf784d58683eefd"> 2402</a></span> <span class="preprocessor">#define IS_TYPE(type, tag) type.compare(ModelVisitor::tag) == 0</span></div>
|
|
<div class="line"><a name="l02403"></a><span class="lineno"> 2403</span>  </div>
|
|
<div class="line"><a name="l02404"></a><span class="lineno"> 2404</span> <span class="keyword">class </span>ExprLinearizer : <span class="keyword">public</span> ModelParser {</div>
|
|
<div class="line"><a name="l02405"></a><span class="lineno"> 2405</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l02406"></a><span class="lineno"> 2406</span>  <span class="keyword">explicit</span> ExprLinearizer(</div>
|
|
<div class="line"><a name="l02407"></a><span class="lineno"> 2407</span>  absl::flat_hash_map<IntVar*, int64_t>* <span class="keyword">const</span> variables_to_coefficients)</div>
|
|
<div class="line"><a name="l02408"></a><span class="lineno"> 2408</span>  : variables_to_coefficients_(variables_to_coefficients), constant_(0) {}</div>
|
|
<div class="line"><a name="l02409"></a><span class="lineno"> 2409</span>  </div>
|
|
<div class="line"><a name="l02410"></a><span class="lineno"> 2410</span>  ~ExprLinearizer()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l02411"></a><span class="lineno"> 2411</span>  </div>
|
|
<div class="line"><a name="l02412"></a><span class="lineno"> 2412</span>  <span class="comment">// Begin/End visit element.</span></div>
|
|
<div class="line"><a name="l02413"></a><span class="lineno"> 2413</span>  <span class="keywordtype">void</span> BeginVisitModel(<span class="keyword">const</span> std::string& solver_name)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02414"></a><span class="lineno"> 2414</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should not be here"</span>;</div>
|
|
<div class="line"><a name="l02415"></a><span class="lineno"> 2415</span>  }</div>
|
|
<div class="line"><a name="l02416"></a><span class="lineno"> 2416</span>  </div>
|
|
<div class="line"><a name="l02417"></a><span class="lineno"> 2417</span>  <span class="keywordtype">void</span> EndVisitModel(<span class="keyword">const</span> std::string& solver_name)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02418"></a><span class="lineno"> 2418</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should not be here"</span>;</div>
|
|
<div class="line"><a name="l02419"></a><span class="lineno"> 2419</span>  }</div>
|
|
<div class="line"><a name="l02420"></a><span class="lineno"> 2420</span>  </div>
|
|
<div class="line"><a name="l02421"></a><span class="lineno"> 2421</span>  <span class="keywordtype">void</span> BeginVisitConstraint(<span class="keyword">const</span> std::string& type_name,</div>
|
|
<div class="line"><a name="l02422"></a><span class="lineno"> 2422</span>  <span class="keyword">const</span> Constraint* <span class="keyword">const</span> constraint)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02423"></a><span class="lineno"> 2423</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should not be here"</span>;</div>
|
|
<div class="line"><a name="l02424"></a><span class="lineno"> 2424</span>  }</div>
|
|
<div class="line"><a name="l02425"></a><span class="lineno"> 2425</span>  </div>
|
|
<div class="line"><a name="l02426"></a><span class="lineno"> 2426</span>  <span class="keywordtype">void</span> EndVisitConstraint(<span class="keyword">const</span> std::string& type_name,</div>
|
|
<div class="line"><a name="l02427"></a><span class="lineno"> 2427</span>  <span class="keyword">const</span> Constraint* <span class="keyword">const</span> constraint)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02428"></a><span class="lineno"> 2428</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should not be here"</span>;</div>
|
|
<div class="line"><a name="l02429"></a><span class="lineno"> 2429</span>  }</div>
|
|
<div class="line"><a name="l02430"></a><span class="lineno"> 2430</span>  </div>
|
|
<div class="line"><a name="l02431"></a><span class="lineno"> 2431</span>  <span class="keywordtype">void</span> BeginVisitExtension(<span class="keyword">const</span> std::string& type)<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l02432"></a><span class="lineno"> 2432</span>  </div>
|
|
<div class="line"><a name="l02433"></a><span class="lineno"> 2433</span>  <span class="keywordtype">void</span> EndVisitExtension(<span class="keyword">const</span> std::string& type)<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l02434"></a><span class="lineno"> 2434</span>  <span class="keywordtype">void</span> BeginVisitIntegerExpression(<span class="keyword">const</span> std::string& type_name,</div>
|
|
<div class="line"><a name="l02435"></a><span class="lineno"> 2435</span>  <span class="keyword">const</span> IntExpr* <span class="keyword">const</span> expr)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02436"></a><span class="lineno"> 2436</span>  BeginVisit(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l02437"></a><span class="lineno"> 2437</span>  }</div>
|
|
<div class="line"><a name="l02438"></a><span class="lineno"> 2438</span>  </div>
|
|
<div class="line"><a name="l02439"></a><span class="lineno"> 2439</span>  <span class="keywordtype">void</span> EndVisitIntegerExpression(<span class="keyword">const</span> std::string& type_name,</div>
|
|
<div class="line"><a name="l02440"></a><span class="lineno"> 2440</span>  <span class="keyword">const</span> IntExpr* <span class="keyword">const</span> expr)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02441"></a><span class="lineno"> 2441</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a7ace0bd24fca8b7eecf784d58683eefd">IS_TYPE</a>(type_name, kSum)) {</div>
|
|
<div class="line"><a name="l02442"></a><span class="lineno"> 2442</span>  VisitSum(expr);</div>
|
|
<div class="line"><a name="l02443"></a><span class="lineno"> 2443</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a7ace0bd24fca8b7eecf784d58683eefd">IS_TYPE</a>(type_name, kScalProd)) {</div>
|
|
<div class="line"><a name="l02444"></a><span class="lineno"> 2444</span>  VisitScalProd(expr);</div>
|
|
<div class="line"><a name="l02445"></a><span class="lineno"> 2445</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a7ace0bd24fca8b7eecf784d58683eefd">IS_TYPE</a>(type_name, kDifference)) {</div>
|
|
<div class="line"><a name="l02446"></a><span class="lineno"> 2446</span>  VisitDifference(expr);</div>
|
|
<div class="line"><a name="l02447"></a><span class="lineno"> 2447</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a7ace0bd24fca8b7eecf784d58683eefd">IS_TYPE</a>(type_name, kOpposite)) {</div>
|
|
<div class="line"><a name="l02448"></a><span class="lineno"> 2448</span>  VisitOpposite(expr);</div>
|
|
<div class="line"><a name="l02449"></a><span class="lineno"> 2449</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a7ace0bd24fca8b7eecf784d58683eefd">IS_TYPE</a>(type_name, kProduct)) {</div>
|
|
<div class="line"><a name="l02450"></a><span class="lineno"> 2450</span>  VisitProduct(expr);</div>
|
|
<div class="line"><a name="l02451"></a><span class="lineno"> 2451</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a7ace0bd24fca8b7eecf784d58683eefd">IS_TYPE</a>(type_name, kTrace)) {</div>
|
|
<div class="line"><a name="l02452"></a><span class="lineno"> 2452</span>  VisitTrace(expr);</div>
|
|
<div class="line"><a name="l02453"></a><span class="lineno"> 2453</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02454"></a><span class="lineno"> 2454</span>  VisitIntegerExpression(expr);</div>
|
|
<div class="line"><a name="l02455"></a><span class="lineno"> 2455</span>  }</div>
|
|
<div class="line"><a name="l02456"></a><span class="lineno"> 2456</span>  EndVisit();</div>
|
|
<div class="line"><a name="l02457"></a><span class="lineno"> 2457</span>  }</div>
|
|
<div class="line"><a name="l02458"></a><span class="lineno"> 2458</span>  </div>
|
|
<div class="line"><a name="l02459"></a><span class="lineno"> 2459</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="l02460"></a><span class="lineno"> 2460</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="l02461"></a><span class="lineno"> 2461</span>  IntVar* <span class="keyword">const</span> delegate)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02462"></a><span class="lineno"> 2462</span>  <span class="keywordflow">if</span> (operation == ModelVisitor::kSumOperation) {</div>
|
|
<div class="line"><a name="l02463"></a><span class="lineno"> 2463</span>  AddConstant(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l02464"></a><span class="lineno"> 2464</span>  VisitSubExpression(delegate);</div>
|
|
<div class="line"><a name="l02465"></a><span class="lineno"> 2465</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (operation == ModelVisitor::kDifferenceOperation) {</div>
|
|
<div class="line"><a name="l02466"></a><span class="lineno"> 2466</span>  AddConstant(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l02467"></a><span class="lineno"> 2467</span>  PushMultiplier(-1);</div>
|
|
<div class="line"><a name="l02468"></a><span class="lineno"> 2468</span>  VisitSubExpression(delegate);</div>
|
|
<div class="line"><a name="l02469"></a><span class="lineno"> 2469</span>  PopMultiplier();</div>
|
|
<div class="line"><a name="l02470"></a><span class="lineno"> 2470</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (operation == ModelVisitor::kProductOperation) {</div>
|
|
<div class="line"><a name="l02471"></a><span class="lineno"> 2471</span>  PushMultiplier(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l02472"></a><span class="lineno"> 2472</span>  VisitSubExpression(delegate);</div>
|
|
<div class="line"><a name="l02473"></a><span class="lineno"> 2473</span>  PopMultiplier();</div>
|
|
<div class="line"><a name="l02474"></a><span class="lineno"> 2474</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (operation == ModelVisitor::kTraceOperation) {</div>
|
|
<div class="line"><a name="l02475"></a><span class="lineno"> 2475</span>  VisitSubExpression(delegate);</div>
|
|
<div class="line"><a name="l02476"></a><span class="lineno"> 2476</span>  }</div>
|
|
<div class="line"><a name="l02477"></a><span class="lineno"> 2477</span>  }</div>
|
|
<div class="line"><a name="l02478"></a><span class="lineno"> 2478</span>  </div>
|
|
<div class="line"><a name="l02479"></a><span class="lineno"> 2479</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="l02480"></a><span class="lineno"> 2480</span>  IntExpr* <span class="keyword">const</span> delegate)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02481"></a><span class="lineno"> 2481</span>  <span class="keywordflow">if</span> (delegate != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l02482"></a><span class="lineno"> 2482</span>  VisitSubExpression(delegate);</div>
|
|
<div class="line"><a name="l02483"></a><span class="lineno"> 2483</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02484"></a><span class="lineno"> 2484</span>  <span class="keywordflow">if</span> (variable->Bound()) {</div>
|
|
<div class="line"><a name="l02485"></a><span class="lineno"> 2485</span>  AddConstant(variable->Min());</div>
|
|
<div class="line"><a name="l02486"></a><span class="lineno"> 2486</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02487"></a><span class="lineno"> 2487</span>  RegisterExpression(variable, 1);</div>
|
|
<div class="line"><a name="l02488"></a><span class="lineno"> 2488</span>  }</div>
|
|
<div class="line"><a name="l02489"></a><span class="lineno"> 2489</span>  }</div>
|
|
<div class="line"><a name="l02490"></a><span class="lineno"> 2490</span>  }</div>
|
|
<div class="line"><a name="l02491"></a><span class="lineno"> 2491</span>  </div>
|
|
<div class="line"><a name="l02492"></a><span class="lineno"> 2492</span>  <span class="comment">// Visit integer arguments.</span></div>
|
|
<div class="line"><a name="l02493"></a><span class="lineno"> 2493</span>  <span class="keywordtype">void</span> VisitIntegerArgument(<span class="keyword">const</span> std::string& arg_name,</div>
|
|
<div class="line"><a name="l02494"></a><span class="lineno"> 2494</span>  int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02495"></a><span class="lineno"> 2495</span>  Top()->SetIntegerArgument(arg_name, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l02496"></a><span class="lineno"> 2496</span>  }</div>
|
|
<div class="line"><a name="l02497"></a><span class="lineno"> 2497</span>  </div>
|
|
<div class="line"><a name="l02498"></a><span class="lineno"> 2498</span>  <span class="keywordtype">void</span> VisitIntegerArrayArgument(<span class="keyword">const</span> std::string& arg_name,</div>
|
|
<div class="line"><a name="l02499"></a><span class="lineno"> 2499</span>  <span class="keyword">const</span> std::vector<int64_t>& values)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02500"></a><span class="lineno"> 2500</span>  Top()->SetIntegerArrayArgument(arg_name, values);</div>
|
|
<div class="line"><a name="l02501"></a><span class="lineno"> 2501</span>  }</div>
|
|
<div class="line"><a name="l02502"></a><span class="lineno"> 2502</span>  </div>
|
|
<div class="line"><a name="l02503"></a><span class="lineno"> 2503</span>  <span class="keywordtype">void</span> VisitIntegerMatrixArgument(<span class="keyword">const</span> std::string& arg_name,</div>
|
|
<div class="line"><a name="l02504"></a><span class="lineno"> 2504</span>  <span class="keyword">const</span> IntTupleSet& values)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02505"></a><span class="lineno"> 2505</span>  Top()->SetIntegerMatrixArgument(arg_name, values);</div>
|
|
<div class="line"><a name="l02506"></a><span class="lineno"> 2506</span>  }</div>
|
|
<div class="line"><a name="l02507"></a><span class="lineno"> 2507</span>  </div>
|
|
<div class="line"><a name="l02508"></a><span class="lineno"> 2508</span>  <span class="comment">// Visit integer expression argument.</span></div>
|
|
<div class="line"><a name="l02509"></a><span class="lineno"> 2509</span>  <span class="keywordtype">void</span> VisitIntegerExpressionArgument(<span class="keyword">const</span> std::string& arg_name,</div>
|
|
<div class="line"><a name="l02510"></a><span class="lineno"> 2510</span>  IntExpr* <span class="keyword">const</span> argument)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02511"></a><span class="lineno"> 2511</span>  Top()->SetIntegerExpressionArgument(arg_name, argument);</div>
|
|
<div class="line"><a name="l02512"></a><span class="lineno"> 2512</span>  }</div>
|
|
<div class="line"><a name="l02513"></a><span class="lineno"> 2513</span>  </div>
|
|
<div class="line"><a name="l02514"></a><span class="lineno"> 2514</span>  <span class="keywordtype">void</span> VisitIntegerVariableArrayArgument(</div>
|
|
<div class="line"><a name="l02515"></a><span class="lineno"> 2515</span>  <span class="keyword">const</span> std::string& arg_name,</div>
|
|
<div class="line"><a name="l02516"></a><span class="lineno"> 2516</span>  <span class="keyword">const</span> std::vector<IntVar*>& arguments)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02517"></a><span class="lineno"> 2517</span>  Top()->SetIntegerVariableArrayArgument(arg_name, arguments);</div>
|
|
<div class="line"><a name="l02518"></a><span class="lineno"> 2518</span>  }</div>
|
|
<div class="line"><a name="l02519"></a><span class="lineno"> 2519</span>  </div>
|
|
<div class="line"><a name="l02520"></a><span class="lineno"> 2520</span>  <span class="comment">// Visit interval argument.</span></div>
|
|
<div class="line"><a name="l02521"></a><span class="lineno"> 2521</span>  <span class="keywordtype">void</span> VisitIntervalArgument(<span class="keyword">const</span> std::string& arg_name,</div>
|
|
<div class="line"><a name="l02522"></a><span class="lineno"> 2522</span>  IntervalVar* <span class="keyword">const</span> argument)<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l02523"></a><span class="lineno"> 2523</span>  </div>
|
|
<div class="line"><a name="l02524"></a><span class="lineno"> 2524</span>  <span class="keywordtype">void</span> VisitIntervalArrayArgument(</div>
|
|
<div class="line"><a name="l02525"></a><span class="lineno"> 2525</span>  <span class="keyword">const</span> std::string& arg_name,</div>
|
|
<div class="line"><a name="l02526"></a><span class="lineno"> 2526</span>  <span class="keyword">const</span> std::vector<IntervalVar*>& argument)<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l02527"></a><span class="lineno"> 2527</span>  </div>
|
|
<div class="line"><a name="l02528"></a><span class="lineno"> 2528</span>  <span class="keywordtype">void</span> Visit(<span class="keyword">const</span> IntExpr* <span class="keyword">const</span> expr, int64_t multiplier) {</div>
|
|
<div class="line"><a name="l02529"></a><span class="lineno"> 2529</span>  <span class="keywordflow">if</span> (expr->Min() == expr->Max()) {</div>
|
|
<div class="line"><a name="l02530"></a><span class="lineno"> 2530</span>  constant_ = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(constant_, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(expr->Min(), multiplier));</div>
|
|
<div class="line"><a name="l02531"></a><span class="lineno"> 2531</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02532"></a><span class="lineno"> 2532</span>  PushMultiplier(multiplier);</div>
|
|
<div class="line"><a name="l02533"></a><span class="lineno"> 2533</span>  expr->Accept(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02534"></a><span class="lineno"> 2534</span>  PopMultiplier();</div>
|
|
<div class="line"><a name="l02535"></a><span class="lineno"> 2535</span>  }</div>
|
|
<div class="line"><a name="l02536"></a><span class="lineno"> 2536</span>  }</div>
|
|
<div class="line"><a name="l02537"></a><span class="lineno"> 2537</span>  </div>
|
|
<div class="line"><a name="l02538"></a><span class="lineno"> 2538</span>  int64_t Constant()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> constant_; }</div>
|
|
<div class="line"><a name="l02539"></a><span class="lineno"> 2539</span>  </div>
|
|
<div class="line"><a name="l02540"></a><span class="lineno"> 2540</span>  std::string DebugString()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"ExprLinearizer"</span>; }</div>
|
|
<div class="line"><a name="l02541"></a><span class="lineno"> 2541</span>  </div>
|
|
<div class="line"><a name="l02542"></a><span class="lineno"> 2542</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l02543"></a><span class="lineno"> 2543</span>  <span class="keywordtype">void</span> BeginVisit(<span class="keywordtype">bool</span> active) { PushArgumentHolder(); }</div>
|
|
<div class="line"><a name="l02544"></a><span class="lineno"> 2544</span>  </div>
|
|
<div class="line"><a name="l02545"></a><span class="lineno"> 2545</span>  <span class="keywordtype">void</span> EndVisit() { PopArgumentHolder(); }</div>
|
|
<div class="line"><a name="l02546"></a><span class="lineno"> 2546</span>  </div>
|
|
<div class="line"><a name="l02547"></a><span class="lineno"> 2547</span>  <span class="keywordtype">void</span> VisitSubExpression(<span class="keyword">const</span> IntExpr* <span class="keyword">const</span> cp_expr) {</div>
|
|
<div class="line"><a name="l02548"></a><span class="lineno"> 2548</span>  cp_expr->Accept(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02549"></a><span class="lineno"> 2549</span>  }</div>
|
|
<div class="line"><a name="l02550"></a><span class="lineno"> 2550</span>  </div>
|
|
<div class="line"><a name="l02551"></a><span class="lineno"> 2551</span>  <span class="keywordtype">void</span> VisitSum(<span class="keyword">const</span> IntExpr* <span class="keyword">const</span> cp_expr) {</div>
|
|
<div class="line"><a name="l02552"></a><span class="lineno"> 2552</span>  <span class="keywordflow">if</span> (Top()->HasIntegerVariableArrayArgument(ModelVisitor::kVarsArgument)) {</div>
|
|
<div class="line"><a name="l02553"></a><span class="lineno"> 2553</span>  <span class="keyword">const</span> std::vector<IntVar*>& cp_vars =</div>
|
|
<div class="line"><a name="l02554"></a><span class="lineno"> 2554</span>  Top()->FindIntegerVariableArrayArgumentOrDie(</div>
|
|
<div class="line"><a name="l02555"></a><span class="lineno"> 2555</span>  ModelVisitor::kVarsArgument);</div>
|
|
<div class="line"><a name="l02556"></a><span class="lineno"> 2556</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < cp_vars.size(); ++i) {</div>
|
|
<div class="line"><a name="l02557"></a><span class="lineno"> 2557</span>  VisitSubExpression(cp_vars[i]);</div>
|
|
<div class="line"><a name="l02558"></a><span class="lineno"> 2558</span>  }</div>
|
|
<div class="line"><a name="l02559"></a><span class="lineno"> 2559</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (Top()->HasIntegerExpressionArgument(</div>
|
|
<div class="line"><a name="l02560"></a><span class="lineno"> 2560</span>  ModelVisitor::kLeftArgument)) {</div>
|
|
<div class="line"><a name="l02561"></a><span class="lineno"> 2561</span>  <span class="keyword">const</span> IntExpr* <span class="keyword">const</span> left = Top()->FindIntegerExpressionArgumentOrDie(</div>
|
|
<div class="line"><a name="l02562"></a><span class="lineno"> 2562</span>  ModelVisitor::kLeftArgument);</div>
|
|
<div class="line"><a name="l02563"></a><span class="lineno"> 2563</span>  <span class="keyword">const</span> IntExpr* <span class="keyword">const</span> right = Top()->FindIntegerExpressionArgumentOrDie(</div>
|
|
<div class="line"><a name="l02564"></a><span class="lineno"> 2564</span>  ModelVisitor::kRightArgument);</div>
|
|
<div class="line"><a name="l02565"></a><span class="lineno"> 2565</span>  VisitSubExpression(left);</div>
|
|
<div class="line"><a name="l02566"></a><span class="lineno"> 2566</span>  VisitSubExpression(right);</div>
|
|
<div class="line"><a name="l02567"></a><span class="lineno"> 2567</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02568"></a><span class="lineno"> 2568</span>  <span class="keyword">const</span> IntExpr* <span class="keyword">const</span> expr = Top()->FindIntegerExpressionArgumentOrDie(</div>
|
|
<div class="line"><a name="l02569"></a><span class="lineno"> 2569</span>  ModelVisitor::kExpressionArgument);</div>
|
|
<div class="line"><a name="l02570"></a><span class="lineno"> 2570</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="l02571"></a><span class="lineno"> 2571</span>  Top()->FindIntegerArgumentOrDie(ModelVisitor::kValueArgument);</div>
|
|
<div class="line"><a name="l02572"></a><span class="lineno"> 2572</span>  VisitSubExpression(expr);</div>
|
|
<div class="line"><a name="l02573"></a><span class="lineno"> 2573</span>  AddConstant(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l02574"></a><span class="lineno"> 2574</span>  }</div>
|
|
<div class="line"><a name="l02575"></a><span class="lineno"> 2575</span>  }</div>
|
|
<div class="line"><a name="l02576"></a><span class="lineno"> 2576</span>  </div>
|
|
<div class="line"><a name="l02577"></a><span class="lineno"> 2577</span>  <span class="keywordtype">void</span> VisitScalProd(<span class="keyword">const</span> IntExpr* <span class="keyword">const</span> cp_expr) {</div>
|
|
<div class="line"><a name="l02578"></a><span class="lineno"> 2578</span>  <span class="keyword">const</span> std::vector<IntVar*>& cp_vars =</div>
|
|
<div class="line"><a name="l02579"></a><span class="lineno"> 2579</span>  Top()->FindIntegerVariableArrayArgumentOrDie(</div>
|
|
<div class="line"><a name="l02580"></a><span class="lineno"> 2580</span>  ModelVisitor::kVarsArgument);</div>
|
|
<div class="line"><a name="l02581"></a><span class="lineno"> 2581</span>  <span class="keyword">const</span> std::vector<int64_t>& cp_coefficients =</div>
|
|
<div class="line"><a name="l02582"></a><span class="lineno"> 2582</span>  Top()->FindIntegerArrayArgumentOrDie(</div>
|
|
<div class="line"><a name="l02583"></a><span class="lineno"> 2583</span>  ModelVisitor::kCoefficientsArgument);</div>
|
|
<div class="line"><a name="l02584"></a><span class="lineno"> 2584</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(cp_vars.size(), cp_coefficients.size());</div>
|
|
<div class="line"><a name="l02585"></a><span class="lineno"> 2585</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < cp_vars.size(); ++i) {</div>
|
|
<div class="line"><a name="l02586"></a><span class="lineno"> 2586</span>  <span class="keyword">const</span> int64_t <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> = cp_coefficients[i];</div>
|
|
<div class="line"><a name="l02587"></a><span class="lineno"> 2587</span>  PushMultiplier(<a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>);</div>
|
|
<div class="line"><a name="l02588"></a><span class="lineno"> 2588</span>  VisitSubExpression(cp_vars[i]);</div>
|
|
<div class="line"><a name="l02589"></a><span class="lineno"> 2589</span>  PopMultiplier();</div>
|
|
<div class="line"><a name="l02590"></a><span class="lineno"> 2590</span>  }</div>
|
|
<div class="line"><a name="l02591"></a><span class="lineno"> 2591</span>  }</div>
|
|
<div class="line"><a name="l02592"></a><span class="lineno"> 2592</span>  </div>
|
|
<div class="line"><a name="l02593"></a><span class="lineno"> 2593</span>  <span class="keywordtype">void</span> VisitDifference(<span class="keyword">const</span> IntExpr* <span class="keyword">const</span> cp_expr) {</div>
|
|
<div class="line"><a name="l02594"></a><span class="lineno"> 2594</span>  <span class="keywordflow">if</span> (Top()->HasIntegerExpressionArgument(ModelVisitor::kLeftArgument)) {</div>
|
|
<div class="line"><a name="l02595"></a><span class="lineno"> 2595</span>  <span class="keyword">const</span> IntExpr* <span class="keyword">const</span> left = Top()->FindIntegerExpressionArgumentOrDie(</div>
|
|
<div class="line"><a name="l02596"></a><span class="lineno"> 2596</span>  ModelVisitor::kLeftArgument);</div>
|
|
<div class="line"><a name="l02597"></a><span class="lineno"> 2597</span>  <span class="keyword">const</span> IntExpr* <span class="keyword">const</span> right = Top()->FindIntegerExpressionArgumentOrDie(</div>
|
|
<div class="line"><a name="l02598"></a><span class="lineno"> 2598</span>  ModelVisitor::kRightArgument);</div>
|
|
<div class="line"><a name="l02599"></a><span class="lineno"> 2599</span>  VisitSubExpression(left);</div>
|
|
<div class="line"><a name="l02600"></a><span class="lineno"> 2600</span>  PushMultiplier(-1);</div>
|
|
<div class="line"><a name="l02601"></a><span class="lineno"> 2601</span>  VisitSubExpression(right);</div>
|
|
<div class="line"><a name="l02602"></a><span class="lineno"> 2602</span>  PopMultiplier();</div>
|
|
<div class="line"><a name="l02603"></a><span class="lineno"> 2603</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02604"></a><span class="lineno"> 2604</span>  <span class="keyword">const</span> IntExpr* <span class="keyword">const</span> expr = Top()->FindIntegerExpressionArgumentOrDie(</div>
|
|
<div class="line"><a name="l02605"></a><span class="lineno"> 2605</span>  ModelVisitor::kExpressionArgument);</div>
|
|
<div class="line"><a name="l02606"></a><span class="lineno"> 2606</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="l02607"></a><span class="lineno"> 2607</span>  Top()->FindIntegerArgumentOrDie(ModelVisitor::kValueArgument);</div>
|
|
<div class="line"><a name="l02608"></a><span class="lineno"> 2608</span>  AddConstant(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l02609"></a><span class="lineno"> 2609</span>  PushMultiplier(-1);</div>
|
|
<div class="line"><a name="l02610"></a><span class="lineno"> 2610</span>  VisitSubExpression(expr);</div>
|
|
<div class="line"><a name="l02611"></a><span class="lineno"> 2611</span>  PopMultiplier();</div>
|
|
<div class="line"><a name="l02612"></a><span class="lineno"> 2612</span>  }</div>
|
|
<div class="line"><a name="l02613"></a><span class="lineno"> 2613</span>  }</div>
|
|
<div class="line"><a name="l02614"></a><span class="lineno"> 2614</span>  </div>
|
|
<div class="line"><a name="l02615"></a><span class="lineno"> 2615</span>  <span class="keywordtype">void</span> VisitOpposite(<span class="keyword">const</span> IntExpr* <span class="keyword">const</span> cp_expr) {</div>
|
|
<div class="line"><a name="l02616"></a><span class="lineno"> 2616</span>  <span class="keyword">const</span> IntExpr* <span class="keyword">const</span> expr = Top()->FindIntegerExpressionArgumentOrDie(</div>
|
|
<div class="line"><a name="l02617"></a><span class="lineno"> 2617</span>  ModelVisitor::kExpressionArgument);</div>
|
|
<div class="line"><a name="l02618"></a><span class="lineno"> 2618</span>  PushMultiplier(-1);</div>
|
|
<div class="line"><a name="l02619"></a><span class="lineno"> 2619</span>  VisitSubExpression(expr);</div>
|
|
<div class="line"><a name="l02620"></a><span class="lineno"> 2620</span>  PopMultiplier();</div>
|
|
<div class="line"><a name="l02621"></a><span class="lineno"> 2621</span>  }</div>
|
|
<div class="line"><a name="l02622"></a><span class="lineno"> 2622</span>  </div>
|
|
<div class="line"><a name="l02623"></a><span class="lineno"> 2623</span>  <span class="keywordtype">void</span> VisitProduct(<span class="keyword">const</span> IntExpr* <span class="keyword">const</span> cp_expr) {</div>
|
|
<div class="line"><a name="l02624"></a><span class="lineno"> 2624</span>  <span class="keywordflow">if</span> (Top()->HasIntegerExpressionArgument(</div>
|
|
<div class="line"><a name="l02625"></a><span class="lineno"> 2625</span>  ModelVisitor::kExpressionArgument)) {</div>
|
|
<div class="line"><a name="l02626"></a><span class="lineno"> 2626</span>  <span class="keyword">const</span> IntExpr* <span class="keyword">const</span> expr = Top()->FindIntegerExpressionArgumentOrDie(</div>
|
|
<div class="line"><a name="l02627"></a><span class="lineno"> 2627</span>  ModelVisitor::kExpressionArgument);</div>
|
|
<div class="line"><a name="l02628"></a><span class="lineno"> 2628</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="l02629"></a><span class="lineno"> 2629</span>  Top()->FindIntegerArgumentOrDie(ModelVisitor::kValueArgument);</div>
|
|
<div class="line"><a name="l02630"></a><span class="lineno"> 2630</span>  PushMultiplier(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l02631"></a><span class="lineno"> 2631</span>  VisitSubExpression(expr);</div>
|
|
<div class="line"><a name="l02632"></a><span class="lineno"> 2632</span>  PopMultiplier();</div>
|
|
<div class="line"><a name="l02633"></a><span class="lineno"> 2633</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02634"></a><span class="lineno"> 2634</span>  RegisterExpression(cp_expr, 1);</div>
|
|
<div class="line"><a name="l02635"></a><span class="lineno"> 2635</span>  }</div>
|
|
<div class="line"><a name="l02636"></a><span class="lineno"> 2636</span>  }</div>
|
|
<div class="line"><a name="l02637"></a><span class="lineno"> 2637</span>  </div>
|
|
<div class="line"><a name="l02638"></a><span class="lineno"> 2638</span>  <span class="keywordtype">void</span> VisitTrace(<span class="keyword">const</span> IntExpr* <span class="keyword">const</span> cp_expr) {</div>
|
|
<div class="line"><a name="l02639"></a><span class="lineno"> 2639</span>  <span class="keyword">const</span> IntExpr* <span class="keyword">const</span> expr = Top()->FindIntegerExpressionArgumentOrDie(</div>
|
|
<div class="line"><a name="l02640"></a><span class="lineno"> 2640</span>  ModelVisitor::kExpressionArgument);</div>
|
|
<div class="line"><a name="l02641"></a><span class="lineno"> 2641</span>  VisitSubExpression(expr);</div>
|
|
<div class="line"><a name="l02642"></a><span class="lineno"> 2642</span>  }</div>
|
|
<div class="line"><a name="l02643"></a><span class="lineno"> 2643</span>  </div>
|
|
<div class="line"><a name="l02644"></a><span class="lineno"> 2644</span>  <span class="keywordtype">void</span> VisitIntegerExpression(<span class="keyword">const</span> IntExpr* <span class="keyword">const</span> cp_expr) {</div>
|
|
<div class="line"><a name="l02645"></a><span class="lineno"> 2645</span>  RegisterExpression(cp_expr, 1);</div>
|
|
<div class="line"><a name="l02646"></a><span class="lineno"> 2646</span>  }</div>
|
|
<div class="line"><a name="l02647"></a><span class="lineno"> 2647</span>  </div>
|
|
<div class="line"><a name="l02648"></a><span class="lineno"> 2648</span>  <span class="keywordtype">void</span> RegisterExpression(<span class="keyword">const</span> IntExpr* <span class="keyword">const</span> expr, int64_t <a class="code" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a>) {</div>
|
|
<div class="line"><a name="l02649"></a><span class="lineno"> 2649</span>  int64_t& <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> =</div>
|
|
<div class="line"><a name="l02650"></a><span class="lineno"> 2650</span>  (*variables_to_coefficients_)[<span class="keyword">const_cast<</span>IntExpr*<span class="keyword">></span>(expr)->Var()];</div>
|
|
<div class="line"><a name="l02651"></a><span class="lineno"> 2651</span>  <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(<a class="code" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a>, multipliers_.back()));</div>
|
|
<div class="line"><a name="l02652"></a><span class="lineno"> 2652</span>  }</div>
|
|
<div class="line"><a name="l02653"></a><span class="lineno"> 2653</span>  </div>
|
|
<div class="line"><a name="l02654"></a><span class="lineno"> 2654</span>  <span class="keywordtype">void</span> AddConstant(int64_t constant) {</div>
|
|
<div class="line"><a name="l02655"></a><span class="lineno"> 2655</span>  constant_ = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(constant_, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(constant, multipliers_.back()));</div>
|
|
<div class="line"><a name="l02656"></a><span class="lineno"> 2656</span>  }</div>
|
|
<div class="line"><a name="l02657"></a><span class="lineno"> 2657</span>  </div>
|
|
<div class="line"><a name="l02658"></a><span class="lineno"> 2658</span>  <span class="keywordtype">void</span> PushMultiplier(int64_t multiplier) {</div>
|
|
<div class="line"><a name="l02659"></a><span class="lineno"> 2659</span>  <span class="keywordflow">if</span> (multipliers_.empty()) {</div>
|
|
<div class="line"><a name="l02660"></a><span class="lineno"> 2660</span>  multipliers_.push_back(multiplier);</div>
|
|
<div class="line"><a name="l02661"></a><span class="lineno"> 2661</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02662"></a><span class="lineno"> 2662</span>  multipliers_.push_back(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(multiplier, multipliers_.back()));</div>
|
|
<div class="line"><a name="l02663"></a><span class="lineno"> 2663</span>  }</div>
|
|
<div class="line"><a name="l02664"></a><span class="lineno"> 2664</span>  }</div>
|
|
<div class="line"><a name="l02665"></a><span class="lineno"> 2665</span>  </div>
|
|
<div class="line"><a name="l02666"></a><span class="lineno"> 2666</span>  <span class="keywordtype">void</span> PopMultiplier() { multipliers_.pop_back(); }</div>
|
|
<div class="line"><a name="l02667"></a><span class="lineno"> 2667</span>  </div>
|
|
<div class="line"><a name="l02668"></a><span class="lineno"> 2668</span>  <span class="comment">// We do need a IntVar* as key, and not const IntVar*, because clients of this</span></div>
|
|
<div class="line"><a name="l02669"></a><span class="lineno"> 2669</span>  <span class="comment">// class typically iterate over the map keys and use them as mutable IntVar*.</span></div>
|
|
<div class="line"><a name="l02670"></a><span class="lineno"> 2670</span>  absl::flat_hash_map<IntVar*, int64_t>* <span class="keyword">const</span> variables_to_coefficients_;</div>
|
|
<div class="line"><a name="l02671"></a><span class="lineno"> 2671</span>  std::vector<int64_t> multipliers_;</div>
|
|
<div class="line"><a name="l02672"></a><span class="lineno"> 2672</span>  int64_t constant_;</div>
|
|
<div class="line"><a name="l02673"></a><span class="lineno"> 2673</span> };</div>
|
|
<div class="line"><a name="l02674"></a><span class="lineno"> 2674</span> <span class="preprocessor">#undef IS_TYPE</span></div>
|
|
<div class="line"><a name="l02675"></a><span class="lineno"> 2675</span>  </div>
|
|
<div class="line"><a name="l02676"></a><span class="lineno"> 2676</span> <span class="comment">// ----- Factory functions -----</span></div>
|
|
<div class="line"><a name="l02677"></a><span class="lineno"> 2677</span>  </div>
|
|
<div class="line"><a name="l02678"></a><span class="lineno"> 2678</span> <span class="keywordtype">void</span> DeepLinearize(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& pre_vars,</div>
|
|
<div class="line"><a name="l02679"></a><span class="lineno"> 2679</span>  <span class="keyword">const</span> std::vector<int64_t>& pre_coefs,</div>
|
|
<div class="line"><a name="l02680"></a><span class="lineno"> 2680</span>  std::vector<IntVar*>* vars, std::vector<int64_t>* coefs,</div>
|
|
<div class="line"><a name="l02681"></a><span class="lineno"> 2681</span>  int64_t* constant) {</div>
|
|
<div class="line"><a name="l02682"></a><span class="lineno"> 2682</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(solver != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l02683"></a><span class="lineno"> 2683</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(vars != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l02684"></a><span class="lineno"> 2684</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(coefs != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l02685"></a><span class="lineno"> 2685</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(constant != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l02686"></a><span class="lineno"> 2686</span>  *constant = 0;</div>
|
|
<div class="line"><a name="l02687"></a><span class="lineno"> 2687</span>  vars->reserve(pre_vars.size());</div>
|
|
<div class="line"><a name="l02688"></a><span class="lineno"> 2688</span>  coefs->reserve(pre_coefs.size());</div>
|
|
<div class="line"><a name="l02689"></a><span class="lineno"> 2689</span>  <span class="comment">// Try linear scan of the variables to check if there is nothing to do.</span></div>
|
|
<div class="line"><a name="l02690"></a><span class="lineno"> 2690</span>  <span class="keywordtype">bool</span> need_linearization = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02691"></a><span class="lineno"> 2691</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < pre_vars.size(); ++i) {</div>
|
|
<div class="line"><a name="l02692"></a><span class="lineno"> 2692</span>  IntVar* <span class="keyword">const</span> variable = pre_vars[i];</div>
|
|
<div class="line"><a name="l02693"></a><span class="lineno"> 2693</span>  <span class="keyword">const</span> int64_t <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> = pre_coefs[i];</div>
|
|
<div class="line"><a name="l02694"></a><span class="lineno"> 2694</span>  <span class="keywordflow">if</span> (variable->Bound()) {</div>
|
|
<div class="line"><a name="l02695"></a><span class="lineno"> 2695</span>  *constant = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(*constant, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(<a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>, variable->Min()));</div>
|
|
<div class="line"><a name="l02696"></a><span class="lineno"> 2696</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (solver->CastExpression(variable) == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l02697"></a><span class="lineno"> 2697</span>  vars->push_back(variable);</div>
|
|
<div class="line"><a name="l02698"></a><span class="lineno"> 2698</span>  coefs->push_back(<a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>);</div>
|
|
<div class="line"><a name="l02699"></a><span class="lineno"> 2699</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02700"></a><span class="lineno"> 2700</span>  need_linearization = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02701"></a><span class="lineno"> 2701</span>  vars->clear();</div>
|
|
<div class="line"><a name="l02702"></a><span class="lineno"> 2702</span>  coefs->clear();</div>
|
|
<div class="line"><a name="l02703"></a><span class="lineno"> 2703</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02704"></a><span class="lineno"> 2704</span>  }</div>
|
|
<div class="line"><a name="l02705"></a><span class="lineno"> 2705</span>  }</div>
|
|
<div class="line"><a name="l02706"></a><span class="lineno"> 2706</span>  <span class="keywordflow">if</span> (need_linearization) {</div>
|
|
<div class="line"><a name="l02707"></a><span class="lineno"> 2707</span>  <span class="comment">// Instrospect the variables to simplify the sum.</span></div>
|
|
<div class="line"><a name="l02708"></a><span class="lineno"> 2708</span>  absl::flat_hash_map<IntVar*, int64_t> variables_to_coefficients;</div>
|
|
<div class="line"><a name="l02709"></a><span class="lineno"> 2709</span>  ExprLinearizer linearizer(&variables_to_coefficients);</div>
|
|
<div class="line"><a name="l02710"></a><span class="lineno"> 2710</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < pre_vars.size(); ++i) {</div>
|
|
<div class="line"><a name="l02711"></a><span class="lineno"> 2711</span>  linearizer.Visit(pre_vars[i], pre_coefs[i]);</div>
|
|
<div class="line"><a name="l02712"></a><span class="lineno"> 2712</span>  }</div>
|
|
<div class="line"><a name="l02713"></a><span class="lineno"> 2713</span>  *constant = linearizer.Constant();</div>
|
|
<div class="line"><a name="l02714"></a><span class="lineno"> 2714</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& variable_to_coefficient : variables_to_coefficients) {</div>
|
|
<div class="line"><a name="l02715"></a><span class="lineno"> 2715</span>  <span class="keywordflow">if</span> (variable_to_coefficient.second != 0) {</div>
|
|
<div class="line"><a name="l02716"></a><span class="lineno"> 2716</span>  vars->push_back(variable_to_coefficient.first);</div>
|
|
<div class="line"><a name="l02717"></a><span class="lineno"> 2717</span>  coefs->push_back(variable_to_coefficient.second);</div>
|
|
<div class="line"><a name="l02718"></a><span class="lineno"> 2718</span>  }</div>
|
|
<div class="line"><a name="l02719"></a><span class="lineno"> 2719</span>  }</div>
|
|
<div class="line"><a name="l02720"></a><span class="lineno"> 2720</span>  }</div>
|
|
<div class="line"><a name="l02721"></a><span class="lineno"> 2721</span> }</div>
|
|
<div class="line"><a name="l02722"></a><span class="lineno"> 2722</span>  </div>
|
|
<div class="line"><a name="l02723"></a><span class="lineno"> 2723</span> Constraint* MakeScalProdEqualityFct(Solver* <span class="keyword">const</span> solver,</div>
|
|
<div class="line"><a name="l02724"></a><span class="lineno"> 2724</span>  <span class="keyword">const</span> std::vector<IntVar*>& pre_vars,</div>
|
|
<div class="line"><a name="l02725"></a><span class="lineno"> 2725</span>  <span class="keyword">const</span> std::vector<int64_t>& pre_coefs,</div>
|
|
<div class="line"><a name="l02726"></a><span class="lineno"> 2726</span>  int64_t cst) {</div>
|
|
<div class="line"><a name="l02727"></a><span class="lineno"> 2727</span>  int64_t constant = 0;</div>
|
|
<div class="line"><a name="l02728"></a><span class="lineno"> 2728</span>  std::vector<IntVar*> vars;</div>
|
|
<div class="line"><a name="l02729"></a><span class="lineno"> 2729</span>  std::vector<int64_t> coefs;</div>
|
|
<div class="line"><a name="l02730"></a><span class="lineno"> 2730</span>  DeepLinearize(solver, pre_vars, pre_coefs, &vars, &coefs, &constant);</div>
|
|
<div class="line"><a name="l02731"></a><span class="lineno"> 2731</span>  cst = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cst, constant);</div>
|
|
<div class="line"><a name="l02732"></a><span class="lineno"> 2732</span>  </div>
|
|
<div class="line"><a name="l02733"></a><span class="lineno"> 2733</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l02734"></a><span class="lineno"> 2734</span>  <span class="keywordflow">if</span> (size == 0 || <a class="code" href="namespaceoperations__research.html#ab0ae787392a8dd8a499eb55ac0916aa4">AreAllNull</a>(coefs)) {</div>
|
|
<div class="line"><a name="l02735"></a><span class="lineno"> 2735</span>  <span class="keywordflow">return</span> cst == 0 ? solver->MakeTrueConstraint()</div>
|
|
<div class="line"><a name="l02736"></a><span class="lineno"> 2736</span>  : solver->MakeFalseConstraint();</div>
|
|
<div class="line"><a name="l02737"></a><span class="lineno"> 2737</span>  }</div>
|
|
<div class="line"><a name="l02738"></a><span class="lineno"> 2738</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a54470bffc3ea32cc37d0222e5dbb62a6">AreAllBoundOrNull</a>(vars, coefs)) {</div>
|
|
<div class="line"><a name="l02739"></a><span class="lineno"> 2739</span>  int64_t sum = 0;</div>
|
|
<div class="line"><a name="l02740"></a><span class="lineno"> 2740</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02741"></a><span class="lineno"> 2741</span>  sum = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(coefs[i], vars[i]->Min()));</div>
|
|
<div class="line"><a name="l02742"></a><span class="lineno"> 2742</span>  }</div>
|
|
<div class="line"><a name="l02743"></a><span class="lineno"> 2743</span>  <span class="keywordflow">return</span> sum == cst ? solver->MakeTrueConstraint()</div>
|
|
<div class="line"><a name="l02744"></a><span class="lineno"> 2744</span>  : solver->MakeFalseConstraint();</div>
|
|
<div class="line"><a name="l02745"></a><span class="lineno"> 2745</span>  }</div>
|
|
<div class="line"><a name="l02746"></a><span class="lineno"> 2746</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#ae3e4f71c4c79e0b4ec00c4e715a7c298">AreAllOnes</a>(coefs)) {</div>
|
|
<div class="line"><a name="l02747"></a><span class="lineno"> 2747</span>  <span class="keywordflow">return</span> solver->MakeSumEquality(vars, cst);</div>
|
|
<div class="line"><a name="l02748"></a><span class="lineno"> 2748</span>  }</div>
|
|
<div class="line"><a name="l02749"></a><span class="lineno"> 2749</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars) && size > 2) {</div>
|
|
<div class="line"><a name="l02750"></a><span class="lineno"> 2750</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#ab62b402f767cda48eb67ef8b50397f8f">AreAllPositive</a>(coefs)) {</div>
|
|
<div class="line"><a name="l02751"></a><span class="lineno"> 2751</span>  <span class="keywordflow">return</span> solver->RevAlloc(</div>
|
|
<div class="line"><a name="l02752"></a><span class="lineno"> 2752</span>  <span class="keyword">new</span> PositiveBooleanScalProdEqCst(solver, vars, coefs, cst));</div>
|
|
<div class="line"><a name="l02753"></a><span class="lineno"> 2753</span>  }</div>
|
|
<div class="line"><a name="l02754"></a><span class="lineno"> 2754</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a38972723946490ea4df4e34298d8805d">AreAllNegative</a>(coefs)) {</div>
|
|
<div class="line"><a name="l02755"></a><span class="lineno"> 2755</span>  std::vector<int64_t> opp_coefs(coefs.size());</div>
|
|
<div class="line"><a name="l02756"></a><span class="lineno"> 2756</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < coefs.size(); ++i) {</div>
|
|
<div class="line"><a name="l02757"></a><span class="lineno"> 2757</span>  opp_coefs[i] = -coefs[i];</div>
|
|
<div class="line"><a name="l02758"></a><span class="lineno"> 2758</span>  }</div>
|
|
<div class="line"><a name="l02759"></a><span class="lineno"> 2759</span>  <span class="keywordflow">return</span> solver->RevAlloc(</div>
|
|
<div class="line"><a name="l02760"></a><span class="lineno"> 2760</span>  <span class="keyword">new</span> PositiveBooleanScalProdEqCst(solver, vars, opp_coefs, -cst));</div>
|
|
<div class="line"><a name="l02761"></a><span class="lineno"> 2761</span>  }</div>
|
|
<div class="line"><a name="l02762"></a><span class="lineno"> 2762</span>  }</div>
|
|
<div class="line"><a name="l02763"></a><span class="lineno"> 2763</span>  </div>
|
|
<div class="line"><a name="l02764"></a><span class="lineno"> 2764</span>  <span class="comment">// Simplications.</span></div>
|
|
<div class="line"><a name="l02765"></a><span class="lineno"> 2765</span>  <span class="keywordtype">int</span> constants = 0;</div>
|
|
<div class="line"><a name="l02766"></a><span class="lineno"> 2766</span>  <span class="keywordtype">int</span> positives = 0;</div>
|
|
<div class="line"><a name="l02767"></a><span class="lineno"> 2767</span>  <span class="keywordtype">int</span> negatives = 0;</div>
|
|
<div class="line"><a name="l02768"></a><span class="lineno"> 2768</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02769"></a><span class="lineno"> 2769</span>  <span class="keywordflow">if</span> (coefs[i] == 0 || vars[i]->Bound()) {</div>
|
|
<div class="line"><a name="l02770"></a><span class="lineno"> 2770</span>  constants++;</div>
|
|
<div class="line"><a name="l02771"></a><span class="lineno"> 2771</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs[i] > 0) {</div>
|
|
<div class="line"><a name="l02772"></a><span class="lineno"> 2772</span>  positives++;</div>
|
|
<div class="line"><a name="l02773"></a><span class="lineno"> 2773</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02774"></a><span class="lineno"> 2774</span>  negatives++;</div>
|
|
<div class="line"><a name="l02775"></a><span class="lineno"> 2775</span>  }</div>
|
|
<div class="line"><a name="l02776"></a><span class="lineno"> 2776</span>  }</div>
|
|
<div class="line"><a name="l02777"></a><span class="lineno"> 2777</span>  <span class="keywordflow">if</span> (positives > 0 && negatives > 0) {</div>
|
|
<div class="line"><a name="l02778"></a><span class="lineno"> 2778</span>  std::vector<IntVar*> pos_terms;</div>
|
|
<div class="line"><a name="l02779"></a><span class="lineno"> 2779</span>  std::vector<IntVar*> neg_terms;</div>
|
|
<div class="line"><a name="l02780"></a><span class="lineno"> 2780</span>  int64_t rhs = cst;</div>
|
|
<div class="line"><a name="l02781"></a><span class="lineno"> 2781</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02782"></a><span class="lineno"> 2782</span>  <span class="keywordflow">if</span> (coefs[i] == 0 || vars[i]->Bound()) {</div>
|
|
<div class="line"><a name="l02783"></a><span class="lineno"> 2783</span>  rhs = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(rhs, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(coefs[i], vars[i]->Min()));</div>
|
|
<div class="line"><a name="l02784"></a><span class="lineno"> 2784</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs[i] > 0) {</div>
|
|
<div class="line"><a name="l02785"></a><span class="lineno"> 2785</span>  pos_terms.push_back(solver->MakeProd(vars[i], coefs[i])->Var());</div>
|
|
<div class="line"><a name="l02786"></a><span class="lineno"> 2786</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02787"></a><span class="lineno"> 2787</span>  neg_terms.push_back(solver->MakeProd(vars[i], -coefs[i])->Var());</div>
|
|
<div class="line"><a name="l02788"></a><span class="lineno"> 2788</span>  }</div>
|
|
<div class="line"><a name="l02789"></a><span class="lineno"> 2789</span>  }</div>
|
|
<div class="line"><a name="l02790"></a><span class="lineno"> 2790</span>  <span class="keywordflow">if</span> (negatives == 1) {</div>
|
|
<div class="line"><a name="l02791"></a><span class="lineno"> 2791</span>  <span class="keywordflow">if</span> (rhs != 0) {</div>
|
|
<div class="line"><a name="l02792"></a><span class="lineno"> 2792</span>  pos_terms.push_back(solver->MakeIntConst(-rhs));</div>
|
|
<div class="line"><a name="l02793"></a><span class="lineno"> 2793</span>  }</div>
|
|
<div class="line"><a name="l02794"></a><span class="lineno"> 2794</span>  <span class="keywordflow">return</span> solver->MakeSumEquality(pos_terms, neg_terms[0]);</div>
|
|
<div class="line"><a name="l02795"></a><span class="lineno"> 2795</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (positives == 1) {</div>
|
|
<div class="line"><a name="l02796"></a><span class="lineno"> 2796</span>  <span class="keywordflow">if</span> (rhs != 0) {</div>
|
|
<div class="line"><a name="l02797"></a><span class="lineno"> 2797</span>  neg_terms.push_back(solver->MakeIntConst(rhs));</div>
|
|
<div class="line"><a name="l02798"></a><span class="lineno"> 2798</span>  }</div>
|
|
<div class="line"><a name="l02799"></a><span class="lineno"> 2799</span>  <span class="keywordflow">return</span> solver->MakeSumEquality(neg_terms, pos_terms[0]);</div>
|
|
<div class="line"><a name="l02800"></a><span class="lineno"> 2800</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02801"></a><span class="lineno"> 2801</span>  <span class="keywordflow">if</span> (rhs != 0) {</div>
|
|
<div class="line"><a name="l02802"></a><span class="lineno"> 2802</span>  neg_terms.push_back(solver->MakeIntConst(rhs));</div>
|
|
<div class="line"><a name="l02803"></a><span class="lineno"> 2803</span>  }</div>
|
|
<div class="line"><a name="l02804"></a><span class="lineno"> 2804</span>  <span class="keywordflow">return</span> solver->MakeEquality(solver->MakeSum(pos_terms),</div>
|
|
<div class="line"><a name="l02805"></a><span class="lineno"> 2805</span>  solver->MakeSum(neg_terms));</div>
|
|
<div class="line"><a name="l02806"></a><span class="lineno"> 2806</span>  }</div>
|
|
<div class="line"><a name="l02807"></a><span class="lineno"> 2807</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (positives == 1) {</div>
|
|
<div class="line"><a name="l02808"></a><span class="lineno"> 2808</span>  IntExpr* pos_term = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l02809"></a><span class="lineno"> 2809</span>  int64_t rhs = cst;</div>
|
|
<div class="line"><a name="l02810"></a><span class="lineno"> 2810</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02811"></a><span class="lineno"> 2811</span>  <span class="keywordflow">if</span> (coefs[i] == 0 || vars[i]->Bound()) {</div>
|
|
<div class="line"><a name="l02812"></a><span class="lineno"> 2812</span>  rhs = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(rhs, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(coefs[i], vars[i]->Min()));</div>
|
|
<div class="line"><a name="l02813"></a><span class="lineno"> 2813</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs[i] > 0) {</div>
|
|
<div class="line"><a name="l02814"></a><span class="lineno"> 2814</span>  pos_term = solver->MakeProd(vars[i], coefs[i]);</div>
|
|
<div class="line"><a name="l02815"></a><span class="lineno"> 2815</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02816"></a><span class="lineno"> 2816</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should not be here"</span>;</div>
|
|
<div class="line"><a name="l02817"></a><span class="lineno"> 2817</span>  }</div>
|
|
<div class="line"><a name="l02818"></a><span class="lineno"> 2818</span>  }</div>
|
|
<div class="line"><a name="l02819"></a><span class="lineno"> 2819</span>  <span class="keywordflow">return</span> solver->MakeEquality(pos_term, rhs);</div>
|
|
<div class="line"><a name="l02820"></a><span class="lineno"> 2820</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (negatives == 1) {</div>
|
|
<div class="line"><a name="l02821"></a><span class="lineno"> 2821</span>  IntExpr* neg_term = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l02822"></a><span class="lineno"> 2822</span>  int64_t rhs = cst;</div>
|
|
<div class="line"><a name="l02823"></a><span class="lineno"> 2823</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02824"></a><span class="lineno"> 2824</span>  <span class="keywordflow">if</span> (coefs[i] == 0 || vars[i]->Bound()) {</div>
|
|
<div class="line"><a name="l02825"></a><span class="lineno"> 2825</span>  rhs = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(rhs, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(coefs[i], vars[i]->Min()));</div>
|
|
<div class="line"><a name="l02826"></a><span class="lineno"> 2826</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs[i] > 0) {</div>
|
|
<div class="line"><a name="l02827"></a><span class="lineno"> 2827</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should not be here"</span>;</div>
|
|
<div class="line"><a name="l02828"></a><span class="lineno"> 2828</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02829"></a><span class="lineno"> 2829</span>  neg_term = solver->MakeProd(vars[i], -coefs[i]);</div>
|
|
<div class="line"><a name="l02830"></a><span class="lineno"> 2830</span>  }</div>
|
|
<div class="line"><a name="l02831"></a><span class="lineno"> 2831</span>  }</div>
|
|
<div class="line"><a name="l02832"></a><span class="lineno"> 2832</span>  <span class="keywordflow">return</span> solver->MakeEquality(neg_term, -rhs);</div>
|
|
<div class="line"><a name="l02833"></a><span class="lineno"> 2833</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (positives > 1) {</div>
|
|
<div class="line"><a name="l02834"></a><span class="lineno"> 2834</span>  std::vector<IntVar*> pos_terms;</div>
|
|
<div class="line"><a name="l02835"></a><span class="lineno"> 2835</span>  int64_t rhs = cst;</div>
|
|
<div class="line"><a name="l02836"></a><span class="lineno"> 2836</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02837"></a><span class="lineno"> 2837</span>  <span class="keywordflow">if</span> (coefs[i] == 0 || vars[i]->Bound()) {</div>
|
|
<div class="line"><a name="l02838"></a><span class="lineno"> 2838</span>  rhs = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(rhs, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(coefs[i], vars[i]->Min()));</div>
|
|
<div class="line"><a name="l02839"></a><span class="lineno"> 2839</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs[i] > 0) {</div>
|
|
<div class="line"><a name="l02840"></a><span class="lineno"> 2840</span>  pos_terms.push_back(solver->MakeProd(vars[i], coefs[i])->Var());</div>
|
|
<div class="line"><a name="l02841"></a><span class="lineno"> 2841</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02842"></a><span class="lineno"> 2842</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should not be here"</span>;</div>
|
|
<div class="line"><a name="l02843"></a><span class="lineno"> 2843</span>  }</div>
|
|
<div class="line"><a name="l02844"></a><span class="lineno"> 2844</span>  }</div>
|
|
<div class="line"><a name="l02845"></a><span class="lineno"> 2845</span>  <span class="keywordflow">return</span> solver->MakeSumEquality(pos_terms, rhs);</div>
|
|
<div class="line"><a name="l02846"></a><span class="lineno"> 2846</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (negatives > 1) {</div>
|
|
<div class="line"><a name="l02847"></a><span class="lineno"> 2847</span>  std::vector<IntVar*> neg_terms;</div>
|
|
<div class="line"><a name="l02848"></a><span class="lineno"> 2848</span>  int64_t rhs = cst;</div>
|
|
<div class="line"><a name="l02849"></a><span class="lineno"> 2849</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02850"></a><span class="lineno"> 2850</span>  <span class="keywordflow">if</span> (coefs[i] == 0 || vars[i]->Bound()) {</div>
|
|
<div class="line"><a name="l02851"></a><span class="lineno"> 2851</span>  rhs = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(rhs, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(coefs[i], vars[i]->Min()));</div>
|
|
<div class="line"><a name="l02852"></a><span class="lineno"> 2852</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs[i] > 0) {</div>
|
|
<div class="line"><a name="l02853"></a><span class="lineno"> 2853</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should not be here"</span>;</div>
|
|
<div class="line"><a name="l02854"></a><span class="lineno"> 2854</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02855"></a><span class="lineno"> 2855</span>  neg_terms.push_back(solver->MakeProd(vars[i], -coefs[i])->Var());</div>
|
|
<div class="line"><a name="l02856"></a><span class="lineno"> 2856</span>  }</div>
|
|
<div class="line"><a name="l02857"></a><span class="lineno"> 2857</span>  }</div>
|
|
<div class="line"><a name="l02858"></a><span class="lineno"> 2858</span>  <span class="keywordflow">return</span> solver->MakeSumEquality(neg_terms, -rhs);</div>
|
|
<div class="line"><a name="l02859"></a><span class="lineno"> 2859</span>  }</div>
|
|
<div class="line"><a name="l02860"></a><span class="lineno"> 2860</span>  std::vector<IntVar*> terms;</div>
|
|
<div class="line"><a name="l02861"></a><span class="lineno"> 2861</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02862"></a><span class="lineno"> 2862</span>  terms.push_back(solver->MakeProd(vars[i], coefs[i])->Var());</div>
|
|
<div class="line"><a name="l02863"></a><span class="lineno"> 2863</span>  }</div>
|
|
<div class="line"><a name="l02864"></a><span class="lineno"> 2864</span>  <span class="keywordflow">return</span> solver->MakeSumEquality(terms, solver->MakeIntConst(cst));</div>
|
|
<div class="line"><a name="l02865"></a><span class="lineno"> 2865</span> }</div>
|
|
<div class="line"><a name="l02866"></a><span class="lineno"> 2866</span>  </div>
|
|
<div class="line"><a name="l02867"></a><span class="lineno"> 2867</span> Constraint* MakeScalProdEqualityVarFct(Solver* <span class="keyword">const</span> solver,</div>
|
|
<div class="line"><a name="l02868"></a><span class="lineno"> 2868</span>  <span class="keyword">const</span> std::vector<IntVar*>& pre_vars,</div>
|
|
<div class="line"><a name="l02869"></a><span class="lineno"> 2869</span>  <span class="keyword">const</span> std::vector<int64_t>& pre_coefs,</div>
|
|
<div class="line"><a name="l02870"></a><span class="lineno"> 2870</span>  IntVar* <span class="keyword">const</span> target) {</div>
|
|
<div class="line"><a name="l02871"></a><span class="lineno"> 2871</span>  int64_t constant = 0;</div>
|
|
<div class="line"><a name="l02872"></a><span class="lineno"> 2872</span>  std::vector<IntVar*> vars;</div>
|
|
<div class="line"><a name="l02873"></a><span class="lineno"> 2873</span>  std::vector<int64_t> coefs;</div>
|
|
<div class="line"><a name="l02874"></a><span class="lineno"> 2874</span>  DeepLinearize(solver, pre_vars, pre_coefs, &vars, &coefs, &constant);</div>
|
|
<div class="line"><a name="l02875"></a><span class="lineno"> 2875</span>  </div>
|
|
<div class="line"><a name="l02876"></a><span class="lineno"> 2876</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l02877"></a><span class="lineno"> 2877</span>  <span class="keywordflow">if</span> (size == 0 || AreAllNull<int64_t>(coefs)) {</div>
|
|
<div class="line"><a name="l02878"></a><span class="lineno"> 2878</span>  <span class="keywordflow">return</span> solver->MakeEquality(target, constant);</div>
|
|
<div class="line"><a name="l02879"></a><span class="lineno"> 2879</span>  }</div>
|
|
<div class="line"><a name="l02880"></a><span class="lineno"> 2880</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#ae3e4f71c4c79e0b4ec00c4e715a7c298">AreAllOnes</a>(coefs)) {</div>
|
|
<div class="line"><a name="l02881"></a><span class="lineno"> 2881</span>  <span class="keywordflow">return</span> solver->MakeSumEquality(vars,</div>
|
|
<div class="line"><a name="l02882"></a><span class="lineno"> 2882</span>  solver->MakeSum(target, -constant)->Var());</div>
|
|
<div class="line"><a name="l02883"></a><span class="lineno"> 2883</span>  }</div>
|
|
<div class="line"><a name="l02884"></a><span class="lineno"> 2884</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars) && AreAllPositive<int64_t>(coefs)) {</div>
|
|
<div class="line"><a name="l02885"></a><span class="lineno"> 2885</span>  <span class="comment">// TODO(user) : bench BooleanScalProdEqVar with IntConst.</span></div>
|
|
<div class="line"><a name="l02886"></a><span class="lineno"> 2886</span>  <span class="keywordflow">return</span> solver->RevAlloc(<span class="keyword">new</span> PositiveBooleanScalProdEqVar(</div>
|
|
<div class="line"><a name="l02887"></a><span class="lineno"> 2887</span>  solver, vars, coefs, solver->MakeSum(target, -constant)->Var()));</div>
|
|
<div class="line"><a name="l02888"></a><span class="lineno"> 2888</span>  }</div>
|
|
<div class="line"><a name="l02889"></a><span class="lineno"> 2889</span>  std::vector<IntVar*> terms;</div>
|
|
<div class="line"><a name="l02890"></a><span class="lineno"> 2890</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02891"></a><span class="lineno"> 2891</span>  terms.push_back(solver->MakeProd(vars[i], coefs[i])->Var());</div>
|
|
<div class="line"><a name="l02892"></a><span class="lineno"> 2892</span>  }</div>
|
|
<div class="line"><a name="l02893"></a><span class="lineno"> 2893</span>  <span class="keywordflow">return</span> solver->MakeSumEquality(terms,</div>
|
|
<div class="line"><a name="l02894"></a><span class="lineno"> 2894</span>  solver->MakeSum(target, -constant)->Var());</div>
|
|
<div class="line"><a name="l02895"></a><span class="lineno"> 2895</span> }</div>
|
|
<div class="line"><a name="l02896"></a><span class="lineno"> 2896</span>  </div>
|
|
<div class="line"><a name="l02897"></a><span class="lineno"> 2897</span> Constraint* MakeScalProdGreaterOrEqualFct(Solver* solver,</div>
|
|
<div class="line"><a name="l02898"></a><span class="lineno"> 2898</span>  <span class="keyword">const</span> std::vector<IntVar*>& pre_vars,</div>
|
|
<div class="line"><a name="l02899"></a><span class="lineno"> 2899</span>  <span class="keyword">const</span> std::vector<int64_t>& pre_coefs,</div>
|
|
<div class="line"><a name="l02900"></a><span class="lineno"> 2900</span>  int64_t cst) {</div>
|
|
<div class="line"><a name="l02901"></a><span class="lineno"> 2901</span>  int64_t constant = 0;</div>
|
|
<div class="line"><a name="l02902"></a><span class="lineno"> 2902</span>  std::vector<IntVar*> vars;</div>
|
|
<div class="line"><a name="l02903"></a><span class="lineno"> 2903</span>  std::vector<int64_t> coefs;</div>
|
|
<div class="line"><a name="l02904"></a><span class="lineno"> 2904</span>  DeepLinearize(solver, pre_vars, pre_coefs, &vars, &coefs, &constant);</div>
|
|
<div class="line"><a name="l02905"></a><span class="lineno"> 2905</span>  cst = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cst, constant);</div>
|
|
<div class="line"><a name="l02906"></a><span class="lineno"> 2906</span>  </div>
|
|
<div class="line"><a name="l02907"></a><span class="lineno"> 2907</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l02908"></a><span class="lineno"> 2908</span>  <span class="keywordflow">if</span> (size == 0 || AreAllNull<int64_t>(coefs)) {</div>
|
|
<div class="line"><a name="l02909"></a><span class="lineno"> 2909</span>  <span class="keywordflow">return</span> cst <= 0 ? solver->MakeTrueConstraint()</div>
|
|
<div class="line"><a name="l02910"></a><span class="lineno"> 2910</span>  : solver->MakeFalseConstraint();</div>
|
|
<div class="line"><a name="l02911"></a><span class="lineno"> 2911</span>  }</div>
|
|
<div class="line"><a name="l02912"></a><span class="lineno"> 2912</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#ae3e4f71c4c79e0b4ec00c4e715a7c298">AreAllOnes</a>(coefs)) {</div>
|
|
<div class="line"><a name="l02913"></a><span class="lineno"> 2913</span>  <span class="keywordflow">return</span> solver->MakeSumGreaterOrEqual(vars, cst);</div>
|
|
<div class="line"><a name="l02914"></a><span class="lineno"> 2914</span>  }</div>
|
|
<div class="line"><a name="l02915"></a><span class="lineno"> 2915</span>  <span class="keywordflow">if</span> (cst == 1 && <a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars) && <a class="code" href="namespaceoperations__research.html#ab62b402f767cda48eb67ef8b50397f8f">AreAllPositive</a>(coefs)) {</div>
|
|
<div class="line"><a name="l02916"></a><span class="lineno"> 2916</span>  <span class="comment">// can move all coefs to 1.</span></div>
|
|
<div class="line"><a name="l02917"></a><span class="lineno"> 2917</span>  std::vector<IntVar*> terms;</div>
|
|
<div class="line"><a name="l02918"></a><span class="lineno"> 2918</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02919"></a><span class="lineno"> 2919</span>  <span class="keywordflow">if</span> (coefs[i] > 0) {</div>
|
|
<div class="line"><a name="l02920"></a><span class="lineno"> 2920</span>  terms.push_back(vars[i]);</div>
|
|
<div class="line"><a name="l02921"></a><span class="lineno"> 2921</span>  }</div>
|
|
<div class="line"><a name="l02922"></a><span class="lineno"> 2922</span>  }</div>
|
|
<div class="line"><a name="l02923"></a><span class="lineno"> 2923</span>  <span class="keywordflow">return</span> solver->MakeSumGreaterOrEqual(terms, 1);</div>
|
|
<div class="line"><a name="l02924"></a><span class="lineno"> 2924</span>  }</div>
|
|
<div class="line"><a name="l02925"></a><span class="lineno"> 2925</span>  std::vector<IntVar*> terms;</div>
|
|
<div class="line"><a name="l02926"></a><span class="lineno"> 2926</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02927"></a><span class="lineno"> 2927</span>  terms.push_back(solver->MakeProd(vars[i], coefs[i])->Var());</div>
|
|
<div class="line"><a name="l02928"></a><span class="lineno"> 2928</span>  }</div>
|
|
<div class="line"><a name="l02929"></a><span class="lineno"> 2929</span>  <span class="keywordflow">return</span> solver->MakeSumGreaterOrEqual(terms, cst);</div>
|
|
<div class="line"><a name="l02930"></a><span class="lineno"> 2930</span> }</div>
|
|
<div class="line"><a name="l02931"></a><span class="lineno"> 2931</span>  </div>
|
|
<div class="line"><a name="l02932"></a><span class="lineno"> 2932</span> Constraint* MakeScalProdLessOrEqualFct(Solver* solver,</div>
|
|
<div class="line"><a name="l02933"></a><span class="lineno"> 2933</span>  <span class="keyword">const</span> std::vector<IntVar*>& pre_vars,</div>
|
|
<div class="line"><a name="l02934"></a><span class="lineno"> 2934</span>  <span class="keyword">const</span> std::vector<int64_t>& pre_coefs,</div>
|
|
<div class="line"><a name="l02935"></a><span class="lineno"> 2935</span>  int64_t <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div>
|
|
<div class="line"><a name="l02936"></a><span class="lineno"> 2936</span>  int64_t constant = 0;</div>
|
|
<div class="line"><a name="l02937"></a><span class="lineno"> 2937</span>  std::vector<IntVar*> vars;</div>
|
|
<div class="line"><a name="l02938"></a><span class="lineno"> 2938</span>  std::vector<int64_t> coefs;</div>
|
|
<div class="line"><a name="l02939"></a><span class="lineno"> 2939</span>  DeepLinearize(solver, pre_vars, pre_coefs, &vars, &coefs, &constant);</div>
|
|
<div class="line"><a name="l02940"></a><span class="lineno"> 2940</span>  <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, constant);</div>
|
|
<div class="line"><a name="l02941"></a><span class="lineno"> 2941</span>  </div>
|
|
<div class="line"><a name="l02942"></a><span class="lineno"> 2942</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l02943"></a><span class="lineno"> 2943</span>  <span class="keywordflow">if</span> (size == 0 || AreAllNull<int64_t>(coefs)) {</div>
|
|
<div class="line"><a name="l02944"></a><span class="lineno"> 2944</span>  <span class="keywordflow">return</span> <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> >= 0 ? solver->MakeTrueConstraint()</div>
|
|
<div class="line"><a name="l02945"></a><span class="lineno"> 2945</span>  : solver->MakeFalseConstraint();</div>
|
|
<div class="line"><a name="l02946"></a><span class="lineno"> 2946</span>  }</div>
|
|
<div class="line"><a name="l02947"></a><span class="lineno"> 2947</span>  <span class="comment">// TODO(user) : compute constant on the fly.</span></div>
|
|
<div class="line"><a name="l02948"></a><span class="lineno"> 2948</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a54470bffc3ea32cc37d0222e5dbb62a6">AreAllBoundOrNull</a>(vars, coefs)) {</div>
|
|
<div class="line"><a name="l02949"></a><span class="lineno"> 2949</span>  int64_t cst = 0;</div>
|
|
<div class="line"><a name="l02950"></a><span class="lineno"> 2950</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02951"></a><span class="lineno"> 2951</span>  cst = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(cst, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(vars[i]->Min(), coefs[i]));</div>
|
|
<div class="line"><a name="l02952"></a><span class="lineno"> 2952</span>  }</div>
|
|
<div class="line"><a name="l02953"></a><span class="lineno"> 2953</span>  <span class="keywordflow">return</span> cst <= <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> ? solver->MakeTrueConstraint()</div>
|
|
<div class="line"><a name="l02954"></a><span class="lineno"> 2954</span>  : solver->MakeFalseConstraint();</div>
|
|
<div class="line"><a name="l02955"></a><span class="lineno"> 2955</span>  }</div>
|
|
<div class="line"><a name="l02956"></a><span class="lineno"> 2956</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#ae3e4f71c4c79e0b4ec00c4e715a7c298">AreAllOnes</a>(coefs)) {</div>
|
|
<div class="line"><a name="l02957"></a><span class="lineno"> 2957</span>  <span class="keywordflow">return</span> solver->MakeSumLessOrEqual(vars, <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div>
|
|
<div class="line"><a name="l02958"></a><span class="lineno"> 2958</span>  }</div>
|
|
<div class="line"><a name="l02959"></a><span class="lineno"> 2959</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars) && AreAllPositive<int64_t>(coefs)) {</div>
|
|
<div class="line"><a name="l02960"></a><span class="lineno"> 2960</span>  <span class="keywordflow">return</span> solver->RevAlloc(</div>
|
|
<div class="line"><a name="l02961"></a><span class="lineno"> 2961</span>  <span class="keyword">new</span> BooleanScalProdLessConstant(solver, vars, coefs, <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>));</div>
|
|
<div class="line"><a name="l02962"></a><span class="lineno"> 2962</span>  }</div>
|
|
<div class="line"><a name="l02963"></a><span class="lineno"> 2963</span>  <span class="comment">// Some simplications</span></div>
|
|
<div class="line"><a name="l02964"></a><span class="lineno"> 2964</span>  <span class="keywordtype">int</span> constants = 0;</div>
|
|
<div class="line"><a name="l02965"></a><span class="lineno"> 2965</span>  <span class="keywordtype">int</span> positives = 0;</div>
|
|
<div class="line"><a name="l02966"></a><span class="lineno"> 2966</span>  <span class="keywordtype">int</span> negatives = 0;</div>
|
|
<div class="line"><a name="l02967"></a><span class="lineno"> 2967</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02968"></a><span class="lineno"> 2968</span>  <span class="keywordflow">if</span> (coefs[i] == 0 || vars[i]->Bound()) {</div>
|
|
<div class="line"><a name="l02969"></a><span class="lineno"> 2969</span>  constants++;</div>
|
|
<div class="line"><a name="l02970"></a><span class="lineno"> 2970</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs[i] > 0) {</div>
|
|
<div class="line"><a name="l02971"></a><span class="lineno"> 2971</span>  positives++;</div>
|
|
<div class="line"><a name="l02972"></a><span class="lineno"> 2972</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02973"></a><span class="lineno"> 2973</span>  negatives++;</div>
|
|
<div class="line"><a name="l02974"></a><span class="lineno"> 2974</span>  }</div>
|
|
<div class="line"><a name="l02975"></a><span class="lineno"> 2975</span>  }</div>
|
|
<div class="line"><a name="l02976"></a><span class="lineno"> 2976</span>  <span class="keywordflow">if</span> (positives > 0 && negatives > 0) {</div>
|
|
<div class="line"><a name="l02977"></a><span class="lineno"> 2977</span>  std::vector<IntVar*> pos_terms;</div>
|
|
<div class="line"><a name="l02978"></a><span class="lineno"> 2978</span>  std::vector<IntVar*> neg_terms;</div>
|
|
<div class="line"><a name="l02979"></a><span class="lineno"> 2979</span>  int64_t rhs = <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>;</div>
|
|
<div class="line"><a name="l02980"></a><span class="lineno"> 2980</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02981"></a><span class="lineno"> 2981</span>  <span class="keywordflow">if</span> (coefs[i] == 0 || vars[i]->Bound()) {</div>
|
|
<div class="line"><a name="l02982"></a><span class="lineno"> 2982</span>  rhs = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(rhs, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(coefs[i], vars[i]->Min()));</div>
|
|
<div class="line"><a name="l02983"></a><span class="lineno"> 2983</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs[i] > 0) {</div>
|
|
<div class="line"><a name="l02984"></a><span class="lineno"> 2984</span>  pos_terms.push_back(solver->MakeProd(vars[i], coefs[i])->Var());</div>
|
|
<div class="line"><a name="l02985"></a><span class="lineno"> 2985</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02986"></a><span class="lineno"> 2986</span>  neg_terms.push_back(solver->MakeProd(vars[i], -coefs[i])->Var());</div>
|
|
<div class="line"><a name="l02987"></a><span class="lineno"> 2987</span>  }</div>
|
|
<div class="line"><a name="l02988"></a><span class="lineno"> 2988</span>  }</div>
|
|
<div class="line"><a name="l02989"></a><span class="lineno"> 2989</span>  <span class="keywordflow">if</span> (negatives == 1) {</div>
|
|
<div class="line"><a name="l02990"></a><span class="lineno"> 2990</span>  IntExpr* <span class="keyword">const</span> neg_term = solver->MakeSum(neg_terms[0], rhs);</div>
|
|
<div class="line"><a name="l02991"></a><span class="lineno"> 2991</span>  <span class="keywordflow">return</span> solver->MakeLessOrEqual(solver->MakeSum(pos_terms), neg_term);</div>
|
|
<div class="line"><a name="l02992"></a><span class="lineno"> 2992</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (positives == 1) {</div>
|
|
<div class="line"><a name="l02993"></a><span class="lineno"> 2993</span>  IntExpr* <span class="keyword">const</span> pos_term = solver->MakeSum(pos_terms[0], -rhs);</div>
|
|
<div class="line"><a name="l02994"></a><span class="lineno"> 2994</span>  <span class="keywordflow">return</span> solver->MakeGreaterOrEqual(solver->MakeSum(neg_terms), pos_term);</div>
|
|
<div class="line"><a name="l02995"></a><span class="lineno"> 2995</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02996"></a><span class="lineno"> 2996</span>  <span class="keywordflow">if</span> (rhs != 0) {</div>
|
|
<div class="line"><a name="l02997"></a><span class="lineno"> 2997</span>  neg_terms.push_back(solver->MakeIntConst(rhs));</div>
|
|
<div class="line"><a name="l02998"></a><span class="lineno"> 2998</span>  }</div>
|
|
<div class="line"><a name="l02999"></a><span class="lineno"> 2999</span>  <span class="keywordflow">return</span> solver->MakeLessOrEqual(solver->MakeSum(pos_terms),</div>
|
|
<div class="line"><a name="l03000"></a><span class="lineno"> 3000</span>  solver->MakeSum(neg_terms));</div>
|
|
<div class="line"><a name="l03001"></a><span class="lineno"> 3001</span>  }</div>
|
|
<div class="line"><a name="l03002"></a><span class="lineno"> 3002</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (positives == 1) {</div>
|
|
<div class="line"><a name="l03003"></a><span class="lineno"> 3003</span>  IntExpr* pos_term = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l03004"></a><span class="lineno"> 3004</span>  int64_t rhs = <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>;</div>
|
|
<div class="line"><a name="l03005"></a><span class="lineno"> 3005</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l03006"></a><span class="lineno"> 3006</span>  <span class="keywordflow">if</span> (coefs[i] == 0 || vars[i]->Bound()) {</div>
|
|
<div class="line"><a name="l03007"></a><span class="lineno"> 3007</span>  rhs = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(rhs, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(coefs[i], vars[i]->Min()));</div>
|
|
<div class="line"><a name="l03008"></a><span class="lineno"> 3008</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs[i] > 0) {</div>
|
|
<div class="line"><a name="l03009"></a><span class="lineno"> 3009</span>  pos_term = solver->MakeProd(vars[i], coefs[i]);</div>
|
|
<div class="line"><a name="l03010"></a><span class="lineno"> 3010</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03011"></a><span class="lineno"> 3011</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should not be here"</span>;</div>
|
|
<div class="line"><a name="l03012"></a><span class="lineno"> 3012</span>  }</div>
|
|
<div class="line"><a name="l03013"></a><span class="lineno"> 3013</span>  }</div>
|
|
<div class="line"><a name="l03014"></a><span class="lineno"> 3014</span>  <span class="keywordflow">return</span> solver->MakeLessOrEqual(pos_term, rhs);</div>
|
|
<div class="line"><a name="l03015"></a><span class="lineno"> 3015</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (negatives == 1) {</div>
|
|
<div class="line"><a name="l03016"></a><span class="lineno"> 3016</span>  IntExpr* neg_term = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l03017"></a><span class="lineno"> 3017</span>  int64_t rhs = <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>;</div>
|
|
<div class="line"><a name="l03018"></a><span class="lineno"> 3018</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l03019"></a><span class="lineno"> 3019</span>  <span class="keywordflow">if</span> (coefs[i] == 0 || vars[i]->Bound()) {</div>
|
|
<div class="line"><a name="l03020"></a><span class="lineno"> 3020</span>  rhs = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(rhs, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(coefs[i], vars[i]->Min()));</div>
|
|
<div class="line"><a name="l03021"></a><span class="lineno"> 3021</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs[i] > 0) {</div>
|
|
<div class="line"><a name="l03022"></a><span class="lineno"> 3022</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should not be here"</span>;</div>
|
|
<div class="line"><a name="l03023"></a><span class="lineno"> 3023</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03024"></a><span class="lineno"> 3024</span>  neg_term = solver->MakeProd(vars[i], -coefs[i]);</div>
|
|
<div class="line"><a name="l03025"></a><span class="lineno"> 3025</span>  }</div>
|
|
<div class="line"><a name="l03026"></a><span class="lineno"> 3026</span>  }</div>
|
|
<div class="line"><a name="l03027"></a><span class="lineno"> 3027</span>  <span class="keywordflow">return</span> solver->MakeGreaterOrEqual(neg_term, -rhs);</div>
|
|
<div class="line"><a name="l03028"></a><span class="lineno"> 3028</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (positives > 1) {</div>
|
|
<div class="line"><a name="l03029"></a><span class="lineno"> 3029</span>  std::vector<IntVar*> pos_terms;</div>
|
|
<div class="line"><a name="l03030"></a><span class="lineno"> 3030</span>  int64_t rhs = <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>;</div>
|
|
<div class="line"><a name="l03031"></a><span class="lineno"> 3031</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l03032"></a><span class="lineno"> 3032</span>  <span class="keywordflow">if</span> (coefs[i] == 0 || vars[i]->Bound()) {</div>
|
|
<div class="line"><a name="l03033"></a><span class="lineno"> 3033</span>  rhs = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(rhs, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(coefs[i], vars[i]->Min()));</div>
|
|
<div class="line"><a name="l03034"></a><span class="lineno"> 3034</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs[i] > 0) {</div>
|
|
<div class="line"><a name="l03035"></a><span class="lineno"> 3035</span>  pos_terms.push_back(solver->MakeProd(vars[i], coefs[i])->Var());</div>
|
|
<div class="line"><a name="l03036"></a><span class="lineno"> 3036</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03037"></a><span class="lineno"> 3037</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should not be here"</span>;</div>
|
|
<div class="line"><a name="l03038"></a><span class="lineno"> 3038</span>  }</div>
|
|
<div class="line"><a name="l03039"></a><span class="lineno"> 3039</span>  }</div>
|
|
<div class="line"><a name="l03040"></a><span class="lineno"> 3040</span>  <span class="keywordflow">return</span> solver->MakeSumLessOrEqual(pos_terms, rhs);</div>
|
|
<div class="line"><a name="l03041"></a><span class="lineno"> 3041</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (negatives > 1) {</div>
|
|
<div class="line"><a name="l03042"></a><span class="lineno"> 3042</span>  std::vector<IntVar*> neg_terms;</div>
|
|
<div class="line"><a name="l03043"></a><span class="lineno"> 3043</span>  int64_t rhs = <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>;</div>
|
|
<div class="line"><a name="l03044"></a><span class="lineno"> 3044</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l03045"></a><span class="lineno"> 3045</span>  <span class="keywordflow">if</span> (coefs[i] == 0 || vars[i]->Bound()) {</div>
|
|
<div class="line"><a name="l03046"></a><span class="lineno"> 3046</span>  rhs = <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(rhs, <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(coefs[i], vars[i]->Min()));</div>
|
|
<div class="line"><a name="l03047"></a><span class="lineno"> 3047</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs[i] > 0) {</div>
|
|
<div class="line"><a name="l03048"></a><span class="lineno"> 3048</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should not be here"</span>;</div>
|
|
<div class="line"><a name="l03049"></a><span class="lineno"> 3049</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03050"></a><span class="lineno"> 3050</span>  neg_terms.push_back(solver->MakeProd(vars[i], -coefs[i])->Var());</div>
|
|
<div class="line"><a name="l03051"></a><span class="lineno"> 3051</span>  }</div>
|
|
<div class="line"><a name="l03052"></a><span class="lineno"> 3052</span>  }</div>
|
|
<div class="line"><a name="l03053"></a><span class="lineno"> 3053</span>  <span class="keywordflow">return</span> solver->MakeSumGreaterOrEqual(neg_terms, -rhs);</div>
|
|
<div class="line"><a name="l03054"></a><span class="lineno"> 3054</span>  }</div>
|
|
<div class="line"><a name="l03055"></a><span class="lineno"> 3055</span>  std::vector<IntVar*> terms;</div>
|
|
<div class="line"><a name="l03056"></a><span class="lineno"> 3056</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l03057"></a><span class="lineno"> 3057</span>  terms.push_back(solver->MakeProd(vars[i], coefs[i])->Var());</div>
|
|
<div class="line"><a name="l03058"></a><span class="lineno"> 3058</span>  }</div>
|
|
<div class="line"><a name="l03059"></a><span class="lineno"> 3059</span>  <span class="keywordflow">return</span> solver->MakeLessOrEqual(solver->MakeSum(terms), <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div>
|
|
<div class="line"><a name="l03060"></a><span class="lineno"> 3060</span> }</div>
|
|
<div class="line"><a name="l03061"></a><span class="lineno"> 3061</span>  </div>
|
|
<div class="line"><a name="l03062"></a><span class="lineno"> 3062</span> IntExpr* MakeSumArrayAux(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l03063"></a><span class="lineno"> 3063</span>  int64_t constant) {</div>
|
|
<div class="line"><a name="l03064"></a><span class="lineno"> 3064</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l03065"></a><span class="lineno"> 3065</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(size, 2);</div>
|
|
<div class="line"><a name="l03066"></a><span class="lineno"> 3066</span>  int64_t new_min = 0;</div>
|
|
<div class="line"><a name="l03067"></a><span class="lineno"> 3067</span>  int64_t new_max = 0;</div>
|
|
<div class="line"><a name="l03068"></a><span class="lineno"> 3068</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l03069"></a><span class="lineno"> 3069</span>  <span class="keywordflow">if</span> (new_min != <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>()) {</div>
|
|
<div class="line"><a name="l03070"></a><span class="lineno"> 3070</span>  new_min = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(vars[i]->Min(), new_min);</div>
|
|
<div class="line"><a name="l03071"></a><span class="lineno"> 3071</span>  }</div>
|
|
<div class="line"><a name="l03072"></a><span class="lineno"> 3072</span>  <span class="keywordflow">if</span> (new_max != <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a name="l03073"></a><span class="lineno"> 3073</span>  new_max = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(vars[i]->Max(), new_max);</div>
|
|
<div class="line"><a name="l03074"></a><span class="lineno"> 3074</span>  }</div>
|
|
<div class="line"><a name="l03075"></a><span class="lineno"> 3075</span>  }</div>
|
|
<div class="line"><a name="l03076"></a><span class="lineno"> 3076</span>  IntExpr* <span class="keyword">const</span> cache =</div>
|
|
<div class="line"><a name="l03077"></a><span class="lineno"> 3077</span>  solver->Cache()->FindVarArrayExpression(vars, ModelCache::VAR_ARRAY_SUM);</div>
|
|
<div class="line"><a name="l03078"></a><span class="lineno"> 3078</span>  <span class="keywordflow">if</span> (cache != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l03079"></a><span class="lineno"> 3079</span>  <span class="keywordflow">return</span> solver->MakeSum(cache, constant);</div>
|
|
<div class="line"><a name="l03080"></a><span class="lineno"> 3080</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03081"></a><span class="lineno"> 3081</span>  <span class="keyword">const</span> std::string <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a> =</div>
|
|
<div class="line"><a name="l03082"></a><span class="lineno"> 3082</span>  absl::StrFormat(<span class="stringliteral">"Sum([%s])"</span>, <a class="code" href="namespaceoperations__research.html#aea04391e4d85555ed4fde9b89e8139f2">JoinNamePtr</a>(vars, <span class="stringliteral">", "</span>));</div>
|
|
<div class="line"><a name="l03083"></a><span class="lineno"> 3083</span>  IntVar* <span class="keyword">const</span> sum_var = solver->MakeIntVar(new_min, new_max, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>);</div>
|
|
<div class="line"><a name="l03084"></a><span class="lineno"> 3084</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars)) {</div>
|
|
<div class="line"><a name="l03085"></a><span class="lineno"> 3085</span>  solver->AddConstraint(</div>
|
|
<div class="line"><a name="l03086"></a><span class="lineno"> 3086</span>  solver->RevAlloc(<span class="keyword">new</span> SumBooleanEqualToVar(solver, vars, sum_var)));</div>
|
|
<div class="line"><a name="l03087"></a><span class="lineno"> 3087</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size <= solver-><a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>().array_split_size()) {</div>
|
|
<div class="line"><a name="l03088"></a><span class="lineno"> 3088</span>  solver->AddConstraint(</div>
|
|
<div class="line"><a name="l03089"></a><span class="lineno"> 3089</span>  solver->RevAlloc(<span class="keyword">new</span> SmallSumConstraint(solver, vars, sum_var)));</div>
|
|
<div class="line"><a name="l03090"></a><span class="lineno"> 3090</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03091"></a><span class="lineno"> 3091</span>  solver->AddConstraint(</div>
|
|
<div class="line"><a name="l03092"></a><span class="lineno"> 3092</span>  solver->RevAlloc(<span class="keyword">new</span> SumConstraint(solver, vars, sum_var)));</div>
|
|
<div class="line"><a name="l03093"></a><span class="lineno"> 3093</span>  }</div>
|
|
<div class="line"><a name="l03094"></a><span class="lineno"> 3094</span>  solver->Cache()->InsertVarArrayExpression(sum_var, vars,</div>
|
|
<div class="line"><a name="l03095"></a><span class="lineno"> 3095</span>  ModelCache::VAR_ARRAY_SUM);</div>
|
|
<div class="line"><a name="l03096"></a><span class="lineno"> 3096</span>  <span class="keywordflow">return</span> solver->MakeSum(sum_var, constant);</div>
|
|
<div class="line"><a name="l03097"></a><span class="lineno"> 3097</span>  }</div>
|
|
<div class="line"><a name="l03098"></a><span class="lineno"> 3098</span> }</div>
|
|
<div class="line"><a name="l03099"></a><span class="lineno"> 3099</span>  </div>
|
|
<div class="line"><a name="l03100"></a><span class="lineno"> 3100</span> IntExpr* MakeSumAux(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l03101"></a><span class="lineno"> 3101</span>  int64_t constant) {</div>
|
|
<div class="line"><a name="l03102"></a><span class="lineno"> 3102</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l03103"></a><span class="lineno"> 3103</span>  <span class="keywordflow">if</span> (size == 0) {</div>
|
|
<div class="line"><a name="l03104"></a><span class="lineno"> 3104</span>  <span class="keywordflow">return</span> solver->MakeIntConst(constant);</div>
|
|
<div class="line"><a name="l03105"></a><span class="lineno"> 3105</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 1) {</div>
|
|
<div class="line"><a name="l03106"></a><span class="lineno"> 3106</span>  <span class="keywordflow">return</span> solver->MakeSum(vars[0], constant);</div>
|
|
<div class="line"><a name="l03107"></a><span class="lineno"> 3107</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 2) {</div>
|
|
<div class="line"><a name="l03108"></a><span class="lineno"> 3108</span>  <span class="keywordflow">return</span> solver->MakeSum(solver->MakeSum(vars[0], vars[1]), constant);</div>
|
|
<div class="line"><a name="l03109"></a><span class="lineno"> 3109</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03110"></a><span class="lineno"> 3110</span>  <span class="keywordflow">return</span> MakeSumArrayAux(solver, vars, constant);</div>
|
|
<div class="line"><a name="l03111"></a><span class="lineno"> 3111</span>  }</div>
|
|
<div class="line"><a name="l03112"></a><span class="lineno"> 3112</span> }</div>
|
|
<div class="line"><a name="l03113"></a><span class="lineno"> 3113</span>  </div>
|
|
<div class="line"><a name="l03114"></a><span class="lineno"> 3114</span> IntExpr* MakeScalProdAux(Solver* solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l03115"></a><span class="lineno"> 3115</span>  <span class="keyword">const</span> std::vector<int64_t>& coefs, int64_t constant) {</div>
|
|
<div class="line"><a name="l03116"></a><span class="lineno"> 3116</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#ae3e4f71c4c79e0b4ec00c4e715a7c298">AreAllOnes</a>(coefs)) {</div>
|
|
<div class="line"><a name="l03117"></a><span class="lineno"> 3117</span>  <span class="keywordflow">return</span> MakeSumAux(solver, vars, constant);</div>
|
|
<div class="line"><a name="l03118"></a><span class="lineno"> 3118</span>  }</div>
|
|
<div class="line"><a name="l03119"></a><span class="lineno"> 3119</span>  </div>
|
|
<div class="line"><a name="l03120"></a><span class="lineno"> 3120</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l03121"></a><span class="lineno"> 3121</span>  <span class="keywordflow">if</span> (size == 0) {</div>
|
|
<div class="line"><a name="l03122"></a><span class="lineno"> 3122</span>  <span class="keywordflow">return</span> solver->MakeIntConst(constant);</div>
|
|
<div class="line"><a name="l03123"></a><span class="lineno"> 3123</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 1) {</div>
|
|
<div class="line"><a name="l03124"></a><span class="lineno"> 3124</span>  <span class="keywordflow">return</span> solver->MakeSum(solver->MakeProd(vars[0], coefs[0]), constant);</div>
|
|
<div class="line"><a name="l03125"></a><span class="lineno"> 3125</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 2) {</div>
|
|
<div class="line"><a name="l03126"></a><span class="lineno"> 3126</span>  <span class="keywordflow">if</span> (coefs[0] > 0 && coefs[1] < 0) {</div>
|
|
<div class="line"><a name="l03127"></a><span class="lineno"> 3127</span>  <span class="keywordflow">return</span> solver->MakeSum(</div>
|
|
<div class="line"><a name="l03128"></a><span class="lineno"> 3128</span>  solver->MakeDifference(solver->MakeProd(vars[0], coefs[0]),</div>
|
|
<div class="line"><a name="l03129"></a><span class="lineno"> 3129</span>  solver->MakeProd(vars[1], -coefs[1])),</div>
|
|
<div class="line"><a name="l03130"></a><span class="lineno"> 3130</span>  constant);</div>
|
|
<div class="line"><a name="l03131"></a><span class="lineno"> 3131</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coefs[0] < 0 && coefs[1] > 0) {</div>
|
|
<div class="line"><a name="l03132"></a><span class="lineno"> 3132</span>  <span class="keywordflow">return</span> solver->MakeSum(</div>
|
|
<div class="line"><a name="l03133"></a><span class="lineno"> 3133</span>  solver->MakeDifference(solver->MakeProd(vars[1], coefs[1]),</div>
|
|
<div class="line"><a name="l03134"></a><span class="lineno"> 3134</span>  solver->MakeProd(vars[0], -coefs[0])),</div>
|
|
<div class="line"><a name="l03135"></a><span class="lineno"> 3135</span>  constant);</div>
|
|
<div class="line"><a name="l03136"></a><span class="lineno"> 3136</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03137"></a><span class="lineno"> 3137</span>  <span class="keywordflow">return</span> solver->MakeSum(</div>
|
|
<div class="line"><a name="l03138"></a><span class="lineno"> 3138</span>  solver->MakeSum(solver->MakeProd(vars[0], coefs[0]),</div>
|
|
<div class="line"><a name="l03139"></a><span class="lineno"> 3139</span>  solver->MakeProd(vars[1], coefs[1])),</div>
|
|
<div class="line"><a name="l03140"></a><span class="lineno"> 3140</span>  constant);</div>
|
|
<div class="line"><a name="l03141"></a><span class="lineno"> 3141</span>  }</div>
|
|
<div class="line"><a name="l03142"></a><span class="lineno"> 3142</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03143"></a><span class="lineno"> 3143</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars)) {</div>
|
|
<div class="line"><a name="l03144"></a><span class="lineno"> 3144</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#ab62b402f767cda48eb67ef8b50397f8f">AreAllPositive</a>(coefs)) {</div>
|
|
<div class="line"><a name="l03145"></a><span class="lineno"> 3145</span>  <span class="keywordflow">if</span> (vars.size() > 8) {</div>
|
|
<div class="line"><a name="l03146"></a><span class="lineno"> 3146</span>  <span class="keywordflow">return</span> solver->MakeSum(</div>
|
|
<div class="line"><a name="l03147"></a><span class="lineno"> 3147</span>  solver</div>
|
|
<div class="line"><a name="l03148"></a><span class="lineno"> 3148</span>  ->RegisterIntExpr(solver->RevAlloc(</div>
|
|
<div class="line"><a name="l03149"></a><span class="lineno"> 3149</span>  <span class="keyword">new</span> PositiveBooleanScalProd(solver, vars, coefs)))</div>
|
|
<div class="line"><a name="l03150"></a><span class="lineno"> 3150</span>  ->Var(),</div>
|
|
<div class="line"><a name="l03151"></a><span class="lineno"> 3151</span>  constant);</div>
|
|
<div class="line"><a name="l03152"></a><span class="lineno"> 3152</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03153"></a><span class="lineno"> 3153</span>  <span class="keywordflow">return</span> solver->MakeSum(</div>
|
|
<div class="line"><a name="l03154"></a><span class="lineno"> 3154</span>  solver->RegisterIntExpr(solver->RevAlloc(</div>
|
|
<div class="line"><a name="l03155"></a><span class="lineno"> 3155</span>  <span class="keyword">new</span> PositiveBooleanScalProd(solver, vars, coefs))),</div>
|
|
<div class="line"><a name="l03156"></a><span class="lineno"> 3156</span>  constant);</div>
|
|
<div class="line"><a name="l03157"></a><span class="lineno"> 3157</span>  }</div>
|
|
<div class="line"><a name="l03158"></a><span class="lineno"> 3158</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03159"></a><span class="lineno"> 3159</span>  <span class="comment">// If some coefficients are non-positive, partition coefficients in two</span></div>
|
|
<div class="line"><a name="l03160"></a><span class="lineno"> 3160</span>  <span class="comment">// sets, one for the positive coefficients P and one for the negative</span></div>
|
|
<div class="line"><a name="l03161"></a><span class="lineno"> 3161</span>  <span class="comment">// ones N.</span></div>
|
|
<div class="line"><a name="l03162"></a><span class="lineno"> 3162</span>  <span class="comment">// Create two PositiveBooleanScalProd expressions, one on P (s1), the</span></div>
|
|
<div class="line"><a name="l03163"></a><span class="lineno"> 3163</span>  <span class="comment">// other on Opposite(N) (s2).</span></div>
|
|
<div class="line"><a name="l03164"></a><span class="lineno"> 3164</span>  <span class="comment">// The final expression is then s1 - s2.</span></div>
|
|
<div class="line"><a name="l03165"></a><span class="lineno"> 3165</span>  <span class="comment">// If P is empty, the expression is Opposite(s2).</span></div>
|
|
<div class="line"><a name="l03166"></a><span class="lineno"> 3166</span>  std::vector<int64_t> positive_coefs;</div>
|
|
<div class="line"><a name="l03167"></a><span class="lineno"> 3167</span>  std::vector<int64_t> negative_coefs;</div>
|
|
<div class="line"><a name="l03168"></a><span class="lineno"> 3168</span>  std::vector<IntVar*> positive_coef_vars;</div>
|
|
<div class="line"><a name="l03169"></a><span class="lineno"> 3169</span>  std::vector<IntVar*> negative_coef_vars;</div>
|
|
<div class="line"><a name="l03170"></a><span class="lineno"> 3170</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l03171"></a><span class="lineno"> 3171</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a> = coefs[i];</div>
|
|
<div class="line"><a name="l03172"></a><span class="lineno"> 3172</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a> > 0) {</div>
|
|
<div class="line"><a name="l03173"></a><span class="lineno"> 3173</span>  positive_coefs.push_back(<a class="code" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a>);</div>
|
|
<div class="line"><a name="l03174"></a><span class="lineno"> 3174</span>  positive_coef_vars.push_back(vars[i]);</div>
|
|
<div class="line"><a name="l03175"></a><span class="lineno"> 3175</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a> < 0) {</div>
|
|
<div class="line"><a name="l03176"></a><span class="lineno"> 3176</span>  negative_coefs.push_back(-<a class="code" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a>);</div>
|
|
<div class="line"><a name="l03177"></a><span class="lineno"> 3177</span>  negative_coef_vars.push_back(vars[i]);</div>
|
|
<div class="line"><a name="l03178"></a><span class="lineno"> 3178</span>  }</div>
|
|
<div class="line"><a name="l03179"></a><span class="lineno"> 3179</span>  }</div>
|
|
<div class="line"><a name="l03180"></a><span class="lineno"> 3180</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(negative_coef_vars.size(), 0);</div>
|
|
<div class="line"><a name="l03181"></a><span class="lineno"> 3181</span>  IntExpr* <span class="keyword">const</span> negatives =</div>
|
|
<div class="line"><a name="l03182"></a><span class="lineno"> 3182</span>  MakeScalProdAux(solver, negative_coef_vars, negative_coefs, 0);</div>
|
|
<div class="line"><a name="l03183"></a><span class="lineno"> 3183</span>  <span class="keywordflow">if</span> (!positive_coef_vars.empty()) {</div>
|
|
<div class="line"><a name="l03184"></a><span class="lineno"> 3184</span>  IntExpr* <span class="keyword">const</span> positives = MakeScalProdAux(solver, positive_coef_vars,</div>
|
|
<div class="line"><a name="l03185"></a><span class="lineno"> 3185</span>  positive_coefs, constant);</div>
|
|
<div class="line"><a name="l03186"></a><span class="lineno"> 3186</span>  <span class="keywordflow">return</span> solver->MakeDifference(positives, negatives);</div>
|
|
<div class="line"><a name="l03187"></a><span class="lineno"> 3187</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03188"></a><span class="lineno"> 3188</span>  <span class="keywordflow">return</span> solver->MakeDifference(constant, negatives);</div>
|
|
<div class="line"><a name="l03189"></a><span class="lineno"> 3189</span>  }</div>
|
|
<div class="line"><a name="l03190"></a><span class="lineno"> 3190</span>  }</div>
|
|
<div class="line"><a name="l03191"></a><span class="lineno"> 3191</span>  }</div>
|
|
<div class="line"><a name="l03192"></a><span class="lineno"> 3192</span>  }</div>
|
|
<div class="line"><a name="l03193"></a><span class="lineno"> 3193</span>  std::vector<IntVar*> terms;</div>
|
|
<div class="line"><a name="l03194"></a><span class="lineno"> 3194</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l03195"></a><span class="lineno"> 3195</span>  terms.push_back(solver->MakeProd(vars[i], coefs[i])->Var());</div>
|
|
<div class="line"><a name="l03196"></a><span class="lineno"> 3196</span>  }</div>
|
|
<div class="line"><a name="l03197"></a><span class="lineno"> 3197</span>  <span class="keywordflow">return</span> MakeSumArrayAux(solver, terms, constant);</div>
|
|
<div class="line"><a name="l03198"></a><span class="lineno"> 3198</span> }</div>
|
|
<div class="line"><a name="l03199"></a><span class="lineno"> 3199</span>  </div>
|
|
<div class="line"><a name="l03200"></a><span class="lineno"> 3200</span> IntExpr* MakeScalProdFct(Solver* solver, <span class="keyword">const</span> std::vector<IntVar*>& pre_vars,</div>
|
|
<div class="line"><a name="l03201"></a><span class="lineno"> 3201</span>  <span class="keyword">const</span> std::vector<int64_t>& pre_coefs) {</div>
|
|
<div class="line"><a name="l03202"></a><span class="lineno"> 3202</span>  int64_t constant = 0;</div>
|
|
<div class="line"><a name="l03203"></a><span class="lineno"> 3203</span>  std::vector<IntVar*> vars;</div>
|
|
<div class="line"><a name="l03204"></a><span class="lineno"> 3204</span>  std::vector<int64_t> coefs;</div>
|
|
<div class="line"><a name="l03205"></a><span class="lineno"> 3205</span>  DeepLinearize(solver, pre_vars, pre_coefs, &vars, &coefs, &constant);</div>
|
|
<div class="line"><a name="l03206"></a><span class="lineno"> 3206</span>  </div>
|
|
<div class="line"><a name="l03207"></a><span class="lineno"> 3207</span>  <span class="keywordflow">if</span> (vars.empty()) {</div>
|
|
<div class="line"><a name="l03208"></a><span class="lineno"> 3208</span>  <span class="keywordflow">return</span> solver->MakeIntConst(constant);</div>
|
|
<div class="line"><a name="l03209"></a><span class="lineno"> 3209</span>  }</div>
|
|
<div class="line"><a name="l03210"></a><span class="lineno"> 3210</span>  <span class="comment">// Can we simplify using some gcd computation.</span></div>
|
|
<div class="line"><a name="l03211"></a><span class="lineno"> 3211</span>  int64_t gcd = std::abs(coefs[0]);</div>
|
|
<div class="line"><a name="l03212"></a><span class="lineno"> 3212</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < coefs.size(); ++i) {</div>
|
|
<div class="line"><a name="l03213"></a><span class="lineno"> 3213</span>  gcd = MathUtil::GCD64(gcd, std::abs(coefs[i]));</div>
|
|
<div class="line"><a name="l03214"></a><span class="lineno"> 3214</span>  <span class="keywordflow">if</span> (gcd == 1) {</div>
|
|
<div class="line"><a name="l03215"></a><span class="lineno"> 3215</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l03216"></a><span class="lineno"> 3216</span>  }</div>
|
|
<div class="line"><a name="l03217"></a><span class="lineno"> 3217</span>  }</div>
|
|
<div class="line"><a name="l03218"></a><span class="lineno"> 3218</span>  <span class="keywordflow">if</span> (constant != 0 && gcd != 1) {</div>
|
|
<div class="line"><a name="l03219"></a><span class="lineno"> 3219</span>  gcd = MathUtil::GCD64(gcd, std::abs(constant));</div>
|
|
<div class="line"><a name="l03220"></a><span class="lineno"> 3220</span>  }</div>
|
|
<div class="line"><a name="l03221"></a><span class="lineno"> 3221</span>  <span class="keywordflow">if</span> (gcd > 1) {</div>
|
|
<div class="line"><a name="l03222"></a><span class="lineno"> 3222</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < coefs.size(); ++i) {</div>
|
|
<div class="line"><a name="l03223"></a><span class="lineno"> 3223</span>  coefs[i] /= gcd;</div>
|
|
<div class="line"><a name="l03224"></a><span class="lineno"> 3224</span>  }</div>
|
|
<div class="line"><a name="l03225"></a><span class="lineno"> 3225</span>  <span class="keywordflow">return</span> solver->MakeProd(</div>
|
|
<div class="line"><a name="l03226"></a><span class="lineno"> 3226</span>  MakeScalProdAux(solver, vars, coefs, constant / gcd), gcd);</div>
|
|
<div class="line"><a name="l03227"></a><span class="lineno"> 3227</span>  }</div>
|
|
<div class="line"><a name="l03228"></a><span class="lineno"> 3228</span>  <span class="keywordflow">return</span> MakeScalProdAux(solver, vars, coefs, constant);</div>
|
|
<div class="line"><a name="l03229"></a><span class="lineno"> 3229</span> }</div>
|
|
<div class="line"><a name="l03230"></a><span class="lineno"> 3230</span>  </div>
|
|
<div class="line"><a name="l03231"></a><span class="lineno"> 3231</span> IntExpr* MakeSumFct(Solver* solver, <span class="keyword">const</span> std::vector<IntVar*>& pre_vars) {</div>
|
|
<div class="line"><a name="l03232"></a><span class="lineno"> 3232</span>  absl::flat_hash_map<IntVar*, int64_t> variables_to_coefficients;</div>
|
|
<div class="line"><a name="l03233"></a><span class="lineno"> 3233</span>  ExprLinearizer linearizer(&variables_to_coefficients);</div>
|
|
<div class="line"><a name="l03234"></a><span class="lineno"> 3234</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < pre_vars.size(); ++i) {</div>
|
|
<div class="line"><a name="l03235"></a><span class="lineno"> 3235</span>  linearizer.Visit(pre_vars[i], 1);</div>
|
|
<div class="line"><a name="l03236"></a><span class="lineno"> 3236</span>  }</div>
|
|
<div class="line"><a name="l03237"></a><span class="lineno"> 3237</span>  <span class="keyword">const</span> int64_t constant = linearizer.Constant();</div>
|
|
<div class="line"><a name="l03238"></a><span class="lineno"> 3238</span>  std::vector<IntVar*> vars;</div>
|
|
<div class="line"><a name="l03239"></a><span class="lineno"> 3239</span>  std::vector<int64_t> coefs;</div>
|
|
<div class="line"><a name="l03240"></a><span class="lineno"> 3240</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& variable_to_coefficient : variables_to_coefficients) {</div>
|
|
<div class="line"><a name="l03241"></a><span class="lineno"> 3241</span>  <span class="keywordflow">if</span> (variable_to_coefficient.second != 0) {</div>
|
|
<div class="line"><a name="l03242"></a><span class="lineno"> 3242</span>  vars.push_back(variable_to_coefficient.first);</div>
|
|
<div class="line"><a name="l03243"></a><span class="lineno"> 3243</span>  coefs.push_back(variable_to_coefficient.second);</div>
|
|
<div class="line"><a name="l03244"></a><span class="lineno"> 3244</span>  }</div>
|
|
<div class="line"><a name="l03245"></a><span class="lineno"> 3245</span>  }</div>
|
|
<div class="line"><a name="l03246"></a><span class="lineno"> 3246</span>  <span class="keywordflow">return</span> MakeScalProdAux(solver, vars, coefs, constant);</div>
|
|
<div class="line"><a name="l03247"></a><span class="lineno"> 3247</span> }</div>
|
|
<div class="line"><a name="l03248"></a><span class="lineno"> 3248</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l03249"></a><span class="lineno"> 3249</span>  </div>
|
|
<div class="line"><a name="l03250"></a><span class="lineno"> 3250</span> <span class="comment">// ----- API -----</span></div>
|
|
<div class="line"><a name="l03251"></a><span class="lineno"> 3251</span>  </div>
|
|
<div class="line"><a name="l03252"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a09873cffad10d0c03d9e56bfee8063b5"> 3252</a></span> <a class="code" href="classoperations__research_1_1_int_expr.html">IntExpr</a>* Solver::MakeSum(<span class="keyword">const</span> std::vector<IntVar*>& vars) {</div>
|
|
<div class="line"><a name="l03253"></a><span class="lineno"> 3253</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l03254"></a><span class="lineno"> 3254</span>  <span class="keywordflow">if</span> (size == 0) {</div>
|
|
<div class="line"><a name="l03255"></a><span class="lineno"> 3255</span>  <span class="keywordflow">return</span> MakeIntConst(int64_t{0});</div>
|
|
<div class="line"><a name="l03256"></a><span class="lineno"> 3256</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 1) {</div>
|
|
<div class="line"><a name="l03257"></a><span class="lineno"> 3257</span>  <span class="keywordflow">return</span> vars[0];</div>
|
|
<div class="line"><a name="l03258"></a><span class="lineno"> 3258</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 2) {</div>
|
|
<div class="line"><a name="l03259"></a><span class="lineno"> 3259</span>  <span class="keywordflow">return</span> MakeSum(vars[0], vars[1]);</div>
|
|
<div class="line"><a name="l03260"></a><span class="lineno"> 3260</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03261"></a><span class="lineno"> 3261</span>  <a class="code" href="classoperations__research_1_1_int_expr.html">IntExpr</a>* <span class="keyword">const</span> cache =</div>
|
|
<div class="line"><a name="l03262"></a><span class="lineno"> 3262</span>  model_cache_->FindVarArrayExpression(vars, ModelCache::VAR_ARRAY_SUM);</div>
|
|
<div class="line"><a name="l03263"></a><span class="lineno"> 3263</span>  <span class="keywordflow">if</span> (cache != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l03264"></a><span class="lineno"> 3264</span>  <span class="keywordflow">return</span> cache;</div>
|
|
<div class="line"><a name="l03265"></a><span class="lineno"> 3265</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03266"></a><span class="lineno"> 3266</span>  int64_t new_min = 0;</div>
|
|
<div class="line"><a name="l03267"></a><span class="lineno"> 3267</span>  int64_t new_max = 0;</div>
|
|
<div class="line"><a name="l03268"></a><span class="lineno"> 3268</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l03269"></a><span class="lineno"> 3269</span>  <span class="keywordflow">if</span> (new_min != <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>()) {</div>
|
|
<div class="line"><a name="l03270"></a><span class="lineno"> 3270</span>  new_min = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(vars[i]->Min(), new_min);</div>
|
|
<div class="line"><a name="l03271"></a><span class="lineno"> 3271</span>  }</div>
|
|
<div class="line"><a name="l03272"></a><span class="lineno"> 3272</span>  <span class="keywordflow">if</span> (new_max != <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a name="l03273"></a><span class="lineno"> 3273</span>  new_max = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(vars[i]->Max(), new_max);</div>
|
|
<div class="line"><a name="l03274"></a><span class="lineno"> 3274</span>  }</div>
|
|
<div class="line"><a name="l03275"></a><span class="lineno"> 3275</span>  }</div>
|
|
<div class="line"><a name="l03276"></a><span class="lineno"> 3276</span>  <a class="code" href="classoperations__research_1_1_int_expr.html">IntExpr</a>* sum_expr = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l03277"></a><span class="lineno"> 3277</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> all_booleans = <a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars);</div>
|
|
<div class="line"><a name="l03278"></a><span class="lineno"> 3278</span>  <span class="keywordflow">if</span> (all_booleans) {</div>
|
|
<div class="line"><a name="l03279"></a><span class="lineno"> 3279</span>  <span class="keyword">const</span> std::string <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a> =</div>
|
|
<div class="line"><a name="l03280"></a><span class="lineno"> 3280</span>  absl::StrFormat(<span class="stringliteral">"BooleanSum([%s])"</span>, <a class="code" href="namespaceoperations__research.html#aea04391e4d85555ed4fde9b89e8139f2">JoinNamePtr</a>(vars, <span class="stringliteral">", "</span>));</div>
|
|
<div class="line"><a name="l03281"></a><span class="lineno"> 3281</span>  sum_expr = MakeIntVar(new_min, new_max, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>);</div>
|
|
<div class="line"><a name="l03282"></a><span class="lineno"> 3282</span>  AddConstraint(</div>
|
|
<div class="line"><a name="l03283"></a><span class="lineno"> 3283</span>  RevAlloc(<span class="keyword">new</span> SumBooleanEqualToVar(<span class="keyword">this</span>, vars, sum_expr-><a class="code" href="classoperations__research_1_1_int_expr.html#a07173db6ca3b22fdb35ad963831a962b">Var</a>())));</div>
|
|
<div class="line"><a name="l03284"></a><span class="lineno"> 3284</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (new_min != <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>() &&</div>
|
|
<div class="line"><a name="l03285"></a><span class="lineno"> 3285</span>  new_max != <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a name="l03286"></a><span class="lineno"> 3286</span>  sum_expr = MakeSumFct(<span class="keyword">this</span>, vars);</div>
|
|
<div class="line"><a name="l03287"></a><span class="lineno"> 3287</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03288"></a><span class="lineno"> 3288</span>  <span class="keyword">const</span> std::string <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a> =</div>
|
|
<div class="line"><a name="l03289"></a><span class="lineno"> 3289</span>  absl::StrFormat(<span class="stringliteral">"Sum([%s])"</span>, <a class="code" href="namespaceoperations__research.html#aea04391e4d85555ed4fde9b89e8139f2">JoinNamePtr</a>(vars, <span class="stringliteral">", "</span>));</div>
|
|
<div class="line"><a name="l03290"></a><span class="lineno"> 3290</span>  sum_expr = MakeIntVar(new_min, new_max, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>);</div>
|
|
<div class="line"><a name="l03291"></a><span class="lineno"> 3291</span>  AddConstraint(</div>
|
|
<div class="line"><a name="l03292"></a><span class="lineno"> 3292</span>  RevAlloc(<span class="keyword">new</span> SafeSumConstraint(<span class="keyword">this</span>, vars, sum_expr-><a class="code" href="classoperations__research_1_1_int_expr.html#a07173db6ca3b22fdb35ad963831a962b">Var</a>())));</div>
|
|
<div class="line"><a name="l03293"></a><span class="lineno"> 3293</span>  }</div>
|
|
<div class="line"><a name="l03294"></a><span class="lineno"> 3294</span>  model_cache_->InsertVarArrayExpression(sum_expr, vars,</div>
|
|
<div class="line"><a name="l03295"></a><span class="lineno"> 3295</span>  ModelCache::VAR_ARRAY_SUM);</div>
|
|
<div class="line"><a name="l03296"></a><span class="lineno"> 3296</span>  <span class="keywordflow">return</span> sum_expr;</div>
|
|
<div class="line"><a name="l03297"></a><span class="lineno"> 3297</span>  }</div>
|
|
<div class="line"><a name="l03298"></a><span class="lineno"> 3298</span>  }</div>
|
|
<div class="line"><a name="l03299"></a><span class="lineno"> 3299</span> }</div>
|
|
<div class="line"><a name="l03300"></a><span class="lineno"> 3300</span>  </div>
|
|
<div class="line"><a name="l03301"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a259a4ee93238a1e426362cb830317a57"> 3301</a></span> <a class="code" href="classoperations__research_1_1_int_expr.html">IntExpr</a>* Solver::MakeMin(<span class="keyword">const</span> std::vector<IntVar*>& vars) {</div>
|
|
<div class="line"><a name="l03302"></a><span class="lineno"> 3302</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l03303"></a><span class="lineno"> 3303</span>  <span class="keywordflow">if</span> (size == 0) {</div>
|
|
<div class="line"><a name="l03304"></a><span class="lineno"> 3304</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7">WARNING</a>) << <span class="stringliteral">"operations_research::Solver::MakeMin() was called with an "</span></div>
|
|
<div class="line"><a name="l03305"></a><span class="lineno"> 3305</span>  <span class="stringliteral">"empty list of variables. Was this intentional?"</span>;</div>
|
|
<div class="line"><a name="l03306"></a><span class="lineno"> 3306</span>  <span class="keywordflow">return</span> MakeIntConst(<a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div>
|
|
<div class="line"><a name="l03307"></a><span class="lineno"> 3307</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 1) {</div>
|
|
<div class="line"><a name="l03308"></a><span class="lineno"> 3308</span>  <span class="keywordflow">return</span> vars[0];</div>
|
|
<div class="line"><a name="l03309"></a><span class="lineno"> 3309</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 2) {</div>
|
|
<div class="line"><a name="l03310"></a><span class="lineno"> 3310</span>  <span class="keywordflow">return</span> MakeMin(vars[0], vars[1]);</div>
|
|
<div class="line"><a name="l03311"></a><span class="lineno"> 3311</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03312"></a><span class="lineno"> 3312</span>  <a class="code" href="classoperations__research_1_1_int_expr.html">IntExpr</a>* <span class="keyword">const</span> cache =</div>
|
|
<div class="line"><a name="l03313"></a><span class="lineno"> 3313</span>  model_cache_->FindVarArrayExpression(vars, ModelCache::VAR_ARRAY_MIN);</div>
|
|
<div class="line"><a name="l03314"></a><span class="lineno"> 3314</span>  <span class="keywordflow">if</span> (cache != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l03315"></a><span class="lineno"> 3315</span>  <span class="keywordflow">return</span> cache;</div>
|
|
<div class="line"><a name="l03316"></a><span class="lineno"> 3316</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03317"></a><span class="lineno"> 3317</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars)) {</div>
|
|
<div class="line"><a name="l03318"></a><span class="lineno"> 3318</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> new_var = MakeBoolVar();</div>
|
|
<div class="line"><a name="l03319"></a><span class="lineno"> 3319</span>  AddConstraint(RevAlloc(<span class="keyword">new</span> ArrayBoolAndEq(<span class="keyword">this</span>, vars, new_var)));</div>
|
|
<div class="line"><a name="l03320"></a><span class="lineno"> 3320</span>  model_cache_->InsertVarArrayExpression(new_var, vars,</div>
|
|
<div class="line"><a name="l03321"></a><span class="lineno"> 3321</span>  ModelCache::VAR_ARRAY_MIN);</div>
|
|
<div class="line"><a name="l03322"></a><span class="lineno"> 3322</span>  <span class="keywordflow">return</span> new_var;</div>
|
|
<div class="line"><a name="l03323"></a><span class="lineno"> 3323</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03324"></a><span class="lineno"> 3324</span>  int64_t new_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a name="l03325"></a><span class="lineno"> 3325</span>  int64_t new_max = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a name="l03326"></a><span class="lineno"> 3326</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l03327"></a><span class="lineno"> 3327</span>  new_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(new_min, vars[i]->Min());</div>
|
|
<div class="line"><a name="l03328"></a><span class="lineno"> 3328</span>  new_max = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(new_max, vars[i]->Max());</div>
|
|
<div class="line"><a name="l03329"></a><span class="lineno"> 3329</span>  }</div>
|
|
<div class="line"><a name="l03330"></a><span class="lineno"> 3330</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> new_var = MakeIntVar(new_min, new_max);</div>
|
|
<div class="line"><a name="l03331"></a><span class="lineno"> 3331</span>  <span class="keywordflow">if</span> (size <= parameters_.array_split_size()) {</div>
|
|
<div class="line"><a name="l03332"></a><span class="lineno"> 3332</span>  AddConstraint(RevAlloc(<span class="keyword">new</span> SmallMinConstraint(<span class="keyword">this</span>, vars, new_var)));</div>
|
|
<div class="line"><a name="l03333"></a><span class="lineno"> 3333</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03334"></a><span class="lineno"> 3334</span>  AddConstraint(RevAlloc(<span class="keyword">new</span> MinConstraint(<span class="keyword">this</span>, vars, new_var)));</div>
|
|
<div class="line"><a name="l03335"></a><span class="lineno"> 3335</span>  }</div>
|
|
<div class="line"><a name="l03336"></a><span class="lineno"> 3336</span>  model_cache_->InsertVarArrayExpression(new_var, vars,</div>
|
|
<div class="line"><a name="l03337"></a><span class="lineno"> 3337</span>  ModelCache::VAR_ARRAY_MIN);</div>
|
|
<div class="line"><a name="l03338"></a><span class="lineno"> 3338</span>  <span class="keywordflow">return</span> new_var;</div>
|
|
<div class="line"><a name="l03339"></a><span class="lineno"> 3339</span>  }</div>
|
|
<div class="line"><a name="l03340"></a><span class="lineno"> 3340</span>  }</div>
|
|
<div class="line"><a name="l03341"></a><span class="lineno"> 3341</span>  }</div>
|
|
<div class="line"><a name="l03342"></a><span class="lineno"> 3342</span> }</div>
|
|
<div class="line"><a name="l03343"></a><span class="lineno"> 3343</span>  </div>
|
|
<div class="line"><a name="l03344"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a934e08f84e590e48ab860fcd97ca7130"> 3344</a></span> <a class="code" href="classoperations__research_1_1_int_expr.html">IntExpr</a>* Solver::MakeMax(<span class="keyword">const</span> std::vector<IntVar*>& vars) {</div>
|
|
<div class="line"><a name="l03345"></a><span class="lineno"> 3345</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l03346"></a><span class="lineno"> 3346</span>  <span class="keywordflow">if</span> (size == 0) {</div>
|
|
<div class="line"><a name="l03347"></a><span class="lineno"> 3347</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7">WARNING</a>) << <span class="stringliteral">"operations_research::Solver::MakeMax() was called with an "</span></div>
|
|
<div class="line"><a name="l03348"></a><span class="lineno"> 3348</span>  <span class="stringliteral">"empty list of variables. Was this intentional?"</span>;</div>
|
|
<div class="line"><a name="l03349"></a><span class="lineno"> 3349</span>  <span class="keywordflow">return</span> MakeIntConst(<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>());</div>
|
|
<div class="line"><a name="l03350"></a><span class="lineno"> 3350</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 1) {</div>
|
|
<div class="line"><a name="l03351"></a><span class="lineno"> 3351</span>  <span class="keywordflow">return</span> vars[0];</div>
|
|
<div class="line"><a name="l03352"></a><span class="lineno"> 3352</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 2) {</div>
|
|
<div class="line"><a name="l03353"></a><span class="lineno"> 3353</span>  <span class="keywordflow">return</span> MakeMax(vars[0], vars[1]);</div>
|
|
<div class="line"><a name="l03354"></a><span class="lineno"> 3354</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03355"></a><span class="lineno"> 3355</span>  <a class="code" href="classoperations__research_1_1_int_expr.html">IntExpr</a>* <span class="keyword">const</span> cache =</div>
|
|
<div class="line"><a name="l03356"></a><span class="lineno"> 3356</span>  model_cache_->FindVarArrayExpression(vars, ModelCache::VAR_ARRAY_MAX);</div>
|
|
<div class="line"><a name="l03357"></a><span class="lineno"> 3357</span>  <span class="keywordflow">if</span> (cache != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l03358"></a><span class="lineno"> 3358</span>  <span class="keywordflow">return</span> cache;</div>
|
|
<div class="line"><a name="l03359"></a><span class="lineno"> 3359</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03360"></a><span class="lineno"> 3360</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars)) {</div>
|
|
<div class="line"><a name="l03361"></a><span class="lineno"> 3361</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> new_var = MakeBoolVar();</div>
|
|
<div class="line"><a name="l03362"></a><span class="lineno"> 3362</span>  AddConstraint(RevAlloc(<span class="keyword">new</span> ArrayBoolOrEq(<span class="keyword">this</span>, vars, new_var)));</div>
|
|
<div class="line"><a name="l03363"></a><span class="lineno"> 3363</span>  model_cache_->InsertVarArrayExpression(new_var, vars,</div>
|
|
<div class="line"><a name="l03364"></a><span class="lineno"> 3364</span>  ModelCache::VAR_ARRAY_MIN);</div>
|
|
<div class="line"><a name="l03365"></a><span class="lineno"> 3365</span>  <span class="keywordflow">return</span> new_var;</div>
|
|
<div class="line"><a name="l03366"></a><span class="lineno"> 3366</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03367"></a><span class="lineno"> 3367</span>  int64_t new_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a name="l03368"></a><span class="lineno"> 3368</span>  int64_t new_max = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a name="l03369"></a><span class="lineno"> 3369</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l03370"></a><span class="lineno"> 3370</span>  new_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(new_min, vars[i]->Min());</div>
|
|
<div class="line"><a name="l03371"></a><span class="lineno"> 3371</span>  new_max = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(new_max, vars[i]->Max());</div>
|
|
<div class="line"><a name="l03372"></a><span class="lineno"> 3372</span>  }</div>
|
|
<div class="line"><a name="l03373"></a><span class="lineno"> 3373</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> new_var = MakeIntVar(new_min, new_max);</div>
|
|
<div class="line"><a name="l03374"></a><span class="lineno"> 3374</span>  <span class="keywordflow">if</span> (size <= parameters_.array_split_size()) {</div>
|
|
<div class="line"><a name="l03375"></a><span class="lineno"> 3375</span>  AddConstraint(RevAlloc(<span class="keyword">new</span> SmallMaxConstraint(<span class="keyword">this</span>, vars, new_var)));</div>
|
|
<div class="line"><a name="l03376"></a><span class="lineno"> 3376</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03377"></a><span class="lineno"> 3377</span>  AddConstraint(RevAlloc(<span class="keyword">new</span> MaxConstraint(<span class="keyword">this</span>, vars, new_var)));</div>
|
|
<div class="line"><a name="l03378"></a><span class="lineno"> 3378</span>  }</div>
|
|
<div class="line"><a name="l03379"></a><span class="lineno"> 3379</span>  model_cache_->InsertVarArrayExpression(new_var, vars,</div>
|
|
<div class="line"><a name="l03380"></a><span class="lineno"> 3380</span>  ModelCache::VAR_ARRAY_MAX);</div>
|
|
<div class="line"><a name="l03381"></a><span class="lineno"> 3381</span>  <span class="keywordflow">return</span> new_var;</div>
|
|
<div class="line"><a name="l03382"></a><span class="lineno"> 3382</span>  }</div>
|
|
<div class="line"><a name="l03383"></a><span class="lineno"> 3383</span>  }</div>
|
|
<div class="line"><a name="l03384"></a><span class="lineno"> 3384</span>  }</div>
|
|
<div class="line"><a name="l03385"></a><span class="lineno"> 3385</span> }</div>
|
|
<div class="line"><a name="l03386"></a><span class="lineno"> 3386</span>  </div>
|
|
<div class="line"><a name="l03387"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#adf4b4c9f1cc7a6f674a721a5943034af"> 3387</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeMinEquality(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l03388"></a><span class="lineno"> 3388</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> min_var) {</div>
|
|
<div class="line"><a name="l03389"></a><span class="lineno"> 3389</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l03390"></a><span class="lineno"> 3390</span>  <span class="keywordflow">if</span> (size > 2) {</div>
|
|
<div class="line"><a name="l03391"></a><span class="lineno"> 3391</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars)) {</div>
|
|
<div class="line"><a name="l03392"></a><span class="lineno"> 3392</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> ArrayBoolAndEq(<span class="keyword">this</span>, vars, min_var));</div>
|
|
<div class="line"><a name="l03393"></a><span class="lineno"> 3393</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size <= parameters_.array_split_size()) {</div>
|
|
<div class="line"><a name="l03394"></a><span class="lineno"> 3394</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> SmallMinConstraint(<span class="keyword">this</span>, vars, min_var));</div>
|
|
<div class="line"><a name="l03395"></a><span class="lineno"> 3395</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03396"></a><span class="lineno"> 3396</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> MinConstraint(<span class="keyword">this</span>, vars, min_var));</div>
|
|
<div class="line"><a name="l03397"></a><span class="lineno"> 3397</span>  }</div>
|
|
<div class="line"><a name="l03398"></a><span class="lineno"> 3398</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 2) {</div>
|
|
<div class="line"><a name="l03399"></a><span class="lineno"> 3399</span>  <span class="keywordflow">return</span> MakeEquality(MakeMin(vars[0], vars[1]), min_var);</div>
|
|
<div class="line"><a name="l03400"></a><span class="lineno"> 3400</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 1) {</div>
|
|
<div class="line"><a name="l03401"></a><span class="lineno"> 3401</span>  <span class="keywordflow">return</span> MakeEquality(vars[0], min_var);</div>
|
|
<div class="line"><a name="l03402"></a><span class="lineno"> 3402</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03403"></a><span class="lineno"> 3403</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7">WARNING</a>) << <span class="stringliteral">"operations_research::Solver::MakeMinEquality() was called "</span></div>
|
|
<div class="line"><a name="l03404"></a><span class="lineno"> 3404</span>  <span class="stringliteral">"with an empty list of variables. Was this intentional?"</span>;</div>
|
|
<div class="line"><a name="l03405"></a><span class="lineno"> 3405</span>  <span class="keywordflow">return</span> MakeEquality(min_var, <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div>
|
|
<div class="line"><a name="l03406"></a><span class="lineno"> 3406</span>  }</div>
|
|
<div class="line"><a name="l03407"></a><span class="lineno"> 3407</span> }</div>
|
|
<div class="line"><a name="l03408"></a><span class="lineno"> 3408</span>  </div>
|
|
<div class="line"><a name="l03409"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a6f94e0e067e2b294237e14f0dfd5aaa7"> 3409</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeMaxEquality(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l03410"></a><span class="lineno"> 3410</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> max_var) {</div>
|
|
<div class="line"><a name="l03411"></a><span class="lineno"> 3411</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l03412"></a><span class="lineno"> 3412</span>  <span class="keywordflow">if</span> (size > 2) {</div>
|
|
<div class="line"><a name="l03413"></a><span class="lineno"> 3413</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars)) {</div>
|
|
<div class="line"><a name="l03414"></a><span class="lineno"> 3414</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> ArrayBoolOrEq(<span class="keyword">this</span>, vars, max_var));</div>
|
|
<div class="line"><a name="l03415"></a><span class="lineno"> 3415</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size <= parameters_.array_split_size()) {</div>
|
|
<div class="line"><a name="l03416"></a><span class="lineno"> 3416</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> SmallMaxConstraint(<span class="keyword">this</span>, vars, max_var));</div>
|
|
<div class="line"><a name="l03417"></a><span class="lineno"> 3417</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03418"></a><span class="lineno"> 3418</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> MaxConstraint(<span class="keyword">this</span>, vars, max_var));</div>
|
|
<div class="line"><a name="l03419"></a><span class="lineno"> 3419</span>  }</div>
|
|
<div class="line"><a name="l03420"></a><span class="lineno"> 3420</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 2) {</div>
|
|
<div class="line"><a name="l03421"></a><span class="lineno"> 3421</span>  <span class="keywordflow">return</span> MakeEquality(MakeMax(vars[0], vars[1]), max_var);</div>
|
|
<div class="line"><a name="l03422"></a><span class="lineno"> 3422</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 1) {</div>
|
|
<div class="line"><a name="l03423"></a><span class="lineno"> 3423</span>  <span class="keywordflow">return</span> MakeEquality(vars[0], max_var);</div>
|
|
<div class="line"><a name="l03424"></a><span class="lineno"> 3424</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03425"></a><span class="lineno"> 3425</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7">WARNING</a>) << <span class="stringliteral">"operations_research::Solver::MakeMaxEquality() was called "</span></div>
|
|
<div class="line"><a name="l03426"></a><span class="lineno"> 3426</span>  <span class="stringliteral">"with an empty list of variables. Was this intentional?"</span>;</div>
|
|
<div class="line"><a name="l03427"></a><span class="lineno"> 3427</span>  <span class="keywordflow">return</span> MakeEquality(max_var, <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>());</div>
|
|
<div class="line"><a name="l03428"></a><span class="lineno"> 3428</span>  }</div>
|
|
<div class="line"><a name="l03429"></a><span class="lineno"> 3429</span> }</div>
|
|
<div class="line"><a name="l03430"></a><span class="lineno"> 3430</span>  </div>
|
|
<div class="line"><a name="l03431"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#ae22b51c62a7ca70222c73972a1f7caa5"> 3431</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeSumLessOrEqual(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l03432"></a><span class="lineno"> 3432</span>  int64_t cst) {</div>
|
|
<div class="line"><a name="l03433"></a><span class="lineno"> 3433</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l03434"></a><span class="lineno"> 3434</span>  <span class="keywordflow">if</span> (cst == 1LL && <a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars) && size > 2) {</div>
|
|
<div class="line"><a name="l03435"></a><span class="lineno"> 3435</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> SumBooleanLessOrEqualToOne(<span class="keyword">this</span>, vars));</div>
|
|
<div class="line"><a name="l03436"></a><span class="lineno"> 3436</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03437"></a><span class="lineno"> 3437</span>  <span class="keywordflow">return</span> MakeLessOrEqual(MakeSum(vars), cst);</div>
|
|
<div class="line"><a name="l03438"></a><span class="lineno"> 3438</span>  }</div>
|
|
<div class="line"><a name="l03439"></a><span class="lineno"> 3439</span> }</div>
|
|
<div class="line"><a name="l03440"></a><span class="lineno"> 3440</span>  </div>
|
|
<div class="line"><a name="l03441"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a65ef9e909e5d6b35ad9d9ff1b97a7916"> 3441</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeSumGreaterOrEqual(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l03442"></a><span class="lineno"> 3442</span>  int64_t cst) {</div>
|
|
<div class="line"><a name="l03443"></a><span class="lineno"> 3443</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l03444"></a><span class="lineno"> 3444</span>  <span class="keywordflow">if</span> (cst == 1LL && <a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars) && size > 2) {</div>
|
|
<div class="line"><a name="l03445"></a><span class="lineno"> 3445</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> SumBooleanGreaterOrEqualToOne(<span class="keyword">this</span>, vars));</div>
|
|
<div class="line"><a name="l03446"></a><span class="lineno"> 3446</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03447"></a><span class="lineno"> 3447</span>  <span class="keywordflow">return</span> MakeGreaterOrEqual(MakeSum(vars), cst);</div>
|
|
<div class="line"><a name="l03448"></a><span class="lineno"> 3448</span>  }</div>
|
|
<div class="line"><a name="l03449"></a><span class="lineno"> 3449</span> }</div>
|
|
<div class="line"><a name="l03450"></a><span class="lineno"> 3450</span>  </div>
|
|
<div class="line"><a name="l03451"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a1cf098b98c67b72f37ca012e69aec6ce"> 3451</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeSumEquality(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l03452"></a><span class="lineno"> 3452</span>  int64_t cst) {</div>
|
|
<div class="line"><a name="l03453"></a><span class="lineno"> 3453</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l03454"></a><span class="lineno"> 3454</span>  <span class="keywordflow">if</span> (size == 0) {</div>
|
|
<div class="line"><a name="l03455"></a><span class="lineno"> 3455</span>  <span class="keywordflow">return</span> cst == 0 ? MakeTrueConstraint() : MakeFalseConstraint();</div>
|
|
<div class="line"><a name="l03456"></a><span class="lineno"> 3456</span>  }</div>
|
|
<div class="line"><a name="l03457"></a><span class="lineno"> 3457</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars) && size > 2) {</div>
|
|
<div class="line"><a name="l03458"></a><span class="lineno"> 3458</span>  <span class="keywordflow">if</span> (cst == 1) {</div>
|
|
<div class="line"><a name="l03459"></a><span class="lineno"> 3459</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> SumBooleanEqualToOne(<span class="keyword">this</span>, vars));</div>
|
|
<div class="line"><a name="l03460"></a><span class="lineno"> 3460</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (cst < 0 || cst > size) {</div>
|
|
<div class="line"><a name="l03461"></a><span class="lineno"> 3461</span>  <span class="keywordflow">return</span> MakeFalseConstraint();</div>
|
|
<div class="line"><a name="l03462"></a><span class="lineno"> 3462</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03463"></a><span class="lineno"> 3463</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> SumBooleanEqualToVar(<span class="keyword">this</span>, vars, MakeIntConst(cst)));</div>
|
|
<div class="line"><a name="l03464"></a><span class="lineno"> 3464</span>  }</div>
|
|
<div class="line"><a name="l03465"></a><span class="lineno"> 3465</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03466"></a><span class="lineno"> 3466</span>  <span class="keywordflow">if</span> (vars.size() == 1) {</div>
|
|
<div class="line"><a name="l03467"></a><span class="lineno"> 3467</span>  <span class="keywordflow">return</span> MakeEquality(vars[0], cst);</div>
|
|
<div class="line"><a name="l03468"></a><span class="lineno"> 3468</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (vars.size() == 2) {</div>
|
|
<div class="line"><a name="l03469"></a><span class="lineno"> 3469</span>  <span class="keywordflow">return</span> MakeEquality(vars[0], MakeDifference(cst, vars[1]));</div>
|
|
<div class="line"><a name="l03470"></a><span class="lineno"> 3470</span>  }</div>
|
|
<div class="line"><a name="l03471"></a><span class="lineno"> 3471</span>  <span class="keywordflow">if</span> (DetectSumOverflow(vars)) {</div>
|
|
<div class="line"><a name="l03472"></a><span class="lineno"> 3472</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> SafeSumConstraint(<span class="keyword">this</span>, vars, MakeIntConst(cst)));</div>
|
|
<div class="line"><a name="l03473"></a><span class="lineno"> 3473</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size <= parameters_.array_split_size()) {</div>
|
|
<div class="line"><a name="l03474"></a><span class="lineno"> 3474</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> SmallSumConstraint(<span class="keyword">this</span>, vars, MakeIntConst(cst)));</div>
|
|
<div class="line"><a name="l03475"></a><span class="lineno"> 3475</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03476"></a><span class="lineno"> 3476</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> SumConstraint(<span class="keyword">this</span>, vars, MakeIntConst(cst)));</div>
|
|
<div class="line"><a name="l03477"></a><span class="lineno"> 3477</span>  }</div>
|
|
<div class="line"><a name="l03478"></a><span class="lineno"> 3478</span>  }</div>
|
|
<div class="line"><a name="l03479"></a><span class="lineno"> 3479</span> }</div>
|
|
<div class="line"><a name="l03480"></a><span class="lineno"> 3480</span>  </div>
|
|
<div class="line"><a name="l03481"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#aec6401c023dab782b331b0238c6ff5e4"> 3481</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeSumEquality(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l03482"></a><span class="lineno"> 3482</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l03483"></a><span class="lineno"> 3483</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div>
|
|
<div class="line"><a name="l03484"></a><span class="lineno"> 3484</span>  <span class="keywordflow">if</span> (size == 0) {</div>
|
|
<div class="line"><a name="l03485"></a><span class="lineno"> 3485</span>  <span class="keywordflow">return</span> MakeEquality(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="namespaceoperations__research.html#a5a9881f8a07b166ef2cbde572cea27b6">Zero</a>());</div>
|
|
<div class="line"><a name="l03486"></a><span class="lineno"> 3486</span>  }</div>
|
|
<div class="line"><a name="l03487"></a><span class="lineno"> 3487</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">AreAllBooleans</a>(vars) && size > 2) {</div>
|
|
<div class="line"><a name="l03488"></a><span class="lineno"> 3488</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> SumBooleanEqualToVar(<span class="keyword">this</span>, vars, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l03489"></a><span class="lineno"> 3489</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 0) {</div>
|
|
<div class="line"><a name="l03490"></a><span class="lineno"> 3490</span>  <span class="keywordflow">return</span> MakeEquality(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="namespaceoperations__research.html#a5a9881f8a07b166ef2cbde572cea27b6">Zero</a>());</div>
|
|
<div class="line"><a name="l03491"></a><span class="lineno"> 3491</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 1) {</div>
|
|
<div class="line"><a name="l03492"></a><span class="lineno"> 3492</span>  <span class="keywordflow">return</span> MakeEquality(vars[0], <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l03493"></a><span class="lineno"> 3493</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 2) {</div>
|
|
<div class="line"><a name="l03494"></a><span class="lineno"> 3494</span>  <span class="keywordflow">return</span> MakeEquality(MakeSum(vars[0], vars[1]), <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l03495"></a><span class="lineno"> 3495</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03496"></a><span class="lineno"> 3496</span>  <span class="keywordflow">if</span> (DetectSumOverflow(vars)) {</div>
|
|
<div class="line"><a name="l03497"></a><span class="lineno"> 3497</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> SafeSumConstraint(<span class="keyword">this</span>, vars, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l03498"></a><span class="lineno"> 3498</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size <= parameters_.array_split_size()) {</div>
|
|
<div class="line"><a name="l03499"></a><span class="lineno"> 3499</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> SmallSumConstraint(<span class="keyword">this</span>, vars, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l03500"></a><span class="lineno"> 3500</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03501"></a><span class="lineno"> 3501</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> SumConstraint(<span class="keyword">this</span>, vars, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l03502"></a><span class="lineno"> 3502</span>  }</div>
|
|
<div class="line"><a name="l03503"></a><span class="lineno"> 3503</span>  }</div>
|
|
<div class="line"><a name="l03504"></a><span class="lineno"> 3504</span> }</div>
|
|
<div class="line"><a name="l03505"></a><span class="lineno"> 3505</span>  </div>
|
|
<div class="line"><a name="l03506"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#af7d71e7623ee6bb9bb93715e1f9d6e7a"> 3506</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeScalProdEquality(</div>
|
|
<div class="line"><a name="l03507"></a><span class="lineno"> 3507</span>  <span class="keyword">const</span> std::vector<IntVar*>& vars, <span class="keyword">const</span> std::vector<int64_t>& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div>
|
|
<div class="line"><a name="l03508"></a><span class="lineno"> 3508</span>  int64_t cst) {</div>
|
|
<div class="line"><a name="l03509"></a><span class="lineno"> 3509</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vars.size(), <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.size());</div>
|
|
<div class="line"><a name="l03510"></a><span class="lineno"> 3510</span>  <span class="keywordflow">return</span> MakeScalProdEqualityFct(<span class="keyword">this</span>, vars, <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>, cst);</div>
|
|
<div class="line"><a name="l03511"></a><span class="lineno"> 3511</span> }</div>
|
|
<div class="line"><a name="l03512"></a><span class="lineno"> 3512</span>  </div>
|
|
<div class="line"><a name="l03513"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a437898bf331c10bc446010c5ef61fe93"> 3513</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeScalProdEquality(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l03514"></a><span class="lineno"> 3514</span>  <span class="keyword">const</span> std::vector<int>& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div>
|
|
<div class="line"><a name="l03515"></a><span class="lineno"> 3515</span>  int64_t cst) {</div>
|
|
<div class="line"><a name="l03516"></a><span class="lineno"> 3516</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vars.size(), <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.size());</div>
|
|
<div class="line"><a name="l03517"></a><span class="lineno"> 3517</span>  <span class="keywordflow">return</span> MakeScalProdEqualityFct(<span class="keyword">this</span>, vars, <a class="code" href="namespaceoperations__research.html#abeac98dfd5ab1335f6d21a8d71bdfd51">ToInt64Vector</a>(<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>), cst);</div>
|
|
<div class="line"><a name="l03518"></a><span class="lineno"> 3518</span> }</div>
|
|
<div class="line"><a name="l03519"></a><span class="lineno"> 3519</span>  </div>
|
|
<div class="line"><a name="l03520"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a64fa7c2277f0a6228151a96403d1ed1c"> 3520</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeScalProdEquality(</div>
|
|
<div class="line"><a name="l03521"></a><span class="lineno"> 3521</span>  <span class="keyword">const</span> std::vector<IntVar*>& vars, <span class="keyword">const</span> std::vector<int64_t>& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div>
|
|
<div class="line"><a name="l03522"></a><span class="lineno"> 3522</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> target) {</div>
|
|
<div class="line"><a name="l03523"></a><span class="lineno"> 3523</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vars.size(), <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.size());</div>
|
|
<div class="line"><a name="l03524"></a><span class="lineno"> 3524</span>  <span class="keywordflow">return</span> MakeScalProdEqualityVarFct(<span class="keyword">this</span>, vars, <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>, target);</div>
|
|
<div class="line"><a name="l03525"></a><span class="lineno"> 3525</span> }</div>
|
|
<div class="line"><a name="l03526"></a><span class="lineno"> 3526</span>  </div>
|
|
<div class="line"><a name="l03527"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a5cb4f284364b6aa084c48de17678399a"> 3527</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeScalProdEquality(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l03528"></a><span class="lineno"> 3528</span>  <span class="keyword">const</span> std::vector<int>& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div>
|
|
<div class="line"><a name="l03529"></a><span class="lineno"> 3529</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> target) {</div>
|
|
<div class="line"><a name="l03530"></a><span class="lineno"> 3530</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vars.size(), <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.size());</div>
|
|
<div class="line"><a name="l03531"></a><span class="lineno"> 3531</span>  <span class="keywordflow">return</span> MakeScalProdEqualityVarFct(<span class="keyword">this</span>, vars, <a class="code" href="namespaceoperations__research.html#abeac98dfd5ab1335f6d21a8d71bdfd51">ToInt64Vector</a>(<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>),</div>
|
|
<div class="line"><a name="l03532"></a><span class="lineno"> 3532</span>  target);</div>
|
|
<div class="line"><a name="l03533"></a><span class="lineno"> 3533</span> }</div>
|
|
<div class="line"><a name="l03534"></a><span class="lineno"> 3534</span>  </div>
|
|
<div class="line"><a name="l03535"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#ac3183a9fb438996e76e3079f397eb9f5"> 3535</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeScalProdGreaterOrEqual(</div>
|
|
<div class="line"><a name="l03536"></a><span class="lineno"> 3536</span>  <span class="keyword">const</span> std::vector<IntVar*>& vars, <span class="keyword">const</span> std::vector<int64_t>& coeffs,</div>
|
|
<div class="line"><a name="l03537"></a><span class="lineno"> 3537</span>  int64_t cst) {</div>
|
|
<div class="line"><a name="l03538"></a><span class="lineno"> 3538</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vars.size(), coeffs.size());</div>
|
|
<div class="line"><a name="l03539"></a><span class="lineno"> 3539</span>  <span class="keywordflow">return</span> MakeScalProdGreaterOrEqualFct(<span class="keyword">this</span>, vars, coeffs, cst);</div>
|
|
<div class="line"><a name="l03540"></a><span class="lineno"> 3540</span> }</div>
|
|
<div class="line"><a name="l03541"></a><span class="lineno"> 3541</span>  </div>
|
|
<div class="line"><a name="l03542"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#aa647aa406b7e84a0dfc1cb4ca256480e"> 3542</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeScalProdGreaterOrEqual(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l03543"></a><span class="lineno"> 3543</span>  <span class="keyword">const</span> std::vector<int>& coeffs,</div>
|
|
<div class="line"><a name="l03544"></a><span class="lineno"> 3544</span>  int64_t cst) {</div>
|
|
<div class="line"><a name="l03545"></a><span class="lineno"> 3545</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vars.size(), coeffs.size());</div>
|
|
<div class="line"><a name="l03546"></a><span class="lineno"> 3546</span>  <span class="keywordflow">return</span> MakeScalProdGreaterOrEqualFct(<span class="keyword">this</span>, vars, <a class="code" href="namespaceoperations__research.html#abeac98dfd5ab1335f6d21a8d71bdfd51">ToInt64Vector</a>(coeffs), cst);</div>
|
|
<div class="line"><a name="l03547"></a><span class="lineno"> 3547</span> }</div>
|
|
<div class="line"><a name="l03548"></a><span class="lineno"> 3548</span>  </div>
|
|
<div class="line"><a name="l03549"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a72cd61da5676c60fc6f2739c0c43fba5"> 3549</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeScalProdLessOrEqual(</div>
|
|
<div class="line"><a name="l03550"></a><span class="lineno"> 3550</span>  <span class="keyword">const</span> std::vector<IntVar*>& vars, <span class="keyword">const</span> std::vector<int64_t>& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div>
|
|
<div class="line"><a name="l03551"></a><span class="lineno"> 3551</span>  int64_t cst) {</div>
|
|
<div class="line"><a name="l03552"></a><span class="lineno"> 3552</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vars.size(), <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.size());</div>
|
|
<div class="line"><a name="l03553"></a><span class="lineno"> 3553</span>  <span class="keywordflow">return</span> MakeScalProdLessOrEqualFct(<span class="keyword">this</span>, vars, <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>, cst);</div>
|
|
<div class="line"><a name="l03554"></a><span class="lineno"> 3554</span> }</div>
|
|
<div class="line"><a name="l03555"></a><span class="lineno"> 3555</span>  </div>
|
|
<div class="line"><a name="l03556"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a49794b120249479c29e4539c1af980e7"> 3556</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeScalProdLessOrEqual(</div>
|
|
<div class="line"><a name="l03557"></a><span class="lineno"> 3557</span>  <span class="keyword">const</span> std::vector<IntVar*>& vars, <span class="keyword">const</span> std::vector<int>& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div>
|
|
<div class="line"><a name="l03558"></a><span class="lineno"> 3558</span>  int64_t cst) {</div>
|
|
<div class="line"><a name="l03559"></a><span class="lineno"> 3559</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vars.size(), <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.size());</div>
|
|
<div class="line"><a name="l03560"></a><span class="lineno"> 3560</span>  <span class="keywordflow">return</span> MakeScalProdLessOrEqualFct(<span class="keyword">this</span>, vars, <a class="code" href="namespaceoperations__research.html#abeac98dfd5ab1335f6d21a8d71bdfd51">ToInt64Vector</a>(<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>),</div>
|
|
<div class="line"><a name="l03561"></a><span class="lineno"> 3561</span>  cst);</div>
|
|
<div class="line"><a name="l03562"></a><span class="lineno"> 3562</span> }</div>
|
|
<div class="line"><a name="l03563"></a><span class="lineno"> 3563</span>  </div>
|
|
<div class="line"><a name="l03564"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#ab951ede85953696032860c7a34b08bc4"> 3564</a></span> <a class="code" href="classoperations__research_1_1_int_expr.html">IntExpr</a>* Solver::MakeScalProd(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l03565"></a><span class="lineno"> 3565</span>  <span class="keyword">const</span> std::vector<int64_t>& coefs) {</div>
|
|
<div class="line"><a name="l03566"></a><span class="lineno"> 3566</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vars.size(), coefs.size());</div>
|
|
<div class="line"><a name="l03567"></a><span class="lineno"> 3567</span>  <span class="keywordflow">return</span> MakeScalProdFct(<span class="keyword">this</span>, vars, coefs);</div>
|
|
<div class="line"><a name="l03568"></a><span class="lineno"> 3568</span> }</div>
|
|
<div class="line"><a name="l03569"></a><span class="lineno"> 3569</span>  </div>
|
|
<div class="line"><a name="l03570"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a23053cfdf78a25b8e04121f30fbaa72f"> 3570</a></span> <a class="code" href="classoperations__research_1_1_int_expr.html">IntExpr</a>* Solver::MakeScalProd(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l03571"></a><span class="lineno"> 3571</span>  <span class="keyword">const</span> std::vector<int>& coefs) {</div>
|
|
<div class="line"><a name="l03572"></a><span class="lineno"> 3572</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vars.size(), coefs.size());</div>
|
|
<div class="line"><a name="l03573"></a><span class="lineno"> 3573</span>  <span class="keywordflow">return</span> MakeScalProdFct(<span class="keyword">this</span>, vars, <a class="code" href="namespaceoperations__research.html#abeac98dfd5ab1335f6d21a8d71bdfd51">ToInt64Vector</a>(coefs));</div>
|
|
<div class="line"><a name="l03574"></a><span class="lineno"> 3574</span> }</div>
|
|
<div class="line"><a name="l03575"></a><span class="lineno"> 3575</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_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_a4bd2e815ca2f702a4b6aa744b1ff3b82"><div class="ttname"><a href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a></div><div class="ttdeci">#define CHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00708">base/logging.h:708</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_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00710">base/logging.h:710</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_ab4f56aa24c4c9cddc47a6abd2d747f9a"><div class="ttname"><a href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a></div><div class="ttdeci">#define DCHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00898">base/logging.h:898</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_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00423">base/logging.h:423</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_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="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_expr_html"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html">operations_research::IntExpr</a></div><div class="ttdoc">The class IntExpr is the base of all integer expressions in constraint programming.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03839">constraint_solver.h:3839</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_a07173db6ca3b22fdb35ad963831a962b"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a07173db6ca3b22fdb35ad963831a962b">operations_research::IntExpr::Var</a></div><div class="ttdeci">virtual IntVar * Var()=0</div><div class="ttdoc">Creates a variable from the expression.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_html"><div class="ttname"><a href="classoperations__research_1_1_int_var.html">operations_research::IntVar</a></div><div class="ttdoc">The class IntVar is a subset of IntExpr.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04001">constraint_solver.h:4001</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_a28e3cf762a241bdf2838651120aa98cf"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a28e3cf762a241bdf2838651120aa98cf">operations_research::ModelVisitor::kSumEqual</a></div><div class="ttdeci">static const char kSumEqual[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03413">constraint_solver.h:3413</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_a489f38dd601db8d045efae4d9ae7d754"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a489f38dd601db8d045efae4d9ae7d754">operations_research::ModelVisitor::kTargetArgument</a></div><div class="ttdeci">static const char kTargetArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03489">constraint_solver.h:3489</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_a7899dfe8b41c6b2b13546d921114f8d2"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a7899dfe8b41c6b2b13546d921114f8d2">operations_research::ModelVisitor::kValueArgument</a></div><div class="ttdeci">static const char kValueArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03493">constraint_solver.h:3493</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_a9b6934d34d2fdafca6a9c43f6087dc5c"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a9b6934d34d2fdafca6a9c43f6087dc5c">operations_research::ModelVisitor::kMaxEqual</a></div><div class="ttdeci">static const char kMaxEqual[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03386">constraint_solver.h:3386</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_a9bafcebba3b66bac587ce7060c7ae0c6"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a9bafcebba3b66bac587ce7060c7ae0c6">operations_research::ModelVisitor::kSumLessOrEqual</a></div><div class="ttdeci">static const char kSumLessOrEqual[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03415">constraint_solver.h:3415</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_adeea8c62c6003b04a723e309ffc792ca"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#adeea8c62c6003b04a723e309ffc792ca">operations_research::ModelVisitor::kMinEqual</a></div><div class="ttdeci">static const char kMinEqual[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03389">constraint_solver.h:3389</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_ae2d9a127eb9ef5891d0cf5e480574fec"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#ae2d9a127eb9ef5891d0cf5e480574fec">operations_research::ModelVisitor::kSumGreaterOrEqual</a></div><div class="ttdeci">static const char kSumGreaterOrEqual[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03414">constraint_solver.h:3414</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_numerical_rev_html_a83c8a2812799fd87becd114374fb1d36"><div class="ttname"><a href="classoperations__research_1_1_numerical_rev.html#a83c8a2812799fd87becd114374fb1d36">operations_research::NumericalRev::Decr</a></div><div class="ttdeci">void Decr(Solver *const s)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03771">constraint_solver.h:3771</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_numerical_rev_html_ac8beef1ef5cd6ce8bdfb3f48016ff72b"><div class="ttname"><a href="classoperations__research_1_1_numerical_rev.html#ac8beef1ef5cd6ce8bdfb3f48016ff72b">operations_research::NumericalRev::Incr</a></div><div class="ttdeci">void Incr(Solver *const s)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03769">constraint_solver.h:3769</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_rev_html_a95da6a138a3b56de0cf0c3c4ba7c4688"><div class="ttname"><a href="classoperations__research_1_1_rev.html#a95da6a138a3b56de0cf0c3c4ba7c4688">operations_research::Rev::SetValue</a></div><div class="ttdeci">void SetValue(Solver *const s, const T &val)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03744">constraint_solver.h:3744</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_rev_html_affc0b3b0a5efa3efc9d0d86344d4a29f"><div class="ttname"><a href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">operations_research::Rev::Value</a></div><div class="ttdeci">const T & Value() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03742">constraint_solver.h:3742</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="acp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00108">cp_model_fz_solver.cc:108</a></div></div>
|
|
<div class="ttc" id="adefault__search_8cc_html_ac673bc430bdc3fdaa09f7becf98ef267"><div class="ttname"><a href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a></div><div class="ttdeci">const std::string name</div><div class="ttdef"><b>Definition:</b> <a href="default__search_8cc_source.html#l00813">default_search.cc:813</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="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_a151248525a9e07eb3e6e60ea1c4995eb"><div class="ttname"><a href="expr__array_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a></div><div class="ttdeci">const std::vector< IntVar * > vars_</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l00138">expr_array.cc:138</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="aexpr__array_8cc_html_a6338e469375ab701689733df320f8a3d"><div class="ttname"><a href="expr__array_8cc.html#a6338e469375ab701689733df320f8a3d">node_max</a></div><div class="ttdeci">Rev< int64_t > node_max</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l00144">expr_array.cc:144</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a7ace0bd24fca8b7eecf784d58683eefd"><div class="ttname"><a href="expr__array_8cc.html#a7ace0bd24fca8b7eecf784d58683eefd">IS_TYPE</a></div><div class="ttdeci">#define IS_TYPE(type, tag)</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l02402">expr_array.cc:2402</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_abda708e4a6f0de72a842382f919a7c31"><div class="ttname"><a href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a></div><div class="ttdeci">int64_t coef</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01875">expr_array.cc:1875</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_ac23690f5533e0ad832ee79de680f3161"><div class="ttname"><a href="expr__array_8cc.html#ac23690f5533e0ad832ee79de680f3161">inactive_</a></div><div class="ttdeci">RevSwitch inactive_</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01487">expr_array.cc:1487</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_af1270f025dc2ffc2c07aff435ce41005"><div class="ttname"><a href="expr__array_8cc.html#af1270f025dc2ffc2c07aff435ce41005">node_min</a></div><div class="ttdeci">Rev< int64_t > node_min</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l00143">expr_array.cc:143</a></div></div>
|
|
<div class="ttc" id="agscip__solver_8cc_html_a1ba5ca0f61f2fa13bd23bf0f89004f35"><div class="ttname"><a href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a></div><div class="ttdeci">double upper_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00126">gscip_solver.cc:126</a></div></div>
|
|
<div class="ttc" id="agscip__solver_8cc_html_aa59e74cc299dbf75fa6e2234dd0849a2"><div class="ttname"><a href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a></div><div class="ttdeci">absl::Span< const double > coefficients</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00129">gscip_solver.cc:129</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="alog__severity_8h_html_a50e5762f38854b37ee3e2851bc1bb0e7"><div class="ttname"><a href="log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7">WARNING</a></div><div class="ttdeci">const int WARNING</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00031">log_severity.h:31</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_acdd38e3c9f22f127d7776920e3079eda"><div class="ttname"><a href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a></div><div class="ttdeci">const int FATAL</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00032">log_severity.h:32</a></div></div>
|
|
<div class="ttc" id="amathutil_8h_html"><div class="ttname"><a href="mathutil_8h.html">mathutil.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">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_a111f44b9b9cf67a8e8d83794ac9f5291"><div class="ttname"><a href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">operations_research::CapAdd</a></div><div class="ttdeci">int64_t CapAdd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00126">saturated_arithmetic.h:126</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a38972723946490ea4df4e34298d8805d"><div class="ttname"><a href="namespaceoperations__research.html#a38972723946490ea4df4e34298d8805d">operations_research::AreAllNegative</a></div><div class="ttdeci">bool AreAllNegative(const std::vector< T > &values)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l02886">constraint_solveri.h:2886</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a3ea6af6581e6922832918c97753146a7"><div class="ttname"><a href="namespaceoperations__research.html#a3ea6af6581e6922832918c97753146a7">operations_research::MakeConstraintDemon0</a></div><div class="ttdeci">Demon * MakeConstraintDemon0(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#l00518">constraint_solveri.h:518</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a4a43d435871f16c321861fa5de32df82"><div class="ttname"><a href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">operations_research::CapSub</a></div><div class="ttdeci">int64_t CapSub(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00156">saturated_arithmetic.h:156</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_a54470bffc3ea32cc37d0222e5dbb62a6"><div class="ttname"><a href="namespaceoperations__research.html#a54470bffc3ea32cc37d0222e5dbb62a6">operations_research::AreAllBoundOrNull</a></div><div class="ttdeci">bool AreAllBoundOrNull(const std::vector< IntVar * > &vars, const std::vector< T > &values)</div><div class="ttdoc">Returns true if all the variables are assigned to a single value, or if their corresponding value is ...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l02947">constraint_solveri.h:2947</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a5a9881f8a07b166ef2cbde572cea27b6"><div class="ttname"><a href="namespaceoperations__research.html#a5a9881f8a07b166ef2cbde572cea27b6">operations_research::Zero</a></div><div class="ttdeci">int64_t Zero()</div><div class="ttdoc">NOLINT.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03146">constraint_solver.h:3146</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a7abde7313cef64d25202a18f07481fc3"><div class="ttname"><a href="namespaceoperations__research.html#a7abde7313cef64d25202a18f07481fc3">operations_research::AreAllBooleans</a></div><div class="ttdeci">bool AreAllBooleans(const std::vector< IntVar * > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l02940">constraint_solveri.h:2940</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_aa64bf49d041052c7cb3f40f7496d7534"><div class="ttname"><a href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">operations_research::CapProd</a></div><div class="ttdeci">int64_t CapProd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00233">saturated_arithmetic.h:233</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ab0ae787392a8dd8a499eb55ac0916aa4"><div class="ttname"><a href="namespaceoperations__research.html#ab0ae787392a8dd8a499eb55ac0916aa4">operations_research::AreAllNull</a></div><div class="ttdeci">bool AreAllNull(const std::vector< T > &values)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l02856">constraint_solveri.h:2856</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ab62b402f767cda48eb67ef8b50397f8f"><div class="ttname"><a href="namespaceoperations__research.html#ab62b402f767cda48eb67ef8b50397f8f">operations_research::AreAllPositive</a></div><div class="ttdeci">bool AreAllPositive(const std::vector< T > &values)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l02881">constraint_solveri.h:2881</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_abeac98dfd5ab1335f6d21a8d71bdfd51"><div class="ttname"><a href="namespaceoperations__research.html#abeac98dfd5ab1335f6d21a8d71bdfd51">operations_research::ToInt64Vector</a></div><div class="ttdeci">std::vector< int64_t > ToInt64Vector(const std::vector< int > &input)</div><div class="ttdef"><b>Definition:</b> <a href="utilities_8cc_source.html#l00828">utilities.cc:828</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ae3e4f71c4c79e0b4ec00c4e715a7c298"><div class="ttname"><a href="namespaceoperations__research.html#ae3e4f71c4c79e0b4ec00c4e715a7c298">operations_research::AreAllOnes</a></div><div class="ttdeci">bool AreAllOnes(const std::vector< T > &values)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l02851">constraint_solveri.h:2851</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aea04391e4d85555ed4fde9b89e8139f2"><div class="ttname"><a href="namespaceoperations__research.html#aea04391e4d85555ed4fde9b89e8139f2">operations_research::JoinNamePtr</a></div><div class="ttdeci">std::string JoinNamePtr(const std::vector< T > &v, const std::string &separator)</div><div class="ttdef"><b>Definition:</b> <a href="string__array_8h_source.html#l00052">string_array.h:52</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="arouting__filters_8cc_html_a8e4ee19dee0e00541dbe9bbc83d806ba"><div class="ttname"><a href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a></div><div class="ttdeci">int64_t coefficient</div><div class="ttdef"><b>Definition:</b> <a href="routing__filters_8cc_source.html#l00985">routing_filters.cc:985</a></div></div>
|
|
<div class="ttc" id="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
<div class="ttc" id="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="astring__array_8h_html"><div class="ttname"><a href="string__array_8h.html">string_array.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="expr__array_8cc.html">expr_array.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>
|