<ahref="cp__model__postsolve_8cc.html">Go to the documentation of this file.</a><divclass="fragment"><divclass="line"><aname="l00001"></a><spanclass="lineno"> 1</span> <spanclass="comment">// Copyright 2010-2021 Google LLC</span></div><divclass="line"><aname="l00002"></a><spanclass="lineno"> 2</span> <spanclass="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><divclass="line"><aname="l00003"></a><spanclass="lineno"> 3</span> <spanclass="comment">// you may not use this file except in compliance with the License.</span></div><divclass="line"><aname="l00004"></a><spanclass="lineno"> 4</span> <spanclass="comment">// You may obtain a copy of the License at</span></div><divclass="line"><aname="l00005"></a><spanclass="lineno"> 5</span> <spanclass="comment">//</span></div><divclass="line"><aname="l00006"></a><spanclass="lineno"> 6</span> <spanclass="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><divclass="line"><aname="l00007"></a><spanclass="lineno"> 7</span> <spanclass="comment">//</span></div><divclass="line"><aname="l00008"></a><spanclass="lineno"> 8</span> <spanclass="comment">// Unless required by applicable law or agreed to in writing, software</span></div><divclass="line"><aname="l00009"></a><spanclass="lineno"> 9</span> <spanclass="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><divclass="line"><aname="l00010"></a><spanclass="lineno"> 10</span> <spanclass="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><divclass="line"><aname="l00011"></a><spanclass="lineno"> 11</span> <spanclass="comment">// See the License for the specific language governing permissions and</span></div><divclass="line"><aname="l00012"></a><spanclass="lineno"> 12</span> <spanclass="comment">// limitations under the License.</span></div><divclass="line"><aname="l00013"></a><spanclass="lineno"> 13</span> </div><divclass="line"><aname="l00014"></a><spanclass="lineno"> 14</span> <spanclass="preprocessor">#include "<aclass="code"href="cp__model__postsolve_8h.html">ortools/sat/cp_model_postsolve.h</a>"</span></div><divclass="line"><aname="l00015"></a><spanclass="lineno"> 15</span> </div><divclass="line"><aname="l00016"></a><spanclass="lineno"> 16</span> <spanclass="preprocessor">#include <cstdint></span></div><divclass="line"><aname="l00017"></a><spanclass="lineno"> 17</span> <spanclass="preprocessor">#include <limits></span></div><divclass="line"><aname="l00018"></a><spanclass="lineno"> 18</span> </div><divclass="line"><aname="l00019"></a><spanclass="lineno"> 19</span> <spanclass="preprocessor">#include "<aclass="code"href="cp__model__utils_8h.html">ortools/sat/cp_model_utils.h</a>"</span></div><divclass="line"><aname="l00020"></a><spanclass="lineno"> 20</span> </div><divclass="line"><aname="l00021"></a><spanclass="lineno"> 21</span> <spanclass="keyword">namespace </span><aclass="code"href="namespaceoperations__research.html">operations_research</a> {</div><divclass="line"><aname="l00022"></a><spanclass="lineno"> 22</span> <spanclass="keyword">namespace </span>sat {</div><divclass="line"><aname="l00023"></a><spanclass="lineno"> 23</span> </div><divclass="line"><aname="l00024"></a><spanclass="lineno"> 24</span> <spanclass="comment">// This postsolve is "special". If the clause is not satisfied, we fix the</span></div><divclass="line"><aname="l00025"></a><spanclass="lineno"> 25</span> <spanclass="comment">// first literal in the clause to true (even if it was fixed to false). This</span></div><divclass="line"><aname="l00026"></a><spanclass="lineno"> 26</span> <spanclass="comment">// allows to handle more complex presolve operations used by the SAT p
<divclass="ttc"id="classoperations__research_1_1_domain_html_a1341b29865c5167a64de30c797672e4c"><divclass="ttname"><ahref="classoperations__research_1_1_domain.html#a1341b29865c5167a64de30c797672e4c">operations_research::Domain::InverseMultiplicationBy</a></div><divclass="ttdeci">Domain InverseMultiplicationBy(const int64_t coeff) const</div><divclass="ttdoc">Returns {x ∈ Int64, ∃ e ∈ D, x * coeff = e}.</div><divclass="ttdef"><b>Definition:</b><ahref="sorted__interval__list_8cc_source.html#l00457">sorted_interval_list.cc:457</a></div></div>
<divclass="ttc"id="log__severity_8h_html_acdd38e3c9f22f127d7776920e3079eda"><divclass="ttname"><ahref="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a></div><divclass="ttdeci">const int FATAL</div><divclass="ttdef"><b>Definition:</b><ahref="log__severity_8h_source.html#l00032">log_severity.h:32</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_domain_html_aa74ea8cd1b0767659f704b482d07c103"><divclass="ttname"><ahref="classoperations__research_1_1_domain.html#aa74ea8cd1b0767659f704b482d07c103">operations_research::Domain::Max</a></div><divclass="ttdeci">int64_t Max() const</div><divclass="ttdoc">Returns the max value of the domain.</div><divclass="ttdef"><b>Definition:</b><ahref="sorted__interval__list_8cc_source.html#l00213">sorted_interval_list.cc:213</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_domain_html_a8cf21a67f7d81a800ff912239bb2db64"><divclass="ttname"><ahref="classoperations__research_1_1_domain.html#a8cf21a67f7d81a800ff912239bb2db64">operations_research::Domain::Min</a></div><divclass="ttdeci">int64_t Min() const</div><divclass="ttdoc">Returns the min value of the domain.</div><divclass="ttdef"><b>Definition:</b><ahref="sorted__interval__list_8cc_source.html#l00208">sorted_interval_list.cc:208</a></div></div>
<divclass="ttc"id="classoperations__research_1_1sat_1_1_cp_model_proto_html_a2787b866382b560920d55ce5cf129920"><divclass="ttname"><ahref="classoperations__research_1_1sat_1_1_cp_model_proto.html#a2787b866382b560920d55ce5cf129920">operations_research::sat::CpModelProto::objective</a></div><divclass="ttdeci">const ::operations_research::sat::CpObjectiveProto & objective() const</div><divclass="ttdef"><b>Definition:</b><ahref="cp__model_8pb_8h_source.html#l12130">cp_model.pb.h:12130</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_domain_html_a835826c4c5129b74553042a357a721ff"><divclass="ttname"><ahref="classoperations__research_1_1_domain.html#a835826c4c5129b74553042a357a721ff">operations_research::Domain::IntersectionWith</a></div><divclass="ttdeci">Domain IntersectionWith(const Domain &domain) const</div><divclass="ttdoc">Returns the intersection of D and domain.</div><divclass="ttdef"><b>Definition:</b><ahref="sorted__interval__list_8cc_source.html#l00297">sorted_interval_list.cc:297</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_domain_html_a63a708c626b59b4504ddb879496c894e"><divclass="ttname"><ahref="classoperations__research_1_1_domain.html#a63a708c626b59b4504ddb879496c894e">operations_research::Domain::MultiplicationBy</a></div><divclass="ttdeci">Domain MultiplicationBy(int64_t coeff, bool *exact=nullptr) const</div><divclass="ttdoc">Returns {x ∈ Int64, ∃ e ∈ D, x = e * coeff}.</div><divclass="ttdef"><b>Definition:</b><ahref="sorted__interval__list_8cc_source.html#l00376">sorted_interval_list.cc:376</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_domain_html"><divclass="ttname"><ahref="classoperations__research_1_1_domain.html">operations_research::Domain</a></div><divclass="ttdoc">We call domain any subset of Int64 = [kint64min, kint64max].</div><divclass="ttdef"><b>Definition:</b><ahref="sorted__interval__list_8h_source.html#l00081">sorted_interval_list.h:81</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_domain_html_a22c6c2f121586b5d76feb4b0e536dfde"><divclass="ttname"><ahref="classoperations__research_1_1_domain.html#a22c6c2f121586b5d76feb4b0e536dfde">operations_research::Domain::Contains</a></div><divclass="ttdeci">bool Contains(int64_t value) const</div><divclass="ttdoc">Returns true iff value is in Domain.</div><divclass="ttdef"><b>Definition:</b><ahref="sorted__interval__list_8cc_source.html#l00236">sorted_interval_list.cc:236</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html"><divclass="ttname"><ahref="namespaceoperations__research.html">operations_research</a></div><divclass="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><divclass="ttdef"><b>Definition:</b><ahref="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_domain_html_a8e12342fc420701fbffd97025421575a"><divclass="ttname"><ahref="classoperations__research_1_1_domain.html#a8e12342fc420701fbffd97025421575a">operations_research::Domain::IsEmpty</a></div><divclass="ttdeci">bool IsEmpty() const</div><divclass="ttdoc">Returns true if this is the empty set.</div><divclass="ttdef"><b>Definition:</b><ahref="sorted__interval__list_8cc_source.html#l00192">sorted_interval_list.cc:192</a></div></div>
