686 lines
140 KiB
HTML
686 lines
140 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: precedences.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">8.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('precedences_8h_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">precedences.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="precedences_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#ifndef OR_TOOLS_SAT_PRECEDENCES_H_</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#define OR_TOOLS_SAT_PRECEDENCES_H_</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  </div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <deque></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <functional></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  </div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "absl/container/inlined_vector.h"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="int__type_8h.html">ortools/base/int_type.h</a>"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="strong__vector_8h.html">ortools/base/strong_vector.h</a>"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="sat_2model_8h.html">ortools/sat/model.h</a>"</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="bitset_8h.html">ortools/util/bitset.h</a>"</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  </div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  </div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// This class implement a propagator on simple inequalities between integer</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// variables of the form (i1 + offset <= i2). The offset can be constant or</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// given by the value of a third integer variable. Offsets can also be negative.</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// The algorithm works by mapping the problem onto a graph where the edges carry</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// the offset and the nodes correspond to one of the two bounds of an integer</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// variable (lower_bound or -upper_bound). It then find the fixed point using an</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// incremental variant of the Bellman-Ford(-Tarjan) algorithm.</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// This is also known as an "integer difference logic theory" in the SMT world.</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// Another word is "separation logic".</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// TODO(user): We could easily generalize the code to support any relation of</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// the form a*X + b*Y + c*Z >= rhs (or <=). Do that since this class should be</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// a lot faster at propagating small linear inequality than the generic</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// propagator and the overhead of supporting coefficient should not be too bad.</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_precedences_propagator.html"> 51</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html">SatPropagator</a>, <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#abad6589aa3f099fb7024ff6a2ee36740"> 53</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#abad6589aa3f099fb7024ff6a2ee36740">PrecedencesPropagator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html">SatPropagator</a>(<span class="stringliteral">"PrecedencesPropagator"</span>),</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>()),</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  integer_trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>()),</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  watcher_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>()),</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  watcher_id_(watcher_->Register(this)) {</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>()->AddPropagator(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a1eb60e3eca768de339988b37c6f1fd0b">RegisterWatcher</a>(&modified_vars_);</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  watcher_-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adc5598223a363c10d95c00395145bcc6">SetPropagatorPriority</a>(watcher_id_, 0);</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  }</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  </div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() final;</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>(<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail) final;</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#ae20e3965a974e3a5fe816c033a94e568">Untrail</a>(const <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail, <span class="keywordtype">int</span> trail_index) final;</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  </div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="comment">// Propagates all the outgoing arcs of the given variable (and only those). It</span></div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="comment">// is more efficient to do all these propagation in one go by calling</span></div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">// Propagate(), but for scheduling problem, we wants to propagate right away</span></div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// the end of an interval when its start moved.</span></div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#af3c64e10aa2bb2cc1d3615d800f7c71c">PropagateOutgoingArcs</a>(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  </div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// Add a precedence relation (i1 + offset <= i2) between integer variables.</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// Important: The optionality of the variable should be marked BEFORE this</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// is called.</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#aa97e673a3c2e15343be943e4b9267fbf">AddPrecedence</a>(IntegerVariable i1, IntegerVariable i2);</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a7bda671267128f7c8f28d85a3e191103">AddPrecedenceWithOffset</a>(IntegerVariable i1, IntegerVariable i2,</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  IntegerValue offset);</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#abcd500e5d877b7f02d2358b7e7e5fdd1">AddPrecedenceWithVariableOffset</a>(IntegerVariable i1, IntegerVariable i2,</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  IntegerVariable offset_var);</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  </div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// Same as above, but the relation is only true when the given literal is.</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a1565f1c871fd2efe2b4bc30cb84d0872">AddConditionalPrecedence</a>(IntegerVariable i1, IntegerVariable i2,</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l);</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a5979d0d9a10950afe6bb1d4423b41b32">AddConditionalPrecedenceWithOffset</a>(IntegerVariable i1,</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  IntegerVariable i2,</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  IntegerValue offset, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l);</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  </div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// Generic function that cover all of the above case and more.</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a863fce270e52490f300fa1fe27a7cb04">AddPrecedenceWithAllOptions</a>(IntegerVariable i1, IntegerVariable i2,</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  IntegerValue offset,</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  IntegerVariable offset_var,</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <a class="code" href="namespaceabsl.html">absl</a>::Span<const <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>> presence_literals);</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  </div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// Finds all the IntegerVariable that are "after" at least two of the</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// IntegerVariable in vars. Returns a vector of these precedences relation</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// sorted by IntegerPrecedences.var so that it is efficient to find all the</span></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// IntegerVariable "before" another one.</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// Note that we only consider direct precedences here. Given our usage, it may</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// be better to compute the full reachability in the precedence graph, but in</span></div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// pratice that may be too slow.</span></div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// Note that the IntegerVariable in the vector are also returned in</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// topological order for a more efficient propagation in</span></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// DisjunctivePrecedences::Propagate() where this is used.</span></div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">// Important: For identical vars, the entry are sorted by index.</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html"> 111</a></span>  struct <a class="code" href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html">IntegerPrecedences</a> {</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html#a750b5d744c39a06bfb13e6eb010e35d0"> 112</a></span>  <span class="keywordtype">int</span> <a class="code" href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>; <span class="comment">// position in vars.</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html#ab6516f556b715738034b30d290c40214"> 113</a></span>  IntegerVariable <a class="code" href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html#ab6516f556b715738034b30d290c40214">var</a>; <span class="comment">// An IntegerVariable that is >= to vars[index].</span></div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html#aa34933f5ae5cfa4c08158d3f2e275d29"> 114</a></span>  <span class="keywordtype">int</span> <a class="code" href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html#aa34933f5ae5cfa4c08158d3f2e275d29">arc_index</a>; <span class="comment">// Used by AddPrecedenceReason().</span></div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html#acd07f8397a2e61932c8ee17a4e300e23"> 115</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html#acd07f8397a2e61932c8ee17a4e300e23">offset</a>; <span class="comment">// we have: vars[index] + offset <= var</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  };</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a880ad5f7514aee33f81302d8af2a7be2">ComputePrecedences</a>(<span class="keyword">const</span> std::vector<IntegerVariable>& vars,</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  std::vector<IntegerPrecedences>* output);</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a09ebe3a2f1825d6366649cd157e5020f">AddPrecedenceReason</a>(<span class="keywordtype">int</span> arc_index, IntegerValue min_offset,</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  std::vector<Literal>* literal_reason,</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  std::vector<IntegerLiteral>* integer_reason) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  </div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">// Advanced usage. To be called once all the constraints have been added to</span></div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// the model. This will loop over all "node" in this class, and if one of its</span></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// optional incoming arcs must be chosen, it will add a corresponding</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// GreaterThanAtLeastOneOfConstraint(). Returns the number of added</span></div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// constraint.</span></div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">// TODO(user): This can be quite slow, add some kind of deterministic limit</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="comment">// so that we can use it all the time.</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#ab802de47d15374aab8e3721d5fc508e5">AddGreaterThanAtLeastOneOfConstraints</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  </div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  DEFINE_INT_TYPE(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a>, <span class="keywordtype">int</span>);</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  DEFINE_INT_TYPE(OptionalArcIndex, <span class="keywordtype">int</span>);</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>  <span class="comment">// Given an existing clause, sees if it can be used to add "greater than at</span></div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">// least one of" type of constraints. Returns the number of such constraint</span></div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// added.</span></div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordtype">int</span> AddGreaterThanAtLeastOneOfConstraintsFromClause(</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">const</span> absl::Span<const Literal> clause, <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  </div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// Another approach for AddGreaterThanAtLeastOneOfConstraints(), this one</span></div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// might be a bit slow as it relies on the propagation engine to detect</span></div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="comment">// clauses between incoming arcs presence literals.</span></div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// Returns the number of added constraints.</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordtype">int</span> AddGreaterThanAtLeastOneOfConstraintsWithClauseAutoDetection(</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  </div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="comment">// Information about an individual arc.</span></div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">struct </span>ArcInfo {</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  IntegerVariable tail_var;</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  IntegerVariable head_var;</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  </div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  IntegerValue offset;</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  IntegerVariable offset_var; <span class="comment">// kNoIntegerVariable if none.</span></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  </div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// This arc is "present" iff all these literals are true.</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  absl::InlinedVector<Literal, 6> presence_literals;</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  </div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// Used temporarily by our implementation of the Bellman-Ford algorithm. It</span></div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// should be false at the beginning of BellmanFordTarjan().</span></div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keyword">mutable</span> <span class="keywordtype">bool</span> is_marked;</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  };</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  </div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// Internal functions to add new precedence relations.</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// Note that internally, we only propagate lower bounds, so each time we add</span></div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// an arc, we actually create two of them: one on the given variables, and one</span></div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// on their negation.</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordtype">void</span> AdjustSizeFor(IntegerVariable i);</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordtype">void</span> AddArc(IntegerVariable <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, IntegerVariable <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>, IntegerValue offset,</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  IntegerVariable offset_var,</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  absl::Span<const Literal> presence_literals);</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  </div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">// Enqueue a new lower bound for the variable arc.head_lb that was deduced</span></div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">// from the current value of arc.tail_lb and the offset of this arc.</span></div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordtype">bool</span> EnqueueAndCheck(<span class="keyword">const</span> ArcInfo& arc, IntegerValue new_head_lb,</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail);</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  IntegerValue ArcOffset(<span class="keyword">const</span> ArcInfo& arc) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  </div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// Inspect all the optional arcs that needs inspection (to stay sparse) and</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// check if their presence literal can be propagated to false.</span></div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordtype">void</span> PropagateOptionalArcs(<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail);</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  </div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// The core algorithm implementation is split in these functions. One must</span></div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// first call InitializeBFQueueWithModifiedNodes() that will push all the</span></div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// IntegerVariable whose lower bound has been modified since the last call.</span></div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// Then, BellmanFordTarjan() will take care of all the propagation and returns</span></div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// false in case of conflict. Internally, it uses DisassembleSubtree() which</span></div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// is the Tarjan variant to detect a possible positive cycle. Before exiting,</span></div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// it will call CleanUpMarkedArcsAndParents().</span></div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="comment">// The Tarjan version of the Bellam-Ford algorithm is really nice in our</span></div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="comment">// context because it was really easy to make it incremental. Moreover, it</span></div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="comment">// supports batch increment!</span></div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// This implementation is kind of unique because of our context and the fact</span></div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// that it is incremental, but a good reference is "Negative-cycle detection</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">// algorithms", Boris V. Cherkassky, Andrew V. Goldberg, 1996,</span></div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="comment">// http://people.cs.nctu.edu.tw/~tjshen/doc/ne.pdf</span></div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordtype">void</span> InitializeBFQueueWithModifiedNodes();</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordtype">bool</span> BellmanFordTarjan(<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail);</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordtype">bool</span> DisassembleSubtree(<span class="keywordtype">int</span> source, <span class="keywordtype">int</span> target,</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  std::vector<bool>* can_be_skipped);</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordtype">void</span> AnalyzePositiveCycle(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> first_arc, <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail,</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  std::vector<Literal>* must_be_all_true,</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  std::vector<Literal>* literal_reason,</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  std::vector<IntegerLiteral>* integer_reason);</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordtype">void</span> CleanUpMarkedArcsAndParents();</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  </div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="comment">// Loops over all the arcs and verify that there is no propagation left.</span></div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="comment">// This is only meant to be used in a DCHECK() and is not optimized.</span></div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordtype">bool</span> NoPropagationLeft(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  </div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">// External class needed to get the IntegerVariable lower bounds and Enqueue</span></div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// new ones.</span></div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail_;</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail_;</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher_;</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordtype">int</span> watcher_id_;</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  </div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">// The key to our incrementality. This will be cleared once the propagation</span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="comment">// is done, and automatically updated by the integer_trail_ with all the</span></div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="comment">// IntegerVariable that changed since the last clear.</span></div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="classoperations__research_1_1_sparse_bitset.html">SparseBitset<IntegerVariable></a> modified_vars_;</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="comment">// An arc needs to be inspected for propagation (i.e. is impacted) if its</span></div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="comment">// tail_var changed. If an arc has 3 variables (tail, offset, head), it will</span></div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// appear as 6 different entries in the arcs_ vector, one for each variable</span></div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="comment">// and its negation, each time with a different tail.</span></div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="comment">// TODO(user): rearranging the index so that the arc of the same node are</span></div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">// consecutive like in StaticGraph should have a big performance impact.</span></div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="comment">// TODO(user): We do not need to store ArcInfo.tail_var here.</span></div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, absl::InlinedVector<ArcIndex, 6></a>></div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  impacted_arcs_;</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<ArcIndex, ArcInfo></a> arcs_;</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  </div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">// This is similar to impacted_arcs_/arcs_ but it is only used to propagate</span></div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">// one of the presence literals when the arc cannot be present. An arc needs</span></div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="comment">// to appear only once in potential_arcs_, but it will be referenced by</span></div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">// all its variable in impacted_potential_arcs_.</span></div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, absl::InlinedVector<OptionalArcIndex, 6></a>></div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  impacted_potential_arcs_;</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<OptionalArcIndex, ArcInfo></a> potential_arcs_;</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  </div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="comment">// Temporary vectors used by ComputePrecedences().</span></div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, int></a> var_to_degree_;</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, int></a> var_to_last_index_;</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keyword">struct </span>SortedVar {</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>;</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  IntegerValue lower_bound;</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordtype">bool</span> operator<(<span class="keyword">const</span> SortedVar& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordflow">return</span> lower_bound < other.lower_bound;</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>  };</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  std::vector<SortedVar> tmp_sorted_vars_;</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  std::vector<IntegerPrecedences> tmp_precedences_;</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  </div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">// Each time a literal becomes true, this list the set of arcs for which we</span></div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">// need to decrement their count. When an arc count reach zero, it must be</span></div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// added to the set of impacted_arcs_. Note that counts never becomes</span></div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="comment">// negative.</span></div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">// TODO(user): Try a one-watcher approach instead. Note that in most cases</span></div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="comment">// arc should be controlled by 1 or 2 literals, so not sure it is worth it.</span></div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, absl::InlinedVector<ArcIndex, 6></a>></div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  literal_to_new_impacted_arcs_;</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<ArcIndex, int></a> arc_counts_;</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  </div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="comment">// Temp vectors to hold the reason of an assignment.</span></div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  std::vector<Literal> literal_reason_;</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  std::vector<IntegerLiteral> integer_reason_;</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>  <span class="comment">// Temp vectors for the Bellman-Ford algorithm. The graph in which this</span></div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// algorithm works is in one to one correspondence with the IntegerVariable in</span></div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="comment">// impacted_arcs_.</span></div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  std::deque<int> bf_queue_;</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  std::vector<bool> bf_in_queue_;</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  std::vector<bool> bf_can_be_skipped_;</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  std::vector<ArcIndex> bf_parent_arc_of_;</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  </div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">// Temp vector used by the tree traversal in DisassembleSubtree().</span></div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  std::vector<int> tmp_vector_;</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>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#abad6589aa3f099fb7024ff6a2ee36740">PrecedencesPropagator</a>);</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span> };</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  </div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span> <span class="comment">// =============================================================================</span></div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span> <span class="comment">// Implementation of the small API functions below.</span></div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="comment">// =============================================================================</span></div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  </div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#aa97e673a3c2e15343be943e4b9267fbf"> 295</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#aa97e673a3c2e15343be943e4b9267fbf">PrecedencesPropagator::AddPrecedence</a>(IntegerVariable i1,</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  IntegerVariable i2) {</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  AddArc(i1, i2, <span class="comment">/*offset=*/</span>IntegerValue(0), <span class="comment">/*offset_var=*/</span><a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>,</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"> 300</span>  </div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a7bda671267128f7c8f28d85a3e191103"> 301</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a7bda671267128f7c8f28d85a3e191103">PrecedencesPropagator::AddPrecedenceWithOffset</a>(</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  IntegerVariable i1, IntegerVariable i2, IntegerValue offset) {</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  AddArc(i1, i2, offset, <span class="comment">/*offset_var=*/</span><a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>, {});</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span> }</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  </div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a1565f1c871fd2efe2b4bc30cb84d0872"> 306</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a1565f1c871fd2efe2b4bc30cb84d0872">PrecedencesPropagator::AddConditionalPrecedence</a>(IntegerVariable i1,</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  IntegerVariable i2,</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l) {</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  AddArc(i1, i2, <span class="comment">/*offset=*/</span>IntegerValue(0), <span class="comment">/*offset_var=*/</span><a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>,</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  {l});</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span> }</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  </div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a5979d0d9a10950afe6bb1d4423b41b32"> 313</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a5979d0d9a10950afe6bb1d4423b41b32">PrecedencesPropagator::AddConditionalPrecedenceWithOffset</a>(</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  IntegerVariable i1, IntegerVariable i2, IntegerValue offset, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l) {</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  AddArc(i1, i2, offset, <span class="comment">/*offset_var=*/</span><a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>, {l});</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span> }</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  </div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#abcd500e5d877b7f02d2358b7e7e5fdd1"> 318</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#abcd500e5d877b7f02d2358b7e7e5fdd1">PrecedencesPropagator::AddPrecedenceWithVariableOffset</a>(</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  IntegerVariable i1, IntegerVariable i2, IntegerVariable offset_var) {</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  AddArc(i1, i2, <span class="comment">/*offset=*/</span>IntegerValue(0), offset_var, {});</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span> }</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  </div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a863fce270e52490f300fa1fe27a7cb04"> 323</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a863fce270e52490f300fa1fe27a7cb04">PrecedencesPropagator::AddPrecedenceWithAllOptions</a>(</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  IntegerVariable i1, IntegerVariable i2, IntegerValue offset,</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  IntegerVariable offset_var, absl::Span<const Literal> presence_literals) {</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  AddArc(i1, i2, offset, offset_var, presence_literals);</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span> }</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  </div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="comment">// =============================================================================</span></div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="comment">// Model based functions.</span></div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span> <span class="comment">// =============================================================================</span></div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  </div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="comment">// a <= b.</span></div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a9d0a6eb626f8fe3562d141bef9c847d6"> 334</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#ad48b274dddb22fb445d5ab6edbf222df">LowerOrEqual</a>(IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>,</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordflow">return</span> <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>()->AddPrecedence(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>);</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  };</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span> }</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  </div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="comment">// a + offset <= b.</span></div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a32158dca9646a745f392cea12527a42b"> 342</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a32158dca9646a745f392cea12527a42b">LowerOrEqualWithOffset</a>(IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>,</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>,</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset) {</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">return</span> <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>()->AddPrecedenceWithOffset(</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, IntegerValue(offset));</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  };</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span> }</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  </div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment">// a + b <= ub.</span></div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#aacae3ff5d3c450a91ec05d9b2a6568f0"> 352</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#aacae3ff5d3c450a91ec05d9b2a6568f0">Sum2LowerOrEqual</a>(IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>,</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>,</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ub) {</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a32158dca9646a745f392cea12527a42b">LowerOrEqualWithOffset</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>), -ub);</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span> }</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  </div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span> <span class="comment">// l => (a + b <= ub).</span></div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a0634ba012cdeb4e4e1d946681acc6feb"> 359</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a0634ba012cdeb4e4e1d946681acc6feb">ConditionalSum2LowerOrEqual</a>(</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ub,</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keyword">const</span> std::vector<Literal>& enforcement_literals) {</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>* p = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>();</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  p-><a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a863fce270e52490f300fa1fe27a7cb04">AddPrecedenceWithAllOptions</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>), IntegerValue(-ub),</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>, enforcement_literals);</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  };</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span> }</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  </div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="comment">// a + b + c <= ub.</span></div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a9e8e2172cc33d047f83ef321ab747138"> 370</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a9e8e2172cc33d047f83ef321ab747138">Sum3LowerOrEqual</a>(IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>,</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>,</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  IntegerVariable c,</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ub) {</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>* p = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>();</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  p-><a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a863fce270e52490f300fa1fe27a7cb04">AddPrecedenceWithAllOptions</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(c), IntegerValue(-ub), <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, {});</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">// l => (a + b + c <= ub).</span></div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a1f38cd9af4ce815d3bf7b46e617cebd9"> 381</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a1f38cd9af4ce815d3bf7b46e617cebd9">ConditionalSum3LowerOrEqual</a>(</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, IntegerVariable c, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ub,</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keyword">const</span> std::vector<Literal>& enforcement_literals) {</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>* p = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>();</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  p-><a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a863fce270e52490f300fa1fe27a7cb04">AddPrecedenceWithAllOptions</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(c), IntegerValue(-ub), <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>,</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  enforcement_literals);</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  };</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span> }</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  </div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="comment">// a >= b.</span></div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a1ca507c16b5b862d2b77385a03d332b9"> 392</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#acb6021b325a62a7c9bd759f52111a887">GreaterOrEqual</a>(IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>,</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordflow">return</span> <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>()->AddPrecedence(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>);</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  };</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span> }</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  </div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="comment">// a == b.</span></div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#aadaa81c6b316f980d9609d49572c0494"> 400</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a607ba8d18e00b2e6dbdc8622bb74fdf5">Equality</a>(IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>,</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#ad48b274dddb22fb445d5ab6edbf222df">LowerOrEqual</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>));</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#ad48b274dddb22fb445d5ab6edbf222df">LowerOrEqual</a>(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>));</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  };</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span> }</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  </div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="comment">// a + offset == b.</span></div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a28941c68f2f19aedc5038c9e8f336816"> 409</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a28941c68f2f19aedc5038c9e8f336816">EqualityWithOffset</a>(IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>,</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>,</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset) {</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a32158dca9646a745f392cea12527a42b">LowerOrEqualWithOffset</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, offset));</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a32158dca9646a745f392cea12527a42b">LowerOrEqualWithOffset</a>(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, -offset));</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  };</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span> }</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  </div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="comment">// is_le => (a + offset <= b).</span></div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a38733d8aaf7083f231fc914c127f155d"> 419</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a38733d8aaf7083f231fc914c127f155d">ConditionalLowerOrEqualWithOffset</a>(</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_le) {</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>* p = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>();</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  p-><a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a5979d0d9a10950afe6bb1d4423b41b32">AddConditionalPrecedenceWithOffset</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, IntegerValue(offset), is_le);</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  };</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span> }</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  </div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="comment">// is_le => (a <= b).</span></div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#aa62b548274db01f5136c72437c13a875"> 428</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#aa62b548274db01f5136c72437c13a875">ConditionalLowerOrEqual</a>(IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>,</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>,</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_le) {</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a38733d8aaf7083f231fc914c127f155d">ConditionalLowerOrEqualWithOffset</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, 0, is_le);</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> <span class="comment">// literals => (a <= b).</span></div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a4aa82964f755a2bcba06123d352acd28"> 435</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#aa62b548274db01f5136c72437c13a875">ConditionalLowerOrEqual</a>(</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, absl::Span<const Literal> literals) {</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>* p = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>();</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  p-><a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a863fce270e52490f300fa1fe27a7cb04">AddPrecedenceWithAllOptions</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, IntegerValue(0),</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">/*offset_var*/</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>, literals);</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  };</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span> }</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  </div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="comment">// is_le <=> (a + offset <= b).</span></div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a4cbfd3ef9e4a23d109a2fd4bad3aefe4"> 445</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a4cbfd3ef9e4a23d109a2fd4bad3aefe4">ReifiedLowerOrEqualWithOffset</a>(</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_le) {</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>* p = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>();</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  p-><a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a5979d0d9a10950afe6bb1d4423b41b32">AddConditionalPrecedenceWithOffset</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, IntegerValue(offset), is_le);</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  </div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="comment">// The negation of (a + offset <= b) is (a + offset > b) which can be</span></div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="comment">// rewritten as (b + 1 - offset <= a).</span></div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  p-><a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a5979d0d9a10950afe6bb1d4423b41b32">AddConditionalPrecedenceWithOffset</a>(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, IntegerValue(1 - offset),</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  is_le.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>());</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  };</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span> }</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  </div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="comment">// is_eq <=> (a == b).</span></div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a8122843c07882c8619c9b357069d9c10"> 459</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a8122843c07882c8619c9b357069d9c10">ReifiedEquality</a>(IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>,</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>,</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_eq) {</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">// We creates two extra Boolean variables in this case.</span></div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="comment">// TODO(user): Avoid creating them if we already have some literal that</span></div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="comment">// have the same meaning. For instance if a client also wanted to know if</span></div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="comment">// a <= b, he would have called ReifiedLowerOrEqualWithOffset() directly.</span></div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_le = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">NewBooleanVariable</a>()), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_ge = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">NewBooleanVariable</a>()), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#aa874aee040980146062498b87e8fb956">ReifiedBoolAnd</a>({is_le, is_ge}, is_eq));</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a4cbfd3ef9e4a23d109a2fd4bad3aefe4">ReifiedLowerOrEqualWithOffset</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, 0, is_le));</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a4cbfd3ef9e4a23d109a2fd4bad3aefe4">ReifiedLowerOrEqualWithOffset</a>(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, 0, is_ge));</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  };</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span> }</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  </div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span> <span class="comment">// is_eq <=> (a + offset == b).</span></div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a6fff32fbcc23479d823063d268fd4ea3"> 477</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a6fff32fbcc23479d823063d268fd4ea3">ReifiedEqualityWithOffset</a>(IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>,</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>,</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset,</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_eq) {</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="comment">// We creates two extra Boolean variables in this case.</span></div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="comment">// TODO(user): Avoid creating them if we already have some literal that</span></div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="comment">// have the same meaning. For instance if a client also wanted to know if</span></div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="comment">// a <= b, he would have called ReifiedLowerOrEqualWithOffset() directly.</span></div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_le = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">NewBooleanVariable</a>()), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_ge = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">NewBooleanVariable</a>()), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#aa874aee040980146062498b87e8fb956">ReifiedBoolAnd</a>({is_le, is_ge}, is_eq));</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a4cbfd3ef9e4a23d109a2fd4bad3aefe4">ReifiedLowerOrEqualWithOffset</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, offset, is_le));</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a4cbfd3ef9e4a23d109a2fd4bad3aefe4">ReifiedLowerOrEqualWithOffset</a>(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, -offset, is_ge));</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  };</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span> }</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  </div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span> <span class="comment">// a != b.</span></div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#addbb8a10177aecb901a36bf943d4837f"> 496</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#addbb8a10177aecb901a36bf943d4837f">NotEqual</a>(IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>,</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  IntegerVariable <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="comment">// We have two options (is_gt or is_lt) and one must be true.</span></div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_lt = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">NewBooleanVariable</a>()), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_gt = is_lt.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>();</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a38733d8aaf7083f231fc914c127f155d">ConditionalLowerOrEqualWithOffset</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, 1, is_lt));</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a38733d8aaf7083f231fc914c127f155d">ConditionalLowerOrEqualWithOffset</a>(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, 1, is_gt));</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  };</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span> }</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  </div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  </div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span> <span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_SAT_PRECEDENCES_H_</span></div>
|
|
<div class="ttc" id="abitset_8h_html"><div class="ttname"><a href="bitset_8h.html">bitset.h</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector</a></div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00076">strong_vector.h:76</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html">operations_research::SparseBitset< IntegerVariable ></a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">operations_research::sat::GenericLiteralWatcher</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01108">integer.h:1108</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_adc5598223a363c10d95c00395145bcc6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adc5598223a363c10d95c00395145bcc6">operations_research::sat::GenericLiteralWatcher::SetPropagatorPriority</a></div><div class="ttdeci">void SetPropagatorPriority(int id, int priority)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01962">integer.cc:1962</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00540">integer.h:540</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a1eb60e3eca768de339988b37c6f1fd0b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a1eb60e3eca768de339988b37c6f1fd0b">operations_research::sat::IntegerTrail::RegisterWatcher</a></div><div class="ttdeci">void RegisterWatcher(SparseBitset< IntegerVariable > *p)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00803">integer.h:803</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00064">sat_base.h:64</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html_a886e9c024f7209181c0a850b6e90c644"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">operations_research::sat::Literal::Negated</a></div><div class="ttdeci">Literal Negated() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00091">sat_base.h:91</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html">operations_research::sat::PrecedencesPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00051">precedences.h:51</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_a09ebe3a2f1825d6366649cd157e5020f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a09ebe3a2f1825d6366649cd157e5020f">operations_research::sat::PrecedencesPropagator::AddPrecedenceReason</a></div><div class="ttdeci">void AddPrecedenceReason(int arc_index, IntegerValue min_offset, std::vector< Literal > *literal_reason, std::vector< IntegerLiteral > *integer_reason) const</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00212">precedences.cc:212</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_a1565f1c871fd2efe2b4bc30cb84d0872"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a1565f1c871fd2efe2b4bc30cb84d0872">operations_research::sat::PrecedencesPropagator::AddConditionalPrecedence</a></div><div class="ttdeci">void AddConditionalPrecedence(IntegerVariable i1, IntegerVariable i2, Literal l)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00306">precedences.h:306</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_a5979d0d9a10950afe6bb1d4423b41b32"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a5979d0d9a10950afe6bb1d4423b41b32">operations_research::sat::PrecedencesPropagator::AddConditionalPrecedenceWithOffset</a></div><div class="ttdeci">void AddConditionalPrecedenceWithOffset(IntegerVariable i1, IntegerVariable i2, IntegerValue offset, Literal l)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00313">precedences.h:313</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_a7bda671267128f7c8f28d85a3e191103"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a7bda671267128f7c8f28d85a3e191103">operations_research::sat::PrecedencesPropagator::AddPrecedenceWithOffset</a></div><div class="ttdeci">void AddPrecedenceWithOffset(IntegerVariable i1, IntegerVariable i2, IntegerValue offset)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00301">precedences.h:301</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_a863fce270e52490f300fa1fe27a7cb04"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a863fce270e52490f300fa1fe27a7cb04">operations_research::sat::PrecedencesPropagator::AddPrecedenceWithAllOptions</a></div><div class="ttdeci">void AddPrecedenceWithAllOptions(IntegerVariable i1, IntegerVariable i2, IntegerValue offset, IntegerVariable offset_var, absl::Span< const Literal > presence_literals)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00323">precedences.h:323</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_a880ad5f7514aee33f81302d8af2a7be2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a880ad5f7514aee33f81302d8af2a7be2">operations_research::sat::PrecedencesPropagator::ComputePrecedences</a></div><div class="ttdeci">void ComputePrecedences(const std::vector< IntegerVariable > &vars, std::vector< IntegerPrecedences > *output)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00135">precedences.cc:135</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_aa97e673a3c2e15343be943e4b9267fbf"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#aa97e673a3c2e15343be943e4b9267fbf">operations_research::sat::PrecedencesPropagator::AddPrecedence</a></div><div class="ttdeci">void AddPrecedence(IntegerVariable i1, IntegerVariable i2)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00295">precedences.h:295</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_ab802de47d15374aab8e3721d5fc508e5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#ab802de47d15374aab8e3721d5fc508e5">operations_research::sat::PrecedencesPropagator::AddGreaterThanAtLeastOneOfConstraints</a></div><div class="ttdeci">int AddGreaterThanAtLeastOneOfConstraints(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00895">precedences.cc:895</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_abad6589aa3f099fb7024ff6a2ee36740"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#abad6589aa3f099fb7024ff6a2ee36740">operations_research::sat::PrecedencesPropagator::PrecedencesPropagator</a></div><div class="ttdeci">PrecedencesPropagator(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00053">precedences.h:53</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_abcd500e5d877b7f02d2358b7e7e5fdd1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#abcd500e5d877b7f02d2358b7e7e5fdd1">operations_research::sat::PrecedencesPropagator::AddPrecedenceWithVariableOffset</a></div><div class="ttdeci">void AddPrecedenceWithVariableOffset(IntegerVariable i1, IntegerVariable i2, IntegerVariable offset_var)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00318">precedences.h:318</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::PrecedencesPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00043">precedences.cc:43</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_ae20e3965a974e3a5fe816c033a94e568"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#ae20e3965a974e3a5fe816c033a94e568">operations_research::sat::PrecedencesPropagator::Untrail</a></div><div class="ttdeci">void Untrail(const Trail &trail, int trail_index) final</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00111">precedences.cc:111</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_af3c64e10aa2bb2cc1d3615d800f7c71c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#af3c64e10aa2bb2cc1d3615d800f7c71c">operations_research::sat::PrecedencesPropagator::PropagateOutgoingArcs</a></div><div class="ttdeci">bool PropagateOutgoingArcs(IntegerVariable var)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00096">precedences.cc:96</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_propagator_interface_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_propagator_interface.html">operations_research::sat::PropagatorInterface</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01060">integer.h:1060</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_propagator.html">operations_research::sat::SatPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00445">sat_base.h:445</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00057">sat_solver.h:57</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html">operations_research::sat::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00233">sat_base.h:233</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a344010e26426d6a13411648d988bc9b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a></div><div class="ttdeci">int64 b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00043">constraint_solver/table.cc:43</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_af730895c6c6ef6e03caaf6251192dfd2"><div class="ttname"><a href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a></div><div class="ttdeci">int64 a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00042">constraint_solver/table.cc:42</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01858">expr_array.cc:1858</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00272">gurobi_interface.cc:272</a></div></div>
|
|
<div class="ttc" id="aint__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></div></div>
|
|
<div class="ttc" id="ainteger_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
|
|
<div class="ttc" id="anamespaceabsl_html"><div class="ttname"><a href="namespaceabsl.html">absl</a></div><div class="ttdef"><b>Definition:</b> <a href="cleanup_8h_source.html#l00022">cleanup.h:22</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a0634ba012cdeb4e4e1d946681acc6feb"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0634ba012cdeb4e4e1d946681acc6feb">operations_research::sat::ConditionalSum2LowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> ConditionalSum2LowerOrEqual(IntegerVariable a, IntegerVariable b, int64 ub, const std::vector< Literal > &enforcement_literals)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00359">precedences.h:359</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1f38cd9af4ce815d3bf7b46e617cebd9"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1f38cd9af4ce815d3bf7b46e617cebd9">operations_research::sat::ConditionalSum3LowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> ConditionalSum3LowerOrEqual(IntegerVariable a, IntegerVariable b, IntegerVariable c, int64 ub, const std::vector< Literal > &enforcement_literals)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00381">precedences.h:381</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a28941c68f2f19aedc5038c9e8f336816"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a28941c68f2f19aedc5038c9e8f336816">operations_research::sat::EqualityWithOffset</a></div><div class="ttdeci">std::function< void(Model *)> EqualityWithOffset(IntegerVariable a, IntegerVariable b, int64 offset)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00409">precedences.h:409</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a32158dca9646a745f392cea12527a42b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a32158dca9646a745f392cea12527a42b">operations_research::sat::LowerOrEqualWithOffset</a></div><div class="ttdeci">std::function< void(Model *)> LowerOrEqualWithOffset(IntegerVariable a, IntegerVariable b, int64 offset)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00342">precedences.h:342</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a38733d8aaf7083f231fc914c127f155d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a38733d8aaf7083f231fc914c127f155d">operations_research::sat::ConditionalLowerOrEqualWithOffset</a></div><div class="ttdeci">std::function< void(Model *)> ConditionalLowerOrEqualWithOffset(IntegerVariable a, IntegerVariable b, int64 offset, Literal is_le)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00419">precedences.h:419</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a38766514ce4824ae1e093a25d7fb43b3"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">operations_research::sat::NewBooleanVariable</a></div><div class="ttdeci">std::function< BooleanVariable(Model *)> NewBooleanVariable()</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01412">integer.h:1412</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a4cbfd3ef9e4a23d109a2fd4bad3aefe4"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4cbfd3ef9e4a23d109a2fd4bad3aefe4">operations_research::sat::ReifiedLowerOrEqualWithOffset</a></div><div class="ttdeci">std::function< void(Model *)> ReifiedLowerOrEqualWithOffset(IntegerVariable a, IntegerVariable b, int64 offset, Literal is_le)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00445">precedences.h:445</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a5bd8c44473618b7eafd33ba978db2f06"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">operations_research::sat::kNoIntegerVariable</a></div><div class="ttdeci">const IntegerVariable kNoIntegerVariable(-1)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a607ba8d18e00b2e6dbdc8622bb74fdf5"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a607ba8d18e00b2e6dbdc8622bb74fdf5">operations_research::sat::Equality</a></div><div class="ttdeci">std::function< void(Model *)> Equality(IntegerVariable v, int64 value)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01524">integer.h:1524</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a6fff32fbcc23479d823063d268fd4ea3"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6fff32fbcc23479d823063d268fd4ea3">operations_research::sat::ReifiedEqualityWithOffset</a></div><div class="ttdeci">std::function< void(Model *)> ReifiedEqualityWithOffset(IntegerVariable a, IntegerVariable b, int64 offset, Literal is_eq)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00477">precedences.h:477</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a8122843c07882c8619c9b357069d9c10"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8122843c07882c8619c9b357069d9c10">operations_research::sat::ReifiedEquality</a></div><div class="ttdeci">std::function< void(Model *)> ReifiedEquality(IntegerVariable a, IntegerVariable b, Literal is_eq)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00459">precedences.h:459</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a9e8e2172cc33d047f83ef321ab747138"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a9e8e2172cc33d047f83ef321ab747138">operations_research::sat::Sum3LowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> Sum3LowerOrEqual(IntegerVariable a, IntegerVariable b, IntegerVariable c, int64 ub)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00370">precedences.h:370</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aa62b548274db01f5136c72437c13a875"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa62b548274db01f5136c72437c13a875">operations_research::sat::ConditionalLowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> ConditionalLowerOrEqual(IntegerVariable a, IntegerVariable b, Literal is_le)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00428">precedences.h:428</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aa874aee040980146062498b87e8fb956"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa874aee040980146062498b87e8fb956">operations_research::sat::ReifiedBoolAnd</a></div><div class="ttdeci">std::function< void(Model *)> ReifiedBoolAnd(const std::vector< Literal > &literals, Literal r)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00968">sat_solver.h:968</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aacae3ff5d3c450a91ec05d9b2a6568f0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aacae3ff5d3c450a91ec05d9b2a6568f0">operations_research::sat::Sum2LowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> Sum2LowerOrEqual(IntegerVariable a, IntegerVariable b, int64 ub)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00352">precedences.h:352</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aae43e784db06c0974ce59ebbe8dd2b22"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">operations_research::sat::NegationOf</a></div><div class="ttdeci">std::vector< IntegerVariable > NegationOf(const std::vector< IntegerVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00027">integer.cc:27</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_acb6021b325a62a7c9bd759f52111a887"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#acb6021b325a62a7c9bd759f52111a887">operations_research::sat::GreaterOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> GreaterOrEqual(IntegerVariable v, int64 lb)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01495">integer.h:1495</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ad48b274dddb22fb445d5ab6edbf222df"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ad48b274dddb22fb445d5ab6edbf222df">operations_research::sat::LowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> LowerOrEqual(IntegerVariable v, int64 ub)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01509">integer.h:1509</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_addbb8a10177aecb901a36bf943d4837f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#addbb8a10177aecb901a36bf943d4837f">operations_research::sat::NotEqual</a></div><div class="ttdeci">std::function< void(Model *)> NotEqual(IntegerVariable a, IntegerVariable b)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00496">precedences.h:496</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ad90a9fc7d16bb2c98a088a4162bbbc9d"><div class="ttname"><a href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">operations_research::ArcIndex</a></div><div class="ttdeci">int32 ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00201">ebert_graph.h:201</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a10b672faee4b99c6a02feb0e343f3b0f"><div class="ttname"><a href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a></div><div class="ttdeci">int64 tail</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00127">routing_flow.cc:127</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_ac891d9f514e55ec8ee1212757a147888"><div class="ttname"><a href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a></div><div class="ttdeci">int64 head</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00128">routing_flow.cc:128</a></div></div>
|
|
<div class="ttc" id="asat_2model_8h_html"><div class="ttname"><a href="sat_2model_8h.html">model.h</a></div></div>
|
|
<div class="ttc" id="asat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
|
<div class="ttc" id="asat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="astrong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html">operations_research::sat::PrecedencesPropagator::IntegerPrecedences</a></div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00111">precedences.h:111</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html#a750b5d744c39a06bfb13e6eb010e35d0">operations_research::sat::PrecedencesPropagator::IntegerPrecedences::index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00112">precedences.h:112</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences_html_aa34933f5ae5cfa4c08158d3f2e275d29"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html#aa34933f5ae5cfa4c08158d3f2e275d29">operations_research::sat::PrecedencesPropagator::IntegerPrecedences::arc_index</a></div><div class="ttdeci">int arc_index</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00114">precedences.h:114</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences_html_ab6516f556b715738034b30d290c40214"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html#ab6516f556b715738034b30d290c40214">operations_research::sat::PrecedencesPropagator::IntegerPrecedences::var</a></div><div class="ttdeci">IntegerVariable var</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00113">precedences.h:113</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences_html_acd07f8397a2e61932c8ee17a4e300e23"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_precedences_propagator_1_1_integer_precedences.html#acd07f8397a2e61932c8ee17a4e300e23">operations_research::sat::PrecedencesPropagator::IntegerPrecedences::offset</a></div><div class="ttdeci">IntegerValue offset</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00115">precedences.h:115</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="precedences_8h.html">precedences.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|