1280 lines
285 KiB
HTML
1280 lines
285 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: routing_breaks.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('routing__breaks_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">routing_breaks.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="routing__breaks_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 <algorithm></span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include "<a class="code" href="routing_8h.html">ortools/constraint_solver/routing.h</a>"</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="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  </div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#a8a31c563d28e1ebe7c9e140f15fea586"> 20</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a8a31c563d28e1ebe7c9e140f15fea586">DisjunctivePropagator::Propagate</a>(<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>, tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size());</div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size(), tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>.size());</div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size(), tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>.size());</div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size(), tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a702574cf13b54bc225f06ce3a548d4e3">duration_max</a>.size());</div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size(), tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>.size());</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size(), tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>.size());</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size(), tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.size());</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="comment">// Do forward deductions, then backward deductions.</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="comment">// All propagators are followed by Precedences(),</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="comment">// except MirrorTasks() after which Precedences() would make no deductions,</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="comment">// and DetectablePrecedencesWithChain() which is stronger than Precedences().</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="comment">// Precedences() is a propagator that does obvious deductions quickly (O(n)),</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="comment">// so interleaving Precedences() speeds up the propagation fixed point.</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">Precedences</a>(tasks) || !<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a08f43a826695abdbdad1c608cb90b25a">EdgeFinding</a>(tasks) || !<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">Precedences</a>(tasks) ||</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  !<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#aa9b624e65cb55b3d74ad35a3a675f9ea">DetectablePrecedencesWithChain</a>(tasks)) {</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  }</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keywordflow">if</span> (!tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">forbidden_intervals</a>.empty()) {</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a7b0f3a8550bd73014e2b61899524a2ad">ForbiddenIntervals</a>(tasks) || !<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">Precedences</a>(tasks)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  }</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keywordflow">if</span> (!tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a7cc44fe8f5261fa7bacc58867dfb3882">distance_duration</a>.empty()) {</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a13e93a8cd8587377e1b8f88096e0efd0">DistanceDuration</a>(tasks) || !<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">Precedences</a>(tasks)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  }</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a29620476a22fde70929c77dc6342be0e">MirrorTasks</a>(tasks) || !<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a08f43a826695abdbdad1c608cb90b25a">EdgeFinding</a>(tasks) || !<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">Precedences</a>(tasks) ||</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  !<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#aa9b624e65cb55b3d74ad35a3a675f9ea">DetectablePrecedencesWithChain</a>(tasks) || !<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a29620476a22fde70929c77dc6342be0e">MirrorTasks</a>(tasks)) {</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  }</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> }</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04"> 51</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">DisjunctivePropagator::Precedences</a>(<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_chain_tasks = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>;</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">if</span> (num_chain_tasks > 0) {</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">// Propagate forwards.</span></div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[0];</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = 0; task < num_chain_tasks; ++task) {</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task], <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>);</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task] = <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>;</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>, tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task]);</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">if</span> (tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task] < <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>, tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[task]);</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[task] = <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>;</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  }</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// Propagate backwards.</span></div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[num_chain_tasks - 1];</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = num_chain_tasks - 1; task >= 0; --task) {</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task], <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>);</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task] = <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>;</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>, tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task]);</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">if</span> (time < tasks-><a class="code" href="sched__constraints_8cc.html#ab2188791e61e013dc8b28e66b31041cd">start_min</a>[task]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>, tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[task]);</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[task] = <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>;</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  }</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size();</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = 0; task < num_tasks; ++task) {</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// Enforce start + duration <= end.</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[task] =</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[task],</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task]));</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[task] =</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[task],</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task]));</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a702574cf13b54bc225f06ce3a548d4e3">duration_max</a>[task] =</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a702574cf13b54bc225f06ce3a548d4e3">duration_max</a>[task],</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task]));</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">if</span> (!tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>[task]) {</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// Enforce start + duration == end for nonpreemptibles.</span></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task] =</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task],</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[task], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a702574cf13b54bc225f06ce3a548d4e3">duration_max</a>[task]));</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task] =</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task],</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[task], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a702574cf13b54bc225f06ce3a548d4e3">duration_max</a>[task]));</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task] =</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task],</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[task], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[task]));</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  }</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> (tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task] > tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a702574cf13b54bc225f06ce3a548d4e3">duration_max</a>[task]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">if</span> (tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[task] > tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">if</span> (tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task] > tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[task]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> }</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  </div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#a29620476a22fde70929c77dc6342be0e"> 106</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a29620476a22fde70929c77dc6342be0e">DisjunctivePropagator::MirrorTasks</a>(<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size();</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// For all tasks, start_min := -end_max and end_max := -start_min.</span></div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = 0; task < num_tasks; ++task) {</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> t = -tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task];</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task] = -tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task];</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task] = t;</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="comment">// For all tasks, start_max := -end_min and end_min := -start_max.</span></div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = 0; task < num_tasks; ++task) {</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> t = -tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[task];</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[task] = -tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[task];</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[task] = t;</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  }</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// In the mirror problem, tasks linked by precedences are in reversed order.</span></div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_chain_tasks = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> it :</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  {tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.begin(), tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>.begin(),</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>.begin(), tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a702574cf13b54bc225f06ce3a548d4e3">duration_max</a>.begin(),</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>.begin(), tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>.begin()}) {</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  std::reverse(it, it + num_chain_tasks);</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  std::reverse(it + num_chain_tasks, it + num_tasks);</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  }</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  std::reverse(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.begin(),</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.begin() + num_chain_tasks);</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  std::reverse(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.begin() + num_chain_tasks,</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.begin() + num_tasks);</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> }</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  </div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#a08f43a826695abdbdad1c608cb90b25a"> 136</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a08f43a826695abdbdad1c608cb90b25a">DisjunctivePropagator::EdgeFinding</a>(<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size();</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">// Prepare start_min events for tree.</span></div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  tasks_by_start_min_.resize(num_tasks);</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  std::iota(tasks_by_start_min_.begin(), tasks_by_start_min_.end(), 0);</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  std::sort(</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  tasks_by_start_min_.begin(), tasks_by_start_min_.end(),</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  [&](<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) { return tasks->start_min[i] < tasks->start_min[j]; });</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  event_of_task_.resize(num_tasks);</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> event = 0; <span class="keyword">event</span> < num_tasks; ++event) {</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  event_of_task_[tasks_by_start_min_[event]] = event;</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  }</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="comment">// Tasks will be browsed according to end_max order.</span></div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  tasks_by_end_max_.resize(num_tasks);</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  std::iota(tasks_by_end_max_.begin(), tasks_by_end_max_.end(), 0);</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  std::sort(</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  tasks_by_end_max_.begin(), tasks_by_end_max_.end(),</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  [&](<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) { return tasks->end_max[i] < tasks->end_max[j]; });</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  </div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// Generic overload checking: insert tasks by end_max,</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">// fail if envelope > end_max.</span></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  theta_lambda_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a7b4553842be2a65d82b3f40eed71744d">Reset</a>(num_tasks);</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> task : tasks_by_end_max_) {</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  theta_lambda_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f">AddOrUpdateEvent</a>(</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  event_of_task_[task], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task],</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task]);</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">if</span> (theta_lambda_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093">GetEnvelope</a>() > tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task]) {</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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>  }</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  </div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="comment">// Generic edge finding: from full set of tasks, at each end_max event in</span></div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// decreasing order, check lambda feasibility, then move end_max task from</span></div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// theta to lambda.</span></div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = num_tasks - 1; i >= 0; --i) {</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = tasks_by_end_max_[i];</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> envelope = theta_lambda_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093">GetEnvelope</a>();</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// If a nonpreemptible optional would overload end_max, push to envelope.</span></div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">while</span> (theta_lambda_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1c2fe501274ef60430486bba0842cd35">GetOptionalEnvelope</a>() > tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task]) {</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordtype">int</span> critical_event; <span class="comment">// Dummy value.</span></div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordtype">int</span> optional_event;</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> available_energy; <span class="comment">// Dummy value.</span></div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  theta_lambda_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0cd86cea355b2b1f70e5494fdce82979">GetEventsWithOptionalEnvelopeGreaterThan</a>(</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task], &critical_event, &optional_event,</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  &available_energy);</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> optional_task = tasks_by_start_min_[optional_event];</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[optional_task] =</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[optional_task], envelope);</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  theta_lambda_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1d04b14711a8d3bba829f1b0eb4dd4a8">RemoveEvent</a>(optional_event);</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  }</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">if</span> (!tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>[task]) {</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  theta_lambda_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a9045183839ce6286d80eb699209c1557">AddOrUpdateOptionalEvent</a>(event_of_task_[task],</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task],</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task]);</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  theta_lambda_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1d04b14711a8d3bba829f1b0eb4dd4a8">RemoveEvent</a>(event_of_task_[task]);</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  }</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span> }</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  </div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#aa9b624e65cb55b3d74ad35a3a675f9ea"> 197</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#aa9b624e65cb55b3d74ad35a3a675f9ea">DisjunctivePropagator::DetectablePrecedencesWithChain</a>(<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size();</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// Prepare start_min events for tree.</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  tasks_by_start_min_.resize(num_tasks);</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  std::iota(tasks_by_start_min_.begin(), tasks_by_start_min_.end(), 0);</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  std::sort(</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  tasks_by_start_min_.begin(), tasks_by_start_min_.end(),</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  [&](<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) { return tasks->start_min[i] < tasks->start_min[j]; });</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  event_of_task_.resize(num_tasks);</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> event = 0; <span class="keyword">event</span> < num_tasks; ++event) {</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  event_of_task_[tasks_by_start_min_[event]] = event;</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  }</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  theta_lambda_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a7b4553842be2a65d82b3f40eed71744d">Reset</a>(num_tasks);</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  </div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">// Sort nonchain tasks by start max = end_max - duration_min.</span></div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_chain_tasks = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>;</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  nonchain_tasks_by_start_max_.resize(num_tasks - num_chain_tasks);</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  std::iota(nonchain_tasks_by_start_max_.begin(),</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  nonchain_tasks_by_start_max_.end(), num_chain_tasks);</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  std::sort(nonchain_tasks_by_start_max_.begin(),</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  nonchain_tasks_by_start_max_.end(), [&tasks](<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) {</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  return tasks->end_max[i] - tasks->duration_min[i] <</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  tasks->end_max[j] - tasks->duration_min[j];</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  });</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  </div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// Detectable precedences, specialized for routes: for every task on route,</span></div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">// put all tasks before it in the tree, then push with envelope.</span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordtype">int</span> index_nonchain = 0;</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_chain_tasks; ++i) {</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">if</span> (!tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>[i]) {</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="comment">// Add all nonchain tasks detected before i.</span></div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">while</span> (index_nonchain < nonchain_tasks_by_start_max_.size()) {</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = nonchain_tasks_by_start_max_[index_nonchain];</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">if</span> (tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task] - tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task] >=</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[i] + tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[i])</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  theta_lambda_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f">AddOrUpdateEvent</a>(</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  event_of_task_[task], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task],</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task]);</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  index_nonchain++;</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  }</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  }</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">// All chain and nonchain tasks before i are now in the tree, push i.</span></div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_start_min = theta_lambda_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093">GetEnvelope</a>();</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">// Add i to the tree before updating it.</span></div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  theta_lambda_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f">AddOrUpdateEvent</a>(event_of_task_[i], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[i],</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[i],</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[i]);</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[i] = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[i], new_start_min);</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  }</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span> }</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  </div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#a7b0f3a8550bd73014e2b61899524a2ad"> 250</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a7b0f3a8550bd73014e2b61899524a2ad">DisjunctivePropagator::ForbiddenIntervals</a>(<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">if</span> (tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">forbidden_intervals</a>.empty()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size();</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = 0; task < num_tasks; ++task) {</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">if</span> (tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task] == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">if</span> (tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">forbidden_intervals</a>[task] == <span class="keyword">nullptr</span>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="comment">// If start_min forbidden, push to next feasible value.</span></div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  {</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> =</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">forbidden_intervals</a>[task]->FirstIntervalGreaterOrEqual(</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task]);</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> == tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">forbidden_intervals</a>[task]->end()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->start <= tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task]) {</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task] = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->end, 1);</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"> 266</span>  <span class="comment">// If end_max forbidden, push to next feasible value.</span></div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  {</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a> =</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task]);</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> =</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">forbidden_intervals</a>[task]->LastIntervalLessOrEqual(<a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a>);</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> == tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">forbidden_intervals</a>[task]->end()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->end >= <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a>) {</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task] =</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->start, tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task] - 1);</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  }</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  }</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task]) ></div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task]) {</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  }</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> }</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  </div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#a13e93a8cd8587377e1b8f88096e0efd0"> 286</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a13e93a8cd8587377e1b8f88096e0efd0">DisjunctivePropagator::DistanceDuration</a>(<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">if</span> (tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a7cc44fe8f5261fa7bacc58867dfb3882">distance_duration</a>.empty()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">if</span> (tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a> == 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> route_start = 0;</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> route_end = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a> - 1;</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size();</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a7cc44fe8f5261fa7bacc58867dfb3882">distance_duration</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_distance = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a7cc44fe8f5261fa7bacc58867dfb3882">distance_duration</a>[i].first;</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> minimum_break_duration = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a7cc44fe8f5261fa7bacc58867dfb3882">distance_duration</a>[i].second;</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  </div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="comment">// This is a sweeping algorithm that looks whether the union of intervals</span></div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// defined by breaks and route start/end is (-infty, +infty).</span></div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">// Those intervals are:</span></div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// - route start: (-infty, start_max + distance]</span></div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="comment">// - route end: [end_min, +infty)</span></div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="comment">// - breaks: [start_min, end_max + distance) if their duration_max</span></div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">// is >= min_duration, empty set otherwise.</span></div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="comment">// If sweeping finds that a time point can be covered by only one interval,</span></div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="comment">// it will force the corresponding break or route start/end to cover this</span></div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="comment">// point, which can force a break to be above minimum_break_duration.</span></div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  </div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="comment">// We suppose break tasks are ordered, so the algorithm supposes that</span></div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="comment">// start_min(task_n) <= start_min(task_{n+1}) and</span></div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="comment">// end_max(task_n) <= end_max(task_{n+1}).</span></div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a> + 1; task < num_tasks; ++task) {</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task] =</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task - 1]);</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = num_tasks - 2; task >= tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>; --task) {</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task] =</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task + 1]);</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  }</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="comment">// Skip breaks that cannot be performed after start.</span></div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordtype">int</span> index_break_by_emax = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>;</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordflow">while</span> (index_break_by_emax < num_tasks &&</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[index_break_by_emax] <= tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[route_start]) {</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  ++index_break_by_emax;</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  }</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="comment">// Special case: no breaks after start.</span></div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keywordflow">if</span> (index_break_by_emax == num_tasks) {</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[route_start] =</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[route_start],</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[route_end], max_distance));</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[route_end] =</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[route_end],</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[route_start], max_distance));</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  }</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="comment">// There will be a break after start, so route_start coverage is tested.</span></div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="comment">// Initial state: start at -inf with route_start in task_set.</span></div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="comment">// Sweep over profile, looking for time points where the number of</span></div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">// covering breaks is <= 1. If it is 0, fail, otherwise force the</span></div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="comment">// unique break to cover it.</span></div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="comment">// Route start and end get a special treatment, not sure generalizing</span></div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">// would be better.</span></div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> xor_active_tasks = route_start;</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordtype">int</span> num_active_tasks = 1;</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> previous_time = <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>;</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> route_start_time =</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[route_start], max_distance);</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> route_end_time = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[route_end];</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordtype">int</span> index_break_by_smin = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>;</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keywordflow">while</span> (index_break_by_emax < num_tasks) {</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment">// Find next time point among start/end of covering intervals.</span></div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> current_time =</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[index_break_by_emax], max_distance);</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">if</span> (index_break_by_smin < num_tasks) {</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  current_time =</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(current_time, tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[index_break_by_smin]);</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  }</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">if</span> (previous_time < route_start_time && route_start_time < current_time) {</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  current_time = route_start_time;</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>  <span class="keywordflow">if</span> (previous_time < route_end_time && route_end_time < current_time) {</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  current_time = route_end_time;</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  }</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="comment">// If num_active_tasks was 1, the unique active task must cover from</span></div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="comment">// previous_time to current_time.</span></div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">if</span> (num_active_tasks == 1) {</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="comment">// xor_active_tasks is the unique task that can cover [previous_time,</span></div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="comment">// current_time).</span></div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordflow">if</span> (xor_active_tasks != route_end) {</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[xor_active_tasks] =</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[xor_active_tasks],</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(current_time, max_distance));</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordflow">if</span> (xor_active_tasks != route_start) {</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[xor_active_tasks] = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[xor_active_tasks],</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  minimum_break_duration,</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(current_time, max_distance), previous_time)));</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>  }</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="comment">// Process covering intervals that start or end at current_time.</span></div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordflow">while</span> (index_break_by_smin < num_tasks &&</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  current_time == tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[index_break_by_smin]) {</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">if</span> (tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a702574cf13b54bc225f06ce3a548d4e3">duration_max</a>[index_break_by_smin] >=</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  minimum_break_duration) {</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  xor_active_tasks ^= index_break_by_smin;</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  ++num_active_tasks;</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  }</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  ++index_break_by_smin;</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  }</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">while</span> (index_break_by_emax < num_tasks &&</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  current_time ==</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[index_break_by_emax], max_distance)) {</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordflow">if</span> (tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a702574cf13b54bc225f06ce3a548d4e3">duration_max</a>[index_break_by_emax] >=</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  minimum_break_duration) {</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  xor_active_tasks ^= index_break_by_emax;</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  --num_active_tasks;</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>  ++index_break_by_emax;</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>  <span class="keywordflow">if</span> (current_time == route_start_time) {</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  xor_active_tasks ^= route_start;</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  --num_active_tasks;</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>  <span class="keywordflow">if</span> (current_time == route_end_time) {</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  xor_active_tasks ^= route_end;</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  ++num_active_tasks;</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  }</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="comment">// If num_active_tasks becomes 1, the unique active task must cover from</span></div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="comment">// current_time.</span></div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">if</span> (num_active_tasks <= 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">if</span> (num_active_tasks == 1) {</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">if</span> (xor_active_tasks != route_start) {</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="comment">// xor_active_tasks is the unique task that can cover from</span></div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="comment">// current_time to the next time point.</span></div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[xor_active_tasks] =</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[xor_active_tasks], current_time);</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">if</span> (xor_active_tasks != route_end) {</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[xor_active_tasks] = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[xor_active_tasks], minimum_break_duration);</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>  }</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  }</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  previous_time = current_time;</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  }</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  }</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordflow">return</span> <span class="keyword">true</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>  </div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#ad84e0e4ee59eab8a1004906628692ccb"> 429</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#ad84e0e4ee59eab8a1004906628692ccb">DisjunctivePropagator::ChainSpanMin</a>(<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_chain_tasks = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>;</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">if</span> (num_chain_tasks < 1) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="comment">// TODO(user): add stronger bounds.</span></div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="comment">// The duration of the chain plus that of nonchain tasks that must be</span></div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="comment">// performed during the chain is a lower bound of the chain span.</span></div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  {</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> sum_chain_durations = 0;</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keyword">const</span> <span class="keyword">auto</span> duration_start = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>.begin();</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keyword">const</span> <span class="keyword">auto</span> duration_end = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>.begin() + num_chain_tasks;</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = duration_start; it != duration_end; ++it) {</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  sum_chain_durations = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(sum_chain_durations, *it);</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  }</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> sum_forced_nonchain_durations = 0;</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = num_chain_tasks; i < tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="comment">// Tasks that can be executed before or after are skipped.</span></div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordflow">if</span> (tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[i] <= tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[0] ||</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[num_chain_tasks - 1] <= tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[i]) {</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  }</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  sum_forced_nonchain_durations =</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(sum_forced_nonchain_durations, tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[i]);</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>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#adb46102185c9230164f718650a0b580d">span_min</a> =</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#adb46102185c9230164f718650a0b580d">span_min</a>,</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(sum_chain_durations, sum_forced_nonchain_durations));</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  }</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="comment">// The difference end of the chain - start of the chain is a lower bound.</span></div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  {</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> end_minus_start =</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[num_chain_tasks - 1], tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[0]);</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#adb46102185c9230164f718650a0b580d">span_min</a> = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#adb46102185c9230164f718650a0b580d">span_min</a>, end_minus_start);</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  }</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  </div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keywordflow">return</span> tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#adb46102185c9230164f718650a0b580d">span_min</a> <= tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a5fac79041fdb19eb570b061d01b96212">span_max</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="comment">// Computes a lower bound of the span of the chain, taking into account only</span></div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span> <span class="comment">// the first nonchain task.</span></div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span> <span class="comment">// TODO(user): extend to arbitrary number of nonchain tasks.</span></div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#acf2f8cdb2a89ceee2b652aee8fa86b21"> 469</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#acf2f8cdb2a89ceee2b652aee8fa86b21">DisjunctivePropagator::ChainSpanMinDynamic</a>(<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="comment">// Do nothing if there are no chain tasks or no nonchain tasks.</span></div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_chain_tasks = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>;</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">if</span> (num_chain_tasks < 1) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">if</span> (num_chain_tasks == tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task_index = num_chain_tasks;</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">Precedences</a>(tasks)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> min_possible_chain_end = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[num_chain_tasks - 1];</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_possible_chain_start = tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[0];</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="comment">// For each chain task i, compute cumulated duration of chain tasks before it.</span></div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> total_duration = 0;</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  {</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  total_duration_before_.resize(num_chain_tasks);</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_chain_tasks; ++i) {</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  total_duration_before_[i] = total_duration;</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  total_duration = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(total_duration, tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[i]);</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</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>  <span class="comment">// Estimate span min of chain tasks. Use the schedule that ends at</span></div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="comment">// min_possible_chain_end and starts at smallest of start_max[0] or the</span></div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="comment">// threshold where pushing start[0] later does not make a difference to the</span></div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="comment">// chain span because of chain precedence constraints,</span></div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="comment">// i.e. min_possible_chain_end - total_duration.</span></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>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_span_min =</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  min_possible_chain_end -</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[0], min_possible_chain_end - total_duration);</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">if</span> (chain_span_min > tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a5fac79041fdb19eb570b061d01b96212">span_max</a>) {</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#adb46102185c9230164f718650a0b580d">span_min</a> = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#adb46102185c9230164f718650a0b580d">span_min</a>, chain_span_min);</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  }</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">// If task can be performed before or after the chain,</span></div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="comment">// span_min is chain_span_min.</span></div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordflow">if</span> (tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[task_index] <= tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[0] ||</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[num_chain_tasks - 1] <= tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[task_index]) {</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</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>  <span class="comment">// Scan all possible preemption positions of the nontask chain,</span></div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="comment">// keep the one that yields the minimum span.</span></div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> span_min = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordtype">bool</span> schedule_is_feasible = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_chain_tasks; ++i) {</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">if</span> (!tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>[i]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="comment">// Estimate span min if tasks is performed during i.</span></div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="comment">// For all possible minimal-span schedules, there is a schedule where task i</span></div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="comment">// and nonchain task form a single block. Thus, we only consider those.</span></div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> block_start_min =</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[i],</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task_index] - tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[i]);</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> block_start_max =</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[task_index],</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[i] - tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task_index]);</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">if</span> (block_start_min > block_start_max) <span class="keywordflow">continue</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="comment">// Compute the block start that yields the minimal span.</span></div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="comment">// Given a feasible block start, a chain of minimum span constrained to</span></div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="comment">// this particular block start can be obtained by scheduling all tasks after</span></div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="comment">// the block at their earliest, and all tasks before it at their latest.</span></div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="comment">// The span can be decomposed into two parts: the head, which are the</span></div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="comment">// tasks that are before the block, and the tail, which are the block and</span></div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="comment">// the tasks after it.</span></div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="comment">// When the block start varies, the head length of the optimal schedule</span></div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="comment">// described above decreases as much as the block start decreases, until</span></div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="comment">// an inflection point at which it stays constant. That inflection value</span></div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="comment">// is the one where the precedence constraints force the chain start to</span></div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="comment">// decrease because of durations.</span></div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> head_inflection =</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  max_possible_chain_start + total_duration_before_[i];</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="comment">// The map from block start to minimal tail length also has an inflection</span></div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="comment">// point, that additionally depends on the nonchain task's duration.</span></div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> tail_inflection = min_possible_chain_end -</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  (total_duration - total_duration_before_[i]) -</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task_index];</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="comment">// All block start values between these two yield the same minimal span.</span></div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="comment">// Indeed, first, mind that the inflection points might be in any order.</span></div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="comment">// - if head_inflection < tail_inflection, then inside the interval</span></div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="comment">// [head_inflection, tail_inflection], increasing the block start by delta</span></div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="comment">// decreases the tail length by delta and increases the head length by</span></div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="comment">// delta too.</span></div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="comment">// - if tail_inflection < head_inflection, then inside the interval</span></div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="comment">// [tail_inflection, head_inflection], head length is constantly at</span></div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="comment">// total_duration_before_[i], and tail length is also constant.</span></div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="comment">// In both cases, outside of the interval, one part is constant and the</span></div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="comment">// other increases as much as the distance to the interval.</span></div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="comment">// We can abstract inflection point to the interval they form.</span></div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> optimal_interval_min_start =</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(head_inflection, tail_inflection);</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> optimal_interval_max_start =</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(head_inflection, tail_inflection);</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="comment">// If the optimal interval for block start intersects the feasible interval,</span></div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="comment">// we can select any point within it, for instance the earliest one.</span></div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> block_start = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(optimal_interval_min_start, block_start_min);</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="comment">// If the intervals do not intersect, the feasible value closest to the</span></div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="comment">// optimal interval has the minimal span, because the span increases as</span></div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="comment">// much as the distance to the optimal interval.</span></div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keywordflow">if</span> (optimal_interval_max_start < block_start_min) {</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="comment">// Optimal interval is before feasible interval, closest is feasible min.</span></div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  block_start = block_start_min;</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (block_start_max < optimal_interval_min_start) {</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="comment">// Optimal interval is after feasible interval, closest is feasible max.</span></div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  block_start = block_start_max;</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  }</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="comment">// Compute span for the chosen block start.</span></div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> head_duration =</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(block_start, head_inflection) - max_possible_chain_start;</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> tail_duration =</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  min_possible_chain_end - <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(block_start, tail_inflection);</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> optimal_span_at_i = head_duration + tail_duration;</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  span_min = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(span_min, optimal_span_at_i);</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  schedule_is_feasible = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  }</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keywordflow">if</span> (!schedule_is_feasible || span_min > tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a5fac79041fdb19eb570b061d01b96212">span_max</a>) {</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#adb46102185c9230164f718650a0b580d">span_min</a> = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#adb46102185c9230164f718650a0b580d">span_min</a>, span_min);</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  }</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span> }</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  </div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a2393ae34fa859cdfb9b671489858030f"> 590</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#a2393ae34fa859cdfb9b671489858030f">AppendTasksFromPath</a>(<span class="keyword">const</span> std::vector<int64>& path,</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_travel_bounds.html">TravelBounds</a>& travel_bounds,</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>& dimension,</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">DisjunctivePropagator::Tasks</a>* tasks) {</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = path.size();</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(travel_bounds.<a class="code" href="structoperations__research_1_1_travel_bounds.html#abca7c77375a78b314c7a1c59cf82d3c8">pre_travels</a>.size(), num_nodes - 1);</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(travel_bounds.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a55ce83aba1e381a608a0b9bdf8dda426">post_travels</a>.size(), num_nodes - 1);</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_nodes; ++i) {</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_min = dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(path[i])-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>();</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_max = dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(path[i])-><a class="code" href="classoperations__research_1_1_int_expr.html#a6dc4d5cdc2ed0da18452a65c5bf69e0d">Max</a>();</div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="comment">// Add task associated to visit i.</span></div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="comment">// Visits start at Cumul(path[i]) - before_visit</span></div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="comment">// and end at Cumul(path[i]) + after_visit</span></div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  {</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> before_visit =</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  (i == 0) ? 0 : travel_bounds.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a55ce83aba1e381a608a0b9bdf8dda426">post_travels</a>[i - 1];</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> after_visit =</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  (i == num_nodes - 1) ? 0 : travel_bounds.<a class="code" href="structoperations__research_1_1_travel_bounds.html#abca7c77375a78b314c7a1c59cf82d3c8">pre_travels</a>[i];</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  </div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.push_back(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(cumul_min, before_visit));</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>.push_back(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(cumul_max, before_visit));</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>.push_back(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(before_visit, after_visit));</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a702574cf13b54bc225f06ce3a548d4e3">duration_max</a>.push_back(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(before_visit, after_visit));</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>.push_back(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul_min, after_visit));</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>.push_back(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul_max, after_visit));</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.push_back(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  }</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keywordflow">if</span> (i == num_nodes - 1) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  </div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="comment">// Tasks from travels.</span></div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">// A travel task starts at Cumul(path[i]) + pre_travel,</span></div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="comment">// last for FixedTransitVar(path[i]) - pre_travel - post_travel,</span></div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="comment">// and must end at the latest at Cumul(path[i+1]) - post_travel.</span></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>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pre_travel = travel_bounds.<a class="code" href="structoperations__research_1_1_travel_bounds.html#abca7c77375a78b314c7a1c59cf82d3c8">pre_travels</a>[i];</div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> post_travel = travel_bounds.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a55ce83aba1e381a608a0b9bdf8dda426">post_travels</a>[i];</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.push_back(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul_min, pre_travel));</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>.push_back(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul_max, pre_travel));</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>.push_back(</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  std::max<int64>(0, <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(travel_bounds.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a4bf199080092cf9464f80c861bfee413">min_travels</a>[i],</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(pre_travel, post_travel))));</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a702574cf13b54bc225f06ce3a548d4e3">duration_max</a>.push_back(</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  travel_bounds.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a3535b65e25ad7ea4781e7d44cbc978b8">max_travels</a>[i] == <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  ? <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  : std::max<int64>(0, <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(travel_bounds.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a3535b65e25ad7ea4781e7d44cbc978b8">max_travels</a>[i],</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(pre_travel, post_travel))));</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>.push_back(</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(path[i + 1])-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>(), post_travel));</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>.push_back(</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(path[i + 1])-><a class="code" href="classoperations__research_1_1_int_expr.html#a6dc4d5cdc2ed0da18452a65c5bf69e0d">Max</a>(), post_travel));</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.push_back(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  }</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  }</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span> }</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  </div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a599f513ba4c5233c5789bc243ac53ca2"> 645</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#a599f513ba4c5233c5789bc243ac53ca2">FillTravelBoundsOfVehicle</a>(<span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::vector<int64>& path,</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>& dimension,</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <a class="code" href="structoperations__research_1_1_travel_bounds.html">TravelBounds</a>* travel_bounds) {</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="comment">// Fill path and min/max/pre/post travel bounds.</span></div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <a class="code" href="namespaceoperations__research.html#ad13d20d0a1737677a4757bd6ef8a95b3">FillPathEvaluation</a>(path, dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#aae1962408e06dbb45f6e5ee67e530880">transit_evaluator</a>(vehicle),</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  &travel_bounds-><a class="code" href="structoperations__research_1_1_travel_bounds.html#a4bf199080092cf9464f80c861bfee413">min_travels</a>);</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_travels = travel_bounds-><a class="code" href="structoperations__research_1_1_travel_bounds.html#a4bf199080092cf9464f80c861bfee413">min_travels</a>.size();</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  travel_bounds-><a class="code" href="structoperations__research_1_1_travel_bounds.html#a3535b65e25ad7ea4781e7d44cbc978b8">max_travels</a>.assign(num_travels, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  {</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a8e93e99ce491f2779c0d2e5e7de5a98a">GetPreTravelEvaluatorOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == -1) {</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  travel_bounds-><a class="code" href="structoperations__research_1_1_travel_bounds.html#abca7c77375a78b314c7a1c59cf82d3c8">pre_travels</a>.assign(num_travels, 0);</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <a class="code" href="namespaceoperations__research.html#ad13d20d0a1737677a4757bd6ef8a95b3">FillPathEvaluation</a>(path, dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#ad558398f8c75f81d879f74d18ba5e7c3">TransitCallback</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>),</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  &travel_bounds-><a class="code" href="structoperations__research_1_1_travel_bounds.html#abca7c77375a78b314c7a1c59cf82d3c8">pre_travels</a>);</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  }</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  }</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  {</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#afb4c32e76561cad95bd8be2777d8f1ac">GetPostTravelEvaluatorOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == -1) {</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  travel_bounds-><a class="code" href="structoperations__research_1_1_travel_bounds.html#a55ce83aba1e381a608a0b9bdf8dda426">post_travels</a>.assign(num_travels, 0);</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <a class="code" href="namespaceoperations__research.html#ad13d20d0a1737677a4757bd6ef8a95b3">FillPathEvaluation</a>(path, dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#ad558398f8c75f81d879f74d18ba5e7c3">TransitCallback</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>),</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  &travel_bounds-><a class="code" href="structoperations__research_1_1_travel_bounds.html#a55ce83aba1e381a608a0b9bdf8dda426">post_travels</a>);</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  }</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  }</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span> }</div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  </div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a6a8bc2370087a30d5a122524bafa867b"> 673</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#a6a8bc2370087a30d5a122524bafa867b">AppendTasksFromIntervals</a>(<span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">DisjunctivePropagator::Tasks</a>* tasks) {</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_interval_var.html">IntervalVar</a>* <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> : intervals) {</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keywordflow">if</span> (!<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>-><a class="code" href="classoperations__research_1_1_interval_var.html#a7f7f661e9b94f25f706732924e0f01e9">MustBePerformed</a>()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.push_back(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>-><a class="code" href="classoperations__research_1_1_interval_var.html#a962c32883b6e5af795e295cf2744df10">StartMin</a>());</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>.push_back(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>-><a class="code" href="classoperations__research_1_1_interval_var.html#a0a4c6ed965a6e5221ed1ce6177da7f6b">StartMax</a>());</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>.push_back(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>-><a class="code" href="classoperations__research_1_1_interval_var.html#ad793719634e2716798692d4e3d6113b5">DurationMin</a>());</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a702574cf13b54bc225f06ce3a548d4e3">duration_max</a>.push_back(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>-><a class="code" href="classoperations__research_1_1_interval_var.html#a43b02df74a6f6ed9719c4e3c0f1fa8ce">DurationMax</a>());</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>.push_back(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>-><a class="code" href="classoperations__research_1_1_interval_var.html#abbd293afc60381f8ff32477a20506bc1">EndMin</a>());</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>.push_back(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>-><a class="code" href="classoperations__research_1_1_interval_var.html#a4d64f6d586f2dffde03a5e6733895265">EndMax</a>());</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  tasks-><a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.push_back(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  }</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span> }</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  </div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#acb1ca5666c8795f29fc71c28d7bb0386"> 687</a></span> <a class="code" href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#acb1ca5666c8795f29fc71c28d7bb0386">GlobalVehicleBreaksConstraint::GlobalVehicleBreaksConstraint</a>(</div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension)</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  : <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>(dimension-><a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->solver()),</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  model_(dimension-><a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()),</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  dimension_(dimension) {</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  vehicle_demons_.resize(model_-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>());</div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span> }</div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  </div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#a19d94d32f3bde30deeebb883c6f71f84"> 695</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#a19d94d32f3bde30deeebb883c6f71f84">GlobalVehicleBreaksConstraint::Post</a>() {</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < model_-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); vehicle++) {</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keywordflow">if</span> (dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle).empty() &&</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a20cb44a14b6119a99fdcef3b594629e8">GetBreakDistanceDurationOfVehicle</a>(vehicle).empty()) {</div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  }</div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  vehicle_demons_[vehicle] = <a class="code" href="namespaceoperations__research.html#a11f4a7dbafd8e00a36b892a82e44445f">MakeDelayedConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <a class="code" href="classoperations__research_1_1_propagation_base_object.html#a5f32c22c620c811754ba7b6f977db864">solver</a>(), <span class="keyword">this</span>, &GlobalVehicleBreaksConstraint::PropagateVehicle,</div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="stringliteral">"PropagateVehicle"</span>, vehicle);</div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_interval_var.html">IntervalVar</a>* <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> :</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle)) {</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->WhenAnything(vehicle_demons_[vehicle]);</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  }</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  }</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_cumuls = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a1b6f521fdc9dff38b7e065c838fa54a3">cumuls</a>().size();</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nexts = model_-><a class="code" href="classoperations__research_1_1_routing_model.html#aad154b31953d2b467bbac3e4ac696cd6">Nexts</a>().size();</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < num_cumuls; node++) {</div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <a class="code" href="classoperations__research_1_1_demon.html">Demon</a>* dimension_demon = <a class="code" href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <a class="code" href="classoperations__research_1_1_propagation_base_object.html#a5f32c22c620c811754ba7b6f977db864">solver</a>(), <span class="keyword">this</span>, &GlobalVehicleBreaksConstraint::PropagateNode,</div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="stringliteral">"PropagateNode"</span>, node);</div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keywordflow">if</span> (node < num_nexts) {</div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">NextVar</a>(node)-><a class="code" href="classoperations__research_1_1_int_var.html#a6e33a313eaf507bae0eb7068455a5bdc">WhenBound</a>(dimension_demon);</div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(node)-><a class="code" href="classoperations__research_1_1_int_expr.html#af13b2ea301c6800bb6d43bd70716bf6d">WhenRange</a>(dimension_demon);</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  }</div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a8cded3d3d6746c179a8ec0eddad24342">VehicleVar</a>(node)-><a class="code" href="classoperations__research_1_1_int_var.html#a6e33a313eaf507bae0eb7068455a5bdc">WhenBound</a>(dimension_demon);</div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(node)-><a class="code" href="classoperations__research_1_1_int_expr.html#af13b2ea301c6800bb6d43bd70716bf6d">WhenRange</a>(dimension_demon);</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> }</div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  </div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#a36d844f2722273b190ed9a069dd25938"> 724</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#a36d844f2722273b190ed9a069dd25938">GlobalVehicleBreaksConstraint::InitialPropagate</a>() {</div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < model_-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); vehicle++) {</div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keywordflow">if</span> (!dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle).empty() ||</div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  !dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a20cb44a14b6119a99fdcef3b594629e8">GetBreakDistanceDurationOfVehicle</a>(vehicle).empty()) {</div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  PropagateVehicle(vehicle);</div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  }</div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  }</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span> }</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  </div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span> <span class="comment">// This dispatches node events to the right vehicle propagator.</span></div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span> <span class="comment">// It also filters out a part of uninteresting events, on which the vehicle</span></div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span> <span class="comment">// propagator will not find anything new.</span></div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span> <span class="keywordtype">void</span> GlobalVehicleBreaksConstraint::PropagateNode(<span class="keywordtype">int</span> node) {</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keywordflow">if</span> (!model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a8cded3d3d6746c179a8ec0eddad24342">VehicleVar</a>(node)-><a class="code" href="classoperations__research_1_1_int_expr.html#a1d04569b37cb7fe6ed0956ab71e08bc9">Bound</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a8cded3d3d6746c179a8ec0eddad24342">VehicleVar</a>(node)-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>();</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="keywordflow">if</span> (vehicle < 0 || vehicle_demons_[vehicle] == <span class="keyword">nullptr</span>) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <a class="code" href="classoperations__research_1_1_propagation_base_object.html#a173cbf153462b14f9b57362d2c45638a">EnqueueDelayedDemon</a>(vehicle_demons_[vehicle]);</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span> }</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  </div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span> <span class="keywordtype">void</span> GlobalVehicleBreaksConstraint::FillPartialPathOfVehicle(<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  path_.clear();</div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="keywordtype">int</span> current = model_-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="keywordflow">while</span> (!model_-><a class="code" href="classoperations__research_1_1_routing_model.html#ae2530e17cabaf267e12929ca0ee1bee0">IsEnd</a>(current)) {</div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  path_.push_back(current);</div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  current = model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">NextVar</a>(current)-><a class="code" href="classoperations__research_1_1_int_expr.html#a1d04569b37cb7fe6ed0956ab71e08bc9">Bound</a>()</div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  ? model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">NextVar</a>(current)-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>()</div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  : model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle);</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>  path_.push_back(current);</div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span> }</div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  </div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span> <span class="keywordtype">void</span> GlobalVehicleBreaksConstraint::FillPathTravels(</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="keyword">const</span> std::vector<int64>& path) {</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_travels = path.size() - 1;</div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a4bf199080092cf9464f80c861bfee413">min_travels</a>.resize(num_travels);</div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a3535b65e25ad7ea4781e7d44cbc978b8">max_travels</a>.resize(num_travels);</div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_travels; ++i) {</div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a4bf199080092cf9464f80c861bfee413">min_travels</a>[i] = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a5997ca01d12b18b158ac0232acc731dd">FixedTransitVar</a>(path[i])-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>();</div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a3535b65e25ad7ea4781e7d44cbc978b8">max_travels</a>[i] = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a5997ca01d12b18b158ac0232acc731dd">FixedTransitVar</a>(path[i])-><a class="code" href="classoperations__research_1_1_int_expr.html#a6dc4d5cdc2ed0da18452a65c5bf69e0d">Max</a>();</div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  }</div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span> }</div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  </div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span> <span class="comment">// First, perform energy-based reasoning on intervals and cumul variables.</span></div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span> <span class="comment">// Then, perform reasoning on slack variables.</span></div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span> <span class="keywordtype">void</span> GlobalVehicleBreaksConstraint::PropagateVehicle(<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="comment">// Fill path and pre/post travel information.</span></div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  FillPartialPathOfVehicle(vehicle);</div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = path_.size();</div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  FillPathTravels(path_);</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  {</div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a8e93e99ce491f2779c0d2e5e7de5a98a">GetPreTravelEvaluatorOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == -1) {</div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#abca7c77375a78b314c7a1c59cf82d3c8">pre_travels</a>.assign(num_nodes - 1, 0);</div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <a class="code" href="namespaceoperations__research.html#ad13d20d0a1737677a4757bd6ef8a95b3">FillPathEvaluation</a>(path_, model_-><a class="code" href="classoperations__research_1_1_routing_model.html#ad558398f8c75f81d879f74d18ba5e7c3">TransitCallback</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>),</div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  &travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#abca7c77375a78b314c7a1c59cf82d3c8">pre_travels</a>);</div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  }</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  }</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  {</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#afb4c32e76561cad95bd8be2777d8f1ac">GetPostTravelEvaluatorOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == -1) {</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a55ce83aba1e381a608a0b9bdf8dda426">post_travels</a>.assign(num_nodes - 1, 0);</div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <a class="code" href="namespaceoperations__research.html#ad13d20d0a1737677a4757bd6ef8a95b3">FillPathEvaluation</a>(path_, model_-><a class="code" href="classoperations__research_1_1_routing_model.html#ad558398f8c75f81d879f74d18ba5e7c3">TransitCallback</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>),</div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  &travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a55ce83aba1e381a608a0b9bdf8dda426">post_travels</a>);</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  }</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">// The last travel might not be fixed: in that case, relax its information.</span></div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keywordflow">if</span> (!model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">NextVar</a>(path_[num_nodes - 2])-><a class="code" href="classoperations__research_1_1_int_expr.html#a1d04569b37cb7fe6ed0956ab71e08bc9">Bound</a>()) {</div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a4bf199080092cf9464f80c861bfee413">min_travels</a>.back() = 0;</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a3535b65e25ad7ea4781e7d44cbc978b8">max_travels</a>.back() = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#abca7c77375a78b314c7a1c59cf82d3c8">pre_travels</a>.back() = 0;</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a55ce83aba1e381a608a0b9bdf8dda426">post_travels</a>.back() = 0;</div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  }</div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  </div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="comment">// Fill tasks from path, break intervals, and break constraints.</span></div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  tasks_.<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <a class="code" href="namespaceoperations__research.html#a2393ae34fa859cdfb9b671489858030f">AppendTasksFromPath</a>(path_, travel_bounds_, *dimension_, &tasks_);</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  tasks_.<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a> = tasks_.<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size();</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <a class="code" href="namespaceoperations__research.html#a6a8bc2370087a30d5a122524bafa867b">AppendTasksFromIntervals</a>(dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle),</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  &tasks_);</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  tasks_.<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a7cc44fe8f5261fa7bacc58867dfb3882">distance_duration</a> =</div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a20cb44a14b6119a99fdcef3b594629e8">GetBreakDistanceDurationOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  </div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="comment">// Do the actual reasoning, no need to continue if infeasible.</span></div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keywordflow">if</span> (!disjunctive_propagator_.<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a8a31c563d28e1ebe7c9e140f15fea586">Propagate</a>(&tasks_)) <a class="code" href="classoperations__research_1_1_propagation_base_object.html#a5f32c22c620c811754ba7b6f977db864">solver</a>()-><a class="code" href="classoperations__research_1_1_solver.html#aeb92d4addb41255c9732cacfcb54f795">Fail</a>();</div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  </div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="comment">// Make task translators to help set new bounds of CP variables.</span></div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  task_translators_.clear();</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_nodes; ++i) {</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> before_visit =</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  (i == 0) ? 0 : travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a55ce83aba1e381a608a0b9bdf8dda426">post_travels</a>[i - 1];</div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> after_visit =</div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  (i == num_nodes - 1) ? 0 : travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#abca7c77375a78b314c7a1c59cf82d3c8">pre_travels</a>[i];</div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  task_translators_.emplace_back(dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(path_[i]), before_visit,</div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  after_visit);</div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="keywordflow">if</span> (i == num_nodes - 1) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  task_translators_.emplace_back(); <span class="comment">// Dummy translator for travel tasks.</span></div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  }</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="keywordflow">for</span> (IntervalVar* <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> :</div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle)) {</div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keywordflow">if</span> (!<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  task_translators_.emplace_back(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>);</div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  }</div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  </div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="comment">// Push new bounds to CP variables.</span></div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks_.<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>.size();</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = 0; task < num_tasks; ++task) {</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  task_translators_[task].SetStartMin(tasks_.<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">start_min</a>[task]);</div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  task_translators_[task].SetStartMax(tasks_.<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">start_max</a>[task]);</div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  task_translators_[task].SetDurationMin(tasks_.<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">duration_min</a>[task]);</div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  task_translators_[task].SetEndMin(tasks_.<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">end_min</a>[task]);</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  task_translators_[task].SetEndMax(tasks_.<a class="code" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">end_max</a>[task]);</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  }</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  </div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="comment">// Reasoning on slack variables: when intervals must be inside an arc,</span></div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="comment">// that arc's slack must be large enough to accommodate for those.</span></div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="comment">// TODO(user): Make a version more efficient than O(n^2).</span></div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keywordflow">if</span> (dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle).empty()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="comment">// If the last arc of the path was not bound, do not change slack.</span></div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> last_bound_arc =</div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  num_nodes - 2 - (model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">NextVar</a>(path_[num_nodes - 2])-><a class="code" href="classoperations__research_1_1_int_expr.html#a1d04569b37cb7fe6ed0956ab71e08bc9">Bound</a>() ? 0 : 1);</div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i <= last_bound_arc; ++i) {</div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> arc_start_max =</div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(path_[i])-><a class="code" href="classoperations__research_1_1_int_expr.html#a6dc4d5cdc2ed0da18452a65c5bf69e0d">Max</a>(),</div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  i > 0 ? travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a55ce83aba1e381a608a0b9bdf8dda426">post_travels</a>[i - 1] : 0);</div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> arc_end_min =</div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(path_[i + 1])-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>(),</div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  i < num_nodes - 2 ? travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#abca7c77375a78b314c7a1c59cf82d3c8">pre_travels</a>[i + 1] : 0);</div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> total_break_inside_arc = 0;</div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keywordflow">for</span> (IntervalVar* <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> :</div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle)) {</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keywordflow">if</span> (!<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> interval_start_max = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMax();</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> interval_end_min = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMin();</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> interval_duration_min = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DurationMin();</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="comment">// If interval cannot end before the arc's from node and</span></div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="comment">// cannot start after the 'to' node, then it must be inside the arc.</span></div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="keywordflow">if</span> (arc_start_max < interval_end_min &&</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  interval_start_max < arc_end_min) {</div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  total_break_inside_arc += interval_duration_min;</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  }</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  }</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(path_[i])-><a class="code" href="classoperations__research_1_1_int_expr.html#a253ec9a9ed6b56ac4de714373ebf91f9">SetMin</a>(total_break_inside_arc);</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  }</div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="comment">// Reasoning on optional intervals.</span></div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="comment">// TODO(user): merge this with energy-based reasoning.</span></div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="comment">// If there is no optional interval, skip the rest of this function.</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"> 873</span>  <span class="keywordtype">bool</span> has_optional = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntervalVar* <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> :</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle)) {</div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MayBePerformed() && !<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed()) {</div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  has_optional = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  }</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  }</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="keywordflow">if</span> (!has_optional) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  }</div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="keyword">const</span> std::vector<IntervalVar*>& break_intervals =</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < num_nodes - 1; ++pos) {</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> current_slack_max = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(path_[pos])-><a class="code" href="classoperations__research_1_1_int_expr.html#a6dc4d5cdc2ed0da18452a65c5bf69e0d">Max</a>();</div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> visit_start_offset =</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  pos > 0 ? travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a55ce83aba1e381a608a0b9bdf8dda426">post_travels</a>[pos - 1] : 0;</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> visit_start_max =</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(path_[pos])-><a class="code" href="classoperations__research_1_1_int_expr.html#a6dc4d5cdc2ed0da18452a65c5bf69e0d">Max</a>(), visit_start_offset);</div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> visit_end_offset =</div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  (pos < num_nodes - 1) ? travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#abca7c77375a78b314c7a1c59cf82d3c8">pre_travels</a>[pos] : 0;</div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> visit_end_min =</div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(path_[pos])-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>(), visit_end_offset);</div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  </div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordflow">for</span> (IntervalVar* <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> : break_intervals) {</div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keywordflow">if</span> (!<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MayBePerformed()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> interval_is_performed = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed();</div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> interval_start_max = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMax();</div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> interval_end_min = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMin();</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> interval_duration_min = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DurationMin();</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="comment">// When interval cannot fit inside current arc,</span></div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="comment">// do disjunctive reasoning on full arc.</span></div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keywordflow">if</span> (pos < num_nodes - 1 && interval_duration_min > current_slack_max) {</div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="comment">// The arc lasts from CumulVar(path_[pos]) - post_travel_[pos] to</span></div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="comment">// CumulVar(path_[pos+1]) + pre_travel_[pos+1].</span></div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> arc_start_offset =</div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  pos > 0 ? travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#a55ce83aba1e381a608a0b9bdf8dda426">post_travels</a>[pos - 1] : 0;</div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> arc_start_max = visit_start_max;</div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> arc_end_offset =</div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  (pos < num_nodes - 2) ? travel_bounds_.<a class="code" href="structoperations__research_1_1_travel_bounds.html#abca7c77375a78b314c7a1c59cf82d3c8">pre_travels</a>[pos + 1] : 0;</div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> arc_end_min =</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(path_[pos + 1])-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>(), arc_end_offset);</div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="comment">// Interval not before.</span></div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keywordflow">if</span> (arc_start_max < interval_end_min) {</div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->SetStartMin(arc_end_min);</div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keywordflow">if</span> (interval_is_performed) {</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(path_[pos + 1])</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  -><a class="code" href="classoperations__research_1_1_int_expr.html#a0034062c82083a6c0af5aae1859ef66b">SetMax</a>(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(interval_start_max, arc_end_offset));</div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  }</div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  }</div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="comment">// Interval not after.</span></div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="keywordflow">if</span> (interval_start_max < arc_end_min) {</div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->SetEndMax(arc_start_max);</div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="keywordflow">if</span> (interval_is_performed) {</div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(path_[pos])</div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  -><a class="code" href="classoperations__research_1_1_int_expr.html#a253ec9a9ed6b56ac4de714373ebf91f9">SetMin</a>(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(interval_end_min, arc_start_offset));</div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  }</div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  }</div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  }</div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="comment">// Interval could fit inside arc: do disjunctive reasoning between</span></div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="comment">// interval and visit.</span></div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="comment">// Interval not before.</span></div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keywordflow">if</span> (visit_start_max < interval_end_min) {</div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->SetStartMin(visit_end_min);</div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="keywordflow">if</span> (interval_is_performed) {</div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(path_[pos])</div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  -><a class="code" href="classoperations__research_1_1_int_expr.html#a0034062c82083a6c0af5aae1859ef66b">SetMax</a>(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(interval_start_max, visit_end_offset));</div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  }</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  }</div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="comment">// Interval not after.</span></div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <span class="keywordflow">if</span> (interval_start_max < visit_end_min) {</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->SetEndMax(visit_start_max);</div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keywordflow">if</span> (interval_is_performed) {</div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(path_[pos])</div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  -><a class="code" href="classoperations__research_1_1_int_expr.html#a253ec9a9ed6b56ac4de714373ebf91f9">SetMin</a>(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(interval_end_min, visit_start_offset));</div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  }</div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  }</div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  }</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  }</div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span> }</div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  </div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span> <span class="keyword">class </span>VehicleBreaksFilter : <span class="keyword">public</span> BasePathFilter {</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  VehicleBreaksFilter(<span class="keyword">const</span> RoutingModel& routing_model,</div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="keyword">const</span> RoutingDimension& dimension);</div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  std::string DebugString()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"VehicleBreaksFilter"</span>; }</div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="keywordtype">bool</span> AcceptPath(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  </div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <span class="comment">// Fills path_ with the path of vehicle, start to end.</span></div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="keywordtype">void</span> FillPathOfVehicle(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> vehicle);</div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  std::vector<int64> path_;</div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="comment">// Handles to model.</span></div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <span class="keyword">const</span> RoutingModel& model_;</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keyword">const</span> RoutingDimension& dimension_;</div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="comment">// Strong energy-based filtering algorithm.</span></div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  DisjunctivePropagator disjunctive_propagator_;</div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  DisjunctivePropagator::Tasks tasks_;</div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  <span class="comment">// Used to check whether propagation changed a vector.</span></div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  std::vector<int64> old_start_min_;</div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  std::vector<int64> old_start_max_;</div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  std::vector<int64> old_end_min_;</div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  std::vector<int64> old_end_max_;</div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  </div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  std::vector<int> start_to_vehicle_;</div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  TravelBounds travel_bounds_;</div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span> };</div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  </div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span> VehicleBreaksFilter::VehicleBreaksFilter(<span class="keyword">const</span> RoutingModel& routing_model,</div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="keyword">const</span> RoutingDimension& dimension)</div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  : BasePathFilter(routing_model.Nexts(),</div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  routing_model.Size() + routing_model.vehicles()),</div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  model_(routing_model),</div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  dimension_(dimension) {</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(dimension_.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a6debc638c02bfb2b4afe0afccdd98ca5">HasBreakConstraints</a>());</div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  start_to_vehicle_.resize(Size(), -1);</div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < routing_model.vehicles(); ++i) {</div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  start_to_vehicle_[routing_model.Start(i)] = i;</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  }</div>
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span> }</div>
|
|
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  </div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span> <span class="keywordtype">void</span> VehicleBreaksFilter::FillPathOfVehicle(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> vehicle) {</div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  path_.clear();</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="keywordtype">int</span> current = model_.<a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="keywordflow">while</span> (!model_.<a class="code" href="classoperations__research_1_1_routing_model.html#ae2530e17cabaf267e12929ca0ee1bee0">IsEnd</a>(current)) {</div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  path_.push_back(current);</div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  current = GetNext(current);</div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  }</div>
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  path_.push_back(current);</div>
|
|
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span> }</div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  </div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span> <span class="keywordtype">bool</span> VehicleBreaksFilter::AcceptPath(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) {</div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = start_to_vehicle_[path_start];</div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  <span class="keywordflow">if</span> (dimension_.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle).empty() &&</div>
|
|
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  dimension_.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a20cb44a14b6119a99fdcef3b594629e8">GetBreakDistanceDurationOfVehicle</a>(vehicle).empty()) {</div>
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  }</div>
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  <span class="comment">// Fill path and pre/post travel information.</span></div>
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  FillPathOfVehicle(vehicle);</div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <a class="code" href="namespaceoperations__research.html#a599f513ba4c5233c5789bc243ac53ca2">FillTravelBoundsOfVehicle</a>(vehicle, path_, dimension_, &travel_bounds_);</div>
|
|
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <span class="comment">// Fill tasks from path, forbidden intervals, breaks and break constraints.</span></div>
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  tasks_.Clear();</div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <a class="code" href="namespaceoperations__research.html#a2393ae34fa859cdfb9b671489858030f">AppendTasksFromPath</a>(path_, travel_bounds_, dimension_, &tasks_);</div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  tasks_.num_chain_tasks = tasks_.start_min.size();</div>
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <a class="code" href="namespaceoperations__research.html#a6a8bc2370087a30d5a122524bafa867b">AppendTasksFromIntervals</a>(dimension_.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle),</div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  &tasks_);</div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <span class="comment">// Add forbidden intervals only if a node has some.</span></div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  tasks_.forbidden_intervals.clear();</div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <span class="keywordflow">if</span> (std::any_of(path_.begin(), path_.end(), [<span class="keyword">this</span>](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node) {</div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  return dimension_.forbidden_intervals()[node].NumIntervals() > 0;</div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  })) {</div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  tasks_.forbidden_intervals.assign(tasks_.start_min.size(), <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < path_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  tasks_.forbidden_intervals[2 * i] =</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  &(dimension_.<a class="code" href="classoperations__research_1_1_routing_dimension.html#aff15c149ac7cbb96d340d8c1370d5aea">forbidden_intervals</a>()[path_[i]]);</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  }</div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  }</div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="comment">// Max distance duration constraint.</span></div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  tasks_.distance_duration =</div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  dimension_.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a20cb44a14b6119a99fdcef3b594629e8">GetBreakDistanceDurationOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  </div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="comment">// Reduce bounds until failure or fixed point is reached.</span></div>
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="comment">// We set a maximum amount of iterations to avoid slow propagation.</span></div>
|
|
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="keywordtype">bool</span> is_feasible = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <span class="keywordtype">int</span> maximum_num_iterations = 8;</div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="keywordflow">while</span> (--maximum_num_iterations >= 0) {</div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  old_start_min_ = tasks_.start_min;</div>
|
|
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  old_start_max_ = tasks_.start_max;</div>
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  old_end_min_ = tasks_.end_min;</div>
|
|
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  old_end_max_ = tasks_.end_max;</div>
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  is_feasible = disjunctive_propagator_.<a class="code" href="classoperations__research_1_1_disjunctive_propagator.html#a8a31c563d28e1ebe7c9e140f15fea586">Propagate</a>(&tasks_);</div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="keywordflow">if</span> (!is_feasible) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="comment">// If fixed point reached, stop.</span></div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="keywordflow">if</span> ((old_start_min_ == tasks_.start_min) &&</div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  (old_start_max_ == tasks_.start_max) &&</div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  (old_end_min_ == tasks_.end_min) && (old_end_max_ == tasks_.end_max)) {</div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  }</div>
|
|
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  }</div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="keywordflow">return</span> is_feasible;</div>
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span> }</div>
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  </div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  </div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a447588dfd4d5f539ec22f403e21ca668"> 1060</a></span> <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html">IntVarLocalSearchFilter</a>* <a class="code" href="namespaceoperations__research.html#a447588dfd4d5f539ec22f403e21ca668">MakeVehicleBreaksFilter</a>(</div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>& routing_model, <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>& dimension) {</div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  <span class="keywordflow">return</span> routing_model.<a class="code" href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">solver</a>()-><a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(</div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <span class="keyword">new</span> VehicleBreaksFilter(routing_model, dimension));</div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span> }</div>
|
|
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  </div>
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</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_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_a4395e95bab44e222cb2e77251017a0e2"><div class="ttname"><a href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a></div><div class="ttdeci">#define DCHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00887">base/logging.h:887</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="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_constraint_html"><div class="ttname"><a href="classoperations__research_1_1_constraint.html">operations_research::Constraint</a></div><div class="ttdoc">A constraint is the main modeling object.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03584">constraint_solver.h:3584</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_demon_html"><div class="ttname"><a href="classoperations__research_1_1_demon.html">operations_research::Demon</a></div><div class="ttdoc">A Demon is the base element of a propagation queue.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03301">constraint_solver.h:3301</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_a08f43a826695abdbdad1c608cb90b25a"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#a08f43a826695abdbdad1c608cb90b25a">operations_research::DisjunctivePropagator::EdgeFinding</a></div><div class="ttdeci">bool EdgeFinding(Tasks *tasks)</div><div class="ttdoc">Does edge-finding deductions on all tasks.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00136">routing_breaks.cc:136</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_a0d1ed47f6804807e925b489b24fb8d04"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">operations_research::DisjunctivePropagator::Precedences</a></div><div class="ttdeci">bool Precedences(Tasks *tasks)</div><div class="ttdoc">Propagates the deductions from the chain of precedences, if there is one.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00051">routing_breaks.cc:51</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_a13e93a8cd8587377e1b8f88096e0efd0"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#a13e93a8cd8587377e1b8f88096e0efd0">operations_research::DisjunctivePropagator::DistanceDuration</a></div><div class="ttdeci">bool DistanceDuration(Tasks *tasks)</div><div class="ttdoc">Propagates distance_duration constraints, if any.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00286">routing_breaks.cc:286</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_a29620476a22fde70929c77dc6342be0e"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#a29620476a22fde70929c77dc6342be0e">operations_research::DisjunctivePropagator::MirrorTasks</a></div><div class="ttdeci">bool MirrorTasks(Tasks *tasks)</div><div class="ttdoc">Transforms the problem with a time symmetry centered in 0.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00106">routing_breaks.cc:106</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_a7b0f3a8550bd73014e2b61899524a2ad"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#a7b0f3a8550bd73014e2b61899524a2ad">operations_research::DisjunctivePropagator::ForbiddenIntervals</a></div><div class="ttdeci">bool ForbiddenIntervals(Tasks *tasks)</div><div class="ttdoc">Tasks might have holes in their domain, this enforces such holes.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00250">routing_breaks.cc:250</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_a8a31c563d28e1ebe7c9e140f15fea586"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#a8a31c563d28e1ebe7c9e140f15fea586">operations_research::DisjunctivePropagator::Propagate</a></div><div class="ttdeci">bool Propagate(Tasks *tasks)</div><div class="ttdoc">Computes new bounds for all tasks, returns false if infeasible.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00020">routing_breaks.cc:20</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_aa9b624e65cb55b3d74ad35a3a675f9ea"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#aa9b624e65cb55b3d74ad35a3a675f9ea">operations_research::DisjunctivePropagator::DetectablePrecedencesWithChain</a></div><div class="ttdeci">bool DetectablePrecedencesWithChain(Tasks *tasks)</div><div class="ttdoc">Does detectable precedences deductions on tasks in the chain precedence, taking the time windows of n...</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00197">routing_breaks.cc:197</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_acf2f8cdb2a89ceee2b652aee8fa86b21"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#acf2f8cdb2a89ceee2b652aee8fa86b21">operations_research::DisjunctivePropagator::ChainSpanMinDynamic</a></div><div class="ttdeci">bool ChainSpanMinDynamic(Tasks *tasks)</div><div class="ttdoc">Computes a lower bound of the span of the chain, taking into account only the first nonchain task.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00469">routing_breaks.cc:469</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_ad84e0e4ee59eab8a1004906628692ccb"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#ad84e0e4ee59eab8a1004906628692ccb">operations_research::DisjunctivePropagator::ChainSpanMin</a></div><div class="ttdeci">bool ChainSpanMin(Tasks *tasks)</div><div class="ttdoc">Propagates a lower bound of the chain span, end[num_chain_tasks] - start[0], to span_min.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00429">routing_breaks.cc:429</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_vehicle_breaks_constraint_html_a19d94d32f3bde30deeebb883c6f71f84"><div class="ttname"><a href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#a19d94d32f3bde30deeebb883c6f71f84">operations_research::GlobalVehicleBreaksConstraint::Post</a></div><div class="ttdeci">void Post() override</div><div class="ttdoc">This method is called when the constraint is processed by the solver.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00695">routing_breaks.cc:695</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_vehicle_breaks_constraint_html_a36d844f2722273b190ed9a069dd25938"><div class="ttname"><a href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#a36d844f2722273b190ed9a069dd25938">operations_research::GlobalVehicleBreaksConstraint::InitialPropagate</a></div><div class="ttdeci">void InitialPropagate() override</div><div class="ttdoc">This method performs the initial propagation of the constraint.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00724">routing_breaks.cc:724</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_vehicle_breaks_constraint_html_acb1ca5666c8795f29fc71c28d7bb0386"><div class="ttname"><a href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#acb1ca5666c8795f29fc71c28d7bb0386">operations_research::GlobalVehicleBreaksConstraint::GlobalVehicleBreaksConstraint</a></div><div class="ttdeci">GlobalVehicleBreaksConstraint(const RoutingDimension *dimension)</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00687">routing_breaks.cc:687</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_a0034062c82083a6c0af5aae1859ef66b"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a0034062c82083a6c0af5aae1859ef66b">operations_research::IntExpr::SetMax</a></div><div class="ttdeci">virtual void SetMax(int64 m)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_a1d04569b37cb7fe6ed0956ab71e08bc9"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a1d04569b37cb7fe6ed0956ab71e08bc9">operations_research::IntExpr::Bound</a></div><div class="ttdeci">virtual bool Bound() const</div><div class="ttdoc">Returns true if the min and the max of the expression are equal.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03862">constraint_solver.h:3862</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_a253ec9a9ed6b56ac4de714373ebf91f9"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a253ec9a9ed6b56ac4de714373ebf91f9">operations_research::IntExpr::SetMin</a></div><div class="ttdeci">virtual void SetMin(int64 m)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_a6dc4d5cdc2ed0da18452a65c5bf69e0d"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a6dc4d5cdc2ed0da18452a65c5bf69e0d">operations_research::IntExpr::Max</a></div><div class="ttdeci">virtual int64 Max() const =0</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_expr_html_af13b2ea301c6800bb6d43bd70716bf6d"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#af13b2ea301c6800bb6d43bd70716bf6d">operations_research::IntExpr::WhenRange</a></div><div class="ttdeci">virtual void WhenRange(Demon *d)=0</div><div class="ttdoc">Attach a demon that will watch the min or the max of the expression.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_html_a6e33a313eaf507bae0eb7068455a5bdc"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#a6e33a313eaf507bae0eb7068455a5bdc">operations_research::IntVar::WhenBound</a></div><div class="ttdeci">virtual void WhenBound(Demon *d)=0</div><div class="ttdoc">This method attaches a demon that will be awakened when the variable is bound.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_local_search_filter_html"><div class="ttname"><a href="classoperations__research_1_1_int_var_local_search_filter.html">operations_research::IntVarLocalSearchFilter</a></div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01811">constraint_solveri.h:1811</a></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_a0a4c6ed965a6e5221ed1ce6177da7f6b"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#a0a4c6ed965a6e5221ed1ce6177da7f6b">operations_research::IntervalVar::StartMax</a></div><div class="ttdeci">virtual int64 StartMax() const =0</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_abbd293afc60381f8ff32477a20506bc1"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#abbd293afc60381f8ff32477a20506bc1">operations_research::IntervalVar::EndMin</a></div><div class="ttdeci">virtual int64 EndMin() const =0</div><div class="ttdoc">These methods query, set, and watch the end 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_propagation_base_object_html_a173cbf153462b14f9b57362d2c45638a"><div class="ttname"><a href="classoperations__research_1_1_propagation_base_object.html#a173cbf153462b14f9b57362d2c45638a">operations_research::PropagationBaseObject::EnqueueDelayedDemon</a></div><div class="ttdeci">void EnqueueDelayedDemon(Demon *const d)</div><div class="ttdoc">This method pushes the demon onto the propagation queue.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03192">constraint_solver.h:3192</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_routing_dimension_html"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html">operations_research::RoutingDimension</a></div><div class="ttdoc">Dimensions represent quantities accumulated at nodes along the routes.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02368">routing.h:2368</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a1b6f521fdc9dff38b7e065c838fa54a3"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a1b6f521fdc9dff38b7e065c838fa54a3">operations_research::RoutingDimension::cumuls</a></div><div class="ttdeci">const std::vector< IntVar * > & cumuls() const</div><div class="ttdoc">Like CumulVar(), TransitVar(), SlackVar() but return the whole variable vectors instead (indexed by i...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02394">routing.h:2394</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a20cb44a14b6119a99fdcef3b594629e8"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a20cb44a14b6119a99fdcef3b594629e8">operations_research::RoutingDimension::GetBreakDistanceDurationOfVehicle</a></div><div class="ttdeci">const std::vector< std::pair< int64, int64 > > & GetBreakDistanceDurationOfVehicle(int vehicle) const</div><div class="ttdoc">Returns the pairs (distance, duration) specified by break distance constraints.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06939">routing.cc:6939</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a35a576bb3ea6814f122593d44a3c391e"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">operations_research::RoutingDimension::model</a></div><div class="ttdeci">RoutingModel * model() const</div><div class="ttdoc">Returns the model on which the dimension was created.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02372">routing.h:2372</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a4d87db39b37a97bcf6669448a67f0356"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">operations_research::RoutingDimension::CumulVar</a></div><div class="ttdeci">IntVar * CumulVar(int64 index) const</div><div class="ttdoc">Get the cumul, transit and slack variables for the given node (given as int64 var index).</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02386">routing.h:2386</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a5997ca01d12b18b158ac0232acc731dd"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a5997ca01d12b18b158ac0232acc731dd">operations_research::RoutingDimension::FixedTransitVar</a></div><div class="ttdeci">IntVar * FixedTransitVar(int64 index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02388">routing.h:2388</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a6debc638c02bfb2b4afe0afccdd98ca5"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a6debc638c02bfb2b4afe0afccdd98ca5">operations_research::RoutingDimension::HasBreakConstraints</a></div><div class="ttdeci">bool HasBreakConstraints() const</div><div class="ttdoc">Returns true if any break interval or break distance was defined.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06900">routing.cc:6900</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a8e93e99ce491f2779c0d2e5e7de5a98a"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a8e93e99ce491f2779c0d2e5e7de5a98a">operations_research::RoutingDimension::GetPreTravelEvaluatorOfVehicle</a></div><div class="ttdeci">int GetPreTravelEvaluatorOfVehicle(int vehicle) const</div><div class="ttdoc">!defined(SWIGPYTHON)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06911">routing.cc:6911</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a91b8a6eb7cf5ab0ebc74ddced140d700"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">operations_research::RoutingDimension::GetBreakIntervalsOfVehicle</a></div><div class="ttdeci">const std::vector< IntervalVar * > & GetBreakIntervalsOfVehicle(int vehicle) const</div><div class="ttdoc">Returns the break intervals set by SetBreakIntervalsOfVehicle().</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06904">routing.cc:6904</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_aae1962408e06dbb45f6e5ee67e530880"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#aae1962408e06dbb45f6e5ee67e530880">operations_research::RoutingDimension::transit_evaluator</a></div><div class="ttdeci">const RoutingModel::TransitCallback2 & transit_evaluator(int vehicle) const</div><div class="ttdoc">Returns the callback evaluating the transit value between two node indices for a given vehicle.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02449">routing.h:2449</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_ac300c6449a65333961d8abdd7ce40a7a"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">operations_research::RoutingDimension::SlackVar</a></div><div class="ttdeci">IntVar * SlackVar(int64 index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02389">routing.h:2389</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_afb4c32e76561cad95bd8be2777d8f1ac"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#afb4c32e76561cad95bd8be2777d8f1ac">operations_research::RoutingDimension::GetPostTravelEvaluatorOfVehicle</a></div><div class="ttdeci">int GetPostTravelEvaluatorOfVehicle(int vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06917">routing.cc:6917</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_aff15c149ac7cbb96d340d8c1370d5aea"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#aff15c149ac7cbb96d340d8c1370d5aea">operations_research::RoutingDimension::forbidden_intervals</a></div><div class="ttdeci">const std::vector< SortedDisjointIntervalList > & forbidden_intervals() const</div><div class="ttdoc">Returns forbidden intervals for each node.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02400">routing.h:2400</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html">operations_research::RoutingModel</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00213">routing.h:213</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a1dc8d32892f78532c8ee7a7186158e07"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">operations_research::RoutingModel::End</a></div><div class="ttdeci">int64 End(int vehicle) const</div><div class="ttdoc">Returns the variable index of the ending node of a vehicle route.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01182">routing.h:1182</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a5f32c22c620c811754ba7b6f977db864"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">operations_research::RoutingModel::solver</a></div><div class="ttdeci">Solver * solver() const</div><div class="ttdoc">Returns the underlying constraint solver.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01327">routing.h:1327</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a66fb44c05f9875685e9c332fbdfb643b"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">operations_research::RoutingModel::NextVar</a></div><div class="ttdeci">IntVar * NextVar(int64 index) const</div><div class="ttdoc">!defined(SWIGPYTHON)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01207">routing.h:1207</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a8cded3d3d6746c179a8ec0eddad24342"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a8cded3d3d6746c179a8ec0eddad24342">operations_research::RoutingModel::VehicleVar</a></div><div class="ttdeci">IntVar * VehicleVar(int64 index) const</div><div class="ttdoc">Returns the vehicle variable of the node corresponding to index.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01222">routing.h:1222</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_aa9e7ba89833775f29889744fe9480d29"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">operations_research::RoutingModel::vehicles</a></div><div class="ttdeci">int vehicles() const</div><div class="ttdoc">Returns the number of vehicle routes in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01345">routing.h:1345</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_aad154b31953d2b467bbac3e4ac696cd6"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aad154b31953d2b467bbac3e4ac696cd6">operations_research::RoutingModel::Nexts</a></div><div class="ttdeci">const std::vector< IntVar * > & Nexts() const</div><div class="ttdoc">Returns all next variables of the model, such that Nexts(i) is the next variable of the node correspo...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01200">routing.h:1200</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_acbdbdfc9491ef0586459d38cc5ef4cb8"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">operations_research::RoutingModel::Start</a></div><div class="ttdeci">int64 Start(int vehicle) const</div><div class="ttdoc">Model inspection.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01180">routing.h:1180</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_ad558398f8c75f81d879f74d18ba5e7c3"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#ad558398f8c75f81d879f74d18ba5e7c3">operations_research::RoutingModel::TransitCallback</a></div><div class="ttdeci">const TransitCallback2 & TransitCallback(int callback_index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00413">routing.h:413</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_ae2530e17cabaf267e12929ca0ee1bee0"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#ae2530e17cabaf267e12929ca0ee1bee0">operations_research::RoutingModel::IsEnd</a></div><div class="ttdeci">bool IsEnd(int64 index) const</div><div class="ttdoc">Returns true if 'index' represents the last node of a route.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01186">routing.h:1186</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_aeb92d4addb41255c9732cacfcb54f795"><div class="ttname"><a href="classoperations__research_1_1_solver.html#aeb92d4addb41255c9732cacfcb54f795">operations_research::Solver::Fail</a></div><div class="ttdeci">void Fail()</div><div class="ttdoc">Abandon the current branch in the search tree. A backtrack will follow.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l02416">constraint_solver.cc:2416</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a0cd86cea355b2b1f70e5494fdce82979"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0cd86cea355b2b1f70e5494fdce82979">operations_research::sat::ThetaLambdaTree::GetEventsWithOptionalEnvelopeGreaterThan</a></div><div class="ttdeci">void GetEventsWithOptionalEnvelopeGreaterThan(IntegerType target_envelope, int *critical_event, int *optional_event, IntegerType *available_energy) const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00189">theta_tree.cc:189</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a1c2fe501274ef60430486bba0842cd35"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1c2fe501274ef60430486bba0842cd35">operations_research::sat::ThetaLambdaTree::GetOptionalEnvelope</a></div><div class="ttdeci">IntegerType GetOptionalEnvelope() const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00173">theta_tree.cc:173</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a1d04b14711a8d3bba829f1b0eb4dd4a8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1d04b14711a8d3bba829f1b0eb4dd4a8">operations_research::sat::ThetaLambdaTree::RemoveEvent</a></div><div class="ttdeci">void RemoveEvent(int event)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00147">theta_tree.cc:147</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a7b4553842be2a65d82b3f40eed71744d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a7b4553842be2a65d82b3f40eed71744d">operations_research::sat::ThetaLambdaTree::Reset</a></div><div class="ttdeci">void Reset(int num_events)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00040">theta_tree.cc:40</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a9045183839ce6286d80eb699209c1557"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a9045183839ce6286d80eb699209c1557">operations_research::sat::ThetaLambdaTree::AddOrUpdateOptionalEvent</a></div><div class="ttdeci">void AddOrUpdateOptionalEvent(int event, IntegerType initial_envelope_opt, IntegerType energy_max)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00124">theta_tree.cc:124</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_ad812cddd43d03a817341c9875f4f6f4f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f">operations_research::sat::ThetaLambdaTree::AddOrUpdateEvent</a></div><div class="ttdeci">void AddOrUpdateEvent(int event, IntegerType initial_envelope, IntegerType energy_min, IntegerType energy_max)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00111">theta_tree.cc:111</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_add1a42315d03f68191df32a019d82093"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093">operations_research::sat::ThetaLambdaTree::GetEnvelope</a></div><div class="ttdeci">IntegerType GetEnvelope() const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00168">theta_tree.cc:168</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00272">gurobi_interface.cc:272</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="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_a11f4a7dbafd8e00a36b892a82e44445f"><div class="ttname"><a href="namespaceoperations__research.html#a11f4a7dbafd8e00a36b892a82e44445f">operations_research::MakeDelayedConstraintDemon1</a></div><div class="ttdeci">Demon * MakeDelayedConstraintDemon1(Solver *const s, T *const ct, void(T::*method)(P), const std::string &name, P param1)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00724">constraint_solveri.h:724</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a228fe84d99348c2b62bb4f70a6371d9b"><div class="ttname"><a href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">operations_research::CapSub</a></div><div class="ttdeci">int64 CapSub(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00154">saturated_arithmetic.h:154</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a2393ae34fa859cdfb9b671489858030f"><div class="ttname"><a href="namespaceoperations__research.html#a2393ae34fa859cdfb9b671489858030f">operations_research::AppendTasksFromPath</a></div><div class="ttdeci">void AppendTasksFromPath(const std::vector< int64 > &path, const TravelBounds &travel_bounds, const RoutingDimension &dimension, DisjunctivePropagator::Tasks *tasks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00590">routing_breaks.cc:590</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a447588dfd4d5f539ec22f403e21ca668"><div class="ttname"><a href="namespaceoperations__research.html#a447588dfd4d5f539ec22f403e21ca668">operations_research::MakeVehicleBreaksFilter</a></div><div class="ttdeci">IntVarLocalSearchFilter * MakeVehicleBreaksFilter(const RoutingModel &routing_model, const RoutingDimension &dimension)</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l01060">routing_breaks.cc:1060</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a4fb750da00c784e5ffd1763fd3ce88f7"><div class="ttname"><a href="namespaceoperations__research.html#a4fb750da00c784e5ffd1763fd3ce88f7">operations_research::MakeConstraintDemon1</a></div><div class="ttdeci">Demon * MakeConstraintDemon1(Solver *const s, T *const ct, void(T::*method)(P), const std::string &name, P param1)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00566">constraint_solveri.h:566</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a599f513ba4c5233c5789bc243ac53ca2"><div class="ttname"><a href="namespaceoperations__research.html#a599f513ba4c5233c5789bc243ac53ca2">operations_research::FillTravelBoundsOfVehicle</a></div><div class="ttdeci">void FillTravelBoundsOfVehicle(int vehicle, const std::vector< int64 > &path, const RoutingDimension &dimension, TravelBounds *travel_bounds)</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00645">routing_breaks.cc:645</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a6a8bc2370087a30d5a122524bafa867b"><div class="ttname"><a href="namespaceoperations__research.html#a6a8bc2370087a30d5a122524bafa867b">operations_research::AppendTasksFromIntervals</a></div><div class="ttdeci">void AppendTasksFromIntervals(const std::vector< IntervalVar * > &intervals, DisjunctivePropagator::Tasks *tasks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00673">routing_breaks.cc:673</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a99264812cf177270e521f226a5c012c3"><div class="ttname"><a href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">operations_research::CapAdd</a></div><div class="ttdeci">int64 CapAdd(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00124">saturated_arithmetic.h:124</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ad13d20d0a1737677a4757bd6ef8a95b3"><div class="ttname"><a href="namespaceoperations__research.html#ad13d20d0a1737677a4757bd6ef8a95b3">operations_research::FillPathEvaluation</a></div><div class="ttdeci">void FillPathEvaluation(const std::vector< int64 > &path, const RoutingModel::TransitCallback2 &evaluator, std::vector< int64 > *values)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06215">routing.cc:6215</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_a13421db7d7e84fff732599bcf954c5cc"><div class="ttname"><a href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a></div><div class="ttdeci">int64 time</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01683">resource.cc:1683</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="arouting_8h_html"><div class="ttname"><a href="routing_8h.html">routing.h</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_a7c8133c50ba59755e2162ad1a9478da7"><div class="ttname"><a href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a></div><div class="ttdeci">Rev< int64 > start_max</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00242">sched_constraints.cc:242</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_ab2188791e61e013dc8b28e66b31041cd"><div class="ttname"><a href="sched__constraints_8cc.html#ab2188791e61e013dc8b28e66b31041cd">start_min</a></div><div class="ttdeci">Rev< int64 > start_min</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00241">sched_constraints.cc:241</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">operations_research::DisjunctivePropagator::Tasks</a></div><div class="ttdoc">A structure to hold tasks described by their features.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01961">routing.h:1961</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a07ca7d21baf239c58ad6bd720a5caadb"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a07ca7d21baf239c58ad6bd720a5caadb">operations_research::DisjunctivePropagator::Tasks::end_max</a></div><div class="ttdeci">std::vector< int64 > end_max</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01968">routing.h:1968</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a08530dc2a09c5639d9bffaa8d77ea4cb"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a08530dc2a09c5639d9bffaa8d77ea4cb">operations_research::DisjunctivePropagator::Tasks::start_min</a></div><div class="ttdeci">std::vector< int64 > start_min</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01963">routing.h:1963</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a115f81774c290337166f498824bf5b87"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a115f81774c290337166f498824bf5b87">operations_research::DisjunctivePropagator::Tasks::duration_min</a></div><div class="ttdeci">std::vector< int64 > duration_min</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01965">routing.h:1965</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a3a043b5db0f7e2cd5d378229ca05fcbe"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a3a043b5db0f7e2cd5d378229ca05fcbe">operations_research::DisjunctivePropagator::Tasks::start_max</a></div><div class="ttdeci">std::vector< int64 > start_max</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01964">routing.h:1964</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a425fd06d315549fdc6e6c482e3cdf774"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">operations_research::DisjunctivePropagator::Tasks::forbidden_intervals</a></div><div class="ttdeci">std::vector< const SortedDisjointIntervalList * > forbidden_intervals</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01970">routing.h:1970</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a450130fc232b9ab24cc44a7c215850b6"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">operations_research::DisjunctivePropagator::Tasks::is_preemptible</a></div><div class="ttdeci">std::vector< bool > is_preemptible</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01969">routing.h:1969</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a5fac79041fdb19eb570b061d01b96212"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a5fac79041fdb19eb570b061d01b96212">operations_research::DisjunctivePropagator::Tasks::span_max</a></div><div class="ttdeci">int64 span_max</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01973">routing.h:1973</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a702574cf13b54bc225f06ce3a548d4e3"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a702574cf13b54bc225f06ce3a548d4e3">operations_research::DisjunctivePropagator::Tasks::duration_max</a></div><div class="ttdeci">std::vector< int64 > duration_max</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01966">routing.h:1966</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a7cc44fe8f5261fa7bacc58867dfb3882"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a7cc44fe8f5261fa7bacc58867dfb3882">operations_research::DisjunctivePropagator::Tasks::distance_duration</a></div><div class="ttdeci">std::vector< std::pair< int64, int64 > > distance_duration</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01971">routing.h:1971</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::DisjunctivePropagator::Tasks::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01975">routing.h:1975</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_ac82dcb03265376c6caeb434de093eb11"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac82dcb03265376c6caeb434de093eb11">operations_research::DisjunctivePropagator::Tasks::end_min</a></div><div class="ttdeci">std::vector< int64 > end_min</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01967">routing.h:1967</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_ad5e547ae9d4f7380beae49908c7cdc48"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">operations_research::DisjunctivePropagator::Tasks::num_chain_tasks</a></div><div class="ttdeci">int num_chain_tasks</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01962">routing.h:1962</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_adb46102185c9230164f718650a0b580d"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#adb46102185c9230164f718650a0b580d">operations_research::DisjunctivePropagator::Tasks::span_min</a></div><div class="ttdeci">int64 span_min</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01972">routing.h:1972</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_travel_bounds_html"><div class="ttname"><a href="structoperations__research_1_1_travel_bounds.html">operations_research::TravelBounds</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02031">routing.h:2031</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_travel_bounds_html_a3535b65e25ad7ea4781e7d44cbc978b8"><div class="ttname"><a href="structoperations__research_1_1_travel_bounds.html#a3535b65e25ad7ea4781e7d44cbc978b8">operations_research::TravelBounds::max_travels</a></div><div class="ttdeci">std::vector< int64 > max_travels</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02033">routing.h:2033</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_travel_bounds_html_a4bf199080092cf9464f80c861bfee413"><div class="ttname"><a href="structoperations__research_1_1_travel_bounds.html#a4bf199080092cf9464f80c861bfee413">operations_research::TravelBounds::min_travels</a></div><div class="ttdeci">std::vector< int64 > min_travels</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02032">routing.h:2032</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_travel_bounds_html_a55ce83aba1e381a608a0b9bdf8dda426"><div class="ttname"><a href="structoperations__research_1_1_travel_bounds.html#a55ce83aba1e381a608a0b9bdf8dda426">operations_research::TravelBounds::post_travels</a></div><div class="ttdeci">std::vector< int64 > post_travels</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02035">routing.h:2035</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_travel_bounds_html_abca7c77375a78b314c7a1c59cf82d3c8"><div class="ttname"><a href="structoperations__research_1_1_travel_bounds.html#abca7c77375a78b314c7a1c59cf82d3c8">operations_research::TravelBounds::pre_travels</a></div><div class="ttdeci">std::vector< int64 > pre_travels</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02034">routing.h:2034</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="routing__breaks_8cc.html">routing_breaks.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>
|