150 lines
137 KiB
HTML
150 lines
137 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.15"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: alldiff_cst.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>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</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.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('alldiff__cst_8cc_source.html','');});
|
|
/* @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">alldiff_cst.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="alldiff__cst_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">// AllDifferent constraints</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <memory></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <string></span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <utility></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 "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</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="l00027"></a><span class="lineno"> 27</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="l00028"></a><span class="lineno"> 28</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="l00029"></a><span class="lineno"> 29</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="l00030"></a><span class="lineno"> 30</span> </div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">namespace </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">class </span>BaseAllDifferent : <span class="keyword">public</span> Constraint {</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  BaseAllDifferent(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars)</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  : Constraint(s), <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars) {}</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  ~BaseAllDifferent()<span class="keyword"> override </span>{}</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</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="l00040"></a><span class="lineno"> 40</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="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, <span class="stringliteral">", "</span>));</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  }</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> </div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb"> 44</a></span>  <span class="keyword">const</span> std::vector<IntVar*> <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  int64_t size()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); }</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> };</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">//-----------------------------------------------------------------------------</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// ValueAllDifferent</span></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> <span class="keyword">class </span>ValueAllDifferent : <span class="keyword">public</span> BaseAllDifferent {</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  ValueAllDifferent(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars)</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  : BaseAllDifferent(s, vars) {}</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  ~ValueAllDifferent()<span class="keyword"> override </span>{}</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> </div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordtype">void</span> Post() <span class="keyword">override</span>;</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordtype">void</span> InitialPropagate() <span class="keyword">override</span>;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordtype">void</span> OneMove(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordtype">bool</span> AllMoves();</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  std::string DebugString()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">return</span> DebugStringInternal(<span class="stringliteral">"ValueAllDifferent"</span>);</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  }</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</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="l00066"></a><span class="lineno"> 66</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#ae90c1dfbea9c59346f5db0e636d3a6cc">ModelVisitor::kAllDifferent</a>, <span class="keyword">this</span>);</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  visitor->VisitIntegerArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a37aa9ace9fa14d4208c019662ae90da6">ModelVisitor::kRangeArgument</a>, 0);</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#ae90c1dfbea9c59346f5db0e636d3a6cc">ModelVisitor::kAllDifferent</a>, <span class="keyword">this</span>);</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  }</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> </div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  RevSwitch all_instantiated_;</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> </div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="keywordtype">void</span> ValueAllDifferent::Post() {</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  IntVar* <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i];</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  Demon* d = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(solver(), <span class="keyword">this</span>, &ValueAllDifferent::OneMove,</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="stringliteral">"OneMove"</span>, i);</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>-><a class="code" href="classoperations__research_1_1_int_var.html#a6e33a313eaf507bae0eb7068455a5bdc">WhenBound</a>(d);</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> }</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="keywordtype">void</span> ValueAllDifferent::InitialPropagate() {</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">if</span> (<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Bound()) {</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  OneMove(i);</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> }</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="keywordtype">void</span> ValueAllDifferent::OneMove(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (!AllMoves()) {</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">const</span> int64_t val = <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Value();</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < size(); ++j) {</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> != j) {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> (<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[j]->Size() < 0xFFFFFF) {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[j]->RemoveValue(val);</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  solver()->AddConstraint(solver()->MakeNonEquality(<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[j], val));</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>  }</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> }</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> <span class="keywordtype">bool</span> ValueAllDifferent::AllMoves() {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">if</span> (all_instantiated_.<a class="code" href="classoperations__research_1_1_rev_switch.html#acd90006e99a15f7e9df2aee5cf46549c">Switched</a>() || size() == 0) {</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">if</span> (!<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Bound()) {</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  }</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  }</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  std::unique_ptr<int64_t[]> values(<span class="keyword">new</span> int64_t[size()]);</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  values[i] = <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->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>  std::sort(values.get(), values.get() + size());</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size() - 1; ++i) {</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">if</span> (values[i] == values[i + 1]) {</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  values.reset(); <span class="comment">// prevent leaks (solver()->Fail() won't return)</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  solver()->Fail();</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  }</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  }</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  all_instantiated_.<a class="code" href="classoperations__research_1_1_rev_switch.html#aba56f30d7550dc96d418c689e3ea41f0">Switch</a>(solver());</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> }</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> </div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment">// ---------- Bounds All Different ----------</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// See http://www.cs.uwaterloo.ca/~cquimper/Papers/ijcai03_TR.pdf for details.</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> </div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="keyword">class </span>RangeBipartiteMatching {</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keyword">struct </span>Interval {</div><div class="line"><a name="l00139"></a><span class="lineno"><a class="line" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045"> 139</a></span>  int64_t <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a>;</div><div class="line"><a name="l00140"></a><span class="lineno"><a class="line" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f"> 140</a></span>  int64_t <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a>;</div><div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="alldiff__cst_8cc.html#ace1a164cb9535504a4441b0e81998eb7"> 141</a></span>  <span class="keywordtype">int</span> <a class="code" href="alldiff__cst_8cc.html#ace1a164cb9535504a4441b0e81998eb7">min_rank</a>;</div><div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="alldiff__cst_8cc.html#a5c4f8c31d1c77116201f5c497e1e19f8"> 142</a></span>  <span class="keywordtype">int</span> <a class="code" href="alldiff__cst_8cc.html#a5c4f8c31d1c77116201f5c497e1e19f8">max_rank</a>;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  };</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> </div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  RangeBipartiteMatching(Solver* <span class="keyword">const</span> solver, <span class="keywordtype">int</span> size)</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  : solver_(solver),</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  size_(size),</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  intervals_(new Interval[size + 1]),</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  min_sorted_(new Interval*[size]),</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  max_sorted_(new Interval*[size]),</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  bounds_(new int64_t[2 * size + 2]),</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  tree_(new int[2 * size + 2]),</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  diff_(new int64_t[2 * size + 2]),</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  hall_(new int[2 * size + 2]),</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  active_size_(0) {</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  max_sorted_[i] = &intervals_[i];</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  min_sorted_[i] = max_sorted_[i];</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  }</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  }</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> </div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordtype">void</span> SetRange(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, int64_t imin, int64_t imax) {</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  intervals_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].min = imin;</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  intervals_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].max = imax;</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  }</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> </div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordtype">bool</span> Propagate() {</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  SortArray();</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> modified1 = PropagateMin();</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> modified2 = PropagateMax();</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">return</span> modified1 || modified2;</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  }</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  int64_t Min(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> intervals_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].min; }</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> </div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  int64_t Max(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> intervals_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].max; }</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">// This method sorts the min_sorted_ and max_sorted_ arrays and fill</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// the bounds_ array (and set the active_size_ counter).</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordtype">void</span> SortArray() {</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  std::sort(min_sorted_.get(), min_sorted_.get() + size_,</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  CompareIntervalMin());</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  std::sort(max_sorted_.get(), max_sorted_.get() + size_,</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  CompareIntervalMax());</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>  int64_t <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a> = min_sorted_[0]->min;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  int64_t <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a> = max_sorted_[0]->max + 1;</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  int64_t last = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a> - 2;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  bounds_[0] = last;</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> </div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordtype">int</span> i = 0;</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordtype">int</span> j = 0;</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordtype">int</span> nb = 0;</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">for</span> (;;) { <span class="comment">// merge min_sorted_[] and max_sorted_[] into bounds_[].</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">if</span> (i < size_ && <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a> <= <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a>) { <span class="comment">// make sure min_sorted_ exhausted first.</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">if</span> (<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a> != last) {</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  last = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a>;</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  bounds_[++nb] = last;</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>  min_sorted_[i]->min_rank = nb;</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">if</span> (++i < size_) {</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a> = min_sorted_[i]->min;</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  }</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">if</span> (<a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a> != last) {</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  last = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a>;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  bounds_[++nb] = last;</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  }</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  max_sorted_[j]->max_rank = nb;</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">if</span> (++j == size_) {</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  }</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a> = max_sorted_[j]->max + 1;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  }</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  }</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  active_size_ = nb;</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  bounds_[nb + 1] = bounds_[nb] + 2;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  }</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> </div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// These two methods will actually do the new bounds computation.</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordtype">bool</span> PropagateMin() {</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordtype">bool</span> modified = <span class="keyword">false</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>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i <= active_size_ + 1; ++i) {</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  hall_[i] = i - 1;</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  tree_[i] = i - 1;</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  diff_[i] = bounds_[i] - bounds_[i - 1];</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  }</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="comment">// visit intervals in increasing max order</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> x = max_sorted_[i]->min_rank;</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> y = max_sorted_[i]->max_rank;</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordtype">int</span> z = PathMax(tree_.get(), x + 1);</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordtype">int</span> j = tree_[z];</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">if</span> (--diff_[z] == 0) {</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  tree_[z] = z + 1;</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  z = PathMax(tree_.get(), z + 1);</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  tree_[z] = j;</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>  PathSet(x + 1, z, z, tree_.get()); <span class="comment">// path compression</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordflow">if</span> (diff_[z] < bounds_[z] - bounds_[y]) {</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  solver_->Fail();</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="keywordflow">if</span> (hall_[x] > x) {</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordtype">int</span> w = PathMax(hall_.get(), hall_[x]);</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  max_sorted_[i]->min = bounds_[w];</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  PathSet(x, w, w, hall_.get()); <span class="comment">// path compression</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  modified = <span class="keyword">true</span>;</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  }</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">if</span> (diff_[z] == bounds_[z] - bounds_[y]) {</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  PathSet(hall_[y], j - 1, y, hall_.get()); <span class="comment">// mark hall interval</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  hall_[y] = j - 1;</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  }</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">return</span> modified;</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> </div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordtype">bool</span> PropagateMax() {</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordtype">bool</span> modified = <span class="keyword">false</span>;</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> </div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i <= active_size_; i++) {</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  tree_[i] = i + 1;</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  hall_[i] = i + 1;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  diff_[i] = bounds_[i + 1] - bounds_[i];</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  }</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="comment">// visit intervals in decreasing min order</span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = size_ - 1; i >= 0; --i) {</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> x = min_sorted_[i]->max_rank;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> y = min_sorted_[i]->min_rank;</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordtype">int</span> z = PathMin(tree_.get(), x - 1);</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordtype">int</span> j = tree_[z];</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">if</span> (--diff_[z] == 0) {</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  tree_[z] = z - 1;</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  z = PathMin(tree_.get(), z - 1);</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  tree_[z] = j;</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  }</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  PathSet(x - 1, z, z, tree_.get());</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">if</span> (diff_[z] < bounds_[y] - bounds_[z]) {</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  solver_->Fail();</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="comment">// useless. Should have been caught by the PropagateMin() method.</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  }</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">if</span> (hall_[x] < x) {</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordtype">int</span> w = PathMin(hall_.get(), hall_[x]);</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  min_sorted_[i]->max = bounds_[w] - 1;</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  PathSet(x, w, w, hall_.get());</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  modified = <span class="keyword">true</span>;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  }</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordflow">if</span> (diff_[z] == bounds_[y] - bounds_[z]) {</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  PathSet(hall_[y], j + 1, y, hall_.get());</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  hall_[y] = j + 1;</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  }</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  }</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">return</span> modified;</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> </div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">// TODO(user) : use better sort, use bounding boxes of modifications to</span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// improve the sorting (only modified vars).</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 method is used by the STL sort.</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keyword">struct </span>CompareIntervalMin {</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> Interval* i1, <span class="keyword">const</span> Interval* i2)<span class="keyword"> const </span>{</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordflow">return</span> (i1->min < i2->min);</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  }</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  };</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> </div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="comment">// This method is used by the STL sort.</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keyword">struct </span>CompareIntervalMax {</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> Interval* i1, <span class="keyword">const</span> Interval* i2)<span class="keyword"> const </span>{</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">return</span> (i1->max < i2->max);</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  }</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  };</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> </div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordtype">void</span> PathSet(<span class="keywordtype">int</span> start, <span class="keywordtype">int</span> end, <span class="keywordtype">int</span> to, <span class="keywordtype">int</span>* <span class="keyword">const</span> tree) {</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordtype">int</span> l = start;</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">while</span> (l != end) {</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordtype">int</span> k = l;</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  l = tree[k];</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  tree[k] = to;</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  }</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>  <span class="keywordtype">int</span> PathMin(<span class="keyword">const</span> <span class="keywordtype">int</span>* <span class="keyword">const</span> tree, <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keywordtype">int</span> i = <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">while</span> (tree[i] < i) {</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  i = tree[i];</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  }</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordflow">return</span> i;</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  }</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> </div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordtype">int</span> PathMax(<span class="keyword">const</span> <span class="keywordtype">int</span>* <span class="keyword">const</span> tree, <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordtype">int</span> i = <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordflow">while</span> (tree[i] > i) {</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  i = tree[i];</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>  <span class="keywordflow">return</span> i;</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  }</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span> </div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  Solver* <span class="keyword">const</span> solver_;</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size_;</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  std::unique_ptr<Interval[]> intervals_;</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  std::unique_ptr<Interval*[]> min_sorted_;</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  std::unique_ptr<Interval*[]> max_sorted_;</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">// bounds_[1..active_size_] hold set of min & max in the n intervals_</span></div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="comment">// while bounds_[0] and bounds_[active_size_ + 1] allow sentinels.</span></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  std::unique_ptr<int64_t[]> bounds_;</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  std::unique_ptr<int[]> tree_; <span class="comment">// tree links.</span></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  std::unique_ptr<int64_t[]> diff_; <span class="comment">// diffs between critical capacities.</span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  std::unique_ptr<int[]> hall_; <span class="comment">// hall interval links.</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keywordtype">int</span> active_size_;</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> };</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span> </div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="keyword">class </span>BoundsAllDifferent : <span class="keyword">public</span> BaseAllDifferent {</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  BoundsAllDifferent(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& vars)</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  : BaseAllDifferent(s, vars), matching_(s, vars.size()) {}</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> </div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  ~BoundsAllDifferent()<span class="keyword"> override </span>{}</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> </div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  Demon* range = <a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  solver(), <span class="keyword">this</span>, &BoundsAllDifferent::IncrementalPropagate,</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="stringliteral">"IncrementalPropagate"</span>);</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> </div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenRange(range);</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  Demon* <a class="code" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a> = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(solver(), <span class="keyword">this</span>,</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  &BoundsAllDifferent::PropagateValue,</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="stringliteral">"PropagateValue"</span>, i);</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenBound(<a class="code" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a>);</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> </div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  IncrementalPropagate();</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">if</span> (<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Bound()) {</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  PropagateValue(i);</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  }</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  }</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>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> IncrementalPropagate() {</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  matching_.SetRange(i, <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min(), <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max());</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  }</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> </div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">if</span> (matching_.Propagate()) {</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->SetRange(matching_.Min(i), matching_.Max(i));</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  }</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  }</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  }</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> </div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keywordtype">void</span> PropagateValue(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keyword">const</span> int64_t to_remove = <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Value();</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>; j++) {</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordflow">if</span> (<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[j]->Size() < 0xFFFFFF) {</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[j]->RemoveValue(to_remove);</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  solver()->AddConstraint(solver()->MakeNonEquality(<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[j], to_remove));</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  }</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  }</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + 1; j < size(); j++) {</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordflow">if</span> (<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[j]->Size() < 0xFFFFFF) {</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[j]->RemoveValue(to_remove);</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  solver()->AddConstraint(solver()->MakeNonEquality(<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[j], to_remove));</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  }</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  }</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  }</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> </div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  std::string DebugString()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">return</span> DebugStringInternal(<span class="stringliteral">"BoundsAllDifferent"</span>);</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  }</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> </div><div class="line"><a name="l00418"></a><span class="lineno"> 418</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="l00419"></a><span class="lineno"> 419</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#ae90c1dfbea9c59346f5db0e636d3a6cc">ModelVisitor::kAllDifferent</a>, <span class="keyword">this</span>);</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  visitor->VisitIntegerArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a37aa9ace9fa14d4208c019662ae90da6">ModelVisitor::kRangeArgument</a>, 1);</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#ae90c1dfbea9c59346f5db0e636d3a6cc">ModelVisitor::kAllDifferent</a>, <span class="keyword">this</span>);</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  }</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> </div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  RangeBipartiteMatching matching_;</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> };</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> </div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="keyword">class </span>SortConstraint : <span class="keyword">public</span> Constraint {</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  SortConstraint(Solver* <span class="keyword">const</span> solver,</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keyword">const</span> std::vector<IntVar*>& original_vars,</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keyword">const</span> std::vector<IntVar*>& sorted_vars)</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  : Constraint(solver),</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  ovars_(original_vars),</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  svars_(sorted_vars),</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  mins_(original_vars.size(), 0),</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  maxs_(original_vars.size(), 0),</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  matching_(solver, original_vars.size()) {}</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> </div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  ~SortConstraint()<span class="keyword"> override </span>{}</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> </div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  Demon* <span class="keyword">const</span> demon =</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  solver()->MakeDelayedConstraintInitialPropagateCallback(<span class="keyword">this</span>);</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  ovars_[i]->WhenRange(demon);</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  svars_[i]->WhenRange(demon);</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  }</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  }</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>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  int64_t vmin = 0;</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  int64_t vmax = 0;</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  ovars_[i]->Range(&vmin, &vmax);</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  mins_[i] = vmin;</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  maxs_[i] = vmax;</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  }</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="comment">// Propagates from variables to sorted variables.</span></div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  std::sort(mins_.begin(), mins_.end());</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  std::sort(maxs_.begin(), maxs_.end());</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  svars_[i]->SetRange(mins_[i], maxs_[i]);</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="comment">// Maintains sortedness.</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size() - 1; ++i) {</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  svars_[i + 1]->SetMin(svars_[i]->Min());</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  }</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = size() - 1; i > 0; --i) {</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  svars_[i - 1]->SetMax(svars_[i]->Max());</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>  <span class="comment">// Reverse propagation.</span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  int64_t imin = 0;</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  int64_t imax = 0;</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  FindIntersectionRange(i, &imin, &imax);</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  matching_.SetRange(i, imin, imax);</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  }</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  matching_.Propagate();</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keyword">const</span> int64_t vmin = svars_[matching_.Min(i)]->Min();</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keyword">const</span> int64_t vmax = svars_[matching_.Max(i)]->Max();</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  ovars_[i]->SetRange(vmin, vmax);</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  }</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  }</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span> </div><div class="line"><a name="l00489"></a><span class="lineno"> 489</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="l00490"></a><span class="lineno"> 490</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a2ed9de38632f5dd38ef8cb9bdf5bb2b6">ModelVisitor::kSortingConstraint</a>, <span class="keyword">this</span>);</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  ovars_);</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a489f38dd601db8d045efae4d9ae7d754">ModelVisitor::kTargetArgument</a>,</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  svars_);</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a2ed9de38632f5dd38ef8cb9bdf5bb2b6">ModelVisitor::kSortingConstraint</a>, <span class="keyword">this</span>);</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  }</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span> </div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  std::string DebugString()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"Sort(%s, %s)"</span>, <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(ovars_, <span class="stringliteral">", "</span>),</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(svars_, <span class="stringliteral">", "</span>));</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  }</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> </div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  int64_t size()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> ovars_.size(); }</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span> </div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keywordtype">void</span> FindIntersectionRange(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, int64_t* <span class="keyword">const</span> range_min,</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  int64_t* <span class="keyword">const</span> range_max)<span class="keyword"> const </span>{</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="comment">// Naive version.</span></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="comment">// TODO(user): Implement log(n) version.</span></div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  int64_t imin = 0;</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordflow">while</span> (imin < size() && NotIntersect(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, imin)) {</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  imin++;</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>  <span class="keywordflow">if</span> (imin == size()) {</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  solver()->Fail();</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  }</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  int64_t imax = size() - 1;</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keywordflow">while</span> (imax > imin && NotIntersect(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, imax)) {</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  imax--;</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>  *range_min = imin;</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  *range_max = imax;</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  }</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> </div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keywordtype">bool</span> NotIntersect(<span class="keywordtype">int</span> oindex, <span class="keywordtype">int</span> sindex)<span class="keyword"> const </span>{</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordflow">return</span> ovars_[oindex]->Min() > svars_[sindex]->Max() ||</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  ovars_[oindex]->Max() < svars_[sindex]->Min();</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  }</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> </div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keyword">const</span> std::vector<IntVar*> ovars_;</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keyword">const</span> std::vector<IntVar*> svars_;</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  std::vector<int64_t> mins_;</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  std::vector<int64_t> maxs_;</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  RangeBipartiteMatching matching_;</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> };</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> </div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="comment">// All variables are pairwise different, unless they are assigned to</span></div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="comment">// the escape value.</span></div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="keyword">class </span>AllDifferentExcept : <span class="keyword">public</span> Constraint {</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  AllDifferentExcept(Solver* <span class="keyword">const</span> s, std::vector<IntVar*> vars,</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  int64_t escape_value)</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  : Constraint(s), <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(std::move(vars)), escape_value_(escape_value) {}</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> </div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  ~AllDifferentExcept()<span class="keyword"> override </span>{}</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span> </div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i];</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  Demon* <span class="keyword">const</span> d = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  solver(), <span class="keyword">this</span>, &AllDifferentExcept::Propagate, <span class="stringliteral">"Propagate"</span>, i);</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->WhenBound(d);</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  }</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  }</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span> </div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordflow">if</span> (<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Bound()) {</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  Propagate(i);</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  }</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  }</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  }</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> </div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keywordtype">void</span> Propagate(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keyword">const</span> int64_t val = <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Value();</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keywordflow">if</span> (val != escape_value_) {</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++j) {</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> != j) {</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[j]->RemoveValue(val);</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  }</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  }</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  }</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  }</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span> </div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  std::string DebugString()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"AllDifferentExcept([%s], %d"</span>,</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>, <span class="stringliteral">", "</span>), escape_value_);</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  }</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> </div><div class="line"><a name="l00580"></a><span class="lineno"> 580</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="l00581"></a><span class="lineno"> 581</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#ae90c1dfbea9c59346f5db0e636d3a6cc">ModelVisitor::kAllDifferent</a>, <span class="keyword">this</span>);</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>);</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  visitor->VisitIntegerArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a7899dfe8b41c6b2b13546d921114f8d2">ModelVisitor::kValueArgument</a>, escape_value_);</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#ae90c1dfbea9c59346f5db0e636d3a6cc">ModelVisitor::kAllDifferent</a>, <span class="keyword">this</span>);</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  }</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span> </div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  std::vector<IntVar*> <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keyword">const</span> int64_t escape_value_;</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span> };</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span> </div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span> <span class="comment">// Creates a constraint that states that all variables in the first</span></div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span> <span class="comment">// vector are different from all variables from the second group,</span></div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span> <span class="comment">// unless they are assigned to the escape value if it is defined. Thus</span></div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span> <span class="comment">// the set of values in the first vector minus the escape value does</span></div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span> <span class="comment">// not intersect the set of values in the second vector.</span></div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span> <span class="keyword">class </span>NullIntersectArrayExcept : <span class="keyword">public</span> Constraint {</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  NullIntersectArrayExcept(Solver* <span class="keyword">const</span> s, std::vector<IntVar*> first_vars,</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  std::vector<IntVar*> second_vars,</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  int64_t escape_value)</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  : Constraint(s),</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  first_vars_(std::move(first_vars)),</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  second_vars_(std::move(second_vars)),</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  escape_value_(escape_value),</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  has_escape_value_(true) {}</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>  NullIntersectArrayExcept(Solver* <span class="keyword">const</span> s, std::vector<IntVar*> first_vars,</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  std::vector<IntVar*> second_vars)</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  : Constraint(s),</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  first_vars_(std::move(first_vars)),</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  second_vars_(std::move(second_vars)),</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  escape_value_(0),</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  has_escape_value_(false) {}</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>  ~NullIntersectArrayExcept()<span class="keyword"> override </span>{}</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span> </div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < first_vars_.size(); ++i) {</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = first_vars_[i];</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  Demon* <span class="keyword">const</span> d = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  solver(), <span class="keyword">this</span>, &NullIntersectArrayExcept::PropagateFirst,</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="stringliteral">"PropagateFirst"</span>, i);</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->WhenBound(d);</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  }</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < second_vars_.size(); ++i) {</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = second_vars_[i];</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  Demon* <span class="keyword">const</span> d = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  solver(), <span class="keyword">this</span>, &NullIntersectArrayExcept::PropagateSecond,</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="stringliteral">"PropagateSecond"</span>, i);</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->WhenBound(d);</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> </div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < first_vars_.size(); ++i) {</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keywordflow">if</span> (first_vars_[i]->Bound()) {</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  PropagateFirst(i);</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="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < second_vars_.size(); ++i) {</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keywordflow">if</span> (second_vars_[i]->Bound()) {</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  PropagateSecond(i);</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>  }</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>  <span class="keywordtype">void</span> PropagateFirst(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keyword">const</span> int64_t val = first_vars_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Value();</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keywordflow">if</span> (!has_escape_value_ || val != escape_value_) {</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < second_vars_.size(); ++j) {</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  second_vars_[j]->RemoveValue(val);</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  }</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  }</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  }</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span> </div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordtype">void</span> PropagateSecond(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="keyword">const</span> int64_t val = second_vars_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Value();</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keywordflow">if</span> (!has_escape_value_ || val != escape_value_) {</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < first_vars_.size(); ++j) {</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  first_vars_[j]->RemoveValue(val);</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  }</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  }</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  }</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>  std::string DebugString()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"NullIntersectArray([%s], [%s], escape = %d"</span>,</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(first_vars_, <span class="stringliteral">", "</span>),</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(second_vars_, <span class="stringliteral">", "</span>),</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  escape_value_);</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  }</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span> </div><div class="line"><a name="l00674"></a><span class="lineno"> 674</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="l00675"></a><span class="lineno"> 675</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a5916e547f0c971bcd001c9e2039fd077">ModelVisitor::kNullIntersect</a>, <span class="keyword">this</span>);</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a8e24c7d309e4aaa23eca1c75bd42bdc5">ModelVisitor::kLeftArgument</a>,</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  first_vars_);</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aaeff643bea5491c9055dc67124d5d3d2">ModelVisitor::kRightArgument</a>,</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  second_vars_);</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  visitor->VisitIntegerArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a7899dfe8b41c6b2b13546d921114f8d2">ModelVisitor::kValueArgument</a>, escape_value_);</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a5916e547f0c971bcd001c9e2039fd077">ModelVisitor::kNullIntersect</a>, <span class="keyword">this</span>);</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  }</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span> </div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  std::vector<IntVar*> first_vars_;</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  std::vector<IntVar*> second_vars_;</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keyword">const</span> int64_t escape_value_;</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> has_escape_value_;</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span> };</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span> } <span class="comment">// namespace</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"><a class="line" href="classoperations__research_1_1_solver.html#ac145423b7d355bcd75d627871ca95e86"> 692</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#ac145423b7d355bcd75d627871ca95e86">Solver::MakeAllDifferent</a>(<span class="keyword">const</span> std::vector<IntVar*>& vars) {</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ac145423b7d355bcd75d627871ca95e86">MakeAllDifferent</a>(vars, <span class="keyword">true</span>);</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> </div><div class="line"><a name="l00696"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a5ab1471e27355b524a9a50b8e8386717"> 696</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#ac145423b7d355bcd75d627871ca95e86">Solver::MakeAllDifferent</a>(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keywordtype">bool</span> stronger_propagation) {</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = vars.size();</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<span class="keyword">this</span>, vars[i]->solver());</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>  <span class="keywordflow">if</span> (size < 2) {</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#a783604b36be84a0f63754d0fe5597291">MakeTrueConstraint</a>();</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size == 2) {</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#aaa37d5c7962b1ecd6a7575365efeafd7">MakeNonEquality</a>(const_cast<IntVar* const>(vars[0]),</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  const_cast<IntVar* const>(vars[1]));</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keywordflow">if</span> (stronger_propagation) {</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> BoundsAllDifferent(<span class="keyword">this</span>, vars));</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> ValueAllDifferent(<span class="keyword">this</span>, vars));</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  }</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  }</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> </div><div class="line"><a name="l00716"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#ac14b4f9be9e760378da86da1bc2abd00"> 716</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#ac14b4f9be9e760378da86da1bc2abd00">Solver::MakeSortingConstraint</a>(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keyword">const</span> std::vector<IntVar*>& sorted) {</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(vars.size(), sorted.size());</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> SortConstraint(<span class="keyword">this</span>, vars, sorted));</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> }</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span> </div><div class="line"><a name="l00722"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a7d6119e587498d09e5ab7d3ae47fea09"> 722</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a7d6119e587498d09e5ab7d3ae47fea09">Solver::MakeAllDifferentExcept</a>(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  int64_t escape_value) {</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="keywordtype">int</span> escape_candidates = 0;</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vars.size(); ++i) {</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  escape_candidates += (vars[i]->Contains(escape_value));</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  }</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="keywordflow">if</span> (escape_candidates <= 1) {</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ac145423b7d355bcd75d627871ca95e86">MakeAllDifferent</a>(vars);</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> AllDifferentExcept(<span class="keyword">this</span>, vars, escape_value));</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> }</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span> </div><div class="line"><a name="l00735"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a244b2a437a5d33e9c08c747988c8f830"> 735</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a244b2a437a5d33e9c08c747988c8f830">Solver::MakeNullIntersect</a>(<span class="keyword">const</span> std::vector<IntVar*>& first_vars,</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keyword">const</span> std::vector<IntVar*>& second_vars) {</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> NullIntersectArrayExcept(<span class="keyword">this</span>, first_vars, second_vars));</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span> }</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span> </div><div class="line"><a name="l00740"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a113b01eca9d8ce4a7bf14f9f7e2e9d4d"> 740</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a113b01eca9d8ce4a7bf14f9f7e2e9d4d">Solver::MakeNullIntersectExcept</a>(</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="keyword">const</span> std::vector<IntVar*>& first_vars,</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keyword">const</span> std::vector<IntVar*>& second_vars, int64_t escape_value) {</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keywordtype">int</span> first_escape_candidates = 0;</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < first_vars.size(); ++i) {</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  first_escape_candidates += (first_vars[i]->Contains(escape_value));</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  }</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keywordtype">int</span> second_escape_candidates = 0;</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < second_vars.size(); ++i) {</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  second_escape_candidates += (second_vars[i]->Contains(escape_value));</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="keywordflow">if</span> (first_escape_candidates == 0 || second_escape_candidates == 0) {</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="keyword">new</span> NullIntersectArrayExcept(<span class="keyword">this</span>, first_vars, second_vars));</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> NullIntersectArrayExcept(<span class="keyword">this</span>, first_vars, second_vars,</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  escape_value));</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  }</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span> }</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="routing__filters_8cc_html_a4f1e8002734902ae1c65ccc3fc30c98e"><div class="ttname"><a href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a></div><div class="ttdeci">int64_t bound</div><div class="ttdef"><b>Definition:</b> <a href="routing__filters_8cc_source.html#l00984">routing_filters.cc:984</a></div></div>
|
|
<div class="ttc" id="alldiff__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="classoperations__research_1_1_int_var_html_a6e33a313eaf507bae0eb7068455a5bdc"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#a6e33a313eaf507bae0eb7068455a5bdc">operations_research::IntVar::WhenBound</a></div><div class="ttdeci">virtual void WhenBound(Demon *d)=0</div><div class="ttdoc">This method attaches a demon that will be awakened when the variable is bound.</div></div>
|
|
<div class="ttc" id="constraint__solver_8h_html"><div class="ttname"><a href="constraint__solver_8h.html">constraint_solver.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_ae90c1dfbea9c59346f5db0e636d3a6cc"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#ae90c1dfbea9c59346f5db0e636d3a6cc">operations_research::ModelVisitor::kAllDifferent</a></div><div class="ttdeci">static const char kAllDifferent[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03341">constraint_solver.h:3341</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_solver_html_a7d6119e587498d09e5ab7d3ae47fea09"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a7d6119e587498d09e5ab7d3ae47fea09">operations_research::Solver::MakeAllDifferentExcept</a></div><div class="ttdeci">Constraint * MakeAllDifferentExcept(const std::vector< IntVar * > &vars, int64_t escape_value)</div><div class="ttdoc">All variables are pairwise different, unless they are assigned to the escape value.</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00722">alldiff_cst.cc:722</a></div></div>
|
|
<div class="ttc" id="default__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="classoperations__research_1_1_solver_html_a244b2a437a5d33e9c08c747988c8f830"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a244b2a437a5d33e9c08c747988c8f830">operations_research::Solver::MakeNullIntersect</a></div><div class="ttdeci">Constraint * MakeNullIntersect(const std::vector< IntVar * > &first_vars, const std::vector< IntVar * > &second_vars)</div><div class="ttdoc">Creates a constraint that states that all variables in the first vector are different from all variab...</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00735">alldiff_cst.cc:735</a></div></div>
|
|
<div class="ttc" id="constraint__solveri_8h_html"><div class="ttname"><a href="constraint__solveri_8h.html">constraint_solveri.h</a></div></div>
|
|
<div class="ttc" id="classoperations__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="classoperations__research_1_1_solver_html_a113b01eca9d8ce4a7bf14f9f7e2e9d4d"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a113b01eca9d8ce4a7bf14f9f7e2e9d4d">operations_research::Solver::MakeNullIntersectExcept</a></div><div class="ttdeci">Constraint * MakeNullIntersectExcept(const std::vector< IntVar * > &first_vars, const std::vector< IntVar * > &second_vars, int64_t escape_value)</div><div class="ttdoc">Creates a constraint that states that all variables in the first vector are different from all variab...</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00740">alldiff_cst.cc:740</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_solver_html_ac14b4f9be9e760378da86da1bc2abd00"><div class="ttname"><a href="classoperations__research_1_1_solver.html#ac14b4f9be9e760378da86da1bc2abd00">operations_research::Solver::MakeSortingConstraint</a></div><div class="ttdeci">Constraint * MakeSortingConstraint(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &sorted)</div><div class="ttdoc">Creates a constraint binding the arrays of variables "vars" and "sorted_vars": sorted_vars[0] must be...</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00716">alldiff_cst.cc:716</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_ace1a164cb9535504a4441b0e81998eb7"><div class="ttname"><a href="alldiff__cst_8cc.html#ace1a164cb9535504a4441b0e81998eb7">min_rank</a></div><div class="ttdeci">int min_rank</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00141">alldiff_cst.cc:141</a></div></div>
|
|
<div class="ttc" id="integral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="alldiff__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="classoperations__research_1_1_solver_html_ac145423b7d355bcd75d627871ca95e86"><div class="ttname"><a href="classoperations__research_1_1_solver.html#ac145423b7d355bcd75d627871ca95e86">operations_research::Solver::MakeAllDifferent</a></div><div class="ttdeci">Constraint * MakeAllDifferent(const std::vector< IntVar * > &vars)</div><div class="ttdoc">All variables are pairwise different.</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00692">alldiff_cst.cc:692</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_a5c4f8c31d1c77116201f5c497e1e19f8"><div class="ttname"><a href="alldiff__cst_8cc.html#a5c4f8c31d1c77116201f5c497e1e19f8">max_rank</a></div><div class="ttdeci">int max_rank</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00142">alldiff_cst.cc:142</a></div></div>
|
|
<div class="ttc" id="pack_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="base_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#l00698">base/logging.h:698</a></div></div>
|
|
<div class="ttc" id="classoperations__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="alldiff__cst_8cc_html_a151248525a9e07eb3e6e60ea1c4995eb"><div class="ttname"><a href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a></div><div class="ttdeci">const std::vector< IntVar * > vars_</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00044">alldiff_cst.cc:44</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_solver_html_ab741cb25dd32d1cbe02fbfb36337d9bb"><div class="ttname"><a href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">operations_research::Solver::RevAlloc</a></div><div class="ttdeci">T * RevAlloc(T *object)</div><div class="ttdoc">Registers the given object as being reversible.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00789">constraint_solver.h:789</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a8e24c7d309e4aaa23eca1c75bd42bdc5"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a8e24c7d309e4aaa23eca1c75bd42bdc5">operations_research::ModelVisitor::kLeftArgument</a></div><div class="ttdeci">static const char kLeftArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03465">constraint_solver.h:3465</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_solver_html_a783604b36be84a0f63754d0fe5597291"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a783604b36be84a0f63754d0fe5597291">operations_research::Solver::MakeTrueConstraint</a></div><div class="ttdeci">Constraint * MakeTrueConstraint()</div><div class="ttdoc">This constraint always succeeds.</div><div class="ttdef"><b>Definition:</b> <a href="constraints_8cc_source.html#l00518">constraints.cc:518</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a2ed9de38632f5dd38ef8cb9bdf5bb2b6"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a2ed9de38632f5dd38ef8cb9bdf5bb2b6">operations_research::ModelVisitor::kSortingConstraint</a></div><div class="ttdeci">static const char kSortingConstraint[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03409">constraint_solver.h:3409</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a37aa9ace9fa14d4208c019662ae90da6"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a37aa9ace9fa14d4208c019662ae90da6">operations_research::ModelVisitor::kRangeArgument</a></div><div class="ttdeci">static const char kRangeArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03475">constraint_solver.h:3475</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a5916e547f0c971bcd001c9e2039fd077"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a5916e547f0c971bcd001c9e2039fd077">operations_research::ModelVisitor::kNullIntersect</a></div><div class="ttdeci">static const char kNullIntersect[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03395">constraint_solver.h:3395</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_rev_switch_html_aba56f30d7550dc96d418c689e3ea41f0"><div class="ttname"><a href="classoperations__research_1_1_rev_switch.html#aba56f30d7550dc96d418c689e3ea41f0">operations_research::RevSwitch::Switch</a></div><div class="ttdeci">void Switch(Solver *const solver)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00388">constraint_solveri.h:388</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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="namespaceoperations__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="string__array_8h_html"><div class="ttname"><a href="string__array_8h.html">string_array.h</a></div></div>
|
|
<div class="ttc" id="classoperations__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="namespaceoperations__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="expr__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="classoperations__research_1_1_rev_switch_html_acd90006e99a15f7e9df2aee5cf46549c"><div class="ttname"><a href="classoperations__research_1_1_rev_switch.html#acd90006e99a15f7e9df2aee5cf46549c">operations_research::RevSwitch::Switched</a></div><div class="ttdeci">bool Switched() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00386">constraint_solveri.h:386</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_solver_html_aaa37d5c7962b1ecd6a7575365efeafd7"><div class="ttname"><a href="classoperations__research_1_1_solver.html#aaa37d5c7962b1ecd6a7575365efeafd7">operations_research::Solver::MakeNonEquality</a></div><div class="ttdeci">Constraint * MakeNonEquality(IntExpr *const left, IntExpr *const right)</div><div class="ttdoc">left != right</div><div class="ttdef"><b>Definition:</b> <a href="range__cst_8cc_source.html#l00564">range_cst.cc:564</a></div></div>
|
|
<div class="ttc" id="classoperations__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="classoperations__research_1_1_model_visitor_html_aaeff643bea5491c9055dc67124d5d3d2"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#aaeff643bea5491c9055dc67124d5d3d2">operations_research::ModelVisitor::kRightArgument</a></div><div class="ttdeci">static const char kRightArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03477">constraint_solver.h:3477</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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><!-- 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="alldiff__cst_8cc.html">alldiff_cst.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|