162 lines
110 KiB
HTML
162 lines
110 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.15"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: diffn_util.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('diffn__util_8cc_source.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">diffn_util.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="diffn__util_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="diffn__util_8h.html">ortools/sat/diffn_util.h</a>"</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="stl__util_8h.html">ortools/base/stl_util.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> <span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00021"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_rectangle.html#af35016193fab7576c18a7fbd0e3b9a20"> 21</a></span> <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#af35016193fab7576c18a7fbd0e3b9a20">Rectangle::IsDisjoint</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html">Rectangle</a>& other)<span class="keyword"> const </span>{</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a1f62ae069f3793df9ae18399ba6d052c">x_min</a> >= other.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a0cc9a3a200ee27bae9b9907d97b5718e">x_max</a> || other.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a1f62ae069f3793df9ae18399ba6d052c">x_min</a> >= <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a0cc9a3a200ee27bae9b9907d97b5718e">x_max</a> || <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a379a897decc0711464cb15e8d02fd095">y_min</a> >= other.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#ae39303b5b3149e1914834c36ad51fe8f">y_max</a> ||</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  other.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a379a897decc0711464cb15e8d02fd095">y_min</a> >= <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#ae39303b5b3149e1914834c36ad51fe8f">y_max</a>;</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> }</div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a3e2516c0d3fc4991896c6a9bbead80e7"> 26</a></span> std::vector<absl::Span<int>> <a class="code" href="namespaceoperations__research_1_1sat.html#a3e2516c0d3fc4991896c6a9bbead80e7">GetOverlappingRectangleComponents</a>(</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keyword">const</span> std::vector<Rectangle>& rectangles,</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  absl::Span<int> active_rectangles) {</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keywordflow">if</span> (active_rectangles.empty()) <span class="keywordflow">return</span> {};</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  std::vector<absl::Span<int>> result;</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = active_rectangles.size();</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start = 0; start < size;) {</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">// Find the component of active_rectangles[start].</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keywordtype">int</span> end = start + 1;</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = start; i < end; i++) {</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = end; j < size; ++j) {</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keywordflow">if</span> (!rectangles[active_rectangles[i]].IsDisjoint(</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  rectangles[active_rectangles[j]])) {</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(active_rectangles[end++], active_rectangles[j]);</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  }</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</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> (end > start + 1) {</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  result.push_back(active_rectangles.subspan(start, end - start));</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  }</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  start = end;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  }</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> }</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ac15dce45cd213b58af7a1fd6fc8a6ebc"> 52</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research_1_1sat.html#ac15dce45cd213b58af7a1fd6fc8a6ebc">ReportEnergyConflict</a>(<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html">Rectangle</a> bounding_box, absl::Span<const int> boxes,</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* x,</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* y) {</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  x-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  IntegerValue total_energy(0);</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> : boxes) {</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">const</span> IntegerValue x_min = x-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a0d7780af676ab4fd1c57e62da9e03686">ShiftedStartMin</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">const</span> IntegerValue x_max = x-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5caf109ec436f43088925c00bb64794b">ShiftedEndMax</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">if</span> (x_min < bounding_box.x_min || x_max > bounding_box.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a0cc9a3a200ee27bae9b9907d97b5718e">x_max</a>) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">const</span> IntegerValue y_min = y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a0d7780af676ab4fd1c57e62da9e03686">ShiftedStartMin</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">const</span> IntegerValue y_max = y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5caf109ec436f43088925c00bb64794b">ShiftedEndMax</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">if</span> (y_min < bounding_box.y_min || y_max > bounding_box.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#ae39303b5b3149e1914834c36ad51fe8f">y_max</a>) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  x-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad663c8b14dbad962a78333fbc02c7967">AddEnergyMinInIntervalReason</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, bounding_box.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a1f62ae069f3793df9ae18399ba6d052c">x_min</a>, bounding_box.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a0cc9a3a200ee27bae9b9907d97b5718e">x_max</a>);</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad663c8b14dbad962a78333fbc02c7967">AddEnergyMinInIntervalReason</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, bounding_box.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a379a897decc0711464cb15e8d02fd095">y_min</a>, bounding_box.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#ae39303b5b3149e1914834c36ad51fe8f">y_max</a>);</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  total_energy += x-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) * y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// We abort early if a subset of boxes is enough.</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// TODO(user): Also relax the box if possible.</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">if</span> (total_energy > bounding_box.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a72c77da14562bc93e057989744b551fd">Area</a>()) <span class="keywordflow">break</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> </div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(total_energy, bounding_box.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a72c77da14562bc93e057989744b551fd">Area</a>());</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  x-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9ce9e563527f073b9aac535e63b7f647">ImportOtherReasons</a>(*y);</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">return</span> x-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22">ReportConflict</a>();</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> }</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#acb732f4a9114d03a4b3e53109923e60f"> 81</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research_1_1sat.html#acb732f4a9114d03a4b3e53109923e60f">BoxesAreInEnergyConflict</a>(<span class="keyword">const</span> std::vector<Rectangle>& rectangles,</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">const</span> std::vector<IntegerValue>& energies,</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  absl::Span<const int> boxes,</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html">Rectangle</a>* conflict) {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// First consider all relevant intervals along the x axis.</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  std::vector<IntegerValue> x_starts;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  std::vector<TaskTime> boxes_by_increasing_x_max;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> : boxes) {</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  x_starts.push_back(rectangles[<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>].x_min);</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  boxes_by_increasing_x_max.push_back({<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, rectangles[<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>].x_max});</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&x_starts);</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  std::sort(boxes_by_increasing_x_max.begin(), boxes_by_increasing_x_max.end());</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> </div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  std::vector<IntegerValue> y_starts;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  std::vector<IntegerValue> energy_sum;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  std::vector<TaskTime> boxes_by_increasing_y_max;</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>  std::vector<std::vector<int>> stripes(x_starts.size());</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < boxes_by_increasing_x_max.size(); ++i) {</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = boxes_by_increasing_x_max[i].task_index;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">const</span> IntegerValue x_min = rectangles[<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>].x_min;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">const</span> IntegerValue x_max = rectangles[<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>].x_max;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < x_starts.size(); ++j) {</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">if</span> (x_starts[j] > x_min) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  stripes[j].push_back(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> </div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// Redo the same on the y coordinate for the current x interval</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// which is [starts[j], x_max].</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  y_starts.clear();</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  boxes_by_increasing_y_max.clear();</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> : stripes[j]) {</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  y_starts.push_back(rectangles[<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>].y_min);</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  boxes_by_increasing_y_max.push_back({<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, rectangles[<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>].y_max});</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  }</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&y_starts);</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  std::sort(boxes_by_increasing_y_max.begin(),</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  boxes_by_increasing_y_max.end());</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="keyword">const</span> IntegerValue x_size = x_max - x_starts[j];</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  energy_sum.assign(y_starts.size(), IntegerValue(0));</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < boxes_by_increasing_y_max.size(); ++i) {</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = boxes_by_increasing_y_max[i].task_index;</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keyword">const</span> IntegerValue y_min = rectangles[<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>].y_min;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">const</span> IntegerValue y_max = rectangles[<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>].y_max;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < y_starts.size(); ++j) {</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">if</span> (y_starts[j] > y_min) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  energy_sum[j] += energies[<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>];</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordflow">if</span> (energy_sum[j] > x_size * (y_max - y_starts[j])) {</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">if</span> (conflict != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  *conflict = rectangles[<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>];</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k < i; ++k) {</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task_index = boxes_by_increasing_y_max[k].task_index;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">if</span> (rectangles[task_index].y_min >= y_starts[j]) {</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  conflict-><a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#ae0f155c5fab2db4cf40e75f0ad6039f6">TakeUnionWith</a>(rectangles[task_index]);</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  }</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  }</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  }</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  }</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  }</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  }</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> }</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> </div><div class="line"><a name="l00148"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a98d09c7e8c4f5a15b569f5f14fa9937a"> 148</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a98d09c7e8c4f5a15b569f5f14fa9937a">AnalyzeIntervals</a>(<span class="keywordtype">bool</span> transpose, absl::Span<const int> local_boxes,</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">const</span> std::vector<Rectangle>& rectangles,</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keyword">const</span> std::vector<IntegerValue>& rectangle_energies,</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  IntegerValue* x_threshold, IntegerValue* y_threshold,</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html">Rectangle</a>* conflict) {</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">// First, we compute the possible x_min values (removing duplicates).</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// We also sort the relevant tasks by their x_max.</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">//</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">// TODO(user): If the number of unique x_max is smaller than the number of</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">// unique x_min, it is better to do it the other way around.</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  std::vector<IntegerValue> starts;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  std::vector<TaskTime> task_by_increasing_x_max;</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> t : local_boxes) {</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keyword">const</span> IntegerValue x_min =</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  transpose ? rectangles[t].y_min : rectangles[t].x_min;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keyword">const</span> IntegerValue x_max =</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  transpose ? rectangles[t].y_max : rectangles[t].x_max;</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  starts.push_back(x_min);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  task_by_increasing_x_max.push_back({t, x_max});</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  }</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&starts);</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// Note that for the same end_max, the order change our heuristic to</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// evaluate the max_conflict_height.</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  std::sort(task_by_increasing_x_max.begin(), task_by_increasing_x_max.end());</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> </div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">// The maximum y dimension of a bounding area for which there is a potential</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">// conflict.</span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  IntegerValue max_conflict_height(0);</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="comment">// This is currently only used for logging.</span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  absl::flat_hash_set<std::pair<IntegerValue, IntegerValue>> stripes;</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> </div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// All quantities at index j correspond to the interval [starts[j], x_max].</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  std::vector<IntegerValue> energies(starts.size(), IntegerValue(0));</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  std::vector<IntegerValue> y_mins(starts.size(), <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>);</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  std::vector<IntegerValue> y_maxs(starts.size(), -<a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>);</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  std::vector<IntegerValue> energy_at_max_y(starts.size(), IntegerValue(0));</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  std::vector<IntegerValue> energy_at_min_y(starts.size(), IntegerValue(0));</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> </div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// Sentinel.</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  starts.push_back(<a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>);</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> </div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// Iterate over all boxes by increasing x_max values.</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordtype">int</span> first_j = 0;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">const</span> IntegerValue threshold = transpose ? *y_threshold : *x_threshold;</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < task_by_increasing_x_max.size(); ++i) {</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> t = task_by_increasing_x_max[i].task_index;</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a> = rectangle_energies[t];</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  IntegerValue x_min = rectangles[t].x_min;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  IntegerValue x_max = rectangles[t].x_max;</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  IntegerValue y_min = rectangles[t].y_min;</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  IntegerValue y_max = rectangles[t].y_max;</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">if</span> (transpose) {</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(x_min, y_min);</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(x_max, y_max);</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  }</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> </div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="comment">// Add this box contribution to all the [starts[j], x_max] intervals.</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">while</span> (first_j + 1 < starts.size() && x_max - starts[first_j] > threshold) {</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  ++first_j;</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="keywordflow">for</span> (<span class="keywordtype">int</span> j = first_j; starts[j] <= x_min; ++j) {</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">const</span> IntegerValue old_energy_at_max = energy_at_max_y[j];</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">const</span> IntegerValue old_energy_at_min = energy_at_min_y[j];</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> </div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  energies[j] += <a class="code" href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a>;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> </div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_disjoint = y_min >= y_maxs[j] || y_max <= y_mins[j];</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> </div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">if</span> (y_min <= y_mins[j]) {</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">if</span> (y_min < y_mins[j]) {</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  y_mins[j] = y_min;</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  energy_at_min_y[j] = <a class="code" href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a>;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  energy_at_min_y[j] += <a class="code" href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a>;</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  }</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> </div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">if</span> (y_max >= y_maxs[j]) {</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">if</span> (y_max > y_maxs[j]) {</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  y_maxs[j] = y_max;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  energy_at_max_y[j] = <a class="code" href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a>;</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  energy_at_max_y[j] += <a class="code" href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a>;</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  }</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  }</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> </div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="comment">// If the new box is disjoint in y from the ones added so far, there</span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="comment">// cannot be a new conflict involving this box, so we skip until we add</span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">// new boxes.</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">if</span> (is_disjoint) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> </div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keyword">const</span> IntegerValue width = x_max - starts[j];</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  IntegerValue conflict_height = <a class="code" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(energies[j], width) - 1;</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">if</span> (y_max - y_min > conflict_height) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">if</span> (conflict_height >= y_maxs[j] - y_mins[j]) {</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// We have a conflict.</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">if</span> (conflict != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  *conflict = rectangles[t];</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k < i; ++k) {</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task_index = task_by_increasing_x_max[k].task_index;</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keyword">const</span> IntegerValue task_x_min = transpose</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  ? rectangles[task_index].y_min</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  : rectangles[task_index].x_min;</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">if</span> (task_x_min < starts[j]) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  conflict-><a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#ae0f155c5fab2db4cf40e75f0ad6039f6">TakeUnionWith</a>(rectangles[task_index]);</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  }</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  }</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  }</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> </div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">// Because we currently do not have a conflict involving the new box, the</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">// only way to have one is to remove enough energy to reduce the y domain.</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  IntegerValue can_remove = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(old_energy_at_min, old_energy_at_max);</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">if</span> (old_energy_at_min < old_energy_at_max) {</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">if</span> (y_maxs[j] - y_min >=</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(energies[j] - old_energy_at_min, width)) {</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">// In this case, we need to remove at least old_energy_at_max to have</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="comment">// a conflict.</span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  can_remove = old_energy_at_max;</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  }</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (old_energy_at_max < old_energy_at_min) {</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordflow">if</span> (y_max - y_mins[j] >=</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(energies[j] - old_energy_at_max, width)) {</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  can_remove = old_energy_at_min;</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  }</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  }</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  conflict_height = <a class="code" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(energies[j] - can_remove, width) - 1;</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> </div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="comment">// If the new box height is above the conflict_height, do not count</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="comment">// it now. We only need to consider conflict involving the new box.</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordflow">if</span> (y_max - y_min > conflict_height) <span class="keywordflow">continue</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">if</span> (<a class="code" href="vlog__is__on_8h.html#a956152cad330225654d128f35c00efce">VLOG_IS_ON</a>(2)) stripes.insert({starts[j], x_max});</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  max_conflict_height = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_conflict_height, conflict_height);</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  }</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  }</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> </div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">" num_starts: "</span> << starts.size() - 1 << <span class="stringliteral">"/"</span> << local_boxes.size()</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  << <span class="stringliteral">" conflict_height: "</span> << max_conflict_height</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  << <span class="stringliteral">" num_stripes:"</span> << stripes.size() << <span class="stringliteral">" (<= "</span> << threshold << <span class="stringliteral">")"</span>;</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> </div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">if</span> (transpose) {</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  *x_threshold = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(*x_threshold, max_conflict_height);</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  *y_threshold = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(*y_threshold, max_conflict_height);</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span> }</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> </div><div class="line"><a name="l00300"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a4e6ac3124f7b4484cb98c11d412f9f34"> 300</a></span> absl::Span<int> <a class="code" href="namespaceoperations__research_1_1sat.html#a4e6ac3124f7b4484cb98c11d412f9f34">FilterBoxesAndRandomize</a>(</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keyword">const</span> std::vector<Rectangle>& cached_rectangles, absl::Span<int> boxes,</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  IntegerValue threshold_x, IntegerValue threshold_y,</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  absl::BitGenRef random) {</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordtype">size_t</span> new_size = 0;</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> : boxes) {</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html">Rectangle</a>& dim = cached_rectangles[<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>];</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">if</span> (dim.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a0cc9a3a200ee27bae9b9907d97b5718e">x_max</a> - dim.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a1f62ae069f3793df9ae18399ba6d052c">x_min</a> > threshold_x) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">if</span> (dim.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#ae39303b5b3149e1914834c36ad51fe8f">y_max</a> - dim.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a379a897decc0711464cb15e8d02fd095">y_min</a> > threshold_y) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  boxes[new_size++] = <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>;</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  }</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">if</span> (new_size == 0) <span class="keywordflow">return</span> {};</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  std::shuffle(&boxes[0], &boxes[0] + new_size, random);</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">return</span> {&boxes[0], new_size};</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> }</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> </div><div class="line"><a name="l00316"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ae5c5a34c633c8746d9caca8d79cf2727"> 316</a></span> absl::Span<int> <a class="code" href="namespaceoperations__research_1_1sat.html#ae5c5a34c633c8746d9caca8d79cf2727">FilterBoxesThatAreTooLarge</a>(</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keyword">const</span> std::vector<Rectangle>& cached_rectangles,</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keyword">const</span> std::vector<IntegerValue>& energies, absl::Span<int> boxes) {</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">// Sort the boxes by increasing area.</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  std::sort(boxes.begin(), boxes.end(), [&cached_rectangles](<span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keywordflow">return</span> cached_rectangles[<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>].Area() < cached_rectangles[<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>].Area();</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  });</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> </div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  IntegerValue total_energy(0);</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> box : boxes) total_energy += energies[box];</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> </div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="comment">// Remove all the large boxes until we have one with area smaller than the</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="comment">// energy of the boxes below.</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordtype">int</span> new_size = boxes.size();</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keywordflow">while</span> (new_size > 0 &&</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  cached_rectangles[boxes[new_size - 1]].Area() >= total_energy) {</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  --new_size;</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  total_energy -= energies[boxes[new_size]];</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  }</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordflow">return</span> boxes.subspan(0, new_size);</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> }</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> </div><div class="line"><a name="l00338"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ae9f98f44fb1fe23a4085269af186358e"> 338</a></span> std::ostream& <a class="code" href="namespaceoperations__research_1_1sat.html#a15ca399ada8a279dc92f693ede7e4004">operator<<</a>(std::ostream& out, <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_indexed_interval.html">IndexedInterval</a>& <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>) {</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">return</span> out << <span class="stringliteral">"["</span> << <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.start << <span class="stringliteral">".."</span> << <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.end << <span class="stringliteral">" (#"</span></div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  << <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.<a class="code" href="classoperations__research_1_1sat_1_1_interval_var.html#acca41811e8aaab0112b987749c0ecb93">index</a> << <span class="stringliteral">")]"</span>;</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> }</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> </div><div class="line"><a name="l00343"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a74b637c7690aa3cd4c80157b44c5e5ac"> 343</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a74b637c7690aa3cd4c80157b44c5e5ac">ConstructOverlappingSets</a>(<span class="keywordtype">bool</span> already_sorted,</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  std::vector<IndexedInterval>* intervals,</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  std::vector<std::vector<int>>* result) {</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  result->clear();</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">if</span> (already_sorted) {</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::is_sorted(intervals->begin(), intervals->end(),</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <a class="code" href="structoperations__research_1_1sat_1_1_indexed_interval_1_1_comparator_by_start.html">IndexedInterval::ComparatorByStart</a>()));</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  std::sort(intervals->begin(), intervals->end(),</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <a class="code" href="structoperations__research_1_1sat_1_1_indexed_interval_1_1_comparator_by_start.html">IndexedInterval::ComparatorByStart</a>());</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  }</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  IntegerValue min_end_in_set = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  intervals->push_back({-1, <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>}); <span class="comment">// Sentinel.</span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = intervals->size();</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> </div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="comment">// We do a line sweep. The "current" subset crossing the "line" at</span></div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="comment">// (time, time + 1) will be in (*intervals)[start_index, end_index) at the end</span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="comment">// of the loop block.</span></div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordtype">int</span> start_index = 0;</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> end_index = 0; end_index < size;) {</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> = (*intervals)[end_index].start;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> </div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="comment">// First, if there is some deletion, we will push the "old" set to the</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="comment">// result before updating it. Otherwise, we will have a superset later, so</span></div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="comment">// we just continue for now.</span></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordflow">if</span> (min_end_in_set <= <a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>) {</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  result->push_back({});</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  min_end_in_set = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = start_index; i < end_index; ++i) {</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  result->back().push_back((*intervals)[i].<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">if</span> ((*intervals)[i].end <= <a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>) {</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>((*intervals)[start_index++], (*intervals)[i]);</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  min_end_in_set = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_end_in_set, (*intervals)[i].end);</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">// Do not output subset of size one.</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordflow">if</span> (result->back().size() == 1) result->pop_back();</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  }</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> </div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="comment">// Add all the new intervals starting exactly at "time".</span></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">do</span> {</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  min_end_in_set = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_end_in_set, (*intervals)[end_index].end);</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  ++end_index;</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  } <span class="keywordflow">while</span> (end_index < size && (*intervals)[end_index].start == <a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>);</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  }</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> }</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> </div><div class="line"><a name="l00392"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a3087cde516cefe9797be88d14a80079b"> 392</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a3087cde516cefe9797be88d14a80079b">GetOverlappingIntervalComponents</a>(</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  std::vector<IndexedInterval>* intervals,</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  std::vector<std::vector<int>>* components) {</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  components->clear();</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keywordflow">if</span> (intervals->empty()) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">if</span> (intervals->size() == 1) {</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  components->push_back({intervals->front().index});</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  }</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span> </div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="comment">// For correctness, ComparatorByStart is enough, but in unit tests we want to</span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="comment">// verify this function against another implementation, and fully defined</span></div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="comment">// sorting with tie-breaking makes that much easier.</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="comment">// If that becomes a performance bottleneck:</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="comment">// - One may want to sort the list outside of this function, and simply</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="comment">// have this function DCHECK that it's sorted by start.</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="comment">// - One may use std::stable_sort() with ComparatorByStart().</span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  std::sort(intervals->begin(), intervals->end(),</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <a class="code" href="structoperations__research_1_1sat_1_1_indexed_interval_1_1_comparator_by_start_then_end_then_index.html">IndexedInterval::ComparatorByStartThenEndThenIndex</a>());</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> </div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  IntegerValue end_max_so_far = (*intervals)[0].end;</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  components->push_back({(*intervals)[0].index});</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < intervals->size(); ++i) {</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_indexed_interval.html">IndexedInterval</a>& <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> = (*intervals)[i];</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.start >= end_max_so_far) {</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  components->push_back({<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.<a class="code" href="classoperations__research_1_1sat_1_1_interval_var.html#acca41811e8aaab0112b987749c0ecb93">index</a>});</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  components->back().push_back(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.<a class="code" href="classoperations__research_1_1sat_1_1_interval_var.html#acca41811e8aaab0112b987749c0ecb93">index</a>);</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>  end_max_so_far = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(end_max_so_far, <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.end);</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  }</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> }</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> </div><div class="line"><a name="l00425"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a29fc5608780f1d24b490a8bc3650774e"> 425</a></span> std::vector<int> <a class="code" href="namespaceoperations__research_1_1sat.html#a29fc5608780f1d24b490a8bc3650774e">GetIntervalArticulationPoints</a>(</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  std::vector<IndexedInterval>* intervals) {</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  std::vector<int> articulation_points;</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordflow">if</span> (intervals->size() < 3) <span class="keywordflow">return</span> articulation_points; <span class="comment">// Empty.</span></div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_indexed_interval.html">IndexedInterval</a>& <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> : *intervals) {</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.start, <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.end);</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  }</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  }</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> </div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  std::sort(intervals->begin(), intervals->end(),</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <a class="code" href="structoperations__research_1_1sat_1_1_indexed_interval_1_1_comparator_by_start.html">IndexedInterval::ComparatorByStart</a>());</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> </div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  IntegerValue end_max_so_far = (*intervals)[0].end;</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordtype">int</span> index_of_max = 0;</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  IntegerValue prev_end_max = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>; <span class="comment">// Initialized as a sentinel.</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < intervals->size(); ++i) {</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_indexed_interval.html">IndexedInterval</a>& <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> = (*intervals)[i];</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.start >= end_max_so_far) {</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="comment">// New connected component.</span></div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  end_max_so_far = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.end;</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  index_of_max = i;</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  prev_end_max = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  }</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="comment">// Still the same connected component. Was the previous "max" an</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="comment">// articulation point ?</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordflow">if</span> (prev_end_max != <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a> && <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.start >= prev_end_max) {</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="comment">// We might be re-inserting the same articulation point: guard against it.</span></div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keywordflow">if</span> (articulation_points.empty() ||</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  articulation_points.back() != index_of_max) {</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  articulation_points.push_back(index_of_max);</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>  }</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="comment">// Update the max end.</span></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.end > end_max_so_far) {</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  prev_end_max = end_max_so_far;</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  end_max_so_far = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.end;</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  index_of_max = i;</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.end > prev_end_max) {</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  prev_end_max = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.end;</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  }</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  }</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="comment">// Convert articulation point indices to IndexedInterval.index.</span></div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span>& <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : articulation_points) <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = (*intervals)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].index;</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordflow">return</span> articulation_points;</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> }</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> </div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_afdbd968230d01fa0e91bc15b6f5994e3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">operations_research::sat::SchedulingConstraintHelper::SizeMin</a></div><div class="ttdeci">IntegerValue SizeMin(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00226">intervals.h:226</a></div></div>
|
|
<div class="ttc" id="macros_8h_html_a7f536a3b33f9bed8f75734e035d30725"><div class="ttname"><a href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div><div class="ttdeci">const bool DEBUG_MODE</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00024">macros.h:24</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_indexed_interval_1_1_comparator_by_start_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_indexed_interval_1_1_comparator_by_start.html">operations_research::sat::IndexedInterval::ComparatorByStart</a></div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00125">diffn_util.h:125</a></div></div>
|
|
<div class="ttc" id="stl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a3087cde516cefe9797be88d14a80079b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3087cde516cefe9797be88d14a80079b">operations_research::sat::GetOverlappingIntervalComponents</a></div><div class="ttdeci">void GetOverlappingIntervalComponents(std::vector< IndexedInterval > *intervals, std::vector< std::vector< int >> *components)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00392">diffn_util.cc:392</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a355a62f25cfadeccfb164ab9fb867c81"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">operations_research::sat::kMinIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMinIntegerValue(-kMaxIntegerValue)</div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a4e6ac3124f7b4484cb98c11d412f9f34"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4e6ac3124f7b4484cb98c11d412f9f34">operations_research::sat::FilterBoxesAndRandomize</a></div><div class="ttdeci">absl::Span< int > FilterBoxesAndRandomize(const std::vector< Rectangle > &cached_rectangles, absl::Span< int > boxes, IntegerValue threshold_x, IntegerValue threshold_y, absl::BitGenRef random)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00300">diffn_util.cc:300</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00703">base/logging.h:703</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00979">base/logging.h:979</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_interval_var_html_acca41811e8aaab0112b987749c0ecb93"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_interval_var.html#acca41811e8aaab0112b987749c0ecb93">operations_research::sat::IntervalVar::index</a></div><div class="ttdeci">int index() const</div><div class="ttdoc">Returns the index of the interval constraint in the model.</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8h_source.html#l00395">cp_model.h:395</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap< K, V > &a, IdMap< K, V > &b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00263">id_map.h:263</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a9ce9e563527f073b9aac535e63b7f647"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9ce9e563527f073b9aac535e63b7f647">operations_research::sat::SchedulingConstraintHelper::ImportOtherReasons</a></div><div class="ttdeci">void ImportOtherReasons(const SchedulingConstraintHelper &other_helper)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00541">intervals.cc:541</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html_ae39303b5b3149e1914834c36ad51fe8f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#ae39303b5b3149e1914834c36ad51fe8f">operations_research::sat::Rectangle::y_max</a></div><div class="ttdeci">IntegerValue y_max</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00033">diffn_util.h:33</a></div></div>
|
|
<div class="ttc" id="namespacegtl_html_a288a1dc92da5d3ad62d4bc4cec9e8b1d"><div class="ttname"><a href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a></div><div class="ttdeci">void STLSortAndRemoveDuplicates(T *v, const LessFunc &less_func)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00058">stl_util.h:58</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_indexed_interval_1_1_comparator_by_start_then_end_then_index_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_indexed_interval_1_1_comparator_by_start_then_end_then_index.html">operations_research::sat::IndexedInterval::ComparatorByStartThenEndThenIndex</a></div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00119">diffn_util.h:119</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html_a0cc9a3a200ee27bae9b9907d97b5718e"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#a0cc9a3a200ee27bae9b9907d97b5718e">operations_research::sat::Rectangle::x_max</a></div><div class="ttdeci">IntegerValue x_max</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00031">diffn_util.h:31</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a1227e67513602591fb959e35c9de66e8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">operations_research::sat::kMaxIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMaxIntegerValue(std::numeric_limits< IntegerValue::ValueType >::max() - 1)</div></div>
|
|
<div class="ttc" id="constraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_indexed_interval_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_indexed_interval.html">operations_research::sat::IndexedInterval</a></div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00107">diffn_util.h:107</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_af9c040735b02626e2c373e820d4b6416"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">operations_research::sat::SchedulingConstraintHelper::ClearReason</a></div><div class="ttdeci">void ClearReason()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00488">intervals.h:488</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a5caf109ec436f43088925c00bb64794b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5caf109ec436f43088925c00bb64794b">operations_research::sat::SchedulingConstraintHelper::ShiftedEndMax</a></div><div class="ttdeci">IntegerValue ShiftedEndMax(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00256">intervals.h:256</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html">operations_research::sat::Rectangle</a></div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00029">diffn_util.h:29</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ad663c8b14dbad962a78333fbc02c7967"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad663c8b14dbad962a78333fbc02c7967">operations_research::sat::SchedulingConstraintHelper::AddEnergyMinInIntervalReason</a></div><div class="ttdeci">void AddEnergyMinInIntervalReason(int t, IntegerValue min, IntegerValue max)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00600">intervals.h:600</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html_a72c77da14562bc93e057989744b551fd"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#a72c77da14562bc93e057989744b551fd">operations_research::sat::Rectangle::Area</a></div><div class="ttdeci">IntegerValue Area() const</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00042">diffn_util.h:42</a></div></div>
|
|
<div class="ttc" id="resource_8cc_html_a4a6149ef5bdc681a998b90bb5c165bf3"><div class="ttname"><a href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a></div><div class="ttdeci">int64_t energy</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00354">resource.cc:354</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html_a1f62ae069f3793df9ae18399ba6d052c"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#a1f62ae069f3793df9ae18399ba6d052c">operations_research::sat::Rectangle::x_min</a></div><div class="ttdeci">IntegerValue x_min</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00030">diffn_util.h:30</a></div></div>
|
|
<div class="ttc" id="pack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a74b637c7690aa3cd4c80157b44c5e5ac"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a74b637c7690aa3cd4c80157b44c5e5ac">operations_research::sat::ConstructOverlappingSets</a></div><div class="ttdeci">void ConstructOverlappingSets(bool already_sorted, std::vector< IndexedInterval > *intervals, std::vector< std::vector< int >> *result)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00343">diffn_util.cc:343</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html_ae0f155c5fab2db4cf40e75f0ad6039f6"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#ae0f155c5fab2db4cf40e75f0ad6039f6">operations_research::sat::Rectangle::TakeUnionWith</a></div><div class="ttdeci">void TakeUnionWith(const Rectangle &other)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00035">diffn_util.h:35</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a3e2516c0d3fc4991896c6a9bbead80e7"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3e2516c0d3fc4991896c6a9bbead80e7">operations_research::sat::GetOverlappingRectangleComponents</a></div><div class="ttdeci">std::vector< absl::Span< int > > GetOverlappingRectangleComponents(const std::vector< Rectangle > &rectangles, absl::Span< int > active_rectangles)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00026">diffn_util.cc:26</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a98d09c7e8c4f5a15b569f5f14fa9937a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a98d09c7e8c4f5a15b569f5f14fa9937a">operations_research::sat::AnalyzeIntervals</a></div><div class="ttdeci">bool AnalyzeIntervals(bool transpose, absl::Span< const int > local_boxes, const std::vector< Rectangle > &rectangles, const std::vector< IntegerValue > &rectangle_energies, IntegerValue *x_threshold, IntegerValue *y_threshold, Rectangle *conflict)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00148">diffn_util.cc:148</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a9583bbea958febd24d92742c2f137d22"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22">operations_research::sat::SchedulingConstraintHelper::ReportConflict</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool ReportConflict()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00503">intervals.cc:503</a></div></div>
|
|
<div class="ttc" id="base_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#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_acb732f4a9114d03a4b3e53109923e60f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#acb732f4a9114d03a4b3e53109923e60f">operations_research::sat::BoxesAreInEnergyConflict</a></div><div class="ttdeci">bool BoxesAreInEnergyConflict(const std::vector< Rectangle > &rectangles, const std::vector< IntegerValue > &energies, absl::Span< const int > boxes, Rectangle *conflict)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00081">diffn_util.cc:81</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ac15dce45cd213b58af7a1fd6fc8a6ebc"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac15dce45cd213b58af7a1fd6fc8a6ebc">operations_research::sat::ReportEnergyConflict</a></div><div class="ttdeci">bool ReportEnergyConflict(Rectangle bounding_box, absl::Span< const int > boxes, SchedulingConstraintHelper *x, SchedulingConstraintHelper *y)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00052">diffn_util.cc:52</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">operations_research::sat::SchedulingConstraintHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00173">intervals.h:173</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a29b96869d2a821cf1d2e6099e7a0f51b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">operations_research::sat::CeilRatio</a></div><div class="ttdeci">IntegerValue CeilRatio(IntegerValue dividend, IntegerValue positive_divisor)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00082">integer.h:82</a></div></div>
|
|
<div class="ttc" id="diffn__util_8h_html"><div class="ttname"><a href="diffn__util_8h.html">diffn_util.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="resource_8cc_html_aee52de7b225665566aa47246b9d6b8fa"><div class="ttname"><a href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a></div><div class="ttdeci">int64_t time</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01691">resource.cc:1691</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ae5c5a34c633c8746d9caca8d79cf2727"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae5c5a34c633c8746d9caca8d79cf2727">operations_research::sat::FilterBoxesThatAreTooLarge</a></div><div class="ttdeci">absl::Span< int > FilterBoxesThatAreTooLarge(const std::vector< Rectangle > &cached_rectangles, const std::vector< IntegerValue > &energies, absl::Span< int > boxes)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00316">diffn_util.cc:316</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a29fc5608780f1d24b490a8bc3650774e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a29fc5608780f1d24b490a8bc3650774e">operations_research::sat::GetIntervalArticulationPoints</a></div><div class="ttdeci">std::vector< int > GetIntervalArticulationPoints(std::vector< IndexedInterval > *intervals)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00425">diffn_util.cc:425</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a0d7780af676ab4fd1c57e62da9e03686"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a0d7780af676ab4fd1c57e62da9e03686">operations_research::sat::SchedulingConstraintHelper::ShiftedStartMin</a></div><div class="ttdeci">IntegerValue ShiftedStartMin(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00250">intervals.h:250</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a15ca399ada8a279dc92f693ede7e4004"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a15ca399ada8a279dc92f693ede7e4004">operations_research::sat::operator<<</a></div><div class="ttdeci">std::ostream & operator<<(std::ostream &os, const BoolVar &var)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8cc_source.html#l00068">cp_model.cc:68</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html_af35016193fab7576c18a7fbd0e3b9a20"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#af35016193fab7576c18a7fbd0e3b9a20">operations_research::sat::Rectangle::IsDisjoint</a></div><div class="ttdeci">bool IsDisjoint(const Rectangle &other) const</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00021">diffn_util.cc:21</a></div></div>
|
|
<div class="ttc" id="vlog__is__on_8h_html_a956152cad330225654d128f35c00efce"><div class="ttname"><a href="vlog__is__on_8h.html#a956152cad330225654d128f35c00efce">VLOG_IS_ON</a></div><div class="ttdeci">#define VLOG_IS_ON(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="vlog__is__on_8h_source.html#l00041">vlog_is_on.h:41</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html_a379a897decc0711464cb15e8d02fd095"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#a379a897decc0711464cb15e8d02fd095">operations_research::sat::Rectangle::y_min</a></div><div class="ttdeci">IntegerValue y_min</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00032">diffn_util.h:32</a></div></div>
|
|
<div class="ttc" id="resource_8cc_html_af92a8383a05fdf586a52263d358f5ada"><div class="ttname"><a href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a></div><div class="ttdeci">IntervalVar * interval</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00100">resource.cc:100</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</a></div></div>
|
|
<div class="ttc" id="constraint__solver_2table_8cc_html_acb18315d548212835cd8ed4287e6c0b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a></div><div class="ttdeci">int64_t a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00046">constraint_solver/table.cc:46</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_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="diffn__util_8cc.html">diffn_util.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|