1799 lines
285 KiB
HTML
1799 lines
285 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: graph_constraints.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('graph__constraints_8cc_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">graph_constraints.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="graph__constraints_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 <deque></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  </div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "absl/strings/str_cat.h"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "absl/strings/str_format.h"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "absl/strings/str_join.h"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="constraint__solver_8h.html">ortools/constraint_solver/constraint_solver.h</a>"</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="constraint__solveri_8h.html">ortools/constraint_solver/constraint_solveri.h</a>"</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</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="l00032"></a><span class="lineno"> 32</span>  </div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// ---------- No cycle ----------</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  </div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// This constraint ensures there are no cycles in the variable/value graph.</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// "Sink" values are values outside the range of the array of variables; they</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// are used to end paths.</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// The constraint does essentially two things:</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// - forbid partial paths from looping back to themselves</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// - ensure each variable/node can be connected to a "sink".</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// If assume_paths is true, the constraint assumes the 'next' variables</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// represent paths (and performs a faster propagation); otherwise the</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// constraint assumes the 'next' variables represent a forest.</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// TODO(user): improve code when assume_paths is false (currently does an</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// expensive n^2 loop).</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="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="keyword">class </span>NoCycle : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  NoCycle(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">const</span> std::vector<IntVar*>& active, <a class="code" href="classoperations__research_1_1_solver.html#a6188d0df45262d3176058485c7f47995">Solver::IndexFilter1</a> sink_handler,</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordtype">bool</span> assume_paths);</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  ~NoCycle()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordtype">void</span> Post() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordtype">void</span> InitialPropagate() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordtype">void</span> NextChange(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordtype">void</span> ActiveBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordtype">void</span> NextBound(<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">void</span> ComputeSupports();</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordtype">void</span> ComputeSupport(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</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>  </div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</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="l00065"></a><span class="lineno"> 65</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#accbdf8149c4c29d3b64b43837d0bc3e1">ModelVisitor::kNoCycle</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a91247898d81dc2bca2833abef17f0816">ModelVisitor::kNextsArgument</a>,</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  nexts_);</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a4a0c229a0e9dcf7122ebd68f501a6ef1">ModelVisitor::kActiveArgument</a>,</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  active_);</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  visitor->VisitIntegerArgument(<span class="stringliteral">"assume_paths"</span>, assume_paths_);</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  visitor->VisitInt64ToBoolExtension(sink_handler_, -size(), size());</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#accbdf8149c4c29d3b64b43837d0bc3e1">ModelVisitor::kNoCycle</a>, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  }</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  </div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  int64_t size()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> nexts_.size(); }</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  </div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">const</span> std::vector<IntVar*> nexts_;</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">const</span> std::vector<IntVar*> active_;</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  std::vector<IntVarIterator*> <a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>;</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  RevArray<int64_t> starts_;</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  RevArray<int64_t> ends_;</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  RevArray<bool> marked_;</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordtype">bool</span> all_nexts_bound_;</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  std::vector<int64_t> outbound_supports_;</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  std::vector<int64_t> support_leaves_;</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  std::vector<int64_t> unsupported_;</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <a class="code" href="classoperations__research_1_1_solver.html#a6188d0df45262d3176058485c7f47995">Solver::IndexFilter1</a> sink_handler_;</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  std::vector<int64_t> sinks_;</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordtype">bool</span> assume_paths_;</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> NoCycle::NoCycle(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">const</span> std::vector<IntVar*>& active,</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <a class="code" href="classoperations__research_1_1_solver.html#a6188d0df45262d3176058485c7f47995">Solver::IndexFilter1</a> sink_handler, <span class="keywordtype">bool</span> assume_paths)</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  : Constraint(s),</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  nexts_(nexts),</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  active_(active),</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>(nexts.size(), nullptr),</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  starts_(nexts.size(), -1),</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  ends_(nexts.size(), -1),</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  marked_(nexts.size(), false),</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  all_nexts_bound_(false),</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  outbound_supports_(nexts.size(), -1),</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  sink_handler_(std::move(sink_handler)),</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  assume_paths_(assume_paths) {</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  support_leaves_.reserve(size());</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  unsupported_.reserve(size());</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  starts_.SetValue(s, i, i);</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  ends_.SetValue(s, i, i);</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>[i] = nexts_[i]->MakeDomainIterator(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> }</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> <span class="keywordtype">void</span> NoCycle::InitialPropagate() {</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// Reduce next domains to sinks + range of nexts</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  outbound_supports_[i] = -1;</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  IntVar* <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[i];</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->Min(); j < 0; ++j) {</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">if</span> (!sink_handler_(j)) {</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->RemoveValue(j);</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="keywordflow">for</span> (<span class="keywordtype">int</span> j = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->Max(); j >= size(); --j) {</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">if</span> (!sink_handler_(j)) {</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->RemoveValue(j);</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  }</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  }</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  }</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  solver()->SaveAndSetValue(&all_nexts_bound_, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">if</span> (nexts_[i]->Bound()) {</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  NextBound(i);</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  solver()->SaveAndSetValue(&all_nexts_bound_, <span class="keyword">false</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>  }</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  ComputeSupports();</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> }</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  </div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="keywordtype">void</span> NoCycle::Post() {</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">if</span> (size() == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  IntVar* <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[i];</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  Demon* support_demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  solver(), <span class="keyword">this</span>, &NoCycle::NextChange, <span class="stringliteral">"NextChange"</span>, i);</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->WhenDomain(support_demon);</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  Demon* active_demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  solver(), <span class="keyword">this</span>, &NoCycle::ActiveBound, <span class="stringliteral">"ActiveBound"</span>, i);</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  active_[i]->WhenBound(active_demon);</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  }</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// Setting up sinks</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  int64_t min_min = nexts_[0]->Min();</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  int64_t max_max = nexts_[0]->Max();</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keyword">const</span> IntVar* <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[i];</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  min_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_min, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->Min());</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  max_max = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_max, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->Max());</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>  sinks_.clear();</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = min_min; i <= max_max; ++i) {</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">if</span> (sink_handler_(i)) {</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  sinks_.push_back(i);</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>  }</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>  </div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="keywordtype">void</span> NoCycle::NextChange(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  IntVar* <span class="keyword">const</span> next_var = nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">if</span> (next_var->Bound()) {</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  NextBound(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</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="keywordflow">if</span> (!all_nexts_bound_) {</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordtype">bool</span> all_nexts_bound = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">if</span> (!nexts_[i]->Bound()) {</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  all_nexts_bound = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  }</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  solver()->SaveAndSetValue(&all_nexts_bound_, all_nexts_bound);</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  }</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">if</span> (all_nexts_bound_) {</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  }</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">if</span> (!next_var->Contains(outbound_supports_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>])) {</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  ComputeSupport(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</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="keywordtype">void</span> NoCycle::ActiveBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">if</span> (nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound()) {</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  NextBound(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  }</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> }</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  </div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="keywordtype">void</span> NoCycle::NextBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">if</span> (active_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min() == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">if</span> (marked_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  Solver* <span class="keyword">const</span> s = solver();</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// Subtle: marking indices to avoid overwriting chain starts and ends if</span></div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// propagation for active_[index] or nexts_[index] has already been done.</span></div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  marked_.SetValue(s, <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keyword">const</span> int64_t <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Value();</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keyword">const</span> int64_t chain_start = starts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keyword">const</span> int64_t chain_end = !sink_handler_(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>) ? ends_[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>] : <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">if</span> (!sink_handler_(chain_start)) {</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  ends_.SetValue(s, chain_start, chain_end);</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">if</span> (!sink_handler_(chain_end)) {</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  starts_.SetValue(s, chain_end, chain_start);</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  nexts_[chain_end]->RemoveValue(chain_start);</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">if</span> (!assume_paths_) {</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  int64_t current = i;</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordtype">bool</span> found = (current == chain_end);</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// Counter to detect implicit cycles.</span></div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordtype">int</span> count = 0;</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">while</span> (!found && count < size() && !sink_handler_(current) &&</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  nexts_[current]->Bound()) {</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  current = nexts_[current]->Value();</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  found = (current == chain_end);</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  ++count;</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">if</span> (found) {</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  nexts_[chain_end]->RemoveValue(i);</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>  }</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  }</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  }</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> }</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  </div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="comment">// Compute the support tree. For each variable, find a path connecting to a</span></div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="comment">// sink. Starts partial paths from the sinks down to all unconnected variables.</span></div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="comment">// If some variables remain unconnected, make the corresponding active_</span></div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="comment">// variable false.</span></div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment">// Resulting tree is used as supports for next variables.</span></div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="comment">// TODO(user): Try to see if we can find an algorithm which is less than</span></div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="comment">// quadratic to do this (note that if the tree is flat we are already linear</span></div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="comment">// for a given number of sinks).</span></div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="keywordtype">void</span> NoCycle::ComputeSupports() {</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">// unsupported_ contains nodes not connected to sinks.</span></div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  unsupported_.clear();</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// supported_leaves_ contains the current frontier containing nodes surely</span></div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="comment">// connected to sinks.</span></div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  support_leaves_.clear();</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="comment">// Initial phase: find direct connections to sinks and initialize</span></div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="comment">// support_leaves_ and unsupported_ accordingly.</span></div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> sink_size = sinks_.size();</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keyword">const</span> IntVar* <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[i];</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="comment">// If node is not active, no need to try to connect it to a sink.</span></div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">if</span> (active_[i]->Max() != 0) {</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keyword">const</span> int64_t current_support = outbound_supports_[i];</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">// Optimization: if this node was already supported by a sink, check if</span></div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="comment">// it's still a valid support.</span></div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">if</span> (current_support >= 0 && sink_handler_(current_support) &&</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->Contains(current_support)) {</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  support_leaves_.push_back(i);</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">// Optimization: iterate on sinks or next domain depending on which is</span></div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// smaller.</span></div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  outbound_supports_[i] = -1;</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">if</span> (sink_size < next->Size()) {</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < sink_size; ++j) {</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->Contains(sinks_[j])) {</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  outbound_supports_[i] = sinks_[j];</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  support_leaves_.push_back(i);</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>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : InitAndGetValues(<a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>[i])) {</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordflow">if</span> (sink_handler_(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)) {</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  outbound_supports_[i] = <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  support_leaves_.push_back(i);</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  }</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</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> (outbound_supports_[i] == -1) {</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  unsupported_.push_back(i);</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  }</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  }</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="comment">// No need to iterate on all nodes connected to sinks but just on the ones</span></div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="comment">// added in the last iteration; leaves_begin and leaves_end mark the block</span></div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">// in support_leaves_ corresponding to such nodes.</span></div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordtype">size_t</span> leaves_begin = 0;</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordtype">size_t</span> leaves_end = support_leaves_.size();</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">while</span> (!unsupported_.empty()) {</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="comment">// Try to connected unsupported nodes to nodes connected to sinks.</span></div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">for</span> (int64_t unsupported_index = 0; unsupported_index < unsupported_.size();</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  ++unsupported_index) {</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keyword">const</span> int64_t unsupported = unsupported_[unsupported_index];</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keyword">const</span> IntVar* <span class="keyword">const</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[unsupported];</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = leaves_begin; i < leaves_end; ++i) {</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->Contains(support_leaves_[i])) {</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  outbound_supports_[unsupported] = support_leaves_[i];</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  support_leaves_.push_back(unsupported);</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="comment">// Remove current node from unsupported vector.</span></div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  unsupported_[unsupported_index] = unsupported_.back();</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  unsupported_.pop_back();</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  --unsupported_index;</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  }</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">// TODO(user): evaluate same trick as with the sinks by keeping a</span></div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// bitmap with supported nodes.</span></div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  }</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="comment">// No new leaves were added, we can bail out.</span></div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordflow">if</span> (leaves_end == support_leaves_.size()) {</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  }</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  leaves_begin = leaves_end;</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  leaves_end = support_leaves_.size();</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  }</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// Mark as inactive any unsupported node.</span></div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">for</span> (int64_t unsupported_index = 0; unsupported_index < unsupported_.size();</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  ++unsupported_index) {</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  active_[unsupported_[unsupported_index]]->SetMax(0);</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> }</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> <span class="keywordtype">void</span> NoCycle::ComputeSupport(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="comment">// Try to reconnect the node to the support tree by finding a next node</span></div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// which is both supported and was not a descendant of the node in the tree.</span></div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">if</span> (active_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Max() != 0) {</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> : InitAndGetValues(<a class="code" href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>])) {</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">if</span> (sink_handler_(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)) {</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  outbound_supports_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordflow">return</span>;</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">if</span> (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> != <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> && <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> < outbound_supports_.size()) {</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  int64_t next_support = outbound_supports_[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>];</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">if</span> (next_support >= 0) {</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">// Check if next is not already a descendant of index.</span></div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordtype">bool</span> ancestor_found = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">while</span> (next_support < outbound_supports_.size() &&</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  !sink_handler_(next_support)) {</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">if</span> (next_support == <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  ancestor_found = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  }</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  next_support = outbound_supports_[next_support];</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  }</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keywordflow">if</span> (!ancestor_found) {</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  outbound_supports_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  }</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  }</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  }</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  }</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  }</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="comment">// No support was found, rebuild the support tree.</span></div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  ComputeSupports();</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>  </div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span> std::string NoCycle::DebugString()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"NoCycle(%s)"</span>, <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(nexts_, <span class="stringliteral">", "</span>));</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</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="comment">// ----- Circuit constraint -----</span></div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  </div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="keyword">class </span>Circuit : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  Circuit(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& nexts, <span class="keywordtype">bool</span> sub_circuit)</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  : Constraint(s),</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  nexts_(nexts),</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  size_(nexts_.size()),</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  starts_(size_, -1),</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  ends_(size_, -1),</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  lengths_(size_, 1),</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  domains_(size_),</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  outbound_support_(size_, -1),</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  inbound_support_(size_, -1),</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  temp_support_(size_, -1),</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  inbound_demon_(nullptr),</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  outbound_demon_(nullptr),</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  root_(-1),</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  num_inactives_(0),</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  sub_circuit_(sub_circuit) {</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  domains_[i] = nexts_[i]->MakeDomainIterator(<span class="keyword">true</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>  }</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  </div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  ~Circuit()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  </div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  inbound_demon_ = <a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  solver(), <span class="keyword">this</span>, &Circuit::CheckReachabilityToRoot,</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="stringliteral">"CheckReachabilityToRoot"</span>);</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  outbound_demon_ = <a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  solver(), <span class="keyword">this</span>, &Circuit::CheckReachabilityFromRoot,</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="stringliteral">"CheckReachabilityFromRoot"</span>);</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordflow">if</span> (!nexts_[i]->Bound()) {</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  Demon* <span class="keyword">const</span> bound_demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  solver(), <span class="keyword">this</span>, &Circuit::NextBound, <span class="stringliteral">"NextBound"</span>, i);</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  nexts_[i]->WhenBound(bound_demon);</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  Demon* <span class="keyword">const</span> domain_demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  solver(), <span class="keyword">this</span>, &Circuit::NextDomain, <span class="stringliteral">"NextDomain"</span>, i);</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  nexts_[i]->WhenDomain(domain_demon);</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  }</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  }</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  solver()->AddConstraint(solver()->MakeAllDifferent(nexts_));</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>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  Solver* <span class="keyword">const</span> s = solver();</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">if</span> (!sub_circuit_) {</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  root_.SetValue(solver(), 0);</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="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  nexts_[i]->SetRange(0, size_ - 1);</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">if</span> (!sub_circuit_) {</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  nexts_[i]->RemoveValue(i);</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  }</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  }</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  starts_.SetValue(s, i, i);</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  ends_.SetValue(s, i, i);</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  lengths_.SetValue(s, i, 1);</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  }</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">if</span> (nexts_[i]->Bound()) {</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  NextBound(i);</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  }</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  }</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  CheckReachabilityFromRoot();</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  CheckReachabilityToRoot();</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  }</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  </div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"%sCircuit(%s)"</span>, sub_circuit_ ? <span class="stringliteral">"Sub"</span> : <span class="stringliteral">""</span>,</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(nexts_, <span class="stringliteral">" "</span>));</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>  </div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</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="l00444"></a><span class="lineno"> 444</span>  visitor->BeginVisitConstraint(ModelVisitor::kCircuit, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kNextsArgument,</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  nexts_);</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  visitor->VisitIntegerArgument(ModelVisitor::kPartialArgument, sub_circuit_);</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  visitor->EndVisitConstraint(ModelVisitor::kCircuit, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  }</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>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordtype">bool</span> Inactive(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordflow">return</span> nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound() && nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min() == <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  }</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  </div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keywordtype">void</span> NextBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  Solver* <span class="keyword">const</span> s = solver();</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> destination = nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Value();</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> root = root_.Value();</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordflow">if</span> (destination != <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">if</span> (root == -1) {</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  root_.SetValue(s, <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  }</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_end = ends_.Value(destination);</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_start = starts_.Value(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  starts_.SetValue(s, new_end, new_start);</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  ends_.SetValue(s, new_start, new_end);</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  lengths_.SetValue(</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  s, new_start,</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  lengths_.Value(new_start) + lengths_.Value(destination));</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">if</span> (sub_circuit_) {</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="comment">// You are creating the only path. Nexts can no longer loop upon itself.</span></div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  nexts_[destination]->RemoveValue(destination);</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordflow">if</span> (lengths_.Value(new_start) < size_ - 1 - num_inactives_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>()) {</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  nexts_[new_end]->RemoveValue(new_start);</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  }</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  }</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  num_inactives_.<a class="code" href="classoperations__research_1_1_numerical_rev.html#ac8beef1ef5cd6ce8bdfb3f48016ff72b">Incr</a>(solver());</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  }</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="comment">// TODO(user): You might get more propagation if you maintain</span></div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="comment">// num_undecided_actives_;</span></div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="comment">// then</span></div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="comment">// if (num_undecided_actives_ == 0 &&</span></div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="comment">// lengths_.Value(new_start) < size_ - 1 - num_inactives_.Value()) {</span></div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="comment">// nexts_[new_end]->RemoveValue(new_start);</span></div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="comment">// }</span></div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="comment">// for both complete == true and false.</span></div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  }</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  </div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keywordtype">void</span> NextDomain(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keywordflow">if</span> (root_.Value() == -1) {</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  }</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">if</span> (!nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Contains(outbound_support_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>])) {</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  EnqueueDelayedDemon(outbound_demon_);</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  }</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">if</span> (!nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Contains(inbound_support_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>])) {</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  EnqueueDelayedDemon(inbound_demon_);</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>  </div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keywordtype">void</span> TryInsertReached(<span class="keywordtype">int</span> candidate, int64_t after) {</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">if</span> (!reached_[after]) {</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  reached_[after] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  insertion_queue_.push_back(after);</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  temp_support_[candidate] = after;</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  }</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  }</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  </div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordtype">void</span> CheckReachabilityFromRoot() {</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">if</span> (root_.Value() == -1) { <span class="comment">// Root is not yet defined. Nothing to deduce.</span></div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  }</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>  <span class="comment">// Assign temp_support_ to a dummy value.</span></div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  temp_support_.assign(size_, -1);</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="comment">// Clear the spanning tree.</span></div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordtype">int</span> processed = 0;</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  reached_.assign(size_, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  insertion_queue_.clear();</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="comment">// Add the root node.</span></div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> root_value = root_.Value();</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  reached_[root_value] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  insertion_queue_.push_back(root_value);</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="comment">// Compute reachable nodes.</span></div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keywordflow">while</span> (processed < insertion_queue_.size() &&</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  insertion_queue_.size() + num_inactives_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>() < size_) {</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> candidate = insertion_queue_[processed++];</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = nexts_[candidate];</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keywordflow">switch</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Size()) {</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">case</span> 1: {</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  TryInsertReached(candidate, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min());</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="keywordflow">break</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="keywordflow">case</span> 2: {</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  TryInsertReached(candidate, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min());</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  TryInsertReached(candidate, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Max());</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  }</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keywordflow">default</span>: {</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  IntVarIterator* <span class="keyword">const</span> domain = domains_[candidate];</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : InitAndGetValues(domain)) {</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  TryInsertReached(candidate, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</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>  }</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  }</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  }</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="comment">// All non reachable nodes should point to themselves in the incomplete</span></div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="comment">// case</span></div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keywordflow">if</span> (!reached_[i]) {</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  nexts_[i]->SetValue(i);</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>  }</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="comment">// Update the outbound_support_ vector.</span></div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  outbound_support_.swap(temp_support_);</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  }</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  </div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordtype">void</span> CheckReachabilityToRoot() {</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="comment">// TODO(user): Improve with prev_ data structure.</span></div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="keywordflow">if</span> (root_.Value() == -1) {</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  }</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  </div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  insertion_queue_.clear();</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  insertion_queue_.push_back(root_.Value());</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  temp_support_[root_.Value()] = nexts_[root_.Value()]->Min();</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="keywordtype">int</span> processed = 0;</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  to_visit_.clear();</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keywordflow">if</span> (!Inactive(i) && i != root_.Value()) {</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  to_visit_.push_back(i);</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  }</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  }</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> inactive = num_inactives_.<a class="code" href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">Value</a>();</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keywordflow">while</span> (processed < insertion_queue_.size() &&</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  insertion_queue_.size() + inactive < size_) {</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> inserted = insertion_queue_[processed++];</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  std::vector<int> rejected;</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < to_visit_.size(); ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> candidate = to_visit_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordflow">if</span> (nexts_[candidate]->Contains(inserted)) {</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  insertion_queue_.push_back(candidate);</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  temp_support_[candidate] = inserted;</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  rejected.push_back(candidate);</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  }</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  }</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  to_visit_.swap(rejected);</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="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < to_visit_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> node = to_visit_[i];</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  nexts_[node]->SetValue(node);</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  }</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  temp_support_.swap(inbound_support_);</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  }</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  </div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keyword">const</span> std::vector<IntVar*> nexts_;</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size_;</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  std::vector<int> insertion_queue_;</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  std::vector<int> to_visit_;</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  std::vector<bool> reached_;</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  RevArray<int> starts_;</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  RevArray<int> ends_;</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  RevArray<int> lengths_;</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  std::vector<IntVarIterator*> domains_;</div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  std::vector<int> outbound_support_;</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  std::vector<int> inbound_support_;</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  std::vector<int> temp_support_;</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  Demon* inbound_demon_;</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  Demon* outbound_demon_;</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  Rev<int> root_;</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  NumericalRev<int> num_inactives_;</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> sub_circuit_;</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span> };</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  </div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a81fb93226e8adf2f9131624b7a0eaba3"> 620</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeNoCycle(<span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="keyword">const</span> std::vector<IntVar*>& active,</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <a class="code" href="classoperations__research_1_1_solver.html#a6188d0df45262d3176058485c7f47995">Solver::IndexFilter1</a> sink_handler,</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keywordtype">bool</span> assume_paths) {</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(nexts.size(), active.size());</div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keywordflow">if</span> (sink_handler == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keyword">const</span> int64_t size = nexts.size();</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  sink_handler = [size](int64_t <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) { <span class="keywordflow">return</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> >= size; };</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  }</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> NoCycle(<span class="keyword">this</span>, nexts, active, sink_handler, assume_paths));</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span> }</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  </div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#af86d4d3fd4b1b37d56a50a0a6c7628d6"> 632</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeNoCycle(<span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keyword">const</span> std::vector<IntVar*>& active,</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <a class="code" href="classoperations__research_1_1_solver.html#a6188d0df45262d3176058485c7f47995">Solver::IndexFilter1</a> sink_handler) {</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="keywordflow">return</span> MakeNoCycle(nexts, active, std::move(sink_handler), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span> }</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  </div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span> <span class="comment">// TODO(user): Merge NoCycle and Circuit.</span></div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a399fa67037695a2651e9e9c49ec1e014"> 639</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeCircuit(<span class="keyword">const</span> std::vector<IntVar*>& nexts) {</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> Circuit(<span class="keyword">this</span>, nexts, <span class="keyword">false</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>  </div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a1c08fc5456634780867df83cff1d8a54"> 643</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeSubCircuit(<span class="keyword">const</span> std::vector<IntVar*>& nexts) {</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> Circuit(<span class="keyword">this</span>, nexts, <span class="keyword">true</span>));</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> <span class="comment">// ----- Path cumul constraints -----</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="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span> <span class="keyword">class </span>BasePathCumul : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a> {</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  BasePathCumul(<a class="code" href="classoperations__research_1_1_solver.html">Solver</a>* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keyword">const</span> std::vector<IntVar*>& active,</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keyword">const</span> std::vector<IntVar*>& cumuls);</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  ~BasePathCumul()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_constraint.html#af33bad3aa81a2f411224d5e471f9956f">Post</a>() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_constraint.html#a9100fab5545234f60a4ce442dbb45630">InitialPropagate</a>() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordtype">void</span> ActiveBound(<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">virtual</span> <span class="keywordtype">void</span> NextBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) = 0;</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keyword">virtual</span> <span class="keywordtype">bool</span> AcceptLink(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordtype">void</span> UpdateSupport(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordtype">void</span> CumulRange(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  std::string <a class="code" href="classoperations__research_1_1_constraint.html#aed804747c45a7e1caf81461f9e45dd91">DebugString</a>() <span class="keyword">const override</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>  <span class="keyword">protected</span>:</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  int64_t size()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> nexts_.size(); }</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordtype">int</span> cumul_size()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>.size(); }</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  </div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keyword">const</span> std::vector<IntVar*> nexts_;</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keyword">const</span> std::vector<IntVar*> active_;</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"><a class="line" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5"> 671</a></span>  <span class="keyword">const</span> std::vector<IntVar*> <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>;</div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"><a class="line" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb"> 672</a></span>  RevArray<int> <a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>;</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"><a class="line" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6"> 673</a></span>  std::vector<int> <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>;</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span> };</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  </div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span> BasePathCumul::BasePathCumul(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="keyword">const</span> std::vector<IntVar*>& active,</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="keyword">const</span> std::vector<IntVar*>& cumuls)</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  : Constraint(s),</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  nexts_(nexts),</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  active_(active),</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>(cumuls),</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>(cumuls.size(), -1),</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>(nexts.size()) {</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(cumul_size(), size());</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>[i] = -1;</div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  }</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span> }</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  </div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span> <span class="keywordtype">void</span> BasePathCumul::InitialPropagate() {</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keywordflow">if</span> (nexts_[i]->Bound()) {</div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  NextBound(i);</div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  UpdateSupport(i);</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  }</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  }</div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span> }</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  </div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span> <span class="keywordtype">void</span> BasePathCumul::Post() {</div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  IntVar* <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = nexts_[i];</div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  Demon* d = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(solver(), <span class="keyword">this</span>, &BasePathCumul::NextBound,</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="stringliteral">"NextBound"</span>, i);</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->WhenBound(d);</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  Demon* ds = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  solver(), <span class="keyword">this</span>, &BasePathCumul::UpdateSupport, <span class="stringliteral">"UpdateSupport"</span>, i);</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->WhenDomain(ds);</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  Demon* active_demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  solver(), <span class="keyword">this</span>, &BasePathCumul::ActiveBound, <span class="stringliteral">"ActiveBound"</span>, i);</div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  active_[i]->WhenBound(active_demon);</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>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < cumul_size(); ++i) {</div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  IntVar* cumul = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[i];</div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  Demon* d = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(solver(), <span class="keyword">this</span>, &BasePathCumul::CumulRange,</div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="stringliteral">"CumulRange"</span>, i);</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  cumul->WhenRange(d);</div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  }</div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span> }</div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  </div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span> <span class="keywordtype">void</span> BasePathCumul::ActiveBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keywordflow">if</span> (nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound()) {</div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  NextBound(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  }</div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span> }</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="keywordtype">void</span> BasePathCumul::CumulRange(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < size()) {</div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="keywordflow">if</span> (nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound()) {</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  NextBound(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  UpdateSupport(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  }</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  }</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keywordflow">if</span> (<a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] >= 0) {</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  NextBound(<a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>[i]) {</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  UpdateSupport(i);</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  }</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  }</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  }</div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span> }</div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  </div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span> <span class="keywordtype">void</span> BasePathCumul::UpdateSupport(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keywordtype">int</span> support = <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keywordflow">if</span> (support < 0 || !AcceptLink(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, support)) {</div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  IntVar* <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->Min(); i <= var->Max(); ++i) {</div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keywordflow">if</span> (i != support && AcceptLink(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, i)) {</div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = i;</div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  }</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  }</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  active_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->SetMax(0);</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> }</div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  </div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span> std::string BasePathCumul::DebugString()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  std::string out = <span class="stringliteral">"PathCumul("</span>;</div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  out += nexts_[i]->DebugString() + <span class="stringliteral">" "</span> + <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[i]->DebugString();</div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  }</div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  out += <span class="stringliteral">")"</span>;</div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keywordflow">return</span> out;</div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span> }</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  </div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span> <span class="comment">// cumuls[next[i]] = cumuls[i] + transits[i]</span></div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  </div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span> <span class="keyword">class </span>PathCumul : <span class="keyword">public</span> BasePathCumul {</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  PathCumul(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keyword">const</span> std::vector<IntVar*>& active,</div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keyword">const</span> std::vector<IntVar*>& cumuls,</div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keyword">const</span> std::vector<IntVar*>& transits)</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  : BasePathCumul(s, nexts, active, cumuls), transits_(transits) {}</div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  ~PathCumul()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordtype">void</span> Post() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <span class="keywordtype">void</span> NextBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="keywordtype">bool</span> AcceptLink(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) <span class="keyword">const override</span>;</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keywordtype">void</span> TransitRange(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  </div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="keywordtype">void</span> Accept(ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  visitor->BeginVisitConstraint(ModelVisitor::kPathCumul, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kNextsArgument,</div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  nexts_);</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kActiveArgument,</div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  active_);</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kCumulsArgument,</div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>);</div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kTransitsArgument,</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  transits_);</div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  visitor->EndVisitConstraint(ModelVisitor::kPathCumul, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  }</div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  </div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="keyword">const</span> std::vector<IntVar*> transits_;</div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span> };</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  </div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span> <span class="keywordtype">void</span> PathCumul::Post() {</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  BasePathCumul::Post();</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  Demon* transit_demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  solver(), <span class="keyword">this</span>, &PathCumul::TransitRange, <span class="stringliteral">"TransitRange"</span>, i);</div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  transits_[i]->WhenRange(transit_demon);</div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  }</div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span> }</div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  </div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span> <span class="keywordtype">void</span> PathCumul::NextBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keywordflow">if</span> (active_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min() == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="keyword">const</span> int64_t <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Value();</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  IntVar* cumul = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  IntVar* cumul_next = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>];</div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  IntVar* transit = transits_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  cumul_next->SetMin(cumul->Min() + transit->Min());</div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  cumul_next->SetMax(<a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(cumul->Max(), transit->Max()));</div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  cumul->SetMin(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_next->Min(), transit->Max()));</div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  cumul->SetMax(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_next->Max(), transit->Min()));</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  transit->SetMin(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_next->Min(), cumul->Max()));</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  transit->SetMax(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_next->Max(), cumul->Min()));</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="keywordflow">if</span> (<a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>] < 0) {</div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>.SetValue(solver(), <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  }</div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span> }</div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  </div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span> <span class="keywordtype">void</span> PathCumul::TransitRange(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="keywordflow">if</span> (nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound()) {</div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  NextBound(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  UpdateSupport(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  }</div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keywordflow">if</span> (<a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] >= 0) {</div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  NextBound(<a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>[i]) {</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  UpdateSupport(i);</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  }</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  }</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  }</div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span> }</div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  </div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span> <span class="keywordtype">bool</span> PathCumul::AcceptLink(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="keyword">const</span> IntVar* <span class="keyword">const</span> cumul_i = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[i];</div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <span class="keyword">const</span> IntVar* <span class="keyword">const</span> cumul_j = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[j];</div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="keyword">const</span> IntVar* <span class="keyword">const</span> transit_i = transits_[i];</div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keywordflow">return</span> transit_i->Min() <= <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_j->Max(), cumul_i->Min()) &&</div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_j->Min(), cumul_i->Max()) <= transit_i->Max();</div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span> }</div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  </div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span> <span class="keyword">class </span>StampedVector {</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  StampedVector() : <a class="code" href="search_8cc.html#aea630e5fb2cf8a83bf43f5b43d187cda">stamp_</a>(0) {}</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keyword">const</span> std::vector<T>& Values(Solver* solver) {</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  CheckStamp(solver);</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="keywordflow">return</span> values_;</div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  }</div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="keywordtype">void</span> PushBack(Solver* solver, <span class="keyword">const</span> T& <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  CheckStamp(solver);</div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  values_.push_back(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  }</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <span class="keywordtype">void</span> Clear(Solver* solver) {</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  values_.clear();</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <a class="code" href="search_8cc.html#aea630e5fb2cf8a83bf43f5b43d187cda">stamp_</a> = solver->fail_stamp();</div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  }</div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  </div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keywordtype">void</span> CheckStamp(Solver* solver) {</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  <span class="keywordflow">if</span> (solver->fail_stamp() > <a class="code" href="search_8cc.html#aea630e5fb2cf8a83bf43f5b43d187cda">stamp_</a>) {</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  Clear(solver);</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  }</div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  }</div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  </div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  std::vector<T> values_;</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  uint64_t <a class="code" href="search_8cc.html#aea630e5fb2cf8a83bf43f5b43d187cda">stamp_</a>;</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span> };</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  </div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span> <span class="keyword">class </span>DelayedPathCumul : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  DelayedPathCumul(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="keyword">const</span> std::vector<IntVar*>& active,</div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keyword">const</span> std::vector<IntVar*>& cumuls,</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keyword">const</span> std::vector<IntVar*>& transits)</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  : Constraint(solver),</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  nexts_(nexts),</div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  active_(active),</div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>(cumuls),</div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  transits_(transits),</div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  cumul_transit_demons_(cumuls.size(), nullptr),</div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  path_demon_(nullptr),</div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  touched_(),</div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  chain_starts_(cumuls.size(), -1),</div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  chain_ends_(cumuls.size(), -1),</div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  is_chain_start_(cumuls.size(), false),</div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>(cumuls.size(), -1),</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>(nexts.size()),</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  was_bound_(nexts.size(), false),</div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  has_cumul_demon_(cumuls.size(), false) {</div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keywordflow">for</span> (int64_t i = 0; i < <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  cumul_transit_demons_[i] = <a class="code" href="namespaceoperations__research.html#a11f4a7dbafd8e00a36b892a82e44445f">MakeDelayedConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  solver, <span class="keyword">this</span>, &DelayedPathCumul::CumulRange, <span class="stringliteral">"CumulRange"</span>, i);</div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  chain_starts_[i] = i;</div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  chain_ends_[i] = i;</div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  }</div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  path_demon_ = <a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  solver, <span class="keyword">this</span>, &DelayedPathCumul::PropagatePaths, <span class="stringliteral">"PropagatePaths"</span>);</div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>[i] = -1;</div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  }</div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  }</div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  ~DelayedPathCumul()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  solver()->RegisterDemon(path_demon_);</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="keywordflow">if</span> (!nexts_[i]->Bound()) {</div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  Demon* <span class="keyword">const</span> demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  solver(), <span class="keyword">this</span>, &DelayedPathCumul::NextBound, <span class="stringliteral">"NextBound"</span>, i);</div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  nexts_[i]->WhenBound(demon);</div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  }</div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  }</div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < active_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="keywordflow">if</span> (!active_[i]->Bound()) {</div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  Demon* <span class="keyword">const</span> demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  solver(), <span class="keyword">this</span>, &DelayedPathCumul::ActiveBound, <span class="stringliteral">"ActiveBound"</span>, i);</div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  active_[i]->WhenBound(demon);</div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  }</div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  }</div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  }</div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  touched_.Clear(solver());</div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="keywordflow">if</span> (nexts_[i]->Bound()) {</div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  NextBound(i);</div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  }</div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  }</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < active_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="keywordflow">if</span> (active_[i]->Bound()) {</div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  ActiveBound(i);</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  }</div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  }</div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  }</div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="comment">// TODO(user): Merge NextBound and ActiveBound to re-use the same demon</span></div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="comment">// for next and active variables.</span></div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <span class="keywordtype">void</span> NextBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  <span class="keywordflow">if</span> (active_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min() > 0) {</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min();</div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  PropagateLink(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  touched_.PushBack(solver(), <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  EnqueueDelayedDemon(path_demon_);</div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  }</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  }</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  <span class="keywordtype">void</span> ActiveBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="keywordflow">if</span> (nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound()) {</div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  NextBound(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  }</div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  }</div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keywordtype">void</span> PropagatePaths() {</div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <span class="comment">// Detecting new chains.</span></div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <span class="keyword">const</span> std::vector<int>& touched_values = touched_.Values(solver());</div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> touched : touched_values) {</div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  chain_starts_[touched] = touched;</div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  chain_ends_[touched] = touched;</div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  is_chain_start_[touched] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[touched]->Min();</div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  chain_starts_[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>] = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  chain_ends_[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>] = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  is_chain_start_[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  }</div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> touched : touched_values) {</div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <span class="keywordflow">if</span> (touched >= nexts_.size()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  IntVar* <span class="keyword">const</span> next_var = nexts_[touched];</div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  <span class="keywordflow">if</span> (!was_bound_[touched] && next_var->Bound() &&</div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  active_[touched]->Min() > 0) {</div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  <span class="keyword">const</span> int64_t <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = next_var->Min();</div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  was_bound_.SetValue(solver(), touched, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  chain_starts_[chain_ends_[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>]] = chain_starts_[touched];</div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  chain_ends_[chain_starts_[touched]] = chain_ends_[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>];</div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  is_chain_start_[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  is_chain_start_[chain_starts_[touched]] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  }</div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  }</div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="comment">// Propagating new chains.</span></div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> touched : touched_values) {</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  <span class="comment">// Is touched the start of a chain ?</span></div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="keywordflow">if</span> (is_chain_start_[touched]) {</div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <span class="comment">// Propagate min cumuls from chain_starts[touch] to chain_ends_[touch].</span></div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  int64_t current = touched;</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  int64_t <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[current]->Min();</div>
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <span class="keywordflow">while</span> (current != chain_ends_[touched]) {</div>
|
|
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  <a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>.SetValue(solver(), <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, current);</div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  PropagateLink(current, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  current = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="keywordflow">if</span> (current != chain_ends_[touched]) {</div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[current]->Min();</div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  }</div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  }</div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="comment">// Propagate max cumuls from chain_ends_[i] to chain_starts_[i].</span></div>
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  int64_t prev = <a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>[current];</div>
|
|
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="keywordflow">while</span> (current != touched) {</div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  PropagateLink(prev, current);</div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  current = prev;</div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="keywordflow">if</span> (current != touched) {</div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  prev = <a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>[current];</div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  }</div>
|
|
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  }</div>
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <span class="comment">// Now that the chain has been propagated in both directions, adding</span></div>
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  <span class="comment">// demons for the corresponding cumul and transit variables for</span></div>
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  <span class="comment">// future changes in their range.</span></div>
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  current = touched;</div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <span class="keywordflow">while</span> (current != chain_ends_[touched]) {</div>
|
|
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <span class="keywordflow">if</span> (!has_cumul_demon_[current]) {</div>
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  Demon* <span class="keyword">const</span> demon = cumul_transit_demons_[current];</div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[current]->WhenRange(demon);</div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  transits_[current]->WhenRange(demon);</div>
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  has_cumul_demon_.SetValue(solver(), current, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  }</div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  current = nexts_[current]->Min();</div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  }</div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <span class="keywordflow">if</span> (!has_cumul_demon_[current]) {</div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  Demon* <span class="keyword">const</span> demon = cumul_transit_demons_[current];</div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[current]->WhenRange(demon);</div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <span class="keywordflow">if</span> (current < transits_.size()) {</div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  transits_[current]->WhenRange(demon);</div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  UpdateSupport(current);</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  }</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  has_cumul_demon_.SetValue(solver(), current, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  }</div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  }</div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  }</div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  touched_.Clear(solver());</div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  }</div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  </div>
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</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="l01039"></a><span class="lineno"> 1039</span>  visitor->BeginVisitConstraint(ModelVisitor::kDelayedPathCumul, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kNextsArgument,</div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  nexts_);</div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kActiveArgument,</div>
|
|
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  active_);</div>
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kCumulsArgument,</div>
|
|
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>);</div>
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kTransitsArgument,</div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  transits_);</div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  visitor->EndVisitConstraint(ModelVisitor::kDelayedPathCumul, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  }</div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  </div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  std::string out = <span class="stringliteral">"DelayedPathCumul("</span>;</div>
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  out += nexts_[i]->DebugString() + <span class="stringliteral">" "</span> + <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[i]->DebugString();</div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  }</div>
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  out += <span class="stringliteral">")"</span>;</div>
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="keywordflow">return</span> out;</div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  }</div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  </div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  <span class="keywordtype">void</span> CumulRange(int64_t <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < nexts_.size()) {</div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <span class="keywordflow">if</span> (nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound()) {</div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="keywordflow">if</span> (active_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min() > 0) {</div>
|
|
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  PropagateLink(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min());</div>
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  }</div>
|
|
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  UpdateSupport(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  }</div>
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  }</div>
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keywordflow">if</span> (<a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] >= 0) {</div>
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  PropagateLink(<a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>], <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>[i]) {</div>
|
|
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  UpdateSupport(i);</div>
|
|
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  }</div>
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  }</div>
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  }</div>
|
|
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  }</div>
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="keywordtype">void</span> UpdateSupport(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="keywordtype">int</span> support = <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="keywordflow">if</span> (support < 0 || !AcceptLink(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, support)) {</div>
|
|
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  IntVar* <span class="keyword">const</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->Min(); i <= next->Max(); ++i) {</div>
|
|
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  <span class="keywordflow">if</span> (i != support && AcceptLink(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, i)) {</div>
|
|
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = i;</div>
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  }</div>
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  }</div>
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  active_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->SetMax(0);</div>
|
|
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  }</div>
|
|
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  }</div>
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="keywordtype">void</span> PropagateLink(int64_t <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, int64_t <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>) {</div>
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  IntVar* <span class="keyword">const</span> cumul_var = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  IntVar* <span class="keyword">const</span> next_cumul_var = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>];</div>
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  IntVar* <span class="keyword">const</span> transit = transits_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <span class="keyword">const</span> int64_t transit_min = transit->Min();</div>
|
|
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  <span class="keyword">const</span> int64_t transit_max = transit->Max();</div>
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  next_cumul_var->SetMin(<a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(cumul_var->Min(), transit_min));</div>
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  next_cumul_var->SetMax(<a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(cumul_var->Max(), transit_max));</div>
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="keyword">const</span> int64_t next_cumul_min = next_cumul_var->Min();</div>
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <span class="keyword">const</span> int64_t next_cumul_max = next_cumul_var->Max();</div>
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  cumul_var->SetMin(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(next_cumul_min, transit_max));</div>
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  cumul_var->SetMax(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(next_cumul_max, transit_min));</div>
|
|
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  transit->SetMin(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(next_cumul_min, cumul_var->Max()));</div>
|
|
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  transit->SetMax(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(next_cumul_max, cumul_var->Min()));</div>
|
|
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  }</div>
|
|
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  <span class="keywordtype">bool</span> AcceptLink(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  IntVar* <span class="keyword">const</span> cumul_var = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  IntVar* <span class="keyword">const</span> next_cumul_var = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>];</div>
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  IntVar* <span class="keyword">const</span> transit = transits_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <span class="keywordflow">return</span> transit->Min() <= <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(next_cumul_var->Max(), cumul_var->Min()) &&</div>
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(next_cumul_var->Min(), cumul_var->Max()) <= transit->Max();</div>
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  }</div>
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  </div>
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  <span class="keyword">const</span> std::vector<IntVar*> nexts_;</div>
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="keyword">const</span> std::vector<IntVar*> active_;</div>
|
|
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <span class="keyword">const</span> std::vector<IntVar*> <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>;</div>
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  <span class="keyword">const</span> std::vector<IntVar*> transits_;</div>
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  std::vector<Demon*> cumul_transit_demons_;</div>
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  Demon* path_demon_;</div>
|
|
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  StampedVector<int> touched_;</div>
|
|
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  std::vector<int64_t> chain_starts_;</div>
|
|
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  std::vector<int64_t> chain_ends_;</div>
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  std::vector<bool> is_chain_start_;</div>
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  RevArray<int> <a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>;</div>
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  std::vector<int> <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>;</div>
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  RevArray<bool> was_bound_;</div>
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  RevArray<bool> has_cumul_demon_;</div>
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span> };</div>
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  </div>
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span> <span class="comment">// cumuls[next[i]] = cumuls[i] + transit_evaluator(i, next[i])</span></div>
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  </div>
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span> <span class="keyword">class </span>IndexEvaluator2PathCumul : <span class="keyword">public</span> BasePathCumul {</div>
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  IndexEvaluator2PathCumul(Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  <span class="keyword">const</span> std::vector<IntVar*>& active,</div>
|
|
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <span class="keyword">const</span> std::vector<IntVar*>& cumuls,</div>
|
|
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  Solver::IndexEvaluator2 transit_evaluator);</div>
|
|
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  ~IndexEvaluator2PathCumul()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  <span class="keywordtype">void</span> NextBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  <span class="keywordtype">bool</span> AcceptLink(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) <span class="keyword">const override</span>;</div>
|
|
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  </div>
|
|
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</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="l01146"></a><span class="lineno"> 1146</span>  visitor->BeginVisitConstraint(ModelVisitor::kPathCumul, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kNextsArgument,</div>
|
|
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  nexts_);</div>
|
|
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kActiveArgument,</div>
|
|
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  active_);</div>
|
|
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kCumulsArgument,</div>
|
|
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>);</div>
|
|
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  <span class="comment">// TODO(user): Visit transit correctly.</span></div>
|
|
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  <span class="comment">// visitor->VisitIntegerVariableArrayArgument(</span></div>
|
|
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  <span class="comment">// ModelVisitor::kTransitsArgument,</span></div>
|
|
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <span class="comment">// transit_evaluator);</span></div>
|
|
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  visitor->EndVisitConstraint(ModelVisitor::kPathCumul, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  }</div>
|
|
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  </div>
|
|
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  Solver::IndexEvaluator2 transits_evaluator_;</div>
|
|
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span> };</div>
|
|
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  </div>
|
|
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span> IndexEvaluator2PathCumul::IndexEvaluator2PathCumul(</div>
|
|
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  <span class="keyword">const</span> std::vector<IntVar*>& active, <span class="keyword">const</span> std::vector<IntVar*>& cumuls,</div>
|
|
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  Solver::IndexEvaluator2 transit_evaluator)</div>
|
|
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  : BasePathCumul(s, nexts, active, cumuls),</div>
|
|
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  transits_evaluator_(std::move(transit_evaluator)) {}</div>
|
|
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  </div>
|
|
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span> <span class="keywordtype">void</span> IndexEvaluator2PathCumul::NextBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  <span class="keywordflow">if</span> (active_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min() == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  <span class="keyword">const</span> int64_t <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Value();</div>
|
|
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  IntVar* cumul = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  IntVar* cumul_next = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>];</div>
|
|
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="keyword">const</span> int64_t transit = transits_evaluator_(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  cumul_next->SetMin(cumul->Min() + transit);</div>
|
|
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  cumul_next->SetMax(<a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(cumul->Max(), transit));</div>
|
|
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  cumul->SetMin(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_next->Min(), transit));</div>
|
|
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  cumul->SetMax(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_next->Max(), transit));</div>
|
|
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keywordflow">if</span> (<a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>] < 0) {</div>
|
|
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  <a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>.SetValue(solver(), <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  }</div>
|
|
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span> }</div>
|
|
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  </div>
|
|
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span> <span class="keywordtype">bool</span> IndexEvaluator2PathCumul::AcceptLink(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  <span class="keyword">const</span> IntVar* <span class="keyword">const</span> cumul_i = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[i];</div>
|
|
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  <span class="keyword">const</span> IntVar* <span class="keyword">const</span> cumul_j = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[j];</div>
|
|
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="keyword">const</span> int64_t transit = transits_evaluator_(i, j);</div>
|
|
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  <span class="keywordflow">return</span> transit <= <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_j->Max(), cumul_i->Min()) &&</div>
|
|
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_j->Min(), cumul_i->Max()) <= transit;</div>
|
|
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span> }</div>
|
|
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  </div>
|
|
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span> <span class="comment">// ----- ResulatCallback2SlackPathCumul -----</span></div>
|
|
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  </div>
|
|
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span> <span class="keyword">class </span>IndexEvaluator2SlackPathCumul : <span class="keyword">public</span> BasePathCumul {</div>
|
|
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  IndexEvaluator2SlackPathCumul(Solver* <span class="keyword">const</span> s,</div>
|
|
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  <span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <span class="keyword">const</span> std::vector<IntVar*>& active,</div>
|
|
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  <span class="keyword">const</span> std::vector<IntVar*>& cumuls,</div>
|
|
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  <span class="keyword">const</span> std::vector<IntVar*>& slacks,</div>
|
|
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  Solver::IndexEvaluator2 transit_evaluator);</div>
|
|
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  ~IndexEvaluator2SlackPathCumul()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  <span class="keywordtype">void</span> Post() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  <span class="keywordtype">void</span> NextBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  <span class="keywordtype">bool</span> AcceptLink(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) <span class="keyword">const override</span>;</div>
|
|
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <span class="keywordtype">void</span> SlackRange(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  </div>
|
|
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  <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="l01211"></a><span class="lineno"> 1211</span>  visitor->BeginVisitConstraint(ModelVisitor::kPathCumul, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kNextsArgument,</div>
|
|
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  nexts_);</div>
|
|
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kActiveArgument,</div>
|
|
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  active_);</div>
|
|
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kCumulsArgument,</div>
|
|
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>);</div>
|
|
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  <span class="comment">// TODO(user): Visit transit correctly.</span></div>
|
|
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="comment">// visitor->VisitIntegerVariableArrayArgument(</span></div>
|
|
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <span class="comment">// ModelVisitor::kTransitsArgument,</span></div>
|
|
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  <span class="comment">// transit_evaluator);</span></div>
|
|
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  visitor->EndVisitConstraint(ModelVisitor::kPathCumul, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  }</div>
|
|
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  </div>
|
|
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  <span class="keyword">const</span> std::vector<IntVar*> slacks_;</div>
|
|
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  Solver::IndexEvaluator2 transits_evaluator_;</div>
|
|
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span> };</div>
|
|
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  </div>
|
|
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span> IndexEvaluator2SlackPathCumul::IndexEvaluator2SlackPathCumul(</div>
|
|
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  Solver* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  <span class="keyword">const</span> std::vector<IntVar*>& active, <span class="keyword">const</span> std::vector<IntVar*>& cumuls,</div>
|
|
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  <span class="keyword">const</span> std::vector<IntVar*>& slacks,</div>
|
|
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  Solver::IndexEvaluator2 transit_evaluator)</div>
|
|
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  : BasePathCumul(s, nexts, active, cumuls),</div>
|
|
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  slacks_(slacks),</div>
|
|
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  transits_evaluator_(std::move(transit_evaluator)) {}</div>
|
|
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  </div>
|
|
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span> <span class="keywordtype">void</span> IndexEvaluator2SlackPathCumul::Post() {</div>
|
|
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  BasePathCumul::Post();</div>
|
|
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  Demon* slack_demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  solver(), <span class="keyword">this</span>, &IndexEvaluator2SlackPathCumul::SlackRange,</div>
|
|
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  <span class="stringliteral">"SlackRange"</span>, i);</div>
|
|
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  slacks_[i]->WhenRange(slack_demon);</div>
|
|
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  }</div>
|
|
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span> }</div>
|
|
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  </div>
|
|
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span> <span class="keywordtype">void</span> IndexEvaluator2SlackPathCumul::SlackRange(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  <span class="keywordflow">if</span> (nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound()) {</div>
|
|
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  NextBound(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  UpdateSupport(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  }</div>
|
|
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  <span class="keywordflow">if</span> (<a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] >= 0) {</div>
|
|
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  NextBound(<a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == <a class="code" href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a>[i]) {</div>
|
|
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  UpdateSupport(i);</div>
|
|
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  }</div>
|
|
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  }</div>
|
|
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  }</div>
|
|
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span> }</div>
|
|
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  </div>
|
|
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span> <span class="keywordtype">void</span> IndexEvaluator2SlackPathCumul::NextBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  <span class="keywordflow">if</span> (active_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min() == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  <span class="keyword">const</span> int64_t <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Value();</div>
|
|
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  IntVar* <span class="keyword">const</span> cumul = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  IntVar* <span class="keyword">const</span> cumul_next = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>];</div>
|
|
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  IntVar* <span class="keyword">const</span> slack = slacks_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  <span class="keyword">const</span> int64_t transit = transits_evaluator_(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <span class="keyword">const</span> int64_t cumul_next_minus_transit_min =</div>
|
|
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_next->Min(), transit);</div>
|
|
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  <span class="keyword">const</span> int64_t cumul_next_minus_transit_max =</div>
|
|
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_next->Max(), transit);</div>
|
|
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  cumul_next->SetMin(<a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(cumul->Min(), transit), slack->Min()));</div>
|
|
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  cumul_next->SetMax(<a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(cumul->Max(), transit), slack->Max()));</div>
|
|
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  cumul->SetMin(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_next_minus_transit_min, slack->Max()));</div>
|
|
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  cumul->SetMax(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_next_minus_transit_max, slack->Min()));</div>
|
|
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  slack->SetMin(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_next_minus_transit_min, cumul->Max()));</div>
|
|
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  slack->SetMax(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_next_minus_transit_max, cumul->Min()));</div>
|
|
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  <span class="keywordflow">if</span> (<a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>] < 0) {</div>
|
|
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  <a class="code" href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a>.SetValue(solver(), <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  }</div>
|
|
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span> }</div>
|
|
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  </div>
|
|
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span> <span class="keywordtype">bool</span> IndexEvaluator2SlackPathCumul::AcceptLink(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  <span class="keyword">const</span> IntVar* <span class="keyword">const</span> cumul_i = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[i];</div>
|
|
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <span class="keyword">const</span> IntVar* <span class="keyword">const</span> cumul_j = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[j];</div>
|
|
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  <span class="keyword">const</span> IntVar* <span class="keyword">const</span> slack = slacks_[i];</div>
|
|
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  <span class="keyword">const</span> int64_t transit = transits_evaluator_(i, j);</div>
|
|
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(transit, slack->Min()) <=</div>
|
|
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_j->Max(), cumul_i->Min()) &&</div>
|
|
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_j->Min(), cumul_i->Max()) <=</div>
|
|
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(slack->Max(), transit);</div>
|
|
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span> }</div>
|
|
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  </div>
|
|
<div class="line"><a name="l01300"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#ad66fddae43e332f97a4adc47624b799b"> 1300</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakePathCumul(<span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  <span class="keyword">const</span> std::vector<IntVar*>& active,</div>
|
|
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  <span class="keyword">const</span> std::vector<IntVar*>& cumuls,</div>
|
|
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  <span class="keyword">const</span> std::vector<IntVar*>& transits) {</div>
|
|
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(nexts.size(), active.size());</div>
|
|
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(transits.size(), nexts.size());</div>
|
|
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> PathCumul(<span class="keyword">this</span>, nexts, active, cumuls, transits));</div>
|
|
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span> }</div>
|
|
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  </div>
|
|
<div class="line"><a name="l01309"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a69686be8775ce21f8f1da5ae8570ec71"> 1309</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakePathCumul(<span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  <span class="keyword">const</span> std::vector<IntVar*>& active,</div>
|
|
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  <span class="keyword">const</span> std::vector<IntVar*>& cumuls,</div>
|
|
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  <a class="code" href="classoperations__research_1_1_solver.html#a55d833360c375d45a3c503437de9841c">Solver::IndexEvaluator2</a> transit_evaluator) {</div>
|
|
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(nexts.size(), active.size());</div>
|
|
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> IndexEvaluator2PathCumul(<span class="keyword">this</span>, nexts, active, cumuls,</div>
|
|
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  std::move(transit_evaluator)));</div>
|
|
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span> }</div>
|
|
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  </div>
|
|
<div class="line"><a name="l01318"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#ad92d314c2a6358cff54e0cafbee5c5af"> 1318</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakePathCumul(<span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  <span class="keyword">const</span> std::vector<IntVar*>& active,</div>
|
|
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  <span class="keyword">const</span> std::vector<IntVar*>& cumuls,</div>
|
|
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <span class="keyword">const</span> std::vector<IntVar*>& slacks,</div>
|
|
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  <a class="code" href="classoperations__research_1_1_solver.html#a55d833360c375d45a3c503437de9841c">Solver::IndexEvaluator2</a> transit_evaluator) {</div>
|
|
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(nexts.size(), active.size());</div>
|
|
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> IndexEvaluator2SlackPathCumul(</div>
|
|
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  <span class="keyword">this</span>, nexts, active, cumuls, slacks, std::move(transit_evaluator)));</div>
|
|
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span> }</div>
|
|
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  </div>
|
|
<div class="line"><a name="l01328"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a46d06186cf102695501bfc59cf790877"> 1328</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakeDelayedPathCumul(<span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  <span class="keyword">const</span> std::vector<IntVar*>& active,</div>
|
|
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  <span class="keyword">const</span> std::vector<IntVar*>& cumuls,</div>
|
|
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  <span class="keyword">const</span> std::vector<IntVar*>& transits) {</div>
|
|
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(nexts.size(), active.size());</div>
|
|
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(transits.size(), nexts.size());</div>
|
|
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> DelayedPathCumul(<span class="keyword">this</span>, nexts, active, cumuls, transits));</div>
|
|
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span> }</div>
|
|
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  </div>
|
|
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span> <span class="comment">// Constraint enforcing that status[i] is true iff there's a path defined on</span></div>
|
|
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span> <span class="comment">// next variables from sources[i] to sinks[i].</span></div>
|
|
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span> <span class="keyword">class </span>PathConnectedConstraint : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a> {</div>
|
|
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  PathConnectedConstraint(<a class="code" href="classoperations__research_1_1_solver.html">Solver</a>* solver, std::vector<IntVar*> nexts,</div>
|
|
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  <span class="keyword">const</span> std::vector<int64_t>& sources,</div>
|
|
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  std::vector<int64_t> sinks,</div>
|
|
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  std::vector<IntVar*> status)</div>
|
|
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  : <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>(solver),</div>
|
|
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  sources_(sources.size(), -1),</div>
|
|
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  index_to_path_(nexts.size(), -1),</div>
|
|
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  sinks_(std::move(sinks)),</div>
|
|
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  nexts_(std::move(nexts)),</div>
|
|
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  status_(std::move(status)),</div>
|
|
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  touched_(nexts_.size()) {</div>
|
|
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(status_.size(), sources_.size());</div>
|
|
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(status_.size(), sinks_.size());</div>
|
|
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < status_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  <span class="keyword">const</span> int64_t source = sources[i];</div>
|
|
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  sources_.SetValue(solver, i, source);</div>
|
|
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  <span class="keywordflow">if</span> (source < index_to_path_.size()) {</div>
|
|
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  index_to_path_.SetValue(solver, source, i);</div>
|
|
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  }</div>
|
|
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  }</div>
|
|
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  }</div>
|
|
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_constraint.html#af33bad3aa81a2f411224d5e471f9956f">Post</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  nexts_[i]->WhenBound(<a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  <a class="code" href="classoperations__research_1_1_propagation_base_object.html#a5f32c22c620c811754ba7b6f977db864">solver</a>(), <span class="keyword">this</span>, &PathConnectedConstraint::NextBound, <span class="stringliteral">"NextValue"</span>, i));</div>
|
|
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  }</div>
|
|
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < status_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="keywordflow">if</span> (sources_[i] < nexts_.size()) {</div>
|
|
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  status_[i]->SetRange(0, 1);</div>
|
|
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  status_[i]->SetValue(0);</div>
|
|
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  }</div>
|
|
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  }</div>
|
|
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  }</div>
|
|
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_constraint.html#a9100fab5545234f60a4ce442dbb45630">InitialPropagate</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < status_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  EvaluatePath(i);</div>
|
|
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  }</div>
|
|
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  }</div>
|
|
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  std::string <a class="code" href="classoperations__research_1_1_constraint.html#aed804747c45a7e1caf81461f9e45dd91">DebugString</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  std::string output = <span class="stringliteral">"PathConnected("</span>;</div>
|
|
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  std::vector<std::string> elements;</div>
|
|
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  <span class="keywordflow">for</span> (IntVar* <span class="keyword">const</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> : nexts_) {</div>
|
|
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  elements.push_back(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->DebugString());</div>
|
|
<div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  }</div>
|
|
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < sources_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  elements.push_back(absl::StrCat(sources_[i]));</div>
|
|
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  }</div>
|
|
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  <span class="keywordflow">for</span> (int64_t sink : sinks_) {</div>
|
|
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  elements.push_back(absl::StrCat(sink));</div>
|
|
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  }</div>
|
|
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  <span class="keywordflow">for</span> (IntVar* <span class="keyword">const</span> status : status_) {</div>
|
|
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  elements.push_back(status->DebugString());</div>
|
|
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  }</div>
|
|
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  output += absl::StrJoin(elements, <span class="stringliteral">","</span>) + <span class="stringliteral">")"</span>;</div>
|
|
<div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  <span class="keywordflow">return</span> output;</div>
|
|
<div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  }</div>
|
|
<div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  </div>
|
|
<div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  <span class="keywordtype">void</span> NextBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> path = index_to_path_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  <span class="keywordflow">if</span> (path >= 0) {</div>
|
|
<div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  EvaluatePath(path);</div>
|
|
<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  }</div>
|
|
<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  }</div>
|
|
<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  <span class="keywordtype">void</span> EvaluatePath(<span class="keywordtype">int</span> path) {</div>
|
|
<div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  touched_.SparseClearAll();</div>
|
|
<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  int64_t source = sources_[path];</div>
|
|
<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  <span class="keyword">const</span> int64_t end = sinks_[path];</div>
|
|
<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  <span class="keywordflow">while</span> (source != end) {</div>
|
|
<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  <span class="keywordflow">if</span> (source >= nexts_.size() || touched_[source]) {</div>
|
|
<div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  status_[path]->SetValue(0);</div>
|
|
<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  }</div>
|
|
<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  touched_.Set(source);</div>
|
|
<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  IntVar* <span class="keyword">const</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[source];</div>
|
|
<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->Bound()) {</div>
|
|
<div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  source = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->Min();</div>
|
|
<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  sources_.SetValue(<a class="code" href="classoperations__research_1_1_propagation_base_object.html#a5f32c22c620c811754ba7b6f977db864">solver</a>(), path, source);</div>
|
|
<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  index_to_path_.SetValue(<a class="code" href="classoperations__research_1_1_propagation_base_object.html#a5f32c22c620c811754ba7b6f977db864">solver</a>(), source, path);</div>
|
|
<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  }</div>
|
|
<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  }</div>
|
|
<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  status_[path]->SetValue(1);</div>
|
|
<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  }</div>
|
|
<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  </div>
|
|
<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  RevArray<int64_t> sources_;</div>
|
|
<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  RevArray<int> index_to_path_;</div>
|
|
<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  <span class="keyword">const</span> std::vector<int64_t> sinks_;</div>
|
|
<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  <span class="keyword">const</span> std::vector<IntVar*> nexts_;</div>
|
|
<div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  <span class="keyword">const</span> std::vector<IntVar*> status_;</div>
|
|
<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  SparseBitset<int64_t> touched_;</div>
|
|
<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span> };</div>
|
|
<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  </div>
|
|
<div class="line"><a name="l01438"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a0e7c36ddf2c9c9ce4e9f09621bd04804"> 1438</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakePathConnected(std::vector<IntVar*> nexts,</div>
|
|
<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  std::vector<int64_t> sources,</div>
|
|
<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  std::vector<int64_t> sinks,</div>
|
|
<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  std::vector<IntVar*> status) {</div>
|
|
<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  <span class="keywordflow">return</span> RevAlloc(<span class="keyword">new</span> PathConnectedConstraint(</div>
|
|
<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  <span class="keyword">this</span>, std::move(nexts), sources, std::move(sinks), std::move(status)));</div>
|
|
<div class="line"><a name="l01444"></a><span class="lineno"> 1444</span> }</div>
|
|
<div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  </div>
|
|
<div class="line"><a name="l01446"></a><span class="lineno"> 1446</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l01447"></a><span class="lineno"> 1447</span> <span class="keyword">class </span>PathTransitPrecedenceConstraint : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a> {</div>
|
|
<div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  <span class="keyword">enum</span> PrecedenceType {</div>
|
|
<div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  ANY,</div>
|
|
<div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  LIFO,</div>
|
|
<div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  FIFO,</div>
|
|
<div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  };</div>
|
|
<div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  PathTransitPrecedenceConstraint(</div>
|
|
<div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  Solver* solver, std::vector<IntVar*> nexts, std::vector<IntVar*> transits,</div>
|
|
<div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  <span class="keyword">const</span> std::vector<std::pair<int, int>>& precedences,</div>
|
|
<div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  absl::flat_hash_map<int, PrecedenceType> precedence_types)</div>
|
|
<div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  : Constraint(solver),</div>
|
|
<div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  nexts_(std::move(nexts)),</div>
|
|
<div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  transits_(std::move(transits)),</div>
|
|
<div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  predecessors_(nexts_.size()),</div>
|
|
<div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  successors_(nexts_.size()),</div>
|
|
<div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  precedence_types_(std::move(precedence_types)),</div>
|
|
<div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  starts_(nexts_.size(), -1),</div>
|
|
<div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  ends_(nexts_.size(), -1),</div>
|
|
<div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  transit_cumuls_(nexts_.size(), 0) {</div>
|
|
<div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  starts_.SetValue(solver, i, i);</div>
|
|
<div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  ends_.SetValue(solver, i, i);</div>
|
|
<div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  }</div>
|
|
<div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& precedence : precedences) {</div>
|
|
<div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  <span class="keywordflow">if</span> (precedence.second < nexts_.size()) {</div>
|
|
<div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  predecessors_[precedence.second].push_back(precedence.first);</div>
|
|
<div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>  }</div>
|
|
<div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  <span class="keywordflow">if</span> (precedence.first < nexts_.size()) {</div>
|
|
<div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  successors_[precedence.first].push_back(precedence.second);</div>
|
|
<div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  }</div>
|
|
<div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  }</div>
|
|
<div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  }</div>
|
|
<div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  ~PathTransitPrecedenceConstraint()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_constraint.html#af33bad3aa81a2f411224d5e471f9956f">Post</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  nexts_[i]->WhenBound(<a class="code" href="namespaceoperations__research.html#a11f4a7dbafd8e00a36b892a82e44445f">MakeDelayedConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  <a class="code" href="classoperations__research_1_1_propagation_base_object.html#a5f32c22c620c811754ba7b6f977db864">solver</a>(), <span class="keyword">this</span>, &PathTransitPrecedenceConstraint::NextBound,</div>
|
|
<div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  <span class="stringliteral">"NextBound"</span>, i));</div>
|
|
<div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  }</div>
|
|
<div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < transits_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  transits_[i]->WhenRange(<a class="code" href="namespaceoperations__research.html#a11f4a7dbafd8e00a36b892a82e44445f">MakeDelayedConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  <a class="code" href="classoperations__research_1_1_propagation_base_object.html#a5f32c22c620c811754ba7b6f977db864">solver</a>(), <span class="keyword">this</span>, &PathTransitPrecedenceConstraint::NextBound,</div>
|
|
<div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  <span class="stringliteral">"TransitRange"</span>, i));</div>
|
|
<div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  }</div>
|
|
<div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  }</div>
|
|
<div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_constraint.html#a9100fab5545234f60a4ce442dbb45630">InitialPropagate</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  <span class="keywordflow">if</span> (nexts_[i]->Bound()) {</div>
|
|
<div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  NextBound(i);</div>
|
|
<div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  }</div>
|
|
<div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  }</div>
|
|
<div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  }</div>
|
|
<div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>  std::string <a class="code" href="classoperations__research_1_1_constraint.html#aed804747c45a7e1caf81461f9e45dd91">DebugString</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  std::string output = <span class="stringliteral">"PathPrecedence("</span>;</div>
|
|
<div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  std::vector<std::string> elements = {<a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(nexts_, <span class="stringliteral">","</span>)};</div>
|
|
<div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  <span class="keywordflow">if</span> (!transits_.empty()) {</div>
|
|
<div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  elements.push_back(<a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(transits_, <span class="stringliteral">","</span>));</div>
|
|
<div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  }</div>
|
|
<div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < predecessors_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> predecessor : predecessors_[i]) {</div>
|
|
<div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  elements.push_back(absl::StrCat(<span class="stringliteral">"("</span>, predecessor, <span class="stringliteral">", "</span>, i, <span class="stringliteral">")"</span>));</div>
|
|
<div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  }</div>
|
|
<div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  }</div>
|
|
<div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  output += absl::StrJoin(elements, <span class="stringliteral">","</span>) + <span class="stringliteral">")"</span>;</div>
|
|
<div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  <span class="keywordflow">return</span> output;</div>
|
|
<div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  }</div>
|
|
<div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_constraint.html#aac4aa5ecf086378b1bbac4b669bab4db">Accept</a>(ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  <span class="comment">// TODO(user): Implement.</span></div>
|
|
<div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  }</div>
|
|
<div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  </div>
|
|
<div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  <span class="keywordtype">void</span> NextBound(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  <span class="keywordflow">if</span> (!nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Bound()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->Min();</div>
|
|
<div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> start = starts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> end = (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> < nexts_.size()) ? ends_[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>] : <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  <span class="keywordflow">if</span> (end < nexts_.size()) starts_.SetValue(solver(), end, start);</div>
|
|
<div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  ends_.SetValue(<a class="code" href="classoperations__research_1_1_propagation_base_object.html#a5f32c22c620c811754ba7b6f977db864">solver</a>(), start, end);</div>
|
|
<div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  <span class="keywordtype">int</span> current = start;</div>
|
|
<div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  PrecedenceType type = ANY;</div>
|
|
<div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  <span class="keyword">auto</span> it = precedence_types_.find(start);</div>
|
|
<div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  <span class="keywordflow">if</span> (it != precedence_types_.end()) {</div>
|
|
<div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  type = it->second;</div>
|
|
<div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  }</div>
|
|
<div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  forbidden_.clear();</div>
|
|
<div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  marked_.clear();</div>
|
|
<div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  pushed_.clear();</div>
|
|
<div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  int64_t transit_cumul = 0;</div>
|
|
<div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> has_transits = !transits_.empty();</div>
|
|
<div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  <span class="keywordflow">while</span> (current < nexts_.size() && current != end) {</div>
|
|
<div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  transit_cumuls_[current] = transit_cumul;</div>
|
|
<div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  marked_.insert(current);</div>
|
|
<div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  <span class="comment">// If current has predecessors and we are in LIFO/FIFO mode.</span></div>
|
|
<div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  <span class="keywordflow">if</span> (!predecessors_[current].empty() && !pushed_.empty()) {</div>
|
|
<div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  <span class="keywordtype">bool</span> found = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  <span class="comment">// One of the predecessors must be at the top of the stack.</span></div>
|
|
<div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> predecessor : predecessors_[current]) {</div>
|
|
<div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  <span class="keywordflow">if</span> (pushed_.back() == predecessor) {</div>
|
|
<div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  found = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  }</div>
|
|
<div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  }</div>
|
|
<div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  <span class="keywordflow">if</span> (!found) <a class="code" href="classoperations__research_1_1_propagation_base_object.html#a5f32c22c620c811754ba7b6f977db864">solver</a>()-><a class="code" href="classoperations__research_1_1_solver.html#aeb92d4addb41255c9732cacfcb54f795">Fail</a>();</div>
|
|
<div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  pushed_.pop_back();</div>
|
|
<div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  }</div>
|
|
<div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  <span class="keywordflow">if</span> (forbidden_.find(current) != forbidden_.end()) {</div>
|
|
<div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> successor : successors_[current]) {</div>
|
|
<div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  <span class="keywordflow">if</span> (marked_.find(successor) != marked_.end()) {</div>
|
|
<div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  <span class="keywordflow">if</span> (!has_transits ||</div>
|
|
<div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(transit_cumul, transit_cumuls_[successor]) > 0) {</div>
|
|
<div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  <a class="code" href="classoperations__research_1_1_propagation_base_object.html#a5f32c22c620c811754ba7b6f977db864">solver</a>()-><a class="code" href="classoperations__research_1_1_solver.html#aeb92d4addb41255c9732cacfcb54f795">Fail</a>();</div>
|
|
<div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  }</div>
|
|
<div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  }</div>
|
|
<div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  }</div>
|
|
<div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  }</div>
|
|
<div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  <span class="keywordflow">if</span> (!successors_[current].empty()) {</div>
|
|
<div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  <span class="keywordflow">switch</span> (type) {</div>
|
|
<div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  <span class="keywordflow">case</span> LIFO:</div>
|
|
<div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  pushed_.push_back(current);</div>
|
|
<div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  <span class="keywordflow">case</span> FIFO:</div>
|
|
<div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>  pushed_.push_front(current);</div>
|
|
<div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  <span class="keywordflow">case</span> ANY:</div>
|
|
<div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  }</div>
|
|
<div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  }</div>
|
|
<div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> predecessor : predecessors_[current]) {</div>
|
|
<div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  forbidden_.insert(predecessor);</div>
|
|
<div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  }</div>
|
|
<div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  <span class="keywordflow">if</span> (has_transits) {</div>
|
|
<div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  transit_cumul = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(transit_cumul, transits_[current]->Min());</div>
|
|
<div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  }</div>
|
|
<div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  current = nexts_[current]->Min();</div>
|
|
<div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  }</div>
|
|
<div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  <span class="keywordflow">if</span> (forbidden_.find(current) != forbidden_.end()) {</div>
|
|
<div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> successor : successors_[current]) {</div>
|
|
<div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  <span class="keywordflow">if</span> (marked_.find(successor) != marked_.end()) {</div>
|
|
<div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>  <span class="keywordflow">if</span> (!has_transits ||</div>
|
|
<div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(transit_cumul, transit_cumuls_[successor]) > 0) {</div>
|
|
<div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  <a class="code" href="classoperations__research_1_1_propagation_base_object.html#a5f32c22c620c811754ba7b6f977db864">solver</a>()-><a class="code" href="classoperations__research_1_1_solver.html#aeb92d4addb41255c9732cacfcb54f795">Fail</a>();</div>
|
|
<div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  }</div>
|
|
<div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  }</div>
|
|
<div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  }</div>
|
|
<div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  }</div>
|
|
<div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  }</div>
|
|
<div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  </div>
|
|
<div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  <span class="keyword">const</span> std::vector<IntVar*> nexts_;</div>
|
|
<div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  <span class="keyword">const</span> std::vector<IntVar*> transits_;</div>
|
|
<div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  std::vector<std::vector<int>> predecessors_;</div>
|
|
<div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  std::vector<std::vector<int>> successors_;</div>
|
|
<div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  <span class="keyword">const</span> absl::flat_hash_map<int, PrecedenceType> precedence_types_;</div>
|
|
<div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  RevArray<int> starts_;</div>
|
|
<div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  RevArray<int> ends_;</div>
|
|
<div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>  absl::flat_hash_set<int> forbidden_;</div>
|
|
<div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  absl::flat_hash_set<int> marked_;</div>
|
|
<div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  std::deque<int> pushed_;</div>
|
|
<div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  std::vector<int64_t> transit_cumuls_;</div>
|
|
<div class="line"><a name="l01606"></a><span class="lineno"> 1606</span> };</div>
|
|
<div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>  </div>
|
|
<div class="line"><a name="l01608"></a><span class="lineno"> 1608</span> Constraint* MakePathTransitTypedPrecedenceConstraint(</div>
|
|
<div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  Solver* solver, std::vector<IntVar*> nexts, std::vector<IntVar*> transits,</div>
|
|
<div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  <span class="keyword">const</span> std::vector<std::pair<int, int>>& precedences,</div>
|
|
<div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  absl::flat_hash_map<int, PathTransitPrecedenceConstraint::PrecedenceType></div>
|
|
<div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  precedence_types) {</div>
|
|
<div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  <span class="keywordflow">if</span> (precedences.empty()) {</div>
|
|
<div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  <span class="keywordflow">return</span> solver->MakeTrueConstraint();</div>
|
|
<div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  }</div>
|
|
<div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  <span class="keywordflow">return</span> solver->RevAlloc(<span class="keyword">new</span> PathTransitPrecedenceConstraint(</div>
|
|
<div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  solver, std::move(nexts), std::move(transits), precedences,</div>
|
|
<div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  std::move(precedence_types)));</div>
|
|
<div class="line"><a name="l01619"></a><span class="lineno"> 1619</span> }</div>
|
|
<div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  </div>
|
|
<div class="line"><a name="l01621"></a><span class="lineno"> 1621</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  </div>
|
|
<div class="line"><a name="l01623"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#ae5119b2b21dac7cbfa3eea46b1103a9e"> 1623</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakePathPrecedenceConstraint(</div>
|
|
<div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>  std::vector<IntVar*> nexts,</div>
|
|
<div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  <span class="keyword">const</span> std::vector<std::pair<int, int>>& precedences) {</div>
|
|
<div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  <span class="keywordflow">return</span> MakePathTransitPrecedenceConstraint(std::move(nexts), {}, precedences);</div>
|
|
<div class="line"><a name="l01627"></a><span class="lineno"> 1627</span> }</div>
|
|
<div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  </div>
|
|
<div class="line"><a name="l01629"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#ae628366b4d1baa03c3129d7610e4dc55"> 1629</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakePathPrecedenceConstraint(</div>
|
|
<div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>  std::vector<IntVar*> nexts,</div>
|
|
<div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>  <span class="keyword">const</span> std::vector<std::pair<int, int>>& precedences,</div>
|
|
<div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  <span class="keyword">const</span> std::vector<int>& lifo_path_starts,</div>
|
|
<div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  <span class="keyword">const</span> std::vector<int>& fifo_path_starts) {</div>
|
|
<div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  absl::flat_hash_map<int, PathTransitPrecedenceConstraint::PrecedenceType></div>
|
|
<div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  precedence_types;</div>
|
|
<div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start : lifo_path_starts) {</div>
|
|
<div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  precedence_types[start] = PathTransitPrecedenceConstraint::LIFO;</div>
|
|
<div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  }</div>
|
|
<div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start : fifo_path_starts) {</div>
|
|
<div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  precedence_types[start] = PathTransitPrecedenceConstraint::FIFO;</div>
|
|
<div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  }</div>
|
|
<div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>  <span class="keywordflow">return</span> MakePathTransitTypedPrecedenceConstraint(</div>
|
|
<div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>  <span class="keyword">this</span>, std::move(nexts), {}, precedences, std::move(precedence_types));</div>
|
|
<div class="line"><a name="l01644"></a><span class="lineno"> 1644</span> }</div>
|
|
<div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  </div>
|
|
<div class="line"><a name="l01646"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#ac8b98f1f83afa9e3b5828dc2349e3837"> 1646</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* Solver::MakePathTransitPrecedenceConstraint(</div>
|
|
<div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  std::vector<IntVar*> nexts, std::vector<IntVar*> transits,</div>
|
|
<div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  <span class="keyword">const</span> std::vector<std::pair<int, int>>& precedences) {</div>
|
|
<div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  <span class="keywordflow">return</span> MakePathTransitTypedPrecedenceConstraint(</div>
|
|
<div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  <span class="keyword">this</span>, std::move(nexts), std::move(transits), precedences, {{}});</div>
|
|
<div class="line"><a name="l01651"></a><span class="lineno"> 1651</span> }</div>
|
|
<div class="line"><a name="l01652"></a><span class="lineno"> 1652</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00705">base/logging.h:705</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00709">base/logging.h:709</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_constraint_html"><div class="ttname"><a href="classoperations__research_1_1_constraint.html">operations_research::Constraint</a></div><div class="ttdoc">A constraint is the main modeling object.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03587">constraint_solver.h:3587</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_constraint_html_a9100fab5545234f60a4ce442dbb45630"><div class="ttname"><a href="classoperations__research_1_1_constraint.html#a9100fab5545234f60a4ce442dbb45630">operations_research::Constraint::InitialPropagate</a></div><div class="ttdeci">virtual void InitialPropagate()=0</div><div class="ttdoc">This method performs the initial propagation of the constraint.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_constraint_html_aac4aa5ecf086378b1bbac4b669bab4db"><div class="ttname"><a href="classoperations__research_1_1_constraint.html#aac4aa5ecf086378b1bbac4b669bab4db">operations_research::Constraint::Accept</a></div><div class="ttdeci">virtual void Accept(ModelVisitor *const visitor) const</div><div class="ttdoc">Accepts the given visitor.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l03254">constraint_solver.cc:3254</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_constraint_html_aed804747c45a7e1caf81461f9e45dd91"><div class="ttname"><a href="classoperations__research_1_1_constraint.html#aed804747c45a7e1caf81461f9e45dd91">operations_research::Constraint::DebugString</a></div><div class="ttdeci">std::string DebugString() const override</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l03244">constraint_solver.cc:3244</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_constraint_html_af33bad3aa81a2f411224d5e471f9956f"><div class="ttname"><a href="classoperations__research_1_1_constraint.html#af33bad3aa81a2f411224d5e471f9956f">operations_research::Constraint::Post</a></div><div class="ttdeci">virtual void Post()=0</div><div class="ttdoc">This method is called when the constraint is processed by the solver.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_a4a0c229a0e9dcf7122ebd68f501a6ef1"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a4a0c229a0e9dcf7122ebd68f501a6ef1">operations_research::ModelVisitor::kActiveArgument</a></div><div class="ttdeci">static const char kActiveArgument[]</div><div class="ttdoc">argument names:</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03437">constraint_solver.h:3437</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_a91247898d81dc2bca2833abef17f0816"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a91247898d81dc2bca2833abef17f0816">operations_research::ModelVisitor::kNextsArgument</a></div><div class="ttdeci">static const char kNextsArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03470">constraint_solver.h:3470</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_accbdf8149c4c29d3b64b43837d0bc3e1"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#accbdf8149c4c29d3b64b43837d0bc3e1">operations_research::ModelVisitor::kNoCycle</a></div><div class="ttdeci">static const char kNoCycle[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03391">constraint_solver.h:3391</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_numerical_rev_html_ac8beef1ef5cd6ce8bdfb3f48016ff72b"><div class="ttname"><a href="classoperations__research_1_1_numerical_rev.html#ac8beef1ef5cd6ce8bdfb3f48016ff72b">operations_research::NumericalRev::Incr</a></div><div class="ttdeci">void Incr(Solver *const s)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03769">constraint_solver.h:3769</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_propagation_base_object_html_a5f32c22c620c811754ba7b6f977db864"><div class="ttname"><a href="classoperations__research_1_1_propagation_base_object.html#a5f32c22c620c811754ba7b6f977db864">operations_research::PropagationBaseObject::solver</a></div><div class="ttdeci">Solver * solver() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03181">constraint_solver.h:3181</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_rev_html_affc0b3b0a5efa3efc9d0d86344d4a29f"><div class="ttname"><a href="classoperations__research_1_1_rev.html#affc0b3b0a5efa3efc9d0d86344d4a29f">operations_research::Rev::Value</a></div><div class="ttdeci">const T & Value() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03742">constraint_solver.h:3742</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html"><div class="ttname"><a href="classoperations__research_1_1_solver.html">operations_research::Solver</a></div><div class="ttdoc">Solver Class.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00243">constraint_solver.h:243</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a55d833360c375d45a3c503437de9841c"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a55d833360c375d45a3c503437de9841c">operations_research::Solver::IndexEvaluator2</a></div><div class="ttdeci">std::function< int64_t(int64_t, int64_t)> IndexEvaluator2</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00734">constraint_solver.h:734</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a6188d0df45262d3176058485c7f47995"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a6188d0df45262d3176058485c7f47995">operations_research::Solver::IndexFilter1</a></div><div class="ttdeci">std::function< bool(int64_t)> IndexFilter1</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00737">constraint_solver.h:737</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_aeb92d4addb41255c9732cacfcb54f795"><div class="ttname"><a href="classoperations__research_1_1_solver.html#aeb92d4addb41255c9732cacfcb54f795">operations_research::Solver::Fail</a></div><div class="ttdeci">void Fail()</div><div class="ttdoc">Abandon the current branch in the search tree. A backtrack will follow.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l02421">constraint_solver.cc:2421</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_af6a9149207c05695bc2e26a658461abd"><div class="ttname"><a href="constraint__solver_2table_8cc.html#af6a9149207c05695bc2e26a658461abd">iterators_</a></div><div class="ttdeci">std::vector< IntVarIterator * > iterators_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00229">constraint_solver/table.cc:229</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_8cc_html_a395f613555f398dd389670bb4c2a4599"><div class="ttname"><a href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a></div><div class="ttdeci">Block * next</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l00677">constraint_solver.cc:677</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_8h_html"><div class="ttname"><a href="constraint__solver_8h.html">constraint_solver.h</a></div></div>
|
|
<div class="ttc" id="aconstraint__solveri_8h_html"><div class="ttname"><a href="constraint__solveri_8h.html">constraint_solveri.h</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="agraph__constraints_8cc_html_ada20fc3a4c70c79d8b02df6b8c2413f5"><div class="ttname"><a href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a></div><div class="ttdeci">const std::vector< IntVar * > cumuls_</div><div class="ttdef"><b>Definition:</b> <a href="graph__constraints_8cc_source.html#l00671">graph_constraints.cc:671</a></div></div>
|
|
<div class="ttc" id="agraph__constraints_8cc_html_add322b0a7e2fd5300764079896a11bcb"><div class="ttname"><a href="graph__constraints_8cc.html#add322b0a7e2fd5300764079896a11bcb">prevs_</a></div><div class="ttdeci">RevArray< int > prevs_</div><div class="ttdef"><b>Definition:</b> <a href="graph__constraints_8cc_source.html#l00672">graph_constraints.cc:672</a></div></div>
|
|
<div class="ttc" id="agraph__constraints_8cc_html_adee0f668fb19c3cd4247a4fc74bca2d6"><div class="ttname"><a href="graph__constraints_8cc.html#adee0f668fb19c3cd4247a4fc74bca2d6">supports_</a></div><div class="ttdeci">std::vector< int > supports_</div><div class="ttdef"><b>Definition:</b> <a href="graph__constraints_8cc_source.html#l00673">graph_constraints.cc:673</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a111f44b9b9cf67a8e8d83794ac9f5291"><div class="ttname"><a href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">operations_research::CapAdd</a></div><div class="ttdeci">int64_t CapAdd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00126">saturated_arithmetic.h:126</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a11f4a7dbafd8e00a36b892a82e44445f"><div class="ttname"><a href="namespaceoperations__research.html#a11f4a7dbafd8e00a36b892a82e44445f">operations_research::MakeDelayedConstraintDemon1</a></div><div class="ttdeci">Demon * MakeDelayedConstraintDemon1(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#l00717">constraint_solveri.h:717</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a4a43d435871f16c321861fa5de32df82"><div class="ttname"><a href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">operations_research::CapSub</a></div><div class="ttdeci">int64_t CapSub(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00156">saturated_arithmetic.h:156</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a4fb750da00c784e5ffd1763fd3ce88f7"><div class="ttname"><a href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">operations_research::MakeConstraintDemon1</a></div><div class="ttdeci">Demon * MakeConstraintDemon1(Solver *const s, T *const ct, void(T::*method)(P), const std::string &name, P param1)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00559">constraint_solveri.h:559</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a82110ba1f45aa29ffc933102880dbd82"><div class="ttname"><a href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">operations_research::MakeDelayedConstraintDemon0</a></div><div class="ttdeci">Demon * MakeDelayedConstraintDemon0(Solver *const s, T *const ct, void(T::*method)(), const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00681">constraint_solveri.h:681</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a9be76edcbd5ccb982d92c8d90421a73c"><div class="ttname"><a href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">operations_research::JoinDebugStringPtr</a></div><div class="ttdeci">std::string JoinDebugStringPtr(const std::vector< T > &v, const std::string &separator)</div><div class="ttdef"><b>Definition:</b> <a href="string__array_8h_source.html#l00045">string_array.h:45</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
|
|
<div class="ttc" id="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
<div class="ttc" id="asearch_8cc_html_aea630e5fb2cf8a83bf43f5b43d187cda"><div class="ttname"><a href="search_8cc.html#aea630e5fb2cf8a83bf43f5b43d187cda">stamp_</a></div><div class="ttdeci">const int64_t stamp_</div><div class="ttdef"><b>Definition:</b> <a href="search_8cc_source.html#l03054">search.cc:3054</a></div></div>
|
|
<div class="ttc" id="astring__array_8h_html"><div class="ttname"><a href="string__array_8h.html">string_array.h</a></div></div>
|
|
</div><!-- 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="graph__constraints_8cc.html">graph_constraints.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|