1075 lines
194 KiB
HTML
1075 lines
194 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.3"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: sched_search.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.3</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('sched__search_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">sched_search.cc</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="sched__search_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" 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 id="l00003" 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 id="l00004" 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 id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" 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 id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" 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 id="l00009" 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 id="l00010" 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 id="l00011" 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 id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#include <cstring></span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span> </div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include "absl/strings/str_format.h"</span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</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 id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</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 id="l00024" name="l00024"></a><span class="lineno"> 24</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 id="l00025" name="l00025"></a><span class="lineno"> 25</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 id="l00026" name="l00026"></a><span class="lineno"> 26</span> </div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span>int64_t ValueToIndex(int64_t <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) { <span class="keywordflow">return</span> <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - 1; }</div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> </div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span>int64_t IndexToValue(int64_t <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) { <span class="keywordflow">return</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + 1; }</div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> </div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="comment">// ----- SequenceVar -----</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> </div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="comment">// TODO(user): Add better class invariants, in particular checks</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="comment">// that ranked_first, ranked_last, and unperformed are truly disjoint.</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> </div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#aed4c20c3765ff3cde39e5bd2915d3699"> 39</a></span><a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#aed4c20c3765ff3cde39e5bd2915d3699">SequenceVar::SequenceVar</a>(<a class="code hl_class" href="classoperations__research_1_1_solver.html">Solver</a>* <span class="keyword">const</span> s,</div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keyword">const</span> std::string& <a class="code hl_variable" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>)</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> : <a class="code hl_class" href="classoperations__research_1_1_propagation_base_object.html">PropagationBaseObject</a>(s),</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> intervals_(intervals),</div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> nexts_(nexts),</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> previous_(nexts.size() + 1, -1) {</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <a class="code hl_function" href="classoperations__research_1_1_propagation_base_object.html#ad5260b9627048b854b45d05ed34adc22">set_name</a>(<a class="code hl_function" href="classoperations__research_1_1_propagation_base_object.html#a1d89c28bd42ba9a52da008bb69367171">name</a>);</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span>}</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> </div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#a3a8465a1fa06dd401fa6924a492ce47b"> 50</a></span><a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#a3a8465a1fa06dd401fa6924a492ce47b">SequenceVar::~SequenceVar</a>() {}</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> </div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#a896e760e54eb350618d538c3c2f71ecc"> 52</a></span><a class="code hl_class" href="classoperations__research_1_1_interval_var.html">IntervalVar</a>* <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#a896e760e54eb350618d538c3c2f71ecc">SequenceVar::Interval</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="keywordflow">return</span> intervals_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span>}</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> </div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#a78865614535cb831319b955f6106bcaa"> 56</a></span><a class="code hl_class" href="classoperations__research_1_1_int_var.html">IntVar</a>* <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#a78865614535cb831319b955f6106bcaa">SequenceVar::Next</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> nexts_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]; }</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> </div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#aed804747c45a7e1caf81461f9e45dd91"> 58</a></span>std::string <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#aed804747c45a7e1caf81461f9e45dd91">SequenceVar::DebugString</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> int64_t hmin, hmax, dmin, dmax;</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#a157c0f2f0636c4de7bded81fe83c6cec">HorizonRange</a>(&hmin, &hmax);</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#a38e9cb6169470555a7403c5102030294">DurationRange</a>(&dmin, &dmax);</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordtype">int</span> unperformed = 0;</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordtype">int</span> ranked = 0;</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordtype">int</span> not_ranked = 0;</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#a31d0bb3a9647ebb39d997f77a1eff435">ComputeStatistics</a>(&ranked, &not_ranked, &unperformed);</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">return</span> absl::StrFormat(</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="stringliteral">"%s(horizon = %d..%d, duration = %d..%d, not ranked = %d, ranked = %d, "</span></div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="stringliteral">"nexts = [%s])"</span>,</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <a class="code hl_function" href="classoperations__research_1_1_propagation_base_object.html#a1d89c28bd42ba9a52da008bb69367171">name</a>(), hmin, hmax, dmin, dmax, not_ranked, ranked,</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <a class="code hl_function" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(nexts_, <span class="stringliteral">", "</span>));</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span>}</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> </div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#aac4aa5ecf086378b1bbac4b669bab4db"> 73</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#aac4aa5ecf086378b1bbac4b669bab4db">SequenceVar::Accept</a>(<a class="code hl_class" href="classoperations__research_1_1_model_visitor.html">ModelVisitor</a>* <span class="keyword">const</span> visitor)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> visitor-><a class="code hl_function" href="classoperations__research_1_1_model_visitor.html#a24b1621742f94760c45e305c6fbba6bd">VisitSequenceVariable</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span>}</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> </div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#a38e9cb6169470555a7403c5102030294"> 77</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#a38e9cb6169470555a7403c5102030294">SequenceVar::DurationRange</a>(int64_t* <span class="keyword">const</span> dmin,</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> int64_t* <span class="keyword">const</span> dmax)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> int64_t dur_min = 0;</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> int64_t dur_max = 0;</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals_.size(); ++i) {</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <a class="code hl_class" href="classoperations__research_1_1_interval_var.html">IntervalVar</a>* <span class="keyword">const</span> t = intervals_[i];</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordflow">if</span> (t-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#af341bdc63fc2e487a50047afa36a536b">MayBePerformed</a>()) {</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">if</span> (t-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#a7f7f661e9b94f25f706732924e0f01e9">MustBePerformed</a>()) {</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> dur_min += t-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#a4488d66b163b204a15eadeafcf4872f8">DurationMin</a>();</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> }</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> dur_max += t-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#a2e69397c7c1e71a796afa6a632ee8296">DurationMax</a>();</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> *dmin = dur_min;</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> *dmax = dur_max;</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span>}</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> </div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#a157c0f2f0636c4de7bded81fe83c6cec"> 94</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#a157c0f2f0636c4de7bded81fe83c6cec">SequenceVar::HorizonRange</a>(int64_t* <span class="keyword">const</span> hmin, int64_t* <span class="keyword">const</span> hmax)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> int64_t hor_min = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> int64_t hor_max = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals_.size(); ++i) {</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <a class="code hl_class" href="classoperations__research_1_1_interval_var.html">IntervalVar</a>* <span class="keyword">const</span> t = intervals_[i];</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">if</span> (t-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#af341bdc63fc2e487a50047afa36a536b">MayBePerformed</a>()) {</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <a class="code hl_class" href="classoperations__research_1_1_interval_var.html">IntervalVar</a>* <span class="keyword">const</span> t = intervals_[i];</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> hor_min = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(hor_min, t-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#aa93a06dc97f33ccaefc7df90fb9b89d1">StartMin</a>());</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> hor_max = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(hor_max, t-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#ae05142dd885524b06032bed1cbc63af0">EndMax</a>());</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> }</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> }</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> *hmin = hor_min;</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> *hmax = hor_max;</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span>}</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> </div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#a757086e12f4615673721fd77ca49da7b"> 109</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#a757086e12f4615673721fd77ca49da7b">SequenceVar::ActiveHorizonRange</a>(int64_t* <span class="keyword">const</span> hmin,</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> int64_t* <span class="keyword">const</span> hmax)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> absl::flat_hash_set<int> decided;</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals_.size(); ++i) {</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keywordflow">if</span> (intervals_[i]->CannotBePerformed()) {</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> decided.insert(i);</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> }</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> }</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordtype">int</span> first = 0;</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keywordflow">while</span> (nexts_[first]->Bound()) {</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> first = nexts_[first]->Min();</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="keywordflow">if</span> (first < nexts_.size()) {</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> decided.insert(ValueToIndex(first));</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> }</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> }</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordflow">if</span> (first != nexts_.size()) {</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> UpdatePrevious();</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="keywordtype">int</span> last = nexts_.size();</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keywordflow">while</span> (previous_[last] != -1) {</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> last = previous_[last];</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> decided.insert(ValueToIndex(last));</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> }</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> }</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> int64_t hor_min = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> int64_t hor_max = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals_.size(); ++i) {</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keywordflow">if</span> (!decided.contains(i)) {</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <a class="code hl_class" href="classoperations__research_1_1_interval_var.html">IntervalVar</a>* <span class="keyword">const</span> t = intervals_[i];</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> hor_min = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(hor_min, t-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#aa93a06dc97f33ccaefc7df90fb9b89d1">StartMin</a>());</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> hor_max = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(hor_max, t-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#ae05142dd885524b06032bed1cbc63af0">EndMax</a>());</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> }</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> }</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> *hmin = hor_min;</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> *hmax = hor_max;</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span>}</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> </div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#a31d0bb3a9647ebb39d997f77a1eff435"> 147</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#a31d0bb3a9647ebb39d997f77a1eff435">SequenceVar::ComputeStatistics</a>(<span class="keywordtype">int</span>* <span class="keyword">const</span> ranked, <span class="keywordtype">int</span>* <span class="keyword">const</span> not_ranked,</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="keywordtype">int</span>* <span class="keyword">const</span> unperformed)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> *unperformed = 0;</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals_.size(); ++i) {</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="keywordflow">if</span> (intervals_[i]->CannotBePerformed()) {</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> (*unperformed)++;</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> }</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> }</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> *ranked = 0;</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="keywordtype">int</span> first = 0;</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="keywordflow">while</span> (first < nexts_.size() && nexts_[first]->Bound()) {</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> first = nexts_[first]->Min();</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> (*ranked)++;</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> }</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keywordflow">if</span> (first != nexts_.size()) {</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> UpdatePrevious();</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keywordtype">int</span> last = nexts_.size();</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="keywordflow">while</span> (previous_[last] != -1) {</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> last = previous_[last];</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> (*ranked)++;</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> }</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> } <span class="keywordflow">else</span> { <span class="comment">// We counted the sentinel.</span></div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> (*ranked)--;</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> }</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> *not_ranked = intervals_.size() - *ranked - *unperformed;</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span>}</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> </div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span><span class="keywordtype">int</span> SequenceVar::ComputeForwardFrontier() {</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="keywordtype">int</span> first = 0;</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="keywordflow">while</span> (first != nexts_.size() && nexts_[first]->Bound()) {</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> first = nexts_[first]->Min();</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> }</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="keywordflow">return</span> first;</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span>}</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> </div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span><span class="keywordtype">int</span> SequenceVar::ComputeBackwardFrontier() {</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> UpdatePrevious();</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="keywordtype">int</span> last = nexts_.size();</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="keywordflow">while</span> (previous_[last] != -1) {</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> last = previous_[last];</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> }</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="keywordflow">return</span> last;</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span>}</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> </div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#a01635a3b908310e048be6c6b85366bb8"> 191</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#a01635a3b908310e048be6c6b85366bb8">SequenceVar::ComputePossibleFirstsAndLasts</a>(</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> std::vector<int>* <span class="keyword">const</span> possible_firsts,</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> std::vector<int>* <span class="keyword">const</span> possible_lasts) {</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> possible_firsts->clear();</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> possible_lasts->clear();</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> absl::flat_hash_set<int> to_check;</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals_.size(); ++i) {</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="keywordflow">if</span> (intervals_[i]->MayBePerformed()) {</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> to_check.insert(i);</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> }</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> }</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="keywordtype">int</span> first = 0;</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="keywordflow">while</span> (nexts_[first]->Bound()) {</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> first = nexts_[first]->Min();</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="keywordflow">if</span> (first == nexts_.size()) {</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> }</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> to_check.erase(ValueToIndex(first));</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> }</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> </div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <a class="code hl_class" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> forward_var = nexts_[first];</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> std::vector<int> candidates;</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> int64_t smallest_start_max = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="keywordtype">int</span> ssm_support = -1;</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="keywordflow">for</span> (int64_t i = forward_var-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">Min</a>(); i <= forward_var->Max(); ++i) {</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="comment">// TODO(user): use domain iterator.</span></div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="keywordflow">if</span> (i != 0 && i < IndexToValue(intervals_.size()) &&</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> intervals_[ValueToIndex(i)]->MayBePerformed() &&</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> forward_var-><a class="code hl_function" href="classoperations__research_1_1_int_var.html#a0723abf37f7a5a8a604fd1bcd96a7be0">Contains</a>(i)) {</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="keyword">const</span> <span class="keywordtype">int</span> candidate = ValueToIndex(i);</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> candidates.push_back(candidate);</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="keywordflow">if</span> (intervals_[candidate]->MustBePerformed()) {</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="keywordflow">if</span> (smallest_start_max > intervals_[candidate]->StartMax()) {</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> smallest_start_max = intervals_[candidate]->StartMax();</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> ssm_support = candidate;</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> }</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> }</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> }</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> }</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < candidates.size(); ++i) {</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="keyword">const</span> <span class="keywordtype">int</span> candidate = candidates[i];</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="keywordflow">if</span> (candidate == ssm_support ||</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> intervals_[candidate]->EndMin() <= smallest_start_max) {</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> possible_firsts->push_back(candidate);</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> }</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> }</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> </div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> UpdatePrevious();</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="keywordtype">int</span> last = nexts_.size();</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="keywordflow">while</span> (previous_[last] != -1) {</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> last = previous_[last];</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> to_check.erase(ValueToIndex(last));</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> }</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> </div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> candidates.clear();</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> int64_t biggest_end_min = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="keywordtype">int</span> bem_support = -1;</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> candidate : to_check) {</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="keywordflow">if</span> (nexts_[IndexToValue(candidate)]->Contains(last)) {</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> candidates.push_back(candidate);</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="keywordflow">if</span> (intervals_[candidate]->MustBePerformed()) {</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> <span class="keywordflow">if</span> (biggest_end_min < intervals_[candidate]->EndMin()) {</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> biggest_end_min = intervals_[candidate]->EndMin();</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> bem_support = candidate;</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> }</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> }</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> }</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> }</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> </div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < candidates.size(); ++i) {</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <span class="keyword">const</span> <span class="keywordtype">int</span> candidate = candidates[i];</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> <span class="keywordflow">if</span> (candidate == bem_support ||</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> intervals_[candidate]->StartMax() >= biggest_end_min) {</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> possible_lasts->push_back(candidate);</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> }</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> }</div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span>}</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> </div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#a2c3cdf1887a496fe0fdd4b5abe5c33f5"> 269</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#a2c3cdf1887a496fe0fdd4b5abe5c33f5">SequenceVar::RankSequence</a>(<span class="keyword">const</span> std::vector<int>& rank_first,</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> <span class="keyword">const</span> std::vector<int>& rank_last,</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="keyword">const</span> std::vector<int>& unperformed) {</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <a class="code hl_function" href="classoperations__research_1_1_propagation_base_object.html#a0b526d33739114e9255ffbe8343efe1a">solver</a>()-><a class="code hl_function" href="classoperations__research_1_1_solver.html#a92271ad8e09cd801f83ae84e6af5f609">GetPropagationMonitor</a>()-><a class="code hl_function" href="classoperations__research_1_1_propagation_monitor.html#a6e8312c7b6a02f813e345b99f98a8458">RankSequence</a>(<span class="keyword">this</span>, rank_first, rank_last,</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> unperformed);</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <span class="comment">// Mark unperformed.</span></div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : unperformed) {</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> intervals_[<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>]->SetPerformed(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> }</div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="comment">// Forward.</span></div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="keywordtype">int</span> forward = 0;</div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < rank_first.size(); ++i) {</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = 1 + rank_first[i];</div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> nexts_[forward]->SetValue(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> forward = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> }</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="comment">// Backward.</span></div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="keywordtype">int</span> backward = IndexToValue(intervals_.size());</div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < rank_last.size(); ++i) {</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = 1 + rank_last[i];</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> nexts_[<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>]->SetValue(backward);</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> backward = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> }</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span>}</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> </div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#ab8618d2458a778c7ee4326b41bd2de7e"> 294</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#ab8618d2458a778c7ee4326b41bd2de7e">SequenceVar::RankFirst</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <a class="code hl_function" href="classoperations__research_1_1_propagation_base_object.html#a0b526d33739114e9255ffbe8343efe1a">solver</a>()-><a class="code hl_function" href="classoperations__research_1_1_solver.html#a92271ad8e09cd801f83ae84e6af5f609">GetPropagationMonitor</a>()-><a class="code hl_function" href="classoperations__research_1_1_propagation_monitor.html#af5aaffbf16ee150934ca1d7feddffdf7">RankFirst</a>(<span class="keyword">this</span>, <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> intervals_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->SetPerformed(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="keywordtype">int</span> forward_frontier = 0;</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="keywordflow">while</span> (forward_frontier != nexts_.size() &&</div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> nexts_[forward_frontier]->Bound()) {</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> forward_frontier = nexts_[forward_frontier]->Min();</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <span class="keywordflow">if</span> (forward_frontier == IndexToValue(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> }</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> }</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(forward_frontier, nexts_.size());</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> nexts_[forward_frontier]->SetValue(IndexToValue(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>));</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span>}</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> </div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#aec7dac2fca35046761c8d47af724c091"> 309</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#aec7dac2fca35046761c8d47af724c091">SequenceVar::RankNotFirst</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> <a class="code hl_function" href="classoperations__research_1_1_propagation_base_object.html#a0b526d33739114e9255ffbe8343efe1a">solver</a>()-><a class="code hl_function" href="classoperations__research_1_1_solver.html#a92271ad8e09cd801f83ae84e6af5f609">GetPropagationMonitor</a>()-><a class="code hl_function" href="classoperations__research_1_1_propagation_monitor.html#a670d62cb4741bc10b2332a8a67fd3f5a">RankNotFirst</a>(<span class="keyword">this</span>, <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="keyword">const</span> <span class="keywordtype">int</span> forward_frontier = ComputeForwardFrontier();</div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="keywordflow">if</span> (forward_frontier < nexts_.size()) {</div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> nexts_[forward_frontier]->RemoveValue(IndexToValue(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>));</div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> }</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span>}</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> </div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#aaa902cac039701edcdaf15661fbed327"> 317</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#aaa902cac039701edcdaf15661fbed327">SequenceVar::RankLast</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> <a class="code hl_function" href="classoperations__research_1_1_propagation_base_object.html#a0b526d33739114e9255ffbe8343efe1a">solver</a>()-><a class="code hl_function" href="classoperations__research_1_1_solver.html#a92271ad8e09cd801f83ae84e6af5f609">GetPropagationMonitor</a>()-><a class="code hl_function" href="classoperations__research_1_1_propagation_monitor.html#a133d6644c8ea52f45e657b4c268e0cbf">RankLast</a>(<span class="keyword">this</span>, <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> intervals_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->SetPerformed(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> UpdatePrevious();</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> <span class="keywordtype">int</span> backward_frontier = nexts_.size();</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> <span class="keywordflow">while</span> (previous_[backward_frontier] != -1) {</div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> backward_frontier = previous_[backward_frontier];</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> <span class="keywordflow">if</span> (backward_frontier == IndexToValue(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> }</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> }</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(backward_frontier, 0);</div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> nexts_[IndexToValue(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)]->SetValue(backward_frontier);</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span>}</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> </div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#ad2fcd811f566cf9677c886576515f032"> 332</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#ad2fcd811f566cf9677c886576515f032">SequenceVar::RankNotLast</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> <a class="code hl_function" href="classoperations__research_1_1_propagation_base_object.html#a0b526d33739114e9255ffbe8343efe1a">solver</a>()-><a class="code hl_function" href="classoperations__research_1_1_solver.html#a92271ad8e09cd801f83ae84e6af5f609">GetPropagationMonitor</a>()-><a class="code hl_function" href="classoperations__research_1_1_propagation_monitor.html#a6467f671a40283eed2a71c51741d93b8">RankNotLast</a>(<span class="keyword">this</span>, <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> <span class="keyword">const</span> <span class="keywordtype">int</span> backward_frontier = ComputeBackwardFrontier();</div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> nexts_[IndexToValue(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)]->RemoveValue(backward_frontier);</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span>}</div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> </div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span><span class="keywordtype">void</span> SequenceVar::UpdatePrevious()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals_.size() + 2; ++i) {</div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> previous_[i] = -1;</div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> }</div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_.size(); ++i) {</div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <span class="keywordflow">if</span> (nexts_[i]->Bound()) {</div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> previous_[nexts_[i]->Min()] = i;</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> }</div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> }</div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span>}</div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> </div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequence_var.html#a19499c160356f9655862f3037315d87d"> 349</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sequence_var.html#a19499c160356f9655862f3037315d87d">SequenceVar::FillSequence</a>(std::vector<int>* <span class="keyword">const</span> rank_first,</div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> std::vector<int>* <span class="keyword">const</span> rank_last,</div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> std::vector<int>* <span class="keyword">const</span> unperformed)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(rank_first != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(rank_last != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(unperformed != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> rank_first->clear();</div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> rank_last->clear();</div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> unperformed->clear();</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals_.size(); ++i) {</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> <span class="keywordflow">if</span> (intervals_[i]->CannotBePerformed()) {</div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> unperformed->push_back(i);</div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> }</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> }</div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> <span class="keywordtype">int</span> first = 0;</div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> <span class="keywordflow">while</span> (nexts_[first]->Bound()) {</div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> first = nexts_[first]->Min();</div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> <span class="keywordflow">if</span> (first < nexts_.size()) {</div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> rank_first->push_back(ValueToIndex(first));</div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> }</div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> }</div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> <span class="keywordflow">if</span> (first != nexts_.size()) {</div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> UpdatePrevious();</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> <span class="keywordtype">int</span> last = nexts_.size();</div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> <span class="keywordflow">while</span> (previous_[last] != -1) {</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> last = previous_[last];</div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> rank_last->push_back(ValueToIndex(last));</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> }</div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> }</div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span>}</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> </div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span><span class="comment">// ----- Decisions and DecisionBuilders on interval vars -----</span></div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> </div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span><span class="comment">// TODO(user) : treat optional intervals</span></div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span><span class="comment">// TODO(user) : Call DecisionVisitor and pass name of variable</span></div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span><span class="comment">// Forward scheduling.</span></div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span><span class="keyword">class </span>ScheduleOrPostpone : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_decision.html">Decision</a> {</div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> ScheduleOrPostpone(<a class="code hl_class" href="classoperations__research_1_1_interval_var.html">IntervalVar</a>* <span class="keyword">const</span> <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, int64_t est, int64_t* <span class="keyword">const</span> marker)</div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> : var_(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>), est_(est), marker_(marker) {}</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> ~ScheduleOrPostpone()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> </div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> <span class="keywordtype">void</span> Apply(Solver* <span class="keyword">const</span> s)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> var_->SetPerformed(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> <span class="keywordflow">if</span> (est_.Value() < var_->StartMin()) {</div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> est_.SetValue(s, var_->StartMin());</div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> }</div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> var_->SetStartRange(est_.Value(), est_.Value());</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> }</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> </div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> <span class="keywordtype">void</span> Refute(Solver* <span class="keyword">const</span> s)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> s->SaveAndSetValue(marker_, est_.Value());</div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> }</div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> </div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> <span class="keywordtype">void</span> Accept(DecisionVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(visitor != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> visitor->VisitScheduleOrPostpone(var_, est_.Value());</div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> }</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> </div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"ScheduleOrPostpone(%s at %d)"</span>, var_->DebugString(),</div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> est_.Value());</div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> }</div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> </div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> IntervalVar* <span class="keyword">const</span> var_;</div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> NumericalRev<int64_t> est_;</div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> int64_t* <span class="keyword">const</span> marker_;</div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span>};</div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> </div>
|
|
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span><span class="keyword">class </span>SetTimesForward : <span class="keyword">public</span> DecisionBuilder {</div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> <span class="keyword">explicit</span> SetTimesForward(<span class="keyword">const</span> std::vector<IntervalVar*>& vars)</div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> : <a class="code hl_variable" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> markers_(vars.size(), <a class="code hl_namespace" href="namespacestd.html">std</a>::numeric_limits<int64_t>::<a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a>()) {}</div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> </div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> ~SetTimesForward()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> </div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> Decision* Next(Solver* <span class="keyword">const</span> s)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> int64_t best_est = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> int64_t best_lct = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> <span class="keywordtype">int</span> support = -1;</div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> <span class="comment">// We are looking for the interval that has the smallest start min</span></div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> <span class="comment">// (tie break with smallest end max) and is not postponed. And</span></div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> <span class="comment">// you're going to schedule that interval at its start min.</span></div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code hl_variable" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> IntervalVar* <span class="keyword">const</span> v = <a class="code hl_variable" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i];</div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> <span class="keywordflow">if</span> (v->MayBePerformed() && v->StartMax() != v->StartMin() &&</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> !IsPostponed(i) &&</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> (v->StartMin() < best_est ||</div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> (v->StartMin() == best_est && v->EndMax() < best_lct))) {</div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> best_est = v->StartMin();</div>
|
|
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> best_lct = v->EndMax();</div>
|
|
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> support = i;</div>
|
|
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> }</div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> }</div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> <span class="comment">// TODO(user) : remove this crude quadratic loop with</span></div>
|
|
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> <span class="comment">// reversibles range reduction.</span></div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> <span class="keywordflow">if</span> (support == -1) { <span class="comment">// All intervals are either fixed or postponed.</span></div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> UnperformPostponedTaskBefore(<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> }</div>
|
|
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> UnperformPostponedTaskBefore(best_est);</div>
|
|
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> <span class="keywordflow">return</span> s->RevAlloc(</div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> <span class="keyword">new</span> ScheduleOrPostpone(vars_[support], best_est, &markers_[support]));</div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> }</div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> </div>
|
|
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> std::string DebugString()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"SetTimesForward()"</span>; }</div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> </div>
|
|
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</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 id="l00464" name="l00464"></a><span class="lineno"> 464</span> visitor->BeginVisitExtension(<a class="code hl_variable" href="classoperations__research_1_1_model_visitor.html#ab2689eae50e311de930f43660cd27034">ModelVisitor::kVariableGroupExtension</a>);</div>
|
|
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> visitor->VisitIntervalArrayArgument(<a class="code hl_variable" href="classoperations__research_1_1_model_visitor.html#a671ece39b478a03a0c0e45a0e81cc0c7">ModelVisitor::kIntervalsArgument</a>,</div>
|
|
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> vars_);</div>
|
|
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> visitor->EndVisitExtension(<a class="code hl_variable" href="classoperations__research_1_1_model_visitor.html#ab2689eae50e311de930f43660cd27034">ModelVisitor::kVariableGroupExtension</a>);</div>
|
|
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> }</div>
|
|
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> </div>
|
|
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> <span class="keywordtype">bool</span> IsPostponed(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(vars_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->MayBePerformed());</div>
|
|
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->StartMin() <= markers_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> }</div>
|
|
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> </div>
|
|
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> <span class="keywordtype">void</span> UnperformPostponedTaskBefore(int64_t date) {</div>
|
|
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code hl_variable" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> IntervalVar* <span class="keyword">const</span> v = <a class="code hl_variable" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i];</div>
|
|
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> <span class="keywordflow">if</span> (v->MayBePerformed() && v->StartMin() != v->StartMax() &&</div>
|
|
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> IsPostponed(i) &&</div>
|
|
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> <span class="comment">// There are two rules here:</span></div>
|
|
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> <span class="comment">// - v->StartMax() <= date: the interval should have been scheduled</span></div>
|
|
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> <span class="comment">// as it cannot be scheduled later (assignment is chronological).</span></div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> <span class="comment">// - v->EndMin() <= date: The interval can fit before the current</span></div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> <span class="comment">// start date. In that case, it 'should' always fit, and as it has</span></div>
|
|
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> <span class="comment">// not be scheduled, then we are missing it. So, as a dominance</span></div>
|
|
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> <span class="comment">// rule, it should be marked as unperformed.</span></div>
|
|
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> (v->EndMin() <= date || v->StartMax() <= date)) {</div>
|
|
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> v->SetPerformed(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> }</div>
|
|
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> }</div>
|
|
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> }</div>
|
|
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> </div>
|
|
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> <span class="keyword">const</span> std::vector<IntervalVar*> <a class="code hl_variable" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div>
|
|
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> std::vector<int64_t> markers_;</div>
|
|
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span>};</div>
|
|
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> </div>
|
|
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span><span class="comment">// Backward scheduling.</span></div>
|
|
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span><span class="keyword">class </span>ScheduleOrExpedite : <span class="keyword">public</span> Decision {</div>
|
|
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span> ScheduleOrExpedite(IntervalVar* <span class="keyword">const</span> <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, int64_t est, int64_t* <span class="keyword">const</span> marker)</div>
|
|
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> : var_(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>), est_(est), marker_(marker) {}</div>
|
|
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> ~ScheduleOrExpedite()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> </div>
|
|
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> <span class="keywordtype">void</span> Apply(Solver* <span class="keyword">const</span> s)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> var_->SetPerformed(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> <span class="keywordflow">if</span> (est_.Value() > var_->EndMax()) {</div>
|
|
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> est_.SetValue(s, var_->EndMax());</div>
|
|
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> }</div>
|
|
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> var_->SetEndRange(est_.Value(), est_.Value());</div>
|
|
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> }</div>
|
|
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> </div>
|
|
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> <span class="keywordtype">void</span> Refute(Solver* <span class="keyword">const</span> s)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> s->SaveAndSetValue(marker_, est_.Value() - 1);</div>
|
|
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> }</div>
|
|
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> </div>
|
|
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> <span class="keywordtype">void</span> Accept(DecisionVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(visitor != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> visitor->VisitScheduleOrExpedite(var_, est_.Value());</div>
|
|
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> }</div>
|
|
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> </div>
|
|
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"ScheduleOrExpedite(%s at %d)"</span>, var_->DebugString(),</div>
|
|
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> est_.Value());</div>
|
|
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> }</div>
|
|
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> </div>
|
|
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> IntervalVar* <span class="keyword">const</span> var_;</div>
|
|
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> NumericalRev<int64_t> est_;</div>
|
|
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> int64_t* <span class="keyword">const</span> marker_;</div>
|
|
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span>};</div>
|
|
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> </div>
|
|
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"> 535</span><span class="keyword">class </span>SetTimesBackward : <span class="keyword">public</span> DecisionBuilder {</div>
|
|
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> <span class="keyword">explicit</span> SetTimesBackward(<span class="keyword">const</span> std::vector<IntervalVar*>& vars)</div>
|
|
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> : <a class="code hl_variable" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div>
|
|
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> markers_(vars.size(), <a class="code hl_namespace" href="namespacestd.html">std</a>::numeric_limits<int64_t>::<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a>()) {}</div>
|
|
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> </div>
|
|
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> ~SetTimesBackward()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> </div>
|
|
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> Decision* Next(Solver* <span class="keyword">const</span> s)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> int64_t best_end = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> int64_t best_start = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> <span class="keywordtype">int</span> support = -1;</div>
|
|
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> <span class="keywordtype">int</span> refuted = 0;</div>
|
|
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code hl_variable" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(); ++i) {</div>
|
|
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> IntervalVar* <span class="keyword">const</span> v = <a class="code hl_variable" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i];</div>
|
|
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> <span class="keywordflow">if</span> (v->MayBePerformed() && v->EndMax() > v->EndMin()) {</div>
|
|
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> <span class="keywordflow">if</span> (v->EndMax() <= markers_[i] &&</div>
|
|
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> (v->EndMax() > best_end ||</div>
|
|
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> (v->EndMax() == best_end && v->StartMin() > best_start))) {</div>
|
|
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span> best_end = v->EndMax();</div>
|
|
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> best_start = v->StartMin();</div>
|
|
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> support = i;</div>
|
|
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> refuted++;</div>
|
|
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> }</div>
|
|
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span> }</div>
|
|
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> }</div>
|
|
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span> <span class="comment">// TODO(user) : remove this crude quadratic loop with</span></div>
|
|
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> <span class="comment">// reversibles range reduction.</span></div>
|
|
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span> <span class="keywordflow">if</span> (support == -1) {</div>
|
|
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> <span class="keywordflow">if</span> (refuted == 0) {</div>
|
|
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span> s->Fail();</div>
|
|
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> }</div>
|
|
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> }</div>
|
|
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> <span class="keywordflow">return</span> s->RevAlloc(<span class="keyword">new</span> ScheduleOrExpedite(</div>
|
|
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> vars_[support], vars_[support]->EndMax(), &markers_[support]));</div>
|
|
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno"> 573</span> }</div>
|
|
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno"> 574</span> </div>
|
|
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> std::string DebugString()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"SetTimesBackward()"</span>; }</div>
|
|
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> </div>
|
|
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</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 id="l00578" name="l00578"></a><span class="lineno"> 578</span> visitor->BeginVisitExtension(<a class="code hl_variable" href="classoperations__research_1_1_model_visitor.html#ab2689eae50e311de930f43660cd27034">ModelVisitor::kVariableGroupExtension</a>);</div>
|
|
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> visitor->VisitIntervalArrayArgument(<a class="code hl_variable" href="classoperations__research_1_1_model_visitor.html#a671ece39b478a03a0c0e45a0e81cc0c7">ModelVisitor::kIntervalsArgument</a>,</div>
|
|
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</span> vars_);</div>
|
|
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno"> 581</span> visitor->EndVisitExtension(<a class="code hl_variable" href="classoperations__research_1_1_model_visitor.html#ab2689eae50e311de930f43660cd27034">ModelVisitor::kVariableGroupExtension</a>);</div>
|
|
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span> }</div>
|
|
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span> </div>
|
|
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno"> 584</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"> 585</span> <span class="keyword">const</span> std::vector<IntervalVar*> <a class="code hl_variable" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div>
|
|
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno"> 586</span> std::vector<int64_t> markers_;</div>
|
|
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"> 587</span>};</div>
|
|
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"> 588</span> </div>
|
|
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span><span class="comment">// ----- Decisions and DecisionBuilders on sequences -----</span></div>
|
|
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> </div>
|
|
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span><span class="keyword">class </span>RankFirst : <span class="keyword">public</span> Decision {</div>
|
|
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> RankFirst(SequenceVar* <span class="keyword">const</span> seq, <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)</div>
|
|
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> : sequence_(seq), index_(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {}</div>
|
|
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> ~RankFirst()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> </div>
|
|
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span> <span class="keywordtype">void</span> Apply(Solver* <span class="keyword">const</span> s)<span class="keyword"> override </span>{ sequence_->RankFirst(index_); }</div>
|
|
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> </div>
|
|
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</span> <span class="keywordtype">void</span> Refute(Solver* <span class="keyword">const</span> s)<span class="keyword"> override </span>{ sequence_->RankNotFirst(index_); }</div>
|
|
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> </div>
|
|
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> <span class="keywordtype">void</span> Accept(DecisionVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(visitor != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> visitor->VisitRankFirstInterval(sequence_, index_);</div>
|
|
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"> 604</span> }</div>
|
|
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"> 605</span> </div>
|
|
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span> <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"RankFirst(%s, %d)"</span>, sequence_->DebugString(),</div>
|
|
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> index_);</div>
|
|
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"> 609</span> }</div>
|
|
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> </div>
|
|
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno"> 611</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno"> 612</span> SequenceVar* <span class="keyword">const</span> sequence_;</div>
|
|
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> <span class="keyword">const</span> <span class="keywordtype">int</span> index_;</div>
|
|
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span>};</div>
|
|
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> </div>
|
|
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span><span class="keyword">class </span>RankLast : <span class="keyword">public</span> Decision {</div>
|
|
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</span> RankLast(SequenceVar* <span class="keyword">const</span> seq, <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) : sequence_(seq), index_(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {}</div>
|
|
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno"> 619</span> ~RankLast()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span> </div>
|
|
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> <span class="keywordtype">void</span> Apply(Solver* <span class="keyword">const</span> s)<span class="keyword"> override </span>{ sequence_->RankLast(index_); }</div>
|
|
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> </div>
|
|
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> <span class="keywordtype">void</span> Refute(Solver* <span class="keyword">const</span> s)<span class="keyword"> override </span>{ sequence_->RankNotLast(index_); }</div>
|
|
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span> </div>
|
|
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span> <span class="keywordtype">void</span> Accept(DecisionVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"> 626</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(visitor != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> visitor->VisitRankLastInterval(sequence_, index_);</div>
|
|
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span> }</div>
|
|
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> </div>
|
|
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span> <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"RankLast(%s, %d)"</span>, sequence_->DebugString(),</div>
|
|
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> index_);</div>
|
|
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span> }</div>
|
|
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span> </div>
|
|
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> SequenceVar* <span class="keyword">const</span> sequence_;</div>
|
|
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span> <span class="keyword">const</span> <span class="keywordtype">int</span> index_;</div>
|
|
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span>};</div>
|
|
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</span> </div>
|
|
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"> 640</span><span class="keyword">class </span>RankFirstIntervalVars : <span class="keyword">public</span> DecisionBuilder {</div>
|
|
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span> RankFirstIntervalVars(<span class="keyword">const</span> std::vector<SequenceVar*>& sequences,</div>
|
|
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"> 643</span> <a class="code hl_enumeration" href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482b">Solver::SequenceStrategy</a> str)</div>
|
|
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"> 644</span> : sequences_(sequences), strategy_(str) {}</div>
|
|
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno"> 645</span> </div>
|
|
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno"> 646</span> ~RankFirstIntervalVars()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno"> 647</span> </div>
|
|
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> Decision* Next(Solver* <span class="keyword">const</span> s)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"> 649</span> SequenceVar* best_sequence = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno"> 650</span> best_possible_firsts_.clear();</div>
|
|
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"> 651</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno"> 652</span> <span class="keywordflow">if</span> (FindSequenceVar(s, &best_sequence)) {</div>
|
|
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno"> 653</span> <span class="comment">// No not create a choice point if it is not needed.</span></div>
|
|
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(best_sequence != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> <span class="keywordflow">if</span> (best_possible_firsts_.size() == 1 &&</div>
|
|
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno"> 656</span> best_sequence->Interval(best_possible_firsts_.back())</div>
|
|
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno"> 657</span> ->MustBePerformed()) {</div>
|
|
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"> 658</span> best_sequence->RankFirst(best_possible_firsts_.back());</div>
|
|
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno"> 659</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno"> 660</span> }</div>
|
|
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno"> 661</span> <span class="keywordtype">int</span> best_interval = -1;</div>
|
|
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno"> 662</span> <span class="keywordflow">if</span> (!FindIntervalVar(s, best_sequence, &best_interval)) {</div>
|
|
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno"> 663</span> s->Fail();</div>
|
|
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"> 664</span> }</div>
|
|
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</span> <a class="code hl_define" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(-1, best_interval);</div>
|
|
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno"> 666</span> <span class="keywordflow">return</span> s->RevAlloc(<span class="keyword">new</span> RankFirst(best_sequence, best_interval));</div>
|
|
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno"> 667</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno"> 669</span> }</div>
|
|
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno"> 670</span> }</div>
|
|
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno"> 671</span> }</div>
|
|
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno"> 672</span> </div>
|
|
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno"> 673</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 id="l00674" name="l00674"></a><span class="lineno"> 674</span> visitor->BeginVisitExtension(<a class="code hl_variable" href="classoperations__research_1_1_model_visitor.html#ab2689eae50e311de930f43660cd27034">ModelVisitor::kVariableGroupExtension</a>);</div>
|
|
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno"> 675</span> visitor->VisitSequenceArrayArgument(<a class="code hl_variable" href="classoperations__research_1_1_model_visitor.html#ae28aec831e51bcced5590581bb086e4f">ModelVisitor::kSequencesArgument</a>,</div>
|
|
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno"> 676</span> sequences_);</div>
|
|
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno"> 677</span> visitor->EndVisitExtension(<a class="code hl_variable" href="classoperations__research_1_1_model_visitor.html#ab2689eae50e311de930f43660cd27034">ModelVisitor::kVariableGroupExtension</a>);</div>
|
|
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"> 678</span> }</div>
|
|
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno"> 679</span> </div>
|
|
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno"> 680</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno"> 681</span> <span class="comment">// Selects the interval var to rank.</span></div>
|
|
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno"> 682</span> <span class="keywordtype">bool</span> FindIntervalVarOnStartMin(Solver* <span class="keyword">const</span> s,</div>
|
|
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno"> 683</span> SequenceVar* <span class="keyword">const</span> best_sequence,</div>
|
|
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"> 684</span> <span class="keywordtype">int</span>* <span class="keyword">const</span> best_interval_index) {</div>
|
|
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno"> 685</span> <span class="keywordtype">int</span> best_interval = -1;</div>
|
|
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"> 686</span> int64_t best_start_min = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno"> 687</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < best_possible_firsts_.size(); ++<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno"> 688</span> <span class="keyword">const</span> <span class="keywordtype">int</span> candidate = best_possible_firsts_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno"> 689</span> IntervalVar* <span class="keyword">const</span> <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> = best_sequence->Interval(candidate);</div>
|
|
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"> 690</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin() < best_start_min) {</div>
|
|
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno"> 691</span> best_interval = candidate;</div>
|
|
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno"> 692</span> best_start_min = <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin();</div>
|
|
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno"> 693</span> }</div>
|
|
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno"> 694</span> }</div>
|
|
<div class="line"><a id="l00695" name="l00695"></a><span class="lineno"> 695</span> <span class="keywordflow">if</span> (best_interval == -1) {</div>
|
|
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno"> 696</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno"> 697</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00698" name="l00698"></a><span class="lineno"> 698</span> *best_interval_index = best_interval;</div>
|
|
<div class="line"><a id="l00699" name="l00699"></a><span class="lineno"> 699</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno"> 700</span> }</div>
|
|
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno"> 701</span> }</div>
|
|
<div class="line"><a id="l00702" name="l00702"></a><span class="lineno"> 702</span> </div>
|
|
<div class="line"><a id="l00703" name="l00703"></a><span class="lineno"> 703</span> <span class="keywordtype">bool</span> FindIntervalVarRandomly(Solver* <span class="keyword">const</span> s,</div>
|
|
<div class="line"><a id="l00704" name="l00704"></a><span class="lineno"> 704</span> SequenceVar* <span class="keyword">const</span> best_sequence,</div>
|
|
<div class="line"><a id="l00705" name="l00705"></a><span class="lineno"> 705</span> <span class="keywordtype">int</span>* <span class="keyword">const</span> best_interval_index) {</div>
|
|
<div class="line"><a id="l00706" name="l00706"></a><span class="lineno"> 706</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!best_possible_firsts_.empty());</div>
|
|
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno"> 707</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = s->Rand32(best_possible_firsts_.size());</div>
|
|
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno"> 708</span> *best_interval_index = best_possible_firsts_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a id="l00709" name="l00709"></a><span class="lineno"> 709</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno"> 710</span> }</div>
|
|
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno"> 711</span> </div>
|
|
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno"> 712</span> <span class="keywordtype">bool</span> FindIntervalVar(Solver* <span class="keyword">const</span> s, SequenceVar* <span class="keyword">const</span> best_sequence,</div>
|
|
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno"> 713</span> <span class="keywordtype">int</span>* <span class="keyword">const</span> best_interval_index) {</div>
|
|
<div class="line"><a id="l00714" name="l00714"></a><span class="lineno"> 714</span> <span class="keywordflow">switch</span> (strategy_) {</div>
|
|
<div class="line"><a id="l00715" name="l00715"></a><span class="lineno"> 715</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482baebe21dd4bbeb40285e8ea719f8ea3d0f">Solver::SEQUENCE_DEFAULT</a>:</div>
|
|
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno"> 716</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482ba31e588f8460ab3ec92a69f0d9aff4239">Solver::SEQUENCE_SIMPLE</a>:</div>
|
|
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno"> 717</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482ba56d44a3dd83eb1a8b0c8f6645bbe68d7">Solver::CHOOSE_MIN_SLACK_RANK_FORWARD</a>:</div>
|
|
<div class="line"><a id="l00718" name="l00718"></a><span class="lineno"> 718</span> <span class="keywordflow">return</span> FindIntervalVarOnStartMin(s, best_sequence, best_interval_index);</div>
|
|
<div class="line"><a id="l00719" name="l00719"></a><span class="lineno"> 719</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482bae46a3641c46e09a29875fe4067773615">Solver::CHOOSE_RANDOM_RANK_FORWARD</a>:</div>
|
|
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno"> 720</span> <span class="keywordflow">return</span> FindIntervalVarRandomly(s, best_sequence, best_interval_index);</div>
|
|
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno"> 721</span> <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno"> 722</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Unknown strategy "</span> << strategy_;</div>
|
|
<div class="line"><a id="l00723" name="l00723"></a><span class="lineno"> 723</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno"> 724</span> }</div>
|
|
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno"> 725</span> }</div>
|
|
<div class="line"><a id="l00726" name="l00726"></a><span class="lineno"> 726</span> </div>
|
|
<div class="line"><a id="l00727" name="l00727"></a><span class="lineno"> 727</span> <span class="comment">// Selects the sequence var to start ranking.</span></div>
|
|
<div class="line"><a id="l00728" name="l00728"></a><span class="lineno"> 728</span> <span class="keywordtype">bool</span> FindSequenceVarOnSlack(Solver* <span class="keyword">const</span> s,</div>
|
|
<div class="line"><a id="l00729" name="l00729"></a><span class="lineno"> 729</span> SequenceVar** <span class="keyword">const</span> best_sequence) {</div>
|
|
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno"> 730</span> int64_t best_slack = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l00731" name="l00731"></a><span class="lineno"> 731</span> int64_t best_ahmin = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l00732" name="l00732"></a><span class="lineno"> 732</span> *best_sequence = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00733" name="l00733"></a><span class="lineno"> 733</span> best_possible_firsts_.clear();</div>
|
|
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno"> 734</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < sequences_.size(); ++i) {</div>
|
|
<div class="line"><a id="l00735" name="l00735"></a><span class="lineno"> 735</span> SequenceVar* <span class="keyword">const</span> candidate_sequence = sequences_[i];</div>
|
|
<div class="line"><a id="l00736" name="l00736"></a><span class="lineno"> 736</span> <span class="keywordtype">int</span> ranked = 0;</div>
|
|
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno"> 737</span> <span class="keywordtype">int</span> not_ranked = 0;</div>
|
|
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno"> 738</span> <span class="keywordtype">int</span> unperformed = 0;</div>
|
|
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno"> 739</span> candidate_sequence->ComputeStatistics(&ranked, &not_ranked, &unperformed);</div>
|
|
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno"> 740</span> <span class="keywordflow">if</span> (not_ranked > 0) {</div>
|
|
<div class="line"><a id="l00741" name="l00741"></a><span class="lineno"> 741</span> candidate_possible_firsts_.clear();</div>
|
|
<div class="line"><a id="l00742" name="l00742"></a><span class="lineno"> 742</span> candidate_possible_lasts_.clear();</div>
|
|
<div class="line"><a id="l00743" name="l00743"></a><span class="lineno"> 743</span> candidate_sequence->ComputePossibleFirstsAndLasts(</div>
|
|
<div class="line"><a id="l00744" name="l00744"></a><span class="lineno"> 744</span> &candidate_possible_firsts_, &candidate_possible_lasts_);</div>
|
|
<div class="line"><a id="l00745" name="l00745"></a><span class="lineno"> 745</span> <span class="comment">// No possible first, failing.</span></div>
|
|
<div class="line"><a id="l00746" name="l00746"></a><span class="lineno"> 746</span> <span class="keywordflow">if</span> (candidate_possible_firsts_.empty()) {</div>
|
|
<div class="line"><a id="l00747" name="l00747"></a><span class="lineno"> 747</span> s->Fail();</div>
|
|
<div class="line"><a id="l00748" name="l00748"></a><span class="lineno"> 748</span> }</div>
|
|
<div class="line"><a id="l00749" name="l00749"></a><span class="lineno"> 749</span> <span class="comment">// Only 1 candidate, and non optional: ranking without branching.</span></div>
|
|
<div class="line"><a id="l00750" name="l00750"></a><span class="lineno"> 750</span> <span class="keywordflow">if</span> (candidate_possible_firsts_.size() == 1 &&</div>
|
|
<div class="line"><a id="l00751" name="l00751"></a><span class="lineno"> 751</span> candidate_sequence->Interval(candidate_possible_firsts_.back())</div>
|
|
<div class="line"><a id="l00752" name="l00752"></a><span class="lineno"> 752</span> ->MustBePerformed()) {</div>
|
|
<div class="line"><a id="l00753" name="l00753"></a><span class="lineno"> 753</span> *best_sequence = candidate_sequence;</div>
|
|
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno"> 754</span> best_possible_firsts_ = candidate_possible_firsts_;</div>
|
|
<div class="line"><a id="l00755" name="l00755"></a><span class="lineno"> 755</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00756" name="l00756"></a><span class="lineno"> 756</span> }</div>
|
|
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno"> 757</span> </div>
|
|
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno"> 758</span> <span class="comment">// Evaluating the sequence.</span></div>
|
|
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno"> 759</span> int64_t hmin, hmax, dmin, dmax;</div>
|
|
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno"> 760</span> candidate_sequence->HorizonRange(&hmin, &hmax);</div>
|
|
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno"> 761</span> candidate_sequence->DurationRange(&dmin, &dmax);</div>
|
|
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno"> 762</span> int64_t ahmin, ahmax;</div>
|
|
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno"> 763</span> candidate_sequence->ActiveHorizonRange(&ahmin, &ahmax);</div>
|
|
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno"> 764</span> <span class="keyword">const</span> int64_t current_slack = (hmax - hmin - dmax);</div>
|
|
<div class="line"><a id="l00765" name="l00765"></a><span class="lineno"> 765</span> <span class="keywordflow">if</span> (current_slack < best_slack ||</div>
|
|
<div class="line"><a id="l00766" name="l00766"></a><span class="lineno"> 766</span> (current_slack == best_slack && ahmin < best_ahmin)) {</div>
|
|
<div class="line"><a id="l00767" name="l00767"></a><span class="lineno"> 767</span> best_slack = current_slack;</div>
|
|
<div class="line"><a id="l00768" name="l00768"></a><span class="lineno"> 768</span> *best_sequence = candidate_sequence;</div>
|
|
<div class="line"><a id="l00769" name="l00769"></a><span class="lineno"> 769</span> best_possible_firsts_ = candidate_possible_firsts_;</div>
|
|
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno"> 770</span> best_ahmin = ahmin;</div>
|
|
<div class="line"><a id="l00771" name="l00771"></a><span class="lineno"> 771</span> }</div>
|
|
<div class="line"><a id="l00772" name="l00772"></a><span class="lineno"> 772</span> }</div>
|
|
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno"> 773</span> }</div>
|
|
<div class="line"><a id="l00774" name="l00774"></a><span class="lineno"> 774</span> <span class="keywordflow">return</span> *best_sequence != <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00775" name="l00775"></a><span class="lineno"> 775</span> }</div>
|
|
<div class="line"><a id="l00776" name="l00776"></a><span class="lineno"> 776</span> </div>
|
|
<div class="line"><a id="l00777" name="l00777"></a><span class="lineno"> 777</span> <span class="keywordtype">bool</span> FindSequenceVarRandomly(Solver* <span class="keyword">const</span> s,</div>
|
|
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno"> 778</span> SequenceVar** <span class="keyword">const</span> best_sequence) {</div>
|
|
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno"> 779</span> std::vector<SequenceVar*> all_candidates;</div>
|
|
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno"> 780</span> std::vector<std::vector<int>> all_possible_firsts;</div>
|
|
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno"> 781</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < sequences_.size(); ++i) {</div>
|
|
<div class="line"><a id="l00782" name="l00782"></a><span class="lineno"> 782</span> SequenceVar* <span class="keyword">const</span> candidate_sequence = sequences_[i];</div>
|
|
<div class="line"><a id="l00783" name="l00783"></a><span class="lineno"> 783</span> <span class="keywordtype">int</span> ranked = 0;</div>
|
|
<div class="line"><a id="l00784" name="l00784"></a><span class="lineno"> 784</span> <span class="keywordtype">int</span> not_ranked = 0;</div>
|
|
<div class="line"><a id="l00785" name="l00785"></a><span class="lineno"> 785</span> <span class="keywordtype">int</span> unperformed = 0;</div>
|
|
<div class="line"><a id="l00786" name="l00786"></a><span class="lineno"> 786</span> candidate_sequence->ComputeStatistics(&ranked, &not_ranked, &unperformed);</div>
|
|
<div class="line"><a id="l00787" name="l00787"></a><span class="lineno"> 787</span> <span class="keywordflow">if</span> (not_ranked > 0) {</div>
|
|
<div class="line"><a id="l00788" name="l00788"></a><span class="lineno"> 788</span> candidate_possible_firsts_.clear();</div>
|
|
<div class="line"><a id="l00789" name="l00789"></a><span class="lineno"> 789</span> candidate_possible_lasts_.clear();</div>
|
|
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno"> 790</span> candidate_sequence->ComputePossibleFirstsAndLasts(</div>
|
|
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno"> 791</span> &candidate_possible_firsts_, &candidate_possible_lasts_);</div>
|
|
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno"> 792</span> <span class="comment">// No possible first, failing.</span></div>
|
|
<div class="line"><a id="l00793" name="l00793"></a><span class="lineno"> 793</span> <span class="keywordflow">if</span> (candidate_possible_firsts_.empty()) {</div>
|
|
<div class="line"><a id="l00794" name="l00794"></a><span class="lineno"> 794</span> s->Fail();</div>
|
|
<div class="line"><a id="l00795" name="l00795"></a><span class="lineno"> 795</span> }</div>
|
|
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno"> 796</span> <span class="comment">// Only 1 candidate, and non optional: ranking without branching.</span></div>
|
|
<div class="line"><a id="l00797" name="l00797"></a><span class="lineno"> 797</span> <span class="keywordflow">if</span> (candidate_possible_firsts_.size() == 1 &&</div>
|
|
<div class="line"><a id="l00798" name="l00798"></a><span class="lineno"> 798</span> candidate_sequence->Interval(candidate_possible_firsts_.back())</div>
|
|
<div class="line"><a id="l00799" name="l00799"></a><span class="lineno"> 799</span> ->MustBePerformed()) {</div>
|
|
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno"> 800</span> *best_sequence = candidate_sequence;</div>
|
|
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno"> 801</span> best_possible_firsts_ = candidate_possible_firsts_;</div>
|
|
<div class="line"><a id="l00802" name="l00802"></a><span class="lineno"> 802</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00803" name="l00803"></a><span class="lineno"> 803</span> }</div>
|
|
<div class="line"><a id="l00804" name="l00804"></a><span class="lineno"> 804</span> </div>
|
|
<div class="line"><a id="l00805" name="l00805"></a><span class="lineno"> 805</span> all_candidates.push_back(candidate_sequence);</div>
|
|
<div class="line"><a id="l00806" name="l00806"></a><span class="lineno"> 806</span> all_possible_firsts.push_back(candidate_possible_firsts_);</div>
|
|
<div class="line"><a id="l00807" name="l00807"></a><span class="lineno"> 807</span> }</div>
|
|
<div class="line"><a id="l00808" name="l00808"></a><span class="lineno"> 808</span> }</div>
|
|
<div class="line"><a id="l00809" name="l00809"></a><span class="lineno"> 809</span> <span class="keywordflow">if</span> (all_candidates.empty()) {</div>
|
|
<div class="line"><a id="l00810" name="l00810"></a><span class="lineno"> 810</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00811" name="l00811"></a><span class="lineno"> 811</span> }</div>
|
|
<div class="line"><a id="l00812" name="l00812"></a><span class="lineno"> 812</span> <span class="keyword">const</span> <span class="keywordtype">int</span> chosen = s->Rand32(all_candidates.size());</div>
|
|
<div class="line"><a id="l00813" name="l00813"></a><span class="lineno"> 813</span> *best_sequence = all_candidates[chosen];</div>
|
|
<div class="line"><a id="l00814" name="l00814"></a><span class="lineno"> 814</span> best_possible_firsts_ = all_possible_firsts[chosen];</div>
|
|
<div class="line"><a id="l00815" name="l00815"></a><span class="lineno"> 815</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00816" name="l00816"></a><span class="lineno"> 816</span> }</div>
|
|
<div class="line"><a id="l00817" name="l00817"></a><span class="lineno"> 817</span> </div>
|
|
<div class="line"><a id="l00818" name="l00818"></a><span class="lineno"> 818</span> <span class="keywordtype">bool</span> FindSequenceVar(Solver* <span class="keyword">const</span> s, SequenceVar** <span class="keyword">const</span> best_sequence) {</div>
|
|
<div class="line"><a id="l00819" name="l00819"></a><span class="lineno"> 819</span> <span class="keywordflow">switch</span> (strategy_) {</div>
|
|
<div class="line"><a id="l00820" name="l00820"></a><span class="lineno"> 820</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482baebe21dd4bbeb40285e8ea719f8ea3d0f">Solver::SEQUENCE_DEFAULT</a>:</div>
|
|
<div class="line"><a id="l00821" name="l00821"></a><span class="lineno"> 821</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482ba31e588f8460ab3ec92a69f0d9aff4239">Solver::SEQUENCE_SIMPLE</a>:</div>
|
|
<div class="line"><a id="l00822" name="l00822"></a><span class="lineno"> 822</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482ba56d44a3dd83eb1a8b0c8f6645bbe68d7">Solver::CHOOSE_MIN_SLACK_RANK_FORWARD</a>:</div>
|
|
<div class="line"><a id="l00823" name="l00823"></a><span class="lineno"> 823</span> <span class="keywordflow">return</span> FindSequenceVarOnSlack(s, best_sequence);</div>
|
|
<div class="line"><a id="l00824" name="l00824"></a><span class="lineno"> 824</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482bae46a3641c46e09a29875fe4067773615">Solver::CHOOSE_RANDOM_RANK_FORWARD</a>:</div>
|
|
<div class="line"><a id="l00825" name="l00825"></a><span class="lineno"> 825</span> <span class="keywordflow">return</span> FindSequenceVarRandomly(s, best_sequence);</div>
|
|
<div class="line"><a id="l00826" name="l00826"></a><span class="lineno"> 826</span> <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a id="l00827" name="l00827"></a><span class="lineno"> 827</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Unknown strategy "</span> << strategy_;</div>
|
|
<div class="line"><a id="l00828" name="l00828"></a><span class="lineno"> 828</span> }</div>
|
|
<div class="line"><a id="l00829" name="l00829"></a><span class="lineno"> 829</span> }</div>
|
|
<div class="line"><a id="l00830" name="l00830"></a><span class="lineno"> 830</span> </div>
|
|
<div class="line"><a id="l00831" name="l00831"></a><span class="lineno"> 831</span> <span class="keyword">const</span> std::vector<SequenceVar*> sequences_;</div>
|
|
<div class="line"><a id="l00832" name="l00832"></a><span class="lineno"> 832</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482b">Solver::SequenceStrategy</a> strategy_;</div>
|
|
<div class="line"><a id="l00833" name="l00833"></a><span class="lineno"> 833</span> std::vector<int> best_possible_firsts_;</div>
|
|
<div class="line"><a id="l00834" name="l00834"></a><span class="lineno"> 834</span> std::vector<int> candidate_possible_firsts_;</div>
|
|
<div class="line"><a id="l00835" name="l00835"></a><span class="lineno"> 835</span> std::vector<int> candidate_possible_lasts_;</div>
|
|
<div class="line"><a id="l00836" name="l00836"></a><span class="lineno"> 836</span>};</div>
|
|
<div class="line"><a id="l00837" name="l00837"></a><span class="lineno"> 837</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l00838" name="l00838"></a><span class="lineno"> 838</span> </div>
|
|
<div class="line"><a id="l00839" name="l00839"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#abdb542d05e19b8c9ad5dbea0709555fe"> 839</a></span><a class="code hl_class" href="classoperations__research_1_1_decision.html">Decision</a>* <a class="code hl_function" href="classoperations__research_1_1_solver.html#abdb542d05e19b8c9ad5dbea0709555fe">Solver::MakeScheduleOrPostpone</a>(<a class="code hl_class" href="classoperations__research_1_1_interval_var.html">IntervalVar</a>* <span class="keyword">const</span> <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, int64_t est,</div>
|
|
<div class="line"><a id="l00840" name="l00840"></a><span class="lineno"> 840</span> int64_t* <span class="keyword">const</span> marker) {</div>
|
|
<div class="line"><a id="l00841" name="l00841"></a><span class="lineno"> 841</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00842" name="l00842"></a><span class="lineno"> 842</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(marker != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00843" name="l00843"></a><span class="lineno"> 843</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_solver.html#af5a1f8b1ea0ab0796c8667b9e2ef0ce7">RevAlloc</a>(<span class="keyword">new</span> ScheduleOrPostpone(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, est, marker));</div>
|
|
<div class="line"><a id="l00844" name="l00844"></a><span class="lineno"> 844</span>}</div>
|
|
<div class="line"><a id="l00845" name="l00845"></a><span class="lineno"> 845</span> </div>
|
|
<div class="line"><a id="l00846" name="l00846"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a1d099ae04835723ee3ccd7644f1d40cc"> 846</a></span><a class="code hl_class" href="classoperations__research_1_1_decision.html">Decision</a>* <a class="code hl_function" href="classoperations__research_1_1_solver.html#a1d099ae04835723ee3ccd7644f1d40cc">Solver::MakeScheduleOrExpedite</a>(<a class="code hl_class" href="classoperations__research_1_1_interval_var.html">IntervalVar</a>* <span class="keyword">const</span> <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, int64_t est,</div>
|
|
<div class="line"><a id="l00847" name="l00847"></a><span class="lineno"> 847</span> int64_t* <span class="keyword">const</span> marker) {</div>
|
|
<div class="line"><a id="l00848" name="l00848"></a><span class="lineno"> 848</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00849" name="l00849"></a><span class="lineno"> 849</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(marker != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00850" name="l00850"></a><span class="lineno"> 850</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_solver.html#af5a1f8b1ea0ab0796c8667b9e2ef0ce7">RevAlloc</a>(<span class="keyword">new</span> ScheduleOrExpedite(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, est, marker));</div>
|
|
<div class="line"><a id="l00851" name="l00851"></a><span class="lineno"> 851</span>}</div>
|
|
<div class="line"><a id="l00852" name="l00852"></a><span class="lineno"> 852</span> </div>
|
|
<div class="line"><a id="l00853" name="l00853"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a5817205b496242838ae749efe532f8e1"> 853</a></span><a class="code hl_class" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a>* <a class="code hl_function" href="classoperations__research_1_1_solver.html#ab8c32c78b5af7d4975432c0971369153">Solver::MakePhase</a>(<span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a id="l00854" name="l00854"></a><span class="lineno"> 854</span> <a class="code hl_enumeration" href="classoperations__research_1_1_solver.html#a3a64940761b306c816e00e077906952f">IntervalStrategy</a> str) {</div>
|
|
<div class="line"><a id="l00855" name="l00855"></a><span class="lineno"> 855</span> <span class="keywordflow">switch</span> (str) {</div>
|
|
<div class="line"><a id="l00856" name="l00856"></a><span class="lineno"> 856</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1_solver.html#a3a64940761b306c816e00e077906952faeca7ad9e63f49cd929edb90dbc7f5bb3">Solver::INTERVAL_DEFAULT</a>:</div>
|
|
<div class="line"><a id="l00857" name="l00857"></a><span class="lineno"> 857</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1_solver.html#a3a64940761b306c816e00e077906952fa1bcb9f646cc7d33aa1278c661e40ed6c">Solver::INTERVAL_SIMPLE</a>:</div>
|
|
<div class="line"><a id="l00858" name="l00858"></a><span class="lineno"> 858</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1_solver.html#a3a64940761b306c816e00e077906952fa093ec3f2fbd36daf12e6b7d96525bc92">Solver::INTERVAL_SET_TIMES_FORWARD</a>:</div>
|
|
<div class="line"><a id="l00859" name="l00859"></a><span class="lineno"> 859</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_solver.html#af5a1f8b1ea0ab0796c8667b9e2ef0ce7">RevAlloc</a>(<span class="keyword">new</span> SetTimesForward(intervals));</div>
|
|
<div class="line"><a id="l00860" name="l00860"></a><span class="lineno"> 860</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1_solver.html#a3a64940761b306c816e00e077906952fa34bde74f005a07be4c7598cd4e810831">Solver::INTERVAL_SET_TIMES_BACKWARD</a>:</div>
|
|
<div class="line"><a id="l00861" name="l00861"></a><span class="lineno"> 861</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_solver.html#af5a1f8b1ea0ab0796c8667b9e2ef0ce7">RevAlloc</a>(<span class="keyword">new</span> SetTimesBackward(intervals));</div>
|
|
<div class="line"><a id="l00862" name="l00862"></a><span class="lineno"> 862</span> <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a id="l00863" name="l00863"></a><span class="lineno"> 863</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Unknown strategy "</span> << str;</div>
|
|
<div class="line"><a id="l00864" name="l00864"></a><span class="lineno"> 864</span> }</div>
|
|
<div class="line"><a id="l00865" name="l00865"></a><span class="lineno"> 865</span>}</div>
|
|
<div class="line"><a id="l00866" name="l00866"></a><span class="lineno"> 866</span> </div>
|
|
<div class="line"><a id="l00867" name="l00867"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a928815a4c6a634b490c936097b7d00a5"> 867</a></span><a class="code hl_class" href="classoperations__research_1_1_decision.html">Decision</a>* <a class="code hl_function" href="classoperations__research_1_1_solver.html#a928815a4c6a634b490c936097b7d00a5">Solver::MakeRankFirstInterval</a>(<a class="code hl_class" href="classoperations__research_1_1_sequence_var.html">SequenceVar</a>* <span class="keyword">const</span> sequence,</div>
|
|
<div class="line"><a id="l00868" name="l00868"></a><span class="lineno"> 868</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a id="l00869" name="l00869"></a><span class="lineno"> 869</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(sequence != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00870" name="l00870"></a><span class="lineno"> 870</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_solver.html#af5a1f8b1ea0ab0796c8667b9e2ef0ce7">RevAlloc</a>(<span class="keyword">new</span> RankFirst(sequence, <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>));</div>
|
|
<div class="line"><a id="l00871" name="l00871"></a><span class="lineno"> 871</span>}</div>
|
|
<div class="line"><a id="l00872" name="l00872"></a><span class="lineno"> 872</span> </div>
|
|
<div class="line"><a id="l00873" name="l00873"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#ac0ac844f6576d238f6c11f4069b4576d"> 873</a></span><a class="code hl_class" href="classoperations__research_1_1_decision.html">Decision</a>* <a class="code hl_function" href="classoperations__research_1_1_solver.html#ac0ac844f6576d238f6c11f4069b4576d">Solver::MakeRankLastInterval</a>(<a class="code hl_class" href="classoperations__research_1_1_sequence_var.html">SequenceVar</a>* <span class="keyword">const</span> sequence, <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a id="l00874" name="l00874"></a><span class="lineno"> 874</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(sequence != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00875" name="l00875"></a><span class="lineno"> 875</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_solver.html#af5a1f8b1ea0ab0796c8667b9e2ef0ce7">RevAlloc</a>(<span class="keyword">new</span> RankLast(sequence, <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>));</div>
|
|
<div class="line"><a id="l00876" name="l00876"></a><span class="lineno"> 876</span>}</div>
|
|
<div class="line"><a id="l00877" name="l00877"></a><span class="lineno"> 877</span> </div>
|
|
<div class="line"><a id="l00878" name="l00878"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#ac312642e015dc90cfe57ced402222862"> 878</a></span><a class="code hl_class" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a>* <a class="code hl_function" href="classoperations__research_1_1_solver.html#ab8c32c78b5af7d4975432c0971369153">Solver::MakePhase</a>(<span class="keyword">const</span> std::vector<SequenceVar*>& sequences,</div>
|
|
<div class="line"><a id="l00879" name="l00879"></a><span class="lineno"> 879</span> <a class="code hl_enumeration" href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482b">SequenceStrategy</a> str) {</div>
|
|
<div class="line"><a id="l00880" name="l00880"></a><span class="lineno"> 880</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_solver.html#af5a1f8b1ea0ab0796c8667b9e2ef0ce7">RevAlloc</a>(<span class="keyword">new</span> RankFirstIntervalVars(sequences, str));</div>
|
|
<div class="line"><a id="l00881" name="l00881"></a><span class="lineno"> 881</span>}</div>
|
|
<div class="line"><a id="l00882" name="l00882"></a><span class="lineno"> 882</span> </div>
|
|
<div class="line"><a id="l00883" name="l00883"></a><span class="lineno"> 883</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a151248525a9e07eb3e6e60ea1c4995eb"><div class="ttname"><a href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a></div><div class="ttdeci">const std::vector< IntVar * > vars_</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00044">alldiff_cst.cc:44</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00892">base/logging.h:892</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab25e01a2942b821d66371fc68d53f2eb"><div class="ttname"><a href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a></div><div class="ttdeci">#define CHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00704">base/logging.h:704</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00894">base/logging.h:894</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00420">base/logging.h:420</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_decision_builder_html"><div class="ttname"><a href="classoperations__research_1_1_decision_builder.html">operations_research::DecisionBuilder</a></div><div class="ttdoc">A DecisionBuilder is responsible for creating the search tree.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03285">constraint_solver.h:3285</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_decision_html"><div class="ttname"><a href="classoperations__research_1_1_decision.html">operations_research::Decision</a></div><div class="ttdoc">A Decision represents a choice point in the search tree.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03245">constraint_solver.h:3245</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_a62b340f6d1dde6a36560bd88a382ada7"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">operations_research::IntExpr::Min</a></div><div class="ttdeci">virtual int64_t Min() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_html"><div class="ttname"><a href="classoperations__research_1_1_int_var.html">operations_research::IntVar</a></div><div class="ttdoc">The class IntVar is a subset of IntExpr.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04040">constraint_solver.h:4040</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_html_a0723abf37f7a5a8a604fd1bcd96a7be0"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#a0723abf37f7a5a8a604fd1bcd96a7be0">operations_research::IntVar::Contains</a></div><div class="ttdeci">virtual bool Contains(int64_t v) const =0</div><div class="ttdoc">This method returns whether the value 'v' is in the domain of the variable.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html">operations_research::IntervalVar</a></div><div class="ttdoc">Interval variables are often used in scheduling.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04437">constraint_solver.h:4437</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html_a2e69397c7c1e71a796afa6a632ee8296"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#a2e69397c7c1e71a796afa6a632ee8296">operations_research::IntervalVar::DurationMax</a></div><div class="ttdeci">virtual int64_t DurationMax() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html_a4488d66b163b204a15eadeafcf4872f8"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#a4488d66b163b204a15eadeafcf4872f8">operations_research::IntervalVar::DurationMin</a></div><div class="ttdeci">virtual int64_t DurationMin() const =0</div><div class="ttdoc">These methods query, set, and watch the duration of the interval var.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html_a7f7f661e9b94f25f706732924e0f01e9"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#a7f7f661e9b94f25f706732924e0f01e9">operations_research::IntervalVar::MustBePerformed</a></div><div class="ttdeci">virtual bool MustBePerformed() const =0</div><div class="ttdoc">These methods query, set, and watch the performed status of the interval var.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html_aa93a06dc97f33ccaefc7df90fb9b89d1"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#aa93a06dc97f33ccaefc7df90fb9b89d1">operations_research::IntervalVar::StartMin</a></div><div class="ttdeci">virtual int64_t StartMin() const =0</div><div class="ttdoc">These methods query, set, and watch the start position of the interval var.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html_ae05142dd885524b06032bed1cbc63af0"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#ae05142dd885524b06032bed1cbc63af0">operations_research::IntervalVar::EndMax</a></div><div class="ttdeci">virtual int64_t EndMax() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html_af341bdc63fc2e487a50047afa36a536b"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#af341bdc63fc2e487a50047afa36a536b">operations_research::IntervalVar::MayBePerformed</a></div><div class="ttdeci">virtual bool MayBePerformed() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html">operations_research::ModelVisitor</a></div><div class="ttdoc">Model visitor.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03375">constraint_solver.h:3375</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_a24b1621742f94760c45e305c6fbba6bd"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a24b1621742f94760c45e305c6fbba6bd">operations_research::ModelVisitor::VisitSequenceVariable</a></div><div class="ttdeci">virtual void VisitSequenceVariable(const SequenceVar *const variable)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l02784">constraint_solver.cc:2784</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_a671ece39b478a03a0c0e45a0e81cc0c7"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a671ece39b478a03a0c0e45a0e81cc0c7">operations_research::ModelVisitor::kIntervalsArgument</a></div><div class="ttdeci">static const char kIntervalsArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03501">constraint_solver.h:3501</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_ab2689eae50e311de930f43660cd27034"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#ab2689eae50e311de930f43660cd27034">operations_research::ModelVisitor::kVariableGroupExtension</a></div><div class="ttdeci">static const char kVariableGroupExtension[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03471">constraint_solver.h:3471</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_model_visitor_html_ae28aec831e51bcced5590581bb086e4f"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#ae28aec831e51bcced5590581bb086e4f">operations_research::ModelVisitor::kSequencesArgument</a></div><div class="ttdeci">static const char kSequencesArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03518">constraint_solver.h:3518</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_propagation_base_object_html"><div class="ttname"><a href="classoperations__research_1_1_propagation_base_object.html">operations_research::PropagationBaseObject</a></div><div class="ttdoc">NOLINT.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03184">constraint_solver.h:3184</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_propagation_base_object_html_a0b526d33739114e9255ffbe8343efe1a"><div class="ttname"><a href="classoperations__research_1_1_propagation_base_object.html#a0b526d33739114e9255ffbe8343efe1a">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#l03196">constraint_solver.h:3196</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_propagation_base_object_html_a1d89c28bd42ba9a52da008bb69367171"><div class="ttname"><a href="classoperations__research_1_1_propagation_base_object.html#a1d89c28bd42ba9a52da008bb69367171">operations_research::PropagationBaseObject::name</a></div><div class="ttdeci">virtual std::string name() const</div><div class="ttdoc">Object naming.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l02511">constraint_solver.cc:2511</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_propagation_base_object_html_ad5260b9627048b854b45d05ed34adc22"><div class="ttname"><a href="classoperations__research_1_1_propagation_base_object.html#ad5260b9627048b854b45d05ed34adc22">operations_research::PropagationBaseObject::set_name</a></div><div class="ttdeci">void set_name(const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l02515">constraint_solver.cc:2515</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_propagation_monitor_html_a133d6644c8ea52f45e657b4c268e0cbf"><div class="ttname"><a href="classoperations__research_1_1_propagation_monitor.html#a133d6644c8ea52f45e657b4c268e0cbf">operations_research::PropagationMonitor::RankLast</a></div><div class="ttdeci">virtual void RankLast(SequenceVar *const var, int index)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_propagation_monitor_html_a6467f671a40283eed2a71c51741d93b8"><div class="ttname"><a href="classoperations__research_1_1_propagation_monitor.html#a6467f671a40283eed2a71c51741d93b8">operations_research::PropagationMonitor::RankNotLast</a></div><div class="ttdeci">virtual void RankNotLast(SequenceVar *const var, int index)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_propagation_monitor_html_a670d62cb4741bc10b2332a8a67fd3f5a"><div class="ttname"><a href="classoperations__research_1_1_propagation_monitor.html#a670d62cb4741bc10b2332a8a67fd3f5a">operations_research::PropagationMonitor::RankNotFirst</a></div><div class="ttdeci">virtual void RankNotFirst(SequenceVar *const var, int index)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_propagation_monitor_html_a6e8312c7b6a02f813e345b99f98a8458"><div class="ttname"><a href="classoperations__research_1_1_propagation_monitor.html#a6e8312c7b6a02f813e345b99f98a8458">operations_research::PropagationMonitor::RankSequence</a></div><div class="ttdeci">virtual void RankSequence(SequenceVar *const var, const std::vector< int > &rank_first, const std::vector< int > &rank_last, const std::vector< int > &unperformed)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_propagation_monitor_html_af5aaffbf16ee150934ca1d7feddffdf7"><div class="ttname"><a href="classoperations__research_1_1_propagation_monitor.html#af5aaffbf16ee150934ca1d7feddffdf7">operations_research::PropagationMonitor::RankFirst</a></div><div class="ttdeci">virtual void RankFirst(SequenceVar *const var, int index)=0</div><div class="ttdoc">SequenceVar modifiers.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html">operations_research::SequenceVar</a></div><div class="ttdoc">A sequence variable is a variable whose domain is a set of possible orderings of the interval variabl...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04591">constraint_solver.h:4591</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_a01635a3b908310e048be6c6b85366bb8"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#a01635a3b908310e048be6c6b85366bb8">operations_research::SequenceVar::ComputePossibleFirstsAndLasts</a></div><div class="ttdeci">void ComputePossibleFirstsAndLasts(std::vector< int > *const possible_firsts, std::vector< int > *const possible_lasts)</div><div class="ttdoc">Computes the set of indices of interval variables that can be ranked first in the set of unranked act...</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00191">sched_search.cc:191</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_a157c0f2f0636c4de7bded81fe83c6cec"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#a157c0f2f0636c4de7bded81fe83c6cec">operations_research::SequenceVar::HorizonRange</a></div><div class="ttdeci">void HorizonRange(int64_t *const hmin, int64_t *const hmax) const</div><div class="ttdoc">Returns the minimum start min and the maximum end max of all interval vars in the sequence.</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00094">sched_search.cc:94</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_a19499c160356f9655862f3037315d87d"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#a19499c160356f9655862f3037315d87d">operations_research::SequenceVar::FillSequence</a></div><div class="ttdeci">void FillSequence(std::vector< int > *const rank_first, std::vector< int > *const rank_last, std::vector< int > *const unperformed) const</div><div class="ttdoc">Clears 'rank_first' and 'rank_last', and fills them with the intervals in the order of the ranks.</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00349">sched_search.cc:349</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_a2c3cdf1887a496fe0fdd4b5abe5c33f5"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#a2c3cdf1887a496fe0fdd4b5abe5c33f5">operations_research::SequenceVar::RankSequence</a></div><div class="ttdeci">void RankSequence(const std::vector< int > &rank_first, const std::vector< int > &rank_last, const std::vector< int > &unperformed)</div><div class="ttdoc">Applies the following sequence of ranks, ranks first, then rank last.</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00269">sched_search.cc:269</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_a31d0bb3a9647ebb39d997f77a1eff435"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#a31d0bb3a9647ebb39d997f77a1eff435">operations_research::SequenceVar::ComputeStatistics</a></div><div class="ttdeci">void ComputeStatistics(int *const ranked, int *const not_ranked, int *const unperformed) const</div><div class="ttdoc">Compute statistics on the sequence.</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00147">sched_search.cc:147</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_a38e9cb6169470555a7403c5102030294"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#a38e9cb6169470555a7403c5102030294">operations_research::SequenceVar::DurationRange</a></div><div class="ttdeci">void DurationRange(int64_t *const dmin, int64_t *const dmax) const</div><div class="ttdoc">Returns the minimum and maximum duration of combined interval vars in the sequence.</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00077">sched_search.cc:77</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_a3a8465a1fa06dd401fa6924a492ce47b"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#a3a8465a1fa06dd401fa6924a492ce47b">operations_research::SequenceVar::~SequenceVar</a></div><div class="ttdeci">~SequenceVar() override</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00050">sched_search.cc:50</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_a757086e12f4615673721fd77ca49da7b"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#a757086e12f4615673721fd77ca49da7b">operations_research::SequenceVar::ActiveHorizonRange</a></div><div class="ttdeci">void ActiveHorizonRange(int64_t *const hmin, int64_t *const hmax) const</div><div class="ttdoc">Returns the minimum start min and the maximum end max of all unranked interval vars in the sequence.</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00109">sched_search.cc:109</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_a78865614535cb831319b955f6106bcaa"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#a78865614535cb831319b955f6106bcaa">operations_research::SequenceVar::Next</a></div><div class="ttdeci">IntVar * Next(int index) const</div><div class="ttdoc">Returns the next of the index_th interval of the sequence.</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00056">sched_search.cc:56</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_a896e760e54eb350618d538c3c2f71ecc"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#a896e760e54eb350618d538c3c2f71ecc">operations_research::SequenceVar::Interval</a></div><div class="ttdeci">IntervalVar * Interval(int index) const</div><div class="ttdoc">Returns the index_th interval of the sequence.</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00052">sched_search.cc:52</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_aaa902cac039701edcdaf15661fbed327"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#aaa902cac039701edcdaf15661fbed327">operations_research::SequenceVar::RankLast</a></div><div class="ttdeci">void RankLast(int index)</div><div class="ttdoc">Ranks the index_th interval var first of all unranked interval vars.</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00317">sched_search.cc:317</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_aac4aa5ecf086378b1bbac4b669bab4db"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#aac4aa5ecf086378b1bbac4b669bab4db">operations_research::SequenceVar::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="sched__search_8cc_source.html#l00073">sched_search.cc:73</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_ab8618d2458a778c7ee4326b41bd2de7e"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#ab8618d2458a778c7ee4326b41bd2de7e">operations_research::SequenceVar::RankFirst</a></div><div class="ttdeci">void RankFirst(int index)</div><div class="ttdoc">Ranks the index_th interval var first of all unranked interval vars.</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00294">sched_search.cc:294</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_ad2fcd811f566cf9677c886576515f032"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#ad2fcd811f566cf9677c886576515f032">operations_research::SequenceVar::RankNotLast</a></div><div class="ttdeci">void RankNotLast(int index)</div><div class="ttdoc">Indicates that the index_th interval var will not be ranked first of all currently unranked interval ...</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00332">sched_search.cc:332</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_aec7dac2fca35046761c8d47af724c091"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#aec7dac2fca35046761c8d47af724c091">operations_research::SequenceVar::RankNotFirst</a></div><div class="ttdeci">void RankNotFirst(int index)</div><div class="ttdoc">Indicates that the index_th interval var will not be ranked first of all currently unranked interval ...</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00309">sched_search.cc:309</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_aed4c20c3765ff3cde39e5bd2915d3699"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#aed4c20c3765ff3cde39e5bd2915d3699">operations_research::SequenceVar::SequenceVar</a></div><div class="ttdeci">SequenceVar(Solver *const s, const std::vector< IntervalVar * > &intervals, const std::vector< IntVar * > &nexts, const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00039">sched_search.cc:39</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequence_var_html_aed804747c45a7e1caf81461f9e45dd91"><div class="ttname"><a href="classoperations__research_1_1_sequence_var.html#aed804747c45a7e1caf81461f9e45dd91">operations_research::SequenceVar::DebugString</a></div><div class="ttdeci">std::string DebugString() const override</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00058">sched_search.cc:58</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#l00245">constraint_solver.h:245</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a1d099ae04835723ee3ccd7644f1d40cc"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a1d099ae04835723ee3ccd7644f1d40cc">operations_research::Solver::MakeScheduleOrExpedite</a></div><div class="ttdeci">Decision * MakeScheduleOrExpedite(IntervalVar *const var, int64_t est, int64_t *const marker)</div><div class="ttdoc">Returns a decision that tries to schedule a task at a given time.</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00846">sched_search.cc:846</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a3a64940761b306c816e00e077906952f"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a3a64940761b306c816e00e077906952f">operations_research::Solver::IntervalStrategy</a></div><div class="ttdeci">IntervalStrategy</div><div class="ttdoc">This enum describes the straregy used to select the next interval variable and its value to be fixed.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00411">constraint_solver.h:411</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a3a64940761b306c816e00e077906952fa093ec3f2fbd36daf12e6b7d96525bc92"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a3a64940761b306c816e00e077906952fa093ec3f2fbd36daf12e6b7d96525bc92">operations_research::Solver::INTERVAL_SET_TIMES_FORWARD</a></div><div class="ttdeci">@ INTERVAL_SET_TIMES_FORWARD</div><div class="ttdoc">Selects the variable with the lowest starting time of all variables, and fixes its starting time to t...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00418">constraint_solver.h:418</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a3a64940761b306c816e00e077906952fa1bcb9f646cc7d33aa1278c661e40ed6c"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a3a64940761b306c816e00e077906952fa1bcb9f646cc7d33aa1278c661e40ed6c">operations_research::Solver::INTERVAL_SIMPLE</a></div><div class="ttdeci">@ INTERVAL_SIMPLE</div><div class="ttdoc">The simple is INTERVAL_SET_TIMES_FORWARD.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00415">constraint_solver.h:415</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a3a64940761b306c816e00e077906952fa34bde74f005a07be4c7598cd4e810831"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a3a64940761b306c816e00e077906952fa34bde74f005a07be4c7598cd4e810831">operations_research::Solver::INTERVAL_SET_TIMES_BACKWARD</a></div><div class="ttdeci">@ INTERVAL_SET_TIMES_BACKWARD</div><div class="ttdoc">Selects the variable with the highest ending time of all variables, and fixes the ending time to this...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00422">constraint_solver.h:421</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a3a64940761b306c816e00e077906952faeca7ad9e63f49cd929edb90dbc7f5bb3"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a3a64940761b306c816e00e077906952faeca7ad9e63f49cd929edb90dbc7f5bb3">operations_research::Solver::INTERVAL_DEFAULT</a></div><div class="ttdeci">@ INTERVAL_DEFAULT</div><div class="ttdoc">The default is INTERVAL_SET_TIMES_FORWARD.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00413">constraint_solver.h:413</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a92271ad8e09cd801f83ae84e6af5f609"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a92271ad8e09cd801f83ae84e6af5f609">operations_research::Solver::GetPropagationMonitor</a></div><div class="ttdeci">PropagationMonitor * GetPropagationMonitor() const</div><div class="ttdoc">Returns the propagation monitor.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l03146">constraint_solver.cc:3146</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a928815a4c6a634b490c936097b7d00a5"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a928815a4c6a634b490c936097b7d00a5">operations_research::Solver::MakeRankFirstInterval</a></div><div class="ttdeci">Decision * MakeRankFirstInterval(SequenceVar *const sequence, int index)</div><div class="ttdoc">Returns a decision that tries to rank first the ith interval var in the sequence variable.</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00867">sched_search.cc:867</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_ab8c32c78b5af7d4975432c0971369153"><div class="ttname"><a href="classoperations__research_1_1_solver.html#ab8c32c78b5af7d4975432c0971369153">operations_research::Solver::MakePhase</a></div><div class="ttdeci">DecisionBuilder * MakePhase(const std::vector< IntVar * > &vars, IntVarStrategy var_str, IntValueStrategy val_str)</div><div class="ttdoc">Phases on IntVar arrays.</div><div class="ttdef"><b>Definition:</b> <a href="search_8cc_source.html#l02068">search.cc:2068</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_aba5c5dc6467e097f4972d7776541482b"><div class="ttname"><a href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482b">operations_research::Solver::SequenceStrategy</a></div><div class="ttdeci">SequenceStrategy</div><div class="ttdoc">Used for scheduling. Not yet implemented.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00402">constraint_solver.h:402</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_aba5c5dc6467e097f4972d7776541482ba31e588f8460ab3ec92a69f0d9aff4239"><div class="ttname"><a href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482ba31e588f8460ab3ec92a69f0d9aff4239">operations_research::Solver::SEQUENCE_SIMPLE</a></div><div class="ttdeci">@ SEQUENCE_SIMPLE</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00404">constraint_solver.h:404</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_aba5c5dc6467e097f4972d7776541482ba56d44a3dd83eb1a8b0c8f6645bbe68d7"><div class="ttname"><a href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482ba56d44a3dd83eb1a8b0c8f6645bbe68d7">operations_research::Solver::CHOOSE_MIN_SLACK_RANK_FORWARD</a></div><div class="ttdeci">@ CHOOSE_MIN_SLACK_RANK_FORWARD</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00405">constraint_solver.h:405</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_aba5c5dc6467e097f4972d7776541482bae46a3641c46e09a29875fe4067773615"><div class="ttname"><a href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482bae46a3641c46e09a29875fe4067773615">operations_research::Solver::CHOOSE_RANDOM_RANK_FORWARD</a></div><div class="ttdeci">@ CHOOSE_RANDOM_RANK_FORWARD</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00406">constraint_solver.h:406</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_aba5c5dc6467e097f4972d7776541482baebe21dd4bbeb40285e8ea719f8ea3d0f"><div class="ttname"><a href="classoperations__research_1_1_solver.html#aba5c5dc6467e097f4972d7776541482baebe21dd4bbeb40285e8ea719f8ea3d0f">operations_research::Solver::SEQUENCE_DEFAULT</a></div><div class="ttdeci">@ SEQUENCE_DEFAULT</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00403">constraint_solver.h:403</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_abdb542d05e19b8c9ad5dbea0709555fe"><div class="ttname"><a href="classoperations__research_1_1_solver.html#abdb542d05e19b8c9ad5dbea0709555fe">operations_research::Solver::MakeScheduleOrPostpone</a></div><div class="ttdeci">Decision * MakeScheduleOrPostpone(IntervalVar *const var, int64_t est, int64_t *const marker)</div><div class="ttdoc">Returns a decision that tries to schedule a task at a given time.</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00839">sched_search.cc:839</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_ac0ac844f6576d238f6c11f4069b4576d"><div class="ttname"><a href="classoperations__research_1_1_solver.html#ac0ac844f6576d238f6c11f4069b4576d">operations_research::Solver::MakeRankLastInterval</a></div><div class="ttdeci">Decision * MakeRankLastInterval(SequenceVar *const sequence, int index)</div><div class="ttdoc">Returns a decision that tries to rank last the ith interval var in the sequence variable.</div><div class="ttdef"><b>Definition:</b> <a href="sched__search_8cc_source.html#l00873">sched_search.cc:873</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_af5a1f8b1ea0ab0796c8667b9e2ef0ce7"><div class="ttname"><a href="classoperations__research_1_1_solver.html#af5a1f8b1ea0ab0796c8667b9e2ef0ce7">operations_research::Solver::RevAlloc</a></div><div class="ttdeci">T * RevAlloc(T *object)</div><div class="ttdoc">Registers the given object as being reversible.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00791">constraint_solver.h:791</a></div></div>
|
|
<div class="ttc" id="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#l00678">constraint_solver.cc:678</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="adefault__search_8cc_html_ac673bc430bdc3fdaa09f7becf98ef267"><div class="ttname"><a href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a></div><div class="ttdeci">const std::string name</div><div class="ttdef"><b>Definition:</b> <a href="default__search_8cc_source.html#l00813">default_search.cc:813</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_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="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="alocal__search_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l02750">local_search.cc:2750</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_acdd38e3c9f22f127d7776920e3079eda"><div class="ttname"><a href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a></div><div class="ttdeci">const int FATAL</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00032">log_severity.h:32</a></div></div>
|
|
<div class="ttc" id="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_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="anamespacestd_html"><div class="ttname"><a href="namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
|
|
<div class="ttc" id="aresource_8cc_html_af92a8383a05fdf586a52263d358f5ada"><div class="ttname"><a href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a></div><div class="ttdeci">IntervalVar * interval</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00100">resource.cc:100</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="sched__search_8cc.html">sched_search.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.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|