always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
b7ed2f5355709ffbe75934a57e82c88bbacf7314
ortools-clone/docs/cpp/cp__model__presolve_8h_source.html
Laurent Perron a2ad6677e1 regenerate doc
2022-01-16 18:02:36 +01:00

145 lines
78 KiB
HTML
Raw Blame History

<!-- HTML header for doxygen 1.8.18-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OR-Tools: cp_model_presolve.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>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">OR-Tools
&#160;<span id="projectnumber">9.2</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;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&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('cp__model__presolve_8h_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">cp_model_presolve.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="cp__model__presolve_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>&#160;<span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">// Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<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>&#160;<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>&#160;<span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<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>&#160;<span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<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>&#160;<span class="comment">// distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<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>&#160;<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>&#160;<span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;</div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="preprocessor">#ifndef OR_TOOLS_SAT_CP_MODEL_PRESOLVE_H_</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="preprocessor">#define OR_TOOLS_SAT_CP_MODEL_PRESOLVE_H_</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="preprocessor">#include &lt;cstdint&gt;</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="preprocessor">#include &lt;vector&gt;</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;</div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="cp__model_8pb_8h.html">ortools/sat/cp_model.pb.h</a>&quot;</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="cp__model__utils_8h.html">ortools/sat/cp_model_utils.h</a>&quot;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="presolve__context_8h.html">ortools/sat/presolve_context.h</a>&quot;</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="presolve__util_8h.html">ortools/sat/presolve_util.h</a>&quot;</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="sat__parameters_8pb_8h.html">ortools/sat/sat_parameters.pb.h</a>&quot;</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="affine__relation_8h.html">ortools/util/affine_relation.h</a>&quot;</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="bitset_8h.html">ortools/util/bitset.h</a>&quot;</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="sorted__interval__list_8h.html">ortools/util/sorted_interval_list.h</a>&quot;</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="time__limit_8h.html">ortools/util/time_limit.h</a>&quot;</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160;</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160;<span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160;</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160;<span class="comment">// Replaces all the instance of a variable i (and the literals referring to it)</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160;<span class="comment">// by mapping[i]. The definition of variables i is also moved to its new index.</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160;<span class="comment">// Variables with a negative mapping value are ignored and it is an error if</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160;<span class="comment">// such variable is referenced anywhere (this is CHECKed).</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160;<span class="comment">// The image of the mapping should be dense in [0, new_num_variables), this is</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160;<span class="comment">// also CHECKed.</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160;<span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#ae82ca1b371f76400eefb8e94246c5fe2">ApplyVariableMapping</a>(<span class="keyword">const</span> std::vector&lt;int&gt;&amp; mapping,</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; <span class="keyword">const</span> PresolveContext&amp; <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>);</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160;</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160;<span class="comment">// Presolves the initial content of presolved_model.</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160;<span class="comment">// This also creates a mapping model that encode the correspondence between the</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160;<span class="comment">// two problems. This works as follow:</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160;<span class="comment">// - The first variables of mapping_model are in one to one correspondence with</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160;<span class="comment">// the variables of the initial model.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160;<span class="comment">// - The presolved_model variables are in one to one correspondence with the</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160;<span class="comment">// variable at the indices given by postsolve_mapping in the mapping model.</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160;<span class="comment">// - Fixing one of the two sets of variables and solving the model will assign</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160;<span class="comment">// the other set to a feasible solution of the other problem. Moreover, the</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160;<span class="comment">// objective value of these solutions will be the same. Note that solving such</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160;<span class="comment">// problems will take little time in practice because the propagation will</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160;<span class="comment">// basically do all the work.</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160;<span class="comment">// Note(user): an optimization model can be transformed into a decision problem,</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160;<span class="comment">// if for instance the objective is fixed, or independent from the rest of the</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160;<span class="comment">// problem.</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160;<span class="comment">// TODO(user): Identify disconnected components and returns a vector of</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160;<span class="comment">// presolved model? If we go this route, it may be nicer to store the indices</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160;<span class="comment">// inside the model. We can add a IntegerVariableProto::initial_index;</span></div><div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_cp_model_presolver.html"> 64</a></span>&#160;<span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_cp_model_presolver.html">CpModelPresolver</a> {</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="keyword">public</span>:</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_presolver.html#a7ebb6a65cb3d0da1dcf19929c38640e0">CpModelPresolver</a>(<a class="code" href="classoperations__research_1_1sat_1_1_presolve_context.html">PresolveContext</a>* <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>,</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; std::vector&lt;int&gt;* postsolve_mapping);</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; <span class="comment">// We returns the status of the problem after presolve:</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; <span class="comment">// - UNKNOWN if everything was ok.</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <span class="comment">// - INFEASIBLE if the model was proven so during presolve</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; <span class="comment">// - MODEL_INVALID if the model caused some issues, like if we are not able</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; <span class="comment">// to scale a floating point objective with enough precision.</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815">CpSolverStatus</a> <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_presolver.html#a5878e5237a46a041831321db84c08c4f">Presolve</a>();</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; <span class="comment">// Executes presolve method for the given constraint. Public for testing only.</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_presolver.html#ab37522044009144ac6eff3b3d4c1d271">PresolveOneConstraint</a>(<span class="keywordtype">int</span> c);</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <span class="comment">// Public for testing only.</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_presolver.html#a6c402792bbe83aa90b75033080755f9b">RemoveEmptyConstraints</a>();</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <span class="keyword">private</span>:</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; <span class="comment">// A simple helper that logs the rules applied so far and return INFEASIBLE.</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815">CpSolverStatus</a> InfeasibleStatus();</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; <span class="comment">// Runs the inner loop of the presolver.</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; <span class="keywordtype">void</span> PresolveToFixPoint();</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; <span class="comment">// Runs the probing.</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; <span class="keywordtype">void</span> Probe();</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160;</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; <span class="comment">// Presolve functions.</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <span class="comment">//</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <span class="comment">// They should return false only if the constraint &lt;-&gt; variable graph didn&#39;t</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; <span class="comment">// change. This is just an optimization, returning true is always correct.</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; <span class="comment">//</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; <span class="comment">// Invariant about UNSAT: All these functions should abort right away if</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; <span class="comment">// context_.IsUnsat() is true. And the only way to change the status to unsat</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; <span class="comment">// is through ABSL_MUST_USE_RESULT function that should also abort right away</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; <span class="comment">// the current code. This way we shouldn&#39;t keep doing computation on an</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; <span class="comment">// inconsistent state.</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; <span class="comment">// TODO(user): Make these public and unit test.</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; <span class="keywordtype">bool</span> PresolveAllDiff(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; <span class="keywordtype">bool</span> PresolveAutomaton(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; <span class="keywordtype">bool</span> PresolveElement(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; <span class="keywordtype">bool</span> PresolveIntAbs(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; <span class="keywordtype">bool</span> PresolveIntDiv(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; <span class="keywordtype">bool</span> PresolveIntMod(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; <span class="keywordtype">bool</span> PresolveIntProd(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; <span class="keywordtype">bool</span> PresolveInterval(<span class="keywordtype">int</span> c, <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <span class="keywordtype">bool</span> PresolveInverse(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <span class="keywordtype">bool</span> PresolveLinMax(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; <span class="keywordtype">bool</span> PresolveTable(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <span class="keywordtype">bool</span> PresolveCumulative(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; <span class="keywordtype">bool</span> PresolveNoOverlap(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; <span class="keywordtype">bool</span> PresolveNoOverlap2D(<span class="keywordtype">int</span> c, <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; <span class="keywordtype">bool</span> PresolveReservoir(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; <span class="keywordtype">bool</span> PresolveCircuit(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; <span class="keywordtype">bool</span> PresolveRoutes(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160;</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; <span class="keywordtype">bool</span> PresolveAtMostOrExactlyOne(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; <span class="keywordtype">bool</span> PresolveAtMostOne(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; <span class="keywordtype">bool</span> PresolveExactlyOne(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160;</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; <span class="keywordtype">bool</span> PresolveBoolAnd(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; <span class="keywordtype">bool</span> PresolveBoolOr(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; <span class="keywordtype">bool</span> PresolveBoolXor(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; <span class="keywordtype">bool</span> PresolveEnforcementLiteral(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; <span class="comment">// Regroups terms and substitute affine relations.</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; <span class="comment">// Returns true if the set of variables in the expression changed.</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; <span class="keyword">template</span> &lt;<span class="keyword">typename</span> ProtoWithVarsAndCoeffs&gt;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; <span class="keywordtype">bool</span> CanonicalizeLinearExpressionInternal(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>,</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; ProtoWithVarsAndCoeffs* <a class="code" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>,</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; int64_t* offset);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160; <span class="keywordtype">bool</span> CanonicalizeLinearExpression(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>,</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160; <a class="code" href="classoperations__research_1_1sat_1_1_linear_expression_proto.html">LinearExpressionProto</a>* exp);</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160; <span class="keywordtype">bool</span> CanonicalizeLinearArgument(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>,</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>&#160; <a class="code" href="classoperations__research_1_1sat_1_1_linear_argument_proto.html">LinearArgumentProto</a>* <a class="code" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>);</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; <span class="comment">// For the linear constraints, we have more than one function.</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160; <span class="keywordtype">bool</span> CanonicalizeLinear(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; <span class="keywordtype">bool</span> PropagateDomainsInLinear(<span class="keywordtype">int</span> c, <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; <span class="keywordtype">bool</span> RemoveSingletonInLinear(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; <span class="keywordtype">bool</span> PresolveSmallLinear(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>&#160; <span class="keywordtype">bool</span> PresolveLinearOfSizeOne(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160; <span class="keywordtype">bool</span> PresolveLinearOfSizeTwo(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160; <span class="keywordtype">bool</span> PresolveLinearOnBooleans(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>&#160; <span class="keywordtype">bool</span> AddVarAffineRepresentativeFromLinearEquality(<span class="keywordtype">int</span> target_index,</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; <span class="keywordtype">bool</span> PresolveLinearEqualityWithModulo(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>&#160;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; <span class="keywordtype">bool</span> DetectAndProcessOneSidedLinearConstraint(<span class="keywordtype">int</span> c, <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160; <span class="comment">// SetPPC is short for set packing, partitioning and covering constraints.</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160; <span class="comment">// These are sum of booleans &lt;=, = and &gt;= 1 respectively.</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160; <span class="keywordtype">bool</span> ProcessSetPPC();</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160;</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160; <span class="comment">// This detects and converts constraints of the form:</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; <span class="comment">// &quot;X = sum Boolean * value&quot;, with &quot;sum Boolean &lt;= 1&quot;.</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; <span class="comment">//</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; <span class="comment">// Note that it is not super fast, so it shouldn&#39;t be called too often.</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; <span class="keywordtype">void</span> ExtractEncodingFromLinear();</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160; <span class="keywordtype">bool</span> ProcessEncodingFromLinear(<span class="keywordtype">int</span> linear_encoding_ct_index,</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160; <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; at_most_or_exactly_one,</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160; int64_t* num_unique_terms,</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160; int64_t* num_multiple_terms);</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>&#160;</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160; <span class="comment">// Removes dominated constraints or fixes some variables for given pair of</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160; <span class="comment">// setppc constraints. This assumes that literals in constraint c1 is subset</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>&#160; <span class="comment">// of literals in constraint c2.</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160; <span class="keywordtype">bool</span> ProcessSetPPCSubset(<span class="keywordtype">int</span> c1, <span class="keywordtype">int</span> c2, <span class="keyword">const</span> std::vector&lt;int&gt;&amp; c2_minus_c1,</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160; <span class="keyword">const</span> std::vector&lt;int&gt;&amp; original_constraint_index,</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160; std::vector&lt;bool&gt;* marked_for_removal);</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; <span class="keywordtype">void</span> PresolvePureSatPart();</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160;</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; <span class="comment">// Extracts AtMostOne constraint from Linear constraint.</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160; <span class="keywordtype">void</span> ExtractAtMostOneFromLinear(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>&#160;</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160; <span class="comment">// Returns true if the constraint changed.</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>&#160; <span class="keywordtype">bool</span> DivideLinearByGcd(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>&#160;</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>&#160; <span class="keywordtype">void</span> ExtractEnforcementLiteralFromLinearConstraint(<span class="keywordtype">int</span> ct_index,</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>&#160; <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; <span class="comment">// Extracts cliques from bool_and and small at_most_one constraints and</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; <span class="comment">// transforms them into maximal cliques.</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; <span class="keywordtype">void</span> TransformIntoMaxCliques();</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; <span class="comment">// Converts bool_or and at_most_one of size 2 to bool_and.</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; <span class="keywordtype">void</span> ExtractBoolAnd();</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160;</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; <span class="keywordtype">void</span> ExpandObjective();</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160;</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; <span class="keywordtype">void</span> TryToSimplifyDomain(<span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160;</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; <span class="keywordtype">void</span> MergeNoOverlapConstraints();</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160;</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160; <span class="comment">// Boths function are responsible for dealing with affine relations.</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160; <span class="comment">// The second one returns false on UNSAT.</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160; <span class="keywordtype">void</span> EncodeAllAffineRelations();</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160; <span class="keywordtype">bool</span> PresolveAffineRelationIfAny(<span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160;</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160; <span class="keywordtype">bool</span> ExploitEquivalenceRelations(<span class="keywordtype">int</span> c, <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>&#160;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>&#160; ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> RemoveConstraint(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160; ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> MarkConstraintAsFalse(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160;</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; std::vector&lt;int&gt;* postsolve_mapping_;</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; <a class="code" href="classoperations__research_1_1sat_1_1_presolve_context.html">PresolveContext</a>* context_;</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; <a class="code" href="classoperations__research_1_1_solver_logger.html">SolverLogger</a>* logger_;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; <span class="comment">// Used by CanonicalizeLinearExpressionInternal().</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; std::vector&lt;std::pair&lt;int, int64_t&gt;&gt; tmp_terms_;</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160;};</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160;<span class="comment">// This helper class perform copy with simplification from a model and a</span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160;<span class="comment">// partial assignment to another model. The purpose is to miminize the size of</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160;<span class="comment">// the copied model, as well as to reduce the pressure on the memory sub-system.</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160;<span class="comment">// It is currently used by the LNS part, but could be used with any other scheme</span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160;<span class="comment">// that generates partial assignments.</span></div><div class="line"><a name="l00226"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_model_copy.html"> 226</a></span>&#160;<span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_model_copy.html">ModelCopy</a> {</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; <span class="keyword">public</span>:</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_model_copy.html#a4dc4003514ad43b655e41524c32352f1">ModelCopy</a>(<a class="code" href="classoperations__research_1_1sat_1_1_presolve_context.html">PresolveContext</a>* <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>);</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160;</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; <span class="comment">// Copies all constraints from in_model to working model of the context.</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160; <span class="comment">//</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160; <span class="comment">// During the process, it will read variable domains from the context, and</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; <span class="comment">// simplify constraints to minimize the size of the copied model.</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; <span class="comment">// Thus it is important that the context-&gt;working_model already have the</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; <span class="comment">// variables part copied.</span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; <span class="comment">//</span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160; <span class="comment">// It returns false iff the model is proven infeasible.</span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160; <span class="comment">//</span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160; <span class="comment">// It does not clear the constraints part of the working model of the context.</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160; <span class="comment">//</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160; <span class="comment">// Note(user): If first_copy is true, we will reorder the scheduling</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160; <span class="comment">// constraint so that they only use reference to previously defined intervals.</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; <span class="comment">// This allow to be more efficient later in a few preprocessing steps.</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160; <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_model_copy.html#a58490799f393198b0bf71299bc22a897">ImportAndSimplifyConstraints</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html">CpModelProto</a>&amp; in_model,</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160; <span class="keyword">const</span> std::vector&lt;int&gt;&amp; ignored_constraints,</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160; <span class="keywordtype">bool</span> first_copy = <span class="keyword">false</span>);</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160;</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160; <span class="keyword">private</span>:</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160; <span class="comment">// Overwrites the out_model to be unsat. Returns false.</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160; <span class="keywordtype">bool</span> CreateUnsatModel();</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160;</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160; <span class="keywordtype">void</span> CopyEnforcementLiterals(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; orig,</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>&#160; <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>* dest);</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>&#160; <span class="keywordtype">bool</span> OneEnforcementLiteralIsFalse(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>) <span class="keyword">const</span>;</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>&#160;</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>&#160; <span class="comment">// All these functions return false if the constraint is found infeasible.</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>&#160; <span class="keywordtype">bool</span> CopyBoolOr(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>&#160; <span class="keywordtype">bool</span> CopyBoolAnd(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160; <span class="keywordtype">bool</span> CopyLinear(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>&#160; <span class="keywordtype">bool</span> CopyAtMostOne(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160; <span class="keywordtype">bool</span> CopyExactlyOne(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>&#160; <span class="keywordtype">bool</span> CopyInterval(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <span class="keywordtype">int</span> c);</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160;</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160; <span class="comment">// These function remove unperformed intervals. Note that they requires</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160; <span class="comment">// interval to appear before (validated) as they test unperformed by testing</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160; <span class="comment">// if interval_mapping_ is empty.</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160; <span class="keywordtype">void</span> CopyAndMapNoOverlap(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; <span class="keywordtype">void</span> CopyAndMapNoOverlap2D(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160; <span class="keywordtype">void</span> CopyAndMapCumulative(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>&amp; <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160; <a class="code" href="classoperations__research_1_1sat_1_1_presolve_context.html">PresolveContext</a>* context_;</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; int64_t skipped_non_zero_ = 0;</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160;</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; <span class="comment">// Temp vectors.</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160; std::vector&lt;int&gt; non_fixed_variables_;</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160; std::vector&lt;int64_t&gt; non_fixed_coefficients_;</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160; absl::flat_hash_map&lt;int, int&gt; interval_mapping_;</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160; <span class="keywordtype">int</span> starting_constraint_index_ = 0;</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160; std::vector&lt;int&gt; temp_enforcement_literals_;</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160; std::vector&lt;int&gt; temp_literals_;</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160;};</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160;</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160;<span class="comment">// Import the constraints from the in_model to the presolve context.</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160;<span class="comment">// It performs on the fly simplification, and returns false if the</span></div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160;<span class="comment">// model is proved infeasible.</span></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160;<span class="comment">// This should only be called on the first copy of the user given model.</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160;<span class="comment">// Note that this reorder all constraints that use intervals last. We loose the</span></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160;<span class="comment">// user-defined order, but hopefully that should not matter too much.</span></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160;<span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a980f3e04f0fac2f0f8a7ff4c73572922">ImportConstraintsWithBasicPresolveIntoContext</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html">CpModelProto</a>&amp; in_model,</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>&#160; <a class="code" href="classoperations__research_1_1sat_1_1_presolve_context.html">PresolveContext</a>* <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>);</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>&#160;</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>&#160;<span class="comment">// Copies the non constraint, non variables part of the model.</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>&#160;<span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a8e28f522e1d211cabbdcff4fd3028593">CopyEverythingExceptVariablesAndConstraintsFieldsIntoContext</a>(</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>&#160; <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html">CpModelProto</a>&amp; in_model, <a class="code" href="classoperations__research_1_1sat_1_1_presolve_context.html">PresolveContext</a>* <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>);</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>&#160;</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>&#160;<span class="comment">// Convenient wrapper to call the full presolve.</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>&#160;<a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815">CpSolverStatus</a> <a class="code" href="namespaceoperations__research_1_1sat.html#abc0cd8ddeca98a0ead5ad406a8ae3a69">PresolveCpModel</a>(<a class="code" href="classoperations__research_1_1sat_1_1_presolve_context.html">PresolveContext</a>* <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>,</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>&#160; std::vector&lt;int&gt;* postsolve_mapping);</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>&#160;</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>&#160;<span class="comment">// Returns the index of duplicate constraints in the given proto in the first</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>&#160;<span class="comment">// element of each pair. The second element of each pair is the &quot;representative&quot;</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>&#160;<span class="comment">// that is the first constraint in the proto in a set of duplicate constraints.</span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>&#160;<span class="comment">// Empty constraints are ignored. We also do a bit more:</span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>&#160;<span class="comment">// - We ignore names when comparing constraint.</span></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>&#160;<span class="comment">// - For linear constraints, we ignore the domain. This is because we can</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>&#160;<span class="comment">// just merge them if the constraints are the same.</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>&#160;<span class="comment">// Visible here for testing. This is meant to be called at the end of the</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>&#160;<span class="comment">// presolve where constraints have been canonicalized.</span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>&#160;std::vector&lt;std::pair&lt;int, int&gt;&gt; <a class="code" href="namespaceoperations__research_1_1sat.html#a98b74f23742287a604f9850f26bcc06a">FindDuplicateConstraints</a>(</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>&#160; <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html">CpModelProto</a>&amp; <a class="code" href="cp__model__solver_8cc.html#a6ac76d8a372013f67c4973012948ec84">model_proto</a>);</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>&#160;</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>&#160;} <span class="comment">// namespace sat</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>&#160;} <span class="comment">// namespace operations_research</span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>&#160;</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>&#160;<span class="preprocessor">#endif // OR_TOOLS_SAT_CP_MODEL_PRESOLVE_H_</span></div><div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_presolver_html_a6c402792bbe83aa90b75033080755f9b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_presolver.html#a6c402792bbe83aa90b75033080755f9b">operations_research::sat::CpModelPresolver::RemoveEmptyConstraints</a></div><div class="ttdeci">void RemoveEmptyConstraints()</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__presolve_8cc_source.html#l00073">cp_model_presolve.cc:73</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a98b74f23742287a604f9850f26bcc06a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a98b74f23742287a604f9850f26bcc06a">operations_research::sat::FindDuplicateConstraints</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; int, int &gt; &gt; FindDuplicateConstraints(const CpModelProto &amp;model_proto)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__presolve_8cc_source.html#l08054">cp_model_presolve.cc:8054</a></div></div>
<div class="ttc" id="time__limit_8h_html"><div class="ttname"><a href="time__limit_8h.html">time_limit.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_model_copy_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model_copy.html">operations_research::sat::ModelCopy</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__presolve_8h_source.html#l00226">cp_model_presolve.h:226</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_model_copy_html_a4dc4003514ad43b655e41524c32352f1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model_copy.html#a4dc4003514ad43b655e41524c32352f1">operations_research::sat::ModelCopy::ModelCopy</a></div><div class="ttdeci">ModelCopy(PresolveContext *context)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__presolve_8cc_source.html#l07110">cp_model_presolve.cc:7110</a></div></div>
<div class="ttc" id="classoperations__research_1_1_solver_logger_html"><div class="ttname"><a href="classoperations__research_1_1_solver_logger.html">operations_research::SolverLogger</a></div><div class="ttdef"><b>Definition:</b> <a href="util_2logging_8h_source.html#l00033">util/logging.h:33</a></div></div>
<div class="ttc" id="cp__model__fz__solver_8cc_html_aed003f5eb5197bc586b7ef2c36a63da2"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a></div><div class="ttdeci">CpModelProto proto</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00119">cp_model_fz_solver.cc:119</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html">operations_research::sat::ConstraintProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03772">cp_model.pb.h:3772</a></div></div>
<div class="ttc" id="affine__relation_8h_html"><div class="ttname"><a href="affine__relation_8h.html">affine_relation.h</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a980f3e04f0fac2f0f8a7ff4c73572922"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a980f3e04f0fac2f0f8a7ff4c73572922">operations_research::sat::ImportConstraintsWithBasicPresolveIntoContext</a></div><div class="ttdeci">bool ImportConstraintsWithBasicPresolveIntoContext(const CpModelProto &amp;in_model, PresolveContext *context)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__presolve_8cc_source.html#l07453">cp_model_presolve.cc:7453</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a8e28f522e1d211cabbdcff4fd3028593"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8e28f522e1d211cabbdcff4fd3028593">operations_research::sat::CopyEverythingExceptVariablesAndConstraintsFieldsIntoContext</a></div><div class="ttdeci">void CopyEverythingExceptVariablesAndConstraintsFieldsIntoContext(const CpModelProto &amp;in_model, PresolveContext *context)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__presolve_8cc_source.html#l07464">cp_model_presolve.cc:7464</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html">operations_research::sat::CpModelProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l06111">cp_model.pb.h:6111</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_presolver_html_a7ebb6a65cb3d0da1dcf19929c38640e0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_presolver.html#a7ebb6a65cb3d0da1dcf19929c38640e0">operations_research::sat::CpModelPresolver::CpModelPresolver</a></div><div class="ttdeci">CpModelPresolver(PresolveContext *context, std::vector&lt; int &gt; *postsolve_mapping)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__presolve_8cc_source.html#l07501">cp_model_presolve.cc:7501</a></div></div>
<div class="ttc" id="sorted__interval__list_8h_html"><div class="ttname"><a href="sorted__interval__list_8h.html">sorted_interval_list.h</a></div></div>
<div class="ttc" id="cp__model__utils_8h_html"><div class="ttname"><a href="cp__model__utils_8h.html">cp_model_utils.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_model_copy_html_a58490799f393198b0bf71299bc22a897"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model_copy.html#a58490799f393198b0bf71299bc22a897">operations_research::sat::ModelCopy::ImportAndSimplifyConstraints</a></div><div class="ttdeci">bool ImportAndSimplifyConstraints(const CpModelProto &amp;in_model, const std::vector&lt; int &gt; &amp;ignored_constraints, bool first_copy=false)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__presolve_8cc_source.html#l07117">cp_model_presolve.cc:7117</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_presolver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_presolver.html">operations_research::sat::CpModelPresolver</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__presolve_8h_source.html#l00064">cp_model_presolve.h:64</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_presolver_html_a5878e5237a46a041831321db84c08c4f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_presolver.html#a5878e5237a46a041831321db84c08c4f">operations_research::sat::CpModelPresolver::Presolve</a></div><div class="ttdeci">CpSolverStatus Presolve()</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__presolve_8cc_source.html#l07527">cp_model_presolve.cc:7527</a></div></div>
<div class="ttc" id="presolve__context_8h_html"><div class="ttname"><a href="presolve__context_8h.html">presolve_context.h</a></div></div>
<div class="ttc" id="sat__parameters_8pb_8h_html"><div class="ttname"><a href="sat__parameters_8pb_8h.html">sat_parameters.pb.h</a></div></div>
<div class="ttc" id="cp__model__solver_8cc_html_a6ac76d8a372013f67c4973012948ec84"><div class="ttname"><a href="cp__model__solver_8cc.html#a6ac76d8a372013f67c4973012948ec84">model_proto</a></div><div class="ttdeci">CpModelProto const * model_proto</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l01949">cp_model_solver.cc:1949</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_abc0cd8ddeca98a0ead5ad406a8ae3a69"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#abc0cd8ddeca98a0ead5ad406a8ae3a69">operations_research::sat::PresolveCpModel</a></div><div class="ttdeci">CpSolverStatus PresolveCpModel(PresolveContext *context, std::vector&lt; int &gt; *postsolve_mapping)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__presolve_8cc_source.html#l07495">cp_model_presolve.cc:7495</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_presolve_context_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_presolve_context.html">operations_research::sat::PresolveContext</a></div><div class="ttdef"><b>Definition:</b> <a href="presolve__context_8h_source.html#l00072">presolve_context.h:72</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_expression_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_expression_proto.html">operations_research::sat::LinearExpressionProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00608">cp_model.pb.h:608</a></div></div>
<div class="ttc" id="cp__model_8pb_8h_html"><div class="ttname"><a href="cp__model_8pb_8h.html">cp_model.pb.h</a></div></div>
<div class="ttc" id="presolve__util_8h_html"><div class="ttname"><a href="presolve__util_8h.html">presolve_util.h</a></div></div>
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_presolver_html_ab37522044009144ac6eff3b3d4c1d271"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_presolver.html#ab37522044009144ac6eff3b3d4c1d271">operations_research::sat::CpModelPresolver::PresolveOneConstraint</a></div><div class="ttdeci">bool PresolveOneConstraint(int c)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__presolve_8cc_source.html#l05677">cp_model_presolve.cc:5677</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aedc4ddb96acc28481c09828d2e016815"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815">operations_research::sat::CpSolverStatus</a></div><div class="ttdeci">CpSolverStatus</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00242">cp_model.pb.h:242</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_argument_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_argument_proto.html">operations_research::sat::LinearArgumentProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00804">cp_model.pb.h:804</a></div></div>
<div class="ttc" id="expr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ae82ca1b371f76400eefb8e94246c5fe2"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae82ca1b371f76400eefb8e94246c5fe2">operations_research::sat::ApplyVariableMapping</a></div><div class="ttdeci">void ApplyVariableMapping(const std::vector&lt; int &gt; &amp;mapping, const PresolveContext &amp;context)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__presolve_8cc_source.html#l07927">cp_model_presolve.cc:7927</a></div></div>
<div class="ttc" id="bitset_8h_html"><div class="ttname"><a href="bitset_8h.html">bitset.h</a></div></div>
<div class="ttc" id="gurobi__interface_8cc_html_a5f287b83a753915ae862fed64f8640a6"><div class="ttname"><a href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a></div><div class="ttdeci">GurobiMPCallbackContext * context</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00514">gurobi_interface.cc:514</a></div></div>
<div class="ttc" id="demon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</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="cp__model__presolve_8h.html">cp_model_presolve.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.8.15 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink