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