141 lines
74 KiB
HTML
141 lines
74 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: diffn.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.2</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('constraint__solver_2diffn_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">constraint_solver/diffn.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="constraint__solver_2diffn_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="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <limits></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <string></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "absl/strings/str_format.h"</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="hash_8h.html">ortools/base/hash.h</a>"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="int__type_8h.html">ortools/base/int_type.h</a>"</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</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="l00024"></a><span class="lineno"> 24</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="l00025"></a><span class="lineno"> 25</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="l00026"></a><span class="lineno"> 26</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="l00027"></a><span class="lineno"> 27</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="l00028"></a><span class="lineno"> 28</span> </div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// Diffn constraint, Non overlapping boxs.</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">namespace </span>{</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <a class="code" href="namespaceoperations__research.html#a8fee47a5359613bc7f8df356595c7ff0">DEFINE_INT_TYPE</a>(Box, <span class="keywordtype">int</span>);</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">class </span>Diffn : <span class="keyword">public</span> Constraint {</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  Diffn(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& x_vars,</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keyword">const</span> std::vector<IntVar*>& y_vars, <span class="keyword">const</span> std::vector<IntVar*>& x_size,</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keyword">const</span> std::vector<IntVar*>& y_size, <span class="keywordtype">bool</span> strict)</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  : Constraint(solver),</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  x_(x_vars),</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  y_(y_vars),</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  dx_(x_size),</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  dy_(y_size),</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  strict_(strict),</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  size_(x_vars.size()),</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  fail_stamp_(0) {</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(x_vars.size(), y_vars.size());</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(x_vars.size(), x_size.size());</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(x_vars.size(), y_size.size());</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</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>  ~Diffn()<span class="keyword"> override </span>{}</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  Solver* <span class="keyword">const</span> s = solver();</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  Demon* <span class="keyword">const</span> demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  s, <span class="keyword">this</span>, &Diffn::OnBoxRangeChange, <span class="stringliteral">"OnBoxRangeChange"</span>, i);</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  x_[i]->WhenRange(demon);</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  y_[i]->WhenRange(demon);</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  dx_[i]->WhenRange(demon);</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  dy_[i]->WhenRange(demon);</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  }</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  delayed_demon_ = <a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(s, <span class="keyword">this</span>, &Diffn::PropagateAll,</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="stringliteral">"PropagateAll"</span>);</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">if</span> (solver()-><a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>().diffn_use_cumulative() &&</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  IsArrayInRange<int64_t>(x_, 0, <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) &&</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  IsArrayInRange<int64_t>(y_, 0, <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>())) {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  Constraint* ct1 = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  Constraint* ct2 = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  {</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// We can add redundant cumulative constraints. This is done</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// inside a c++ block to avoid leaking memory if adding the</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// constraints leads to a failure. A cumulative constraint is</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// a scheduling constraint that will perform finer energy</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">// based reasoning to do more propagation. (see Solver::MakeCumulative).</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">const</span> int64_t min_x = <a class="code" href="namespaceoperations__research.html#a8e8f645f06f9749b562b6625cd822daa">MinVarArray</a>(x_);</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">const</span> int64_t max_x = <a class="code" href="namespaceoperations__research.html#a587a6a73cbcb4e4a4c7d3b596fa407aa">MaxVarArray</a>(x_);</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">const</span> int64_t max_size_x = <a class="code" href="namespaceoperations__research.html#a587a6a73cbcb4e4a4c7d3b596fa407aa">MaxVarArray</a>(dx_);</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">const</span> int64_t min_y = <a class="code" href="namespaceoperations__research.html#a8e8f645f06f9749b562b6625cd822daa">MinVarArray</a>(y_);</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">const</span> int64_t max_y = <a class="code" href="namespaceoperations__research.html#a587a6a73cbcb4e4a4c7d3b596fa407aa">MaxVarArray</a>(y_);</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">const</span> int64_t max_size_y = <a class="code" href="namespaceoperations__research.html#a587a6a73cbcb4e4a4c7d3b596fa407aa">MaxVarArray</a>(dy_);</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#ae4c7a8bfc6877606e512d3279549f44d">AreAllBound</a>(dx_)) {</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  std::vector<int64_t> size_x;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <a class="code" href="namespaceoperations__research.html#a79edaa5bfddfcd382d36a2ae25df798c">FillValues</a>(dx_, &size_x);</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  ct1 = MakeCumulativeConstraint(x_, size_x, dy_,</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  max_size_y + max_y - min_y);</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  }</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#ae4c7a8bfc6877606e512d3279549f44d">AreAllBound</a>(dy_)) {</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  std::vector<int64_t> size_y;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <a class="code" href="namespaceoperations__research.html#a79edaa5bfddfcd382d36a2ae25df798c">FillValues</a>(dy_, &size_y);</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  ct2 = MakeCumulativeConstraint(y_, size_y, dx_,</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  max_size_x + max_x - min_x);</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>  }</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (ct1 != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  s->AddConstraint(ct1);</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">if</span> (ct2 != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  s->AddConstraint(ct2);</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  }</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</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>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// All sizes should be >= 0.</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  dx_[i]->SetMin(0);</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  dy_[i]->SetMin(0);</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> </div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">// Force propagation on all boxes.</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  to_propagate_.clear();</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>  to_propagate_.insert(i);</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  }</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  PropagateAll();</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  }</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  std::string DebugString()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">return</span> absl::StrFormat(</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="stringliteral">"Diffn(x = [%s], y = [%s], dx = [%s], dy = [%s]))"</span>,</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(x_, <span class="stringliteral">", "</span>), <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(y_, <span class="stringliteral">", "</span>),</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(dx_, <span class="stringliteral">", "</span>), <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(dy_, <span class="stringliteral">", "</span>));</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  }</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</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="l00127"></a><span class="lineno"> 127</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a43f1277df24787f539601c88e6a5fee0">ModelVisitor::kDisjunctive</a>, <span class="keyword">this</span>);</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a6c57f00cf29d252f86c1dd0d27ce3619">ModelVisitor::kPositionXArgument</a>,</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  x_);</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#ac579d6d64c67e01abcee3be235d65db9">ModelVisitor::kPositionYArgument</a>,</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  y_);</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a7724361fb5b4714dbc30443fa48a25e9">ModelVisitor::kSizeXArgument</a>,</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  dx_);</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#ab89d687f1f30a31bfc0fc1fe67d706e1">ModelVisitor::kSizeYArgument</a>,</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  dy_);</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a43f1277df24787f539601c88e6a5fee0">ModelVisitor::kDisjunctive</a>, <span class="keyword">this</span>);</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  }</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordtype">void</span> PropagateAll() {</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> box : to_propagate_) {</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  FillNeighbors(box);</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  FailWhenEnergyIsTooLarge(box);</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  PushOverlappingBoxes(box);</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  }</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  to_propagate_.clear();</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  fail_stamp_ = solver()->fail_stamp();</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  }</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordtype">void</span> OnBoxRangeChange(<span class="keywordtype">int</span> box) {</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">if</span> (solver()->fail_stamp() > fail_stamp_ && !to_propagate_.empty()) {</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">// We have failed in the last propagation and the to_propagate_</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">// was not cleared.</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  fail_stamp_ = solver()->fail_stamp();</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  to_propagate_.clear();</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  }</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  to_propagate_.insert(box);</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  EnqueueDelayedDemon(delayed_demon_);</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>  <span class="keywordtype">bool</span> CanBoxedOverlap(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j)<span class="keyword"> const </span>{</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">if</span> (AreBoxedDisjoingHorizontallyForSure(i, j) ||</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  AreBoxedDisjoingVerticallyForSure(i, j)) {</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  }</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> </div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordtype">bool</span> AreBoxedDisjoingHorizontallyForSure(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j)<span class="keyword"> const </span>{</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">return</span> (x_[i]->Min() >= x_[j]->Max() + dx_[j]->Max()) ||</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  (x_[j]->Min() >= x_[i]->Max() + dx_[i]->Max()) ||</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  (!strict_ && (dx_[i]->Min() == 0 || dx_[j]->Min() == 0));</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>  <span class="keywordtype">bool</span> AreBoxedDisjoingVerticallyForSure(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j)<span class="keyword"> const </span>{</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">return</span> (y_[i]->Min() >= y_[j]->Max() + dy_[j]->Max()) ||</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  (y_[j]->Min() >= y_[i]->Max() + dy_[i]->Max()) ||</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  (!strict_ && (dy_[i]->Min() == 0 || dy_[j]->Min() == 0));</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  }</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> </div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// Fill neighbors_ with all boxes that can overlap the given box.</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordtype">void</span> FillNeighbors(<span class="keywordtype">int</span> box) {</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// TODO(user): We could maintain a non reversible list of</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">// neighbors and clean it after each failure.</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  neighbors_.clear();</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> other = 0; other < size_; ++other) {</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">if</span> (other != box && CanBoxedOverlap(other, box)) {</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  neighbors_.push_back(other);</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  }</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  }</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  }</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="comment">// Fails if the minimum area of the given box plus the area of its neighbors</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="comment">// (that must already be computed in neighbors_) is greater than the area of a</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="comment">// bounding box that necessarily contains all these boxes.</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordtype">void</span> FailWhenEnergyIsTooLarge(<span class="keywordtype">int</span> box) {</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  int64_t area_min_x = x_[box]->Min();</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  int64_t area_max_x = x_[box]->Max() + dx_[box]->Max();</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  int64_t area_min_y = y_[box]->Min();</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  int64_t area_max_y = y_[box]->Max() + dy_[box]->Max();</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  int64_t sum_of_areas = dx_[box]->Min() * dy_[box]->Min();</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">// TODO(user): Is there a better order, maybe sort by distance</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// with the current box.</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < neighbors_.size(); ++i) {</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> other = neighbors_[i];</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// Update Bounding box.</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  area_min_x = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(area_min_x, x_[other]->Min());</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  area_max_x = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(area_max_x, x_[other]->Max() + dx_[other]->Max());</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  area_min_y = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(area_min_y, y_[other]->Min());</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  area_max_y = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(area_max_y, y_[other]->Max() + dy_[other]->Max());</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">// Update sum of areas.</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  sum_of_areas += dx_[other]->Min() * dy_[other]->Min();</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">const</span> int64_t bounding_area =</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  (area_max_x - area_min_x) * (area_max_y - area_min_y);</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">if</span> (sum_of_areas > bounding_area) {</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  solver()->Fail();</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  }</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  }</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  }</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>  <span class="comment">// Changes the domain of all the neighbors of a given box (that must</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// already be computed in neighbors_) so that they can't overlap the</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">// mandatory part of the given box.</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordtype">void</span> PushOverlappingBoxes(<span class="keywordtype">int</span> box) {</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < neighbors_.size(); ++i) {</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  PushOneBox(box, neighbors_[i]);</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  }</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  }</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> </div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// Changes the domain of the two given box by excluding the value that</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="comment">// make them overlap for sure. Note that this function is symmetric in</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">// the sense that its argument can be swapped for the same result.</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordtype">void</span> PushOneBox(<span class="keywordtype">int</span> box, <span class="keywordtype">int</span> other) {</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> state =</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  (x_[box]->Min() + dx_[box]->Min() <= x_[other]->Max()) +</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  2 * (x_[other]->Min() + dx_[other]->Min() <= x_[box]->Max()) +</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  4 * (y_[box]->Min() + dy_[box]->Min() <= y_[other]->Max()) +</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  8 * (y_[other]->Min() + dy_[other]->Min() <= y_[box]->Max());</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">// This is an "hack" to be able to easily test for none or for one</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// and only one of the conditions below.</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">switch</span> (state) {</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">case</span> 0: {</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  solver()->Fail();</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">break</span>;</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">case</span> 1: { <span class="comment">// We push other left (x increasing).</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  x_[other]->SetMin(x_[box]->Min() + dx_[box]->Min());</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  x_[box]->SetMax(x_[other]->Max() - dx_[box]->Min());</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  dx_[box]->SetMax(x_[other]->Max() - x_[box]->Min());</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">break</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">case</span> 2: { <span class="comment">// We push other right (x decreasing).</span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  x_[box]->SetMin(x_[other]->Min() + dx_[other]->Min());</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  x_[other]->SetMax(x_[box]->Max() - dx_[other]->Min());</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  dx_[other]->SetMax(x_[box]->Max() - x_[other]->Min());</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  }</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">case</span> 4: { <span class="comment">// We push other up (y increasing).</span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  y_[other]->SetMin(y_[box]->Min() + dy_[box]->Min());</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  y_[box]->SetMax(y_[other]->Max() - dy_[box]->Min());</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  dy_[box]->SetMax(y_[other]->Max() - y_[box]->Min());</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  }</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">case</span> 8: { <span class="comment">// We push other down (y decreasing).</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  y_[box]->SetMin(y_[other]->Min() + dy_[other]->Min());</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  y_[other]->SetMax(y_[box]->Max() - dy_[other]->Min());</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  dy_[other]->SetMax(y_[box]->Max() - y_[other]->Min());</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  }</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">default</span>: {</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  }</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  }</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  }</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  Constraint* MakeCumulativeConstraint(<span class="keyword">const</span> std::vector<IntVar*>& positions,</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keyword">const</span> std::vector<int64_t>& sizes,</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keyword">const</span> std::vector<IntVar*>& demands,</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  int64_t <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>) {</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  std::vector<IntervalVar*> intervals;</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  solver()->MakeFixedDurationIntervalVarArray(positions, sizes, <span class="stringliteral">"interval"</span>,</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  &intervals);</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">return</span> solver()->MakeCumulative(intervals, demands, <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, <span class="stringliteral">"cumul"</span>);</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  }</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> </div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  std::vector<IntVar*> x_;</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  std::vector<IntVar*> y_;</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  std::vector<IntVar*> dx_;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  std::vector<IntVar*> dy_;</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> strict_;</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keyword">const</span> int64_t size_;</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  Demon* delayed_demon_;</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  absl::flat_hash_set<int> to_propagate_;</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  std::vector<int> neighbors_;</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  uint64_t fail_stamp_;</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> };</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span> </div><div class="line"><a name="l00299"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a4ddadd35d3227ee3f1216b9d7129227f"> 299</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a4ddadd35d3227ee3f1216b9d7129227f">Solver::MakeNonOverlappingBoxesConstraint</a>(</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keyword">const</span> std::vector<IntVar*>& x_vars, <span class="keyword">const</span> std::vector<IntVar*>& y_vars,</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keyword">const</span> std::vector<IntVar*>& x_size, <span class="keyword">const</span> std::vector<IntVar*>& y_size) {</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> Diffn(<span class="keyword">this</span>, x_vars, y_vars, x_size, y_size, <span class="keyword">true</span>));</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> }</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> </div><div class="line"><a name="l00305"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a27c2d8bdabfef5fd7507993153c0f957"> 305</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a4ddadd35d3227ee3f1216b9d7129227f">Solver::MakeNonOverlappingBoxesConstraint</a>(</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keyword">const</span> std::vector<IntVar*>& x_vars, <span class="keyword">const</span> std::vector<IntVar*>& y_vars,</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keyword">const</span> std::vector<int64_t>& x_size, <span class="keyword">const</span> std::vector<int64_t>& y_size) {</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  std::vector<IntVar*> dx(x_size.size());</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  std::vector<IntVar*> dy(y_size.size());</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < x_size.size(); ++i) {</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  dx[i] = <a class="code" href="classoperations__research_1_1_solver.html#ae8cece32cf189d295336a64e00767bdd">MakeIntConst</a>(x_size[i]);</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  dy[i] = <a class="code" href="classoperations__research_1_1_solver.html#ae8cece32cf189d295336a64e00767bdd">MakeIntConst</a>(y_size[i]);</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> Diffn(<span class="keyword">this</span>, x_vars, y_vars, dx, dy, <span class="keyword">true</span>));</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> }</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> </div><div class="line"><a name="l00317"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#ac0226a133f43985fecfdd49803e53b17"> 317</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a4ddadd35d3227ee3f1216b9d7129227f">Solver::MakeNonOverlappingBoxesConstraint</a>(</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keyword">const</span> std::vector<IntVar*>& x_vars, <span class="keyword">const</span> std::vector<IntVar*>& y_vars,</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keyword">const</span> std::vector<int>& x_size, <span class="keyword">const</span> std::vector<int>& y_size) {</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  std::vector<IntVar*> dx(x_size.size());</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  std::vector<IntVar*> dy(y_size.size());</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < x_size.size(); ++i) {</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  dx[i] = <a class="code" href="classoperations__research_1_1_solver.html#ae8cece32cf189d295336a64e00767bdd">MakeIntConst</a>(x_size[i]);</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  dy[i] = <a class="code" href="classoperations__research_1_1_solver.html#ae8cece32cf189d295336a64e00767bdd">MakeIntConst</a>(y_size[i]);</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  }</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> Diffn(<span class="keyword">this</span>, x_vars, y_vars, dx, dy, <span class="keyword">true</span>));</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> }</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> </div><div class="line"><a name="l00329"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#ac4f11683c5546c728671e917d2031384"> 329</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#ac4f11683c5546c728671e917d2031384">Solver::MakeNonOverlappingNonStrictBoxesConstraint</a>(</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keyword">const</span> std::vector<IntVar*>& x_vars, <span class="keyword">const</span> std::vector<IntVar*>& y_vars,</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keyword">const</span> std::vector<IntVar*>& x_size, <span class="keyword">const</span> std::vector<IntVar*>& y_size) {</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> Diffn(<span class="keyword">this</span>, x_vars, y_vars, x_size, y_size, <span class="keyword">false</span>));</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> }</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> </div><div class="line"><a name="l00335"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a454d82afd3f209d01ee2b69290fc8bf7"> 335</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#ac4f11683c5546c728671e917d2031384">Solver::MakeNonOverlappingNonStrictBoxesConstraint</a>(</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keyword">const</span> std::vector<IntVar*>& x_vars, <span class="keyword">const</span> std::vector<IntVar*>& y_vars,</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keyword">const</span> std::vector<int64_t>& x_size, <span class="keyword">const</span> std::vector<int64_t>& y_size) {</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  std::vector<IntVar*> dx(x_size.size());</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  std::vector<IntVar*> dy(y_size.size());</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < x_size.size(); ++i) {</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  dx[i] = <a class="code" href="classoperations__research_1_1_solver.html#ae8cece32cf189d295336a64e00767bdd">MakeIntConst</a>(x_size[i]);</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  dy[i] = <a class="code" href="classoperations__research_1_1_solver.html#ae8cece32cf189d295336a64e00767bdd">MakeIntConst</a>(y_size[i]);</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  }</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> Diffn(<span class="keyword">this</span>, x_vars, y_vars, dx, dy, <span class="keyword">false</span>));</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> }</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> </div><div class="line"><a name="l00347"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a931314662eb3ee9591e6d0c7635f5971"> 347</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#ac4f11683c5546c728671e917d2031384">Solver::MakeNonOverlappingNonStrictBoxesConstraint</a>(</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keyword">const</span> std::vector<IntVar*>& x_vars, <span class="keyword">const</span> std::vector<IntVar*>& y_vars,</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keyword">const</span> std::vector<int>& x_size, <span class="keyword">const</span> std::vector<int>& y_size) {</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  std::vector<IntVar*> dx(x_size.size());</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  std::vector<IntVar*> dy(y_size.size());</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < x_size.size(); ++i) {</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  dx[i] = <a class="code" href="classoperations__research_1_1_solver.html#ae8cece32cf189d295336a64e00767bdd">MakeIntConst</a>(x_size[i]);</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  dy[i] = <a class="code" href="classoperations__research_1_1_solver.html#ae8cece32cf189d295336a64e00767bdd">MakeIntConst</a>(y_size[i]);</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  }</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> Diffn(<span class="keyword">this</span>, x_vars, y_vars, dx, dy, <span class="keyword">false</span>));</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> }</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> } <span class="comment">// namespace operations_research</span></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="constraint__solver_8h_html"><div class="ttname"><a href="constraint__solver_8h.html">constraint_solver.h</a></div></div>
|
|
<div class="ttc" id="int__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_solver_html_ac4f11683c5546c728671e917d2031384"><div class="ttname"><a href="classoperations__research_1_1_solver.html#ac4f11683c5546c728671e917d2031384">operations_research::Solver::MakeNonOverlappingNonStrictBoxesConstraint</a></div><div class="ttdeci">Constraint * MakeNonOverlappingNonStrictBoxesConstraint(const std::vector< IntVar * > &x_vars, const std::vector< IntVar * > &y_vars, const std::vector< IntVar * > &x_size, const std::vector< IntVar * > &y_size)</div><div class="ttdoc">This constraint states that all the boxes must not overlap.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2diffn_8cc_source.html#l00329">constraint_solver/diffn.cc:329</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a7724361fb5b4714dbc30443fa48a25e9"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a7724361fb5b4714dbc30443fa48a25e9">operations_research::ModelVisitor::kSizeXArgument</a></div><div class="ttdeci">static const char kSizeXArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03520">constraint_solver.h:3520</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a43f1277df24787f539601c88e6a5fee0"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a43f1277df24787f539601c88e6a5fee0">operations_research::ModelVisitor::kDisjunctive</a></div><div class="ttdeci">static const char kDisjunctive[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03393">constraint_solver.h:3393</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="hash_8h_html"><div class="ttname"><a href="hash_8h.html">hash.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#l03626">constraint_solver.h:3626</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a79edaa5bfddfcd382d36a2ae25df798c"><div class="ttname"><a href="namespaceoperations__research.html#a79edaa5bfddfcd382d36a2ae25df798c">operations_research::FillValues</a></div><div class="ttdeci">void FillValues(const std::vector< IntVar * > &vars, std::vector< int64_t > *const values)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l03002">constraint_solveri.h:3002</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="classoperations__research_1_1_model_visitor_html_ab89d687f1f30a31bfc0fc1fe67d706e1"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#ab89d687f1f30a31bfc0fc1fe67d706e1">operations_research::ModelVisitor::kSizeYArgument</a></div><div class="ttdeci">static const char kSizeYArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03521">constraint_solver.h:3521</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="namespaceoperations__research_html_a8fee47a5359613bc7f8df356595c7ff0"><div class="ttname"><a href="namespaceoperations__research.html#a8fee47a5359613bc7f8df356595c7ff0">operations_research::DEFINE_INT_TYPE</a></div><div class="ttdeci">DEFINE_INT_TYPE(RoutingNodeIndex, int)</div><div class="ttdoc">Defining common types used in the routing library outside the main RoutingModel class has several pur...</div></div>
|
|
<div class="ttc" id="routing__flow_8cc_html_a2acb49f4df5288066c43610bede123ec"><div class="ttname"><a href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a></div><div class="ttdeci">int64_t capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00151">routing_flow.cc:151</a></div></div>
|
|
<div class="ttc" id="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#l00702">base/logging.h:702</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a587a6a73cbcb4e4a4c7d3b596fa407aa"><div class="ttname"><a href="namespaceoperations__research.html#a587a6a73cbcb4e4a4c7d3b596fa407aa">operations_research::MaxVarArray</a></div><div class="ttdeci">int64_t MaxVarArray(const std::vector< IntVar * > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l02982">constraint_solveri.h:2982</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#l00791">constraint_solver.h:791</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="namespaceoperations__research_html_ae4c7a8bfc6877606e512d3279549f44d"><div class="ttname"><a href="namespaceoperations__research.html#ae4c7a8bfc6877606e512d3279549f44d">operations_research::AreAllBound</a></div><div class="ttdeci">bool AreAllBound(const std::vector< IntVar * > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l02946">constraint_solveri.h:2946</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_solver_html_ae8cece32cf189d295336a64e00767bdd"><div class="ttname"><a href="classoperations__research_1_1_solver.html#ae8cece32cf189d295336a64e00767bdd">operations_research::Solver::MakeIntConst</a></div><div class="ttdeci">IntVar * MakeIntConst(int64_t val, const std::string &name)</div><div class="ttdoc">IntConst will create a constant expression.</div><div class="ttdef"><b>Definition:</b> <a href="expressions_8cc_source.html#l06480">expressions.cc:6480</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a8e8f645f06f9749b562b6625cd822daa"><div class="ttname"><a href="namespaceoperations__research.html#a8e8f645f06f9749b562b6625cd822daa">operations_research::MinVarArray</a></div><div class="ttdeci">int64_t MinVarArray(const std::vector< IntVar * > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l02992">constraint_solveri.h:2992</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="cp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00120">cp_model_fz_solver.cc:120</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="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#l00682">constraint_solveri.h:682</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_solver_html_a4ddadd35d3227ee3f1216b9d7129227f"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a4ddadd35d3227ee3f1216b9d7129227f">operations_research::Solver::MakeNonOverlappingBoxesConstraint</a></div><div class="ttdeci">Constraint * MakeNonOverlappingBoxesConstraint(const std::vector< IntVar * > &x_vars, const std::vector< IntVar * > &y_vars, const std::vector< IntVar * > &x_size, const std::vector< IntVar * > &y_size)</div><div class="ttdoc">This constraint states that all the boxes must not overlap.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2diffn_8cc_source.html#l00299">constraint_solver/diffn.cc:299</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#l00560">constraint_solveri.h:560</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a6c57f00cf29d252f86c1dd0d27ce3619"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a6c57f00cf29d252f86c1dd0d27ce3619">operations_research::ModelVisitor::kPositionXArgument</a></div><div class="ttdeci">static const char kPositionXArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03512">constraint_solver.h:3512</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_ac579d6d64c67e01abcee3be235d65db9"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#ac579d6d64c67e01abcee3be235d65db9">operations_research::ModelVisitor::kPositionYArgument</a></div><div class="ttdeci">static const char kPositionYArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03513">constraint_solver.h:3513</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_afbb39f66221aac28bbdefd1dca2b2b0.html">constraint_solver</a></li><li class="navelem"><a class="el" href="constraint__solver_2diffn_8cc.html">diffn.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>
|