Files
ortools-clone/docs/cpp/boolean__problem_8cc_source.html

286 lines
254 KiB
HTML
Raw Normal View History

2020-09-01 16:00:33 +02:00
<!-- 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"/>
2022-01-16 18:02:36 +01:00
<meta name="generator" content="Doxygen 1.8.15"/>
2020-09-01 16:00:33 +02:00
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OR-Tools: boolean_problem.cc Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
2022-01-16 18:02:36 +01:00
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
2020-09-01 16:00:33 +02:00
<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
2021-12-14 13:41:01 +01:00
&#160;<span id="projectnumber">9.2</span>
2020-09-01 16:00:33 +02:00
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
2022-01-16 18:02:36 +01:00
<!-- Generated by Doxygen 1.8.15 -->
2020-09-01 16:00:33 +02:00
<script type="text/javascript">
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
2020-09-01 16:00:33 +02:00
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
2020-09-01 16:00:33 +02:00
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
2022-01-16 18:02:36 +01:00
/* @license-end */</script>
2020-09-01 16:00:33 +02:00
<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">
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('boolean__problem_8cc_source.html','');});
2020-09-01 16:00:33 +02:00
/* @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">
2022-01-16 18:02:36 +01:00
<div class="headertitle">
<div class="title">boolean_problem.cc</div> </div>
2020-09-01 16:00:33 +02:00
</div><!--header-->
<div class="contents">
2022-01-16 18:02:36 +01:00
<a href="boolean__problem_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#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">#include &quot;<a class="code" href="boolean__problem_8h.html">ortools/sat/boolean_problem.h</a>&quot;</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;</div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="preprocessor">#include &lt;algorithm&gt;</span></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;cstdlib&gt;</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="preprocessor">#include &lt;limits&gt;</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="preprocessor">#include &lt;numeric&gt;</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="preprocessor">#include &lt;utility&gt;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;<span class="preprocessor">#include &quot;absl/container/flat_hash_map.h&quot;</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="preprocessor">#include &quot;absl/status/status.h&quot;</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;<span class="preprocessor">#include &quot;absl/strings/str_format.h&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="commandlineflags_8h.html">ortools/base/commandlineflags.h</a>&quot;</span></div><div
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a07c4372fa55782d13edd24b86130e3ba"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a07c4372fa55782d13edd24b86130e3ba">operations_research::sat::AddObjectiveConstraint</a></div><div class="ttdeci">bool AddObjectiveConstraint(const LinearBooleanProblem &amp;problem, bool use_lower_bound, Coefficient lower_bound, bool use_upper_bound, Coefficient upper_bound, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00338">boolean_problem.cc:338</a></div></div>
<div class="ttc" id="classoperations__research_1_1_graph_symmetry_finder_html"><div class="ttname"><a href="classoperations__research_1_1_graph_symmetry_finder.html">operations_research::GraphSymmetryFinder</a></div><div class="ttdef"><b>Definition:</b> <a href="find__graph__symmetries_8h_source.html#l00043">find_graph_symmetries.h:43</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_constraint_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_constraint.html">operations_research::sat::LinearBooleanConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l00083">boolean_problem.pb.h:83</a></div></div>
<div class="ttc" id="base_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aaf57d784624873d840a2589efa6ff1a1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aaf57d784624873d840a2589efa6ff1a1">operations_research::sat::ChangeOptimizationDirection</a></div><div class="ttdeci">void ChangeOptimizationDirection(LinearBooleanProblem *problem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00210">boolean_problem.cc:210</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_objective_proto_html_ac7453c28e1da85ea4728b31419c0d6b7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_objective_proto.html#ac7453c28e1da85ea4728b31419c0d6b7">operations_research::sat::CpObjectiveProto::set_offset</a></div><div class="ttdeci">void set_offset(double value)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l11330">cp_model.pb.h:11330</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem_html_a7391d0c784872207477f474cf28f65a5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem.html#a7391d0c784872207477f474cf28f65a5">operations_research::sat::CanonicalBooleanLinearProblem::Rhs</a></div><div class="ttdeci">const Coefficient Rhs(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00157">pb_constraint.h:157</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a1a5e26554d014197de9434d2c39e07e9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9">operations_research::sat::SatSolver::parameters</a></div><div class="ttdeci">const SatParameters &amp; parameters() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00111">sat_solver.cc:111</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_literal_html_a44fc3f1a79635fadb162d04cec312341"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a44fc3f1a79635fadb162d04cec312341">operations_research::sat::Literal::SignedValue</a></div><div class="ttdeci">int SignedValue() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00089">sat_base.h:89</a></div></div>
<div class="ttc" id="classoperations__research_1_1_graph_symmetry_finder_html_ad1f88654797ab9271206d6a4c013a94e"><div class="ttname"><a href="classoperations__research_1_1_graph_symmetry_finder.html#ad1f88654797ab9271206d6a4c013a94e">operations_research::GraphSymmetryFinder::FindSymmetries</a></div><div class="ttdeci">absl::Status FindSymmetries(std::vector&lt; int &gt; *node_equivalence_classes_io, std::vector&lt; std::unique_ptr&lt; SparsePermutation &gt; &gt; *generators, std::vector&lt; int &gt; *factorized_automorphism_group_size, TimeLimit *time_limit=nullptr)</div><div class="ttdef"><b>Definition:</b> <a href="find__graph__symmetries_8cc_source.html#l00377">find_graph_symmetries.cc:377</a></div></div>
<div class="ttc" id="macros_8h_html_a7f536a3b33f9bed8f75734e035d30725"><div class="ttname"><a href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div><div class="ttdeci">const bool DEBUG_MODE</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00024">macros.h:24</a></div></div>
<div class="ttc" id="alldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aa9848f5a312eda3dad1aa59ed96e2519"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa9848f5a312eda3dad1aa59ed96e2519">operations_research::sat::ApplyLiteralMappingToBooleanProblem</a></div><div class="ttdeci">void ApplyLiteralMappingToBooleanProblem(const absl::StrongVector&lt; LiteralIndex, LiteralIndex &gt; &amp;mapping, LinearBooleanProblem *problem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00744">boolean_problem.cc:744</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_constraint_html_a4f74a7e2b2f09549c373754a54e6b011"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_constraint.html#a4f74a7e2b2f09549c373754a54e6b011">operations_research::sat::LinearBooleanConstraint::has_upper_bound</a></div><div class="ttdeci">bool has_upper_bound() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01126">boolean_problem.pb.h:1126</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_postsolver_html_a8155216960c6e1f5d476e1c28b2d34fa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a8155216960c6e1f5d476e1c28b2d34fa">operations_research::sat::SatPostsolver::ApplyMapping</a></div><div class="ttdeci">void ApplyMapping(const absl::StrongVector&lt; BooleanVariable, BooleanVariable &gt; &amp;mapping)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00062">simplification.cc:62</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_ae9827e8df25379290d5db3127d9f94d5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#ae9827e8df25379290d5db3127d9f94d5">operations_research::sat::LinearBooleanProblem::mutable_objective</a></div><div class="ttdeci">::operations_research::sat::LinearObjective * mutable_objective()</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01629">boolean_problem.pb.h:1629</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ab55a8cd2852ff07c9900f5cff231b329"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab55a8cd2852ff07c9900f5cff231b329">operations_research::sat::ProbeAndSimplifyProblem</a></div><div class="ttdeci">void ProbeAndSimplifyProblem(SatPostsolver *postsolver, LinearBooleanProblem *problem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00826">boolean_problem.cc:826</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_af02334eb54337092e11b9a74312a4c25"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#af02334eb54337092e11b9a74312a4c25">operations_research::sat::LinearObjective::set_scaling_factor</a></div><div class="ttdeci">void set_scaling_factor(double value)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01367">boolean_problem.pb.h:1367</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ae701a64603e2ac22a99d6c0dd0649845"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae701a64603e2ac22a99d6c0dd0649845">operations_research::sat::LinearBooleanProblemToCnfString</a></div><div class="ttdeci">std::string LinearBooleanProblemToCnfString(const LinearBooleanProblem &amp;problem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00392">boolean_problem.cc:392</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_ad0c9bce45c918e9aa67b70f53519ca37"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#ad0c9bce45c918e9aa67b70f53519ca37">operations_research::sat::LinearBooleanProblem::constraints</a></div><div class="ttdeci">const ::operations_research::sat::LinearBooleanConstraint &amp; constraints(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01546">boolean_problem.pb.h:1546</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_objective_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_objective_proto.html">operations_research::sat::CpObjectiveProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l04469">cp_model.pb.h:4469</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_a21a5c856dce893e9e0f430aab3b09628"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a21a5c856dce893e9e0f430aab3b09628">operations_research::sat::LinearBooleanProblem::mutable_var_names</a></div><div class="ttdeci">std::string * mutable_var_names(int index)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01676">boolean_problem.pb.h:1676</a></div></div>
<div class="ttc" id="base_2logging_8h_html_a9f96ed9f06763f0821fdbb4d29031d8d"><div class="ttname"><a href="base_2logging_8h.html#a9f96ed9f06763f0821fdbb4d29031d8d">CHECK_OK</a></div><div class="ttdeci">#define CHECK_OK(x)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00044">base/logging.h:44</a></div></div>
<div class="ttc" id="int__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_constraint_html_afbd5ac237e1e9e43394094e99703ea69"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_constraint.html#afbd5ac237e1e9e43394094e99703ea69">operations_research::sat::LinearBooleanConstraint::has_lower_bound</a></div><div class="ttdeci">bool has_lower_bound() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01098">boolean_problem.pb.h:1098</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_literal_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a764be64f3029f8b8e23511061d8de355">operations_research::sat::Literal::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00095">sat_base.h:95</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap&lt; K, V &gt; &amp;a, IdMap&lt; K, V &gt; &amp;b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00263">id_map.h:263</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_variables_assignment_html_a5300129913f51dcb0b1c531e3248490e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">operations_research::sat::VariablesAssignment::LiteralIsTrue</a></div><div class="ttdeci">bool LiteralIsTrue(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00152">sat_base.h:152</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_a777a6e330a22a8889389cb9b9c9f12d6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a777a6e330a22a8889389cb9b9c9f12d6">operations_research::sat::LinearBooleanProblem::has_objective</a></div><div class="ttdeci">bool has_objective() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01570">boolean_problem.pb.h:1570</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_literal_html_a4a11c7c4d7706c09de5e18707c3b5c62"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">operations_research::sat::Literal::Index</a></div><div class="ttdeci">LiteralIndex Index() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00086">sat_base.h:86</a></div></div>
<div class="ttc" id="classoperations__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#l00093">sat_base.h:93</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_a9fd8f81a798fd34a843b007c10e40d6b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a9fd8f81a798fd34a843b007c10e40d6b">operations_research::sat::LinearBooleanProblem::objective</a></div><div class="ttdeci">const ::operations_research::sat::LinearObjective &amp; objective() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01582">boolean_problem.pb.h:1582</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_ac7453c28e1da85ea4728b31419c0d6b7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#ac7453c28e1da85ea4728b31419c0d6b7">operations_research::sat::LinearObjective::set_offset</a></div><div class="ttdeci">void set_offset(double value)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01339">boolean_problem.pb.h:1339</a></div></div>
<div class="ttc" id="base_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00420">base/logging.h:420</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_postsolver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_postsolver.html">operations_research::sat::SatPostsolver</a></div><div class="ttdef"><b>Definition:</b> <a href="simplification_8h_source.html#l00049">simplification.h:49</a></div></div>
<div class="ttc" id="classoperations__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#l00066">sat_base.h:66</a></div></div>
<div class="ttc" id="hash_8h_html"><div class="ttname"><a href="hash_8h.html">hash.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_a5a95ed21eee34077d09c7ba95c00c885"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a5a95ed21eee34077d09c7ba95c00c885">operations_research::sat::LinearObjective::mutable_coefficients</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::RepeatedField&lt; int64_t &gt; * mutable_coefficients()</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01311">boolean_problem.pb.h:1311</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a0b58ef3a397720b272662f8bc45585cb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb">operations_research::sat::SatSolver::SetNumVariables</a></div><div class="ttdeci">void SetNumVariables(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00065">sat_solver.cc:65</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_boolean_assignment_html_a6621d62d6f9a24a33e9f33c46d7666eb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_boolean_assignment.html#a6621d62d6f9a24a33e9f33c46d7666eb">operations_research::sat::BooleanAssignment::add_literals</a></div><div class="ttdeci">void add_literals(int32_t value)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01400">boolean_problem.pb.h:1400</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_aeaf0da781ca9b370d96b7fbd3f74266a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#aeaf0da781ca9b370d96b7fbd3f74266a">operations_research::sat::LinearBooleanProblem::constraints_size</a></div><div class="ttdeci">int constraints_size() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01528">boolean_problem.pb.h:1528</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_variables_assignment_html_ae19413c447377161d432f18d1323a037"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#ae19413c447377161d432f18d1323a037">operations_research::sat::VariablesAssignment::NumberOfVariables</a></div><div class="ttdeci">int NumberOfVariables() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00172">sat_base.h:172</a></div></div>
<div class="ttc" id="classoperations__research_1_1_sparse_permutation_html_a9add43490c45e4334099bb15b6e6eab0"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a9add43490c45e4334099bb15b6e6eab0">operations_research::SparsePermutation::RemoveCycles</a></div><div class="ttdeci">void RemoveCycles(const std::vector&lt; int &gt; &amp;cycle_indices)</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8cc_source.html#l00023">sparse_permutation.cc:23</a></div></div>
<div class="ttc" id="routing__filters_8cc_html_a8e4ee19dee0e00541dbe9bbc83d806ba"><div class="ttname"><a href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a></div><div class="ttdeci">int64_t coefficient</div><div class="ttdef"><b>Definition:</b> <a href="routing__filters_8cc_source.html#l00970">routing_filters.cc:970</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a25b9a60378da756e4100df6231f29b23"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a25b9a60378da756e4100df6231f29b23">operations_research::sat::StoreAssignment</a></div><div class="ttdeci">void StoreAssignment(const VariablesAssignment &amp;assignment, BooleanAssignment *output)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00477">boolean_problem.cc:477</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a58c0f19bf0e5ad35da0572722b33d6e7"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a58c0f19bf0e5ad35da0572722b33d6e7">operations_research::sat::ExtractSubproblem</a></div><div class="ttdeci">void ExtractSubproblem(const LinearBooleanProblem &amp;problem, const std::vector&lt; int &gt; &amp;constraint_indices, LinearBooleanProblem *subproblem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00488">boolean_problem.cc:488</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a9d3beb2afe4ae647674b054bf29290e2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2">operations_research::sat::SatSolver::NumVariables</a></div><div class="ttdeci">int NumVariables() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00083">sat_solver.h:83</a></div></div>
<div class="ttc" id="boolean__problem_8h_html"><div class="ttname"><a href="boolean__problem_8h.html">boolean_problem.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_ad03d1e2f94c4ca4c8004ac5355e6504a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ad03d1e2f94c4ca4c8004ac5355e6504a">operations_research::sat::CpModelProto::add_variables</a></div><div class="ttdeci">::operations_research::sat::IntegerVariableProto * add_variables()</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12250">cp_model.pb.h:12250</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ae787aad51dac94ee684cf971def30838"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838">operations_research::sat::ExtractAssignment</a></div><div class="ttdeci">void ExtractAssignment(const LinearBooleanProblem &amp;problem, const SatSolver &amp;solver, std::vector&lt; bool &gt; *assignment)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00052">boolean_problem.cc:52</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_acaccfd2e692c84b7b31c77ac174199cd"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#acaccfd2e692c84b7b31c77ac174199cd">operations_research::sat::BooleanProblemToCpModelproto</a></div><div class="ttdeci">CpModelProto BooleanProblemToCpModelproto(const LinearBooleanProblem &amp;problem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00153">boolean_problem.cc:153</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a6004b20c87a172cc7d18754489157868"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6004b20c87a172cc7d18754489157868">operations_research::sat::ValidateBooleanProblem</a></div><div class="ttdeci">absl::Status ValidateBooleanProblem(const LinearBooleanProblem &amp;problem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00133">boolean_problem.cc:133</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_a956fd282ab101a4dae58dc5e8ed5adfb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a956fd282ab101a4dae58dc5e8ed5adfb">operations_research::sat::LinearBooleanProblem::set_num_variables</a></div><div class="ttdeci">void set_num_variables(int32_t value)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01519">boolean_problem.pb.h:1519</a></div></div>
<div class="ttc" id="io_8h_html"><div class="ttname"><a href="io_8h.html">io.h</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a7ab45c5256e605ee3da3bf3abd1df2e1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7ab45c5256e605ee3da3bf3abd1df2e1">operations_research::sat::kTrueLiteralIndex</a></div><div class="ttdeci">const LiteralIndex kTrueLiteralIndex(-2)</div></div>
<div class="ttc" id="classoperations__research_1_1_sparse_permutation_html_af567b4e287e268eb9ecee908f63e5b64"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#af567b4e287e268eb9ecee908f63e5b64">operations_research::SparsePermutation::Cycle</a></div><div class="ttdeci">Iterator Cycle(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00117">sparse_permutation.h:117</a></div></div>
<div class="ttc" id="classutil_1_1_static_graph_html"><div class="ttname"><a href="classutil_1_1_static_graph.html">util::StaticGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00399">graph.h:399</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html">operations_research::sat::LinearBooleanProblem</a></div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l00711">boolean_problem.pb.h:711</a></div></div>
<div class="ttc" id="integral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
<div class="ttc" id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a8497b34029ee966694083aa34c9022b5"><div class="ttname"><a href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a8497b34029ee966694083aa34c9022b5">operations_research::SparsePermutation::Iterator::begin</a></div><div class="ttdeci">std::vector&lt; int &gt;::const_iterator begin() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00109">sparse_permutation.h:109</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_objective_proto_html_a52d17efda66accf5a25aab163625e0dc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_objective_proto.html#a52d17efda66accf5a25aab163625e0dc">operations_research::sat::CpObjectiveProto::add_vars</a></div><div class="ttdeci">void add_vars(int32_t value)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l11245">cp_model.pb.h:11245</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_aba32b1f1ee3ffb4194aa8af155f827cd"><div class="ttname"><a href="namespaceoperations__research.html#aba32b1f1ee3ffb4194aa8af155f827cd">operations_research::ProtobufDebugString</a></div><div class="ttdeci">std::string ProtobufDebugString(const P &amp;message)</div><div class="ttdef"><b>Definition:</b> <a href="port_2proto__utils_8h_source.html#l00029">port/proto_utils.h:29</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ace3f68c781179d6de36fad9d4b0c386b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ace3f68c781179d6de36fad9d4b0c386b">operations_research::sat::MakeAllLiteralsPositive</a></div><div class="ttdeci">void MakeAllLiteralsPositive(LinearBooleanProblem *problem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00637">boolean_problem.cc:637</a></div></div>
<div class="ttc" id="base_2logging_8h_html_a4bd2e815ca2f702a4b6aa744b1ff3b82"><div class="ttname"><a href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a></div><div class="ttdeci">#define CHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00705">base/logging.h:705</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_constraint_html_a1edcde41f3dff977bb6db2223f1e124f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_constraint.html#a1edcde41f3dff977bb6db2223f1e124f">operations_research::sat::LinearBooleanConstraint::lower_bound</a></div><div class="ttdeci">int64_t lower_bound() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01108">boolean_problem.pb.h:1108</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_a129ed1cb32c2716eb41b03f80e2637bd"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a129ed1cb32c2716eb41b03f80e2637bd">operations_research::sat::LinearObjective::set_literals</a></div><div class="ttdeci">void set_literals(int index, int32_t value)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01239">boolean_problem.pb.h:1239</a></div></div>
<div class="ttc" id="classoperations__research_1_1_sparse_permutation_html"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html">operations_research::SparsePermutation</a></div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00027">sparse_permutation.h:27</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_a6621d62d6f9a24a33e9f33c46d7666eb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a6621d62d6f9a24a33e9f33c46d7666eb">operations_research::sat::LinearObjective::add_literals</a></div><div class="ttdeci">void add_literals(int32_t value)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01246">boolean_problem.pb.h:1246</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_a918afd65e9382a917980761f93356bfa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a918afd65e9382a917980761f93356bfa">operations_research::sat::LinearObjective::add_coefficients</a></div><div class="ttdeci">void add_coefficients(int64_t value)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01293">boolean_problem.pb.h:1293</a></div></div>
<div class="ttc" id="alldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
<div class="ttc" id="strong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
<div class="ttc" id="gscip__solver_8cc_html_a1ba5ca0f61f2fa13bd23bf0f89004f35"><div class="ttname"><a href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a></div><div class="ttdeci">double upper_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00126">gscip_solver.cc:126</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_literal_html_a239e1315c4e975a35537790ba0d913a7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7">operations_research::sat::Literal::NegatedIndex</a></div><div class="ttdeci">LiteralIndex NegatedIndex() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00087">sat_base.h:87</a></div></div>
<div class="ttc" id="map__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
<div class="ttc" id="pack_8cc_html_a4255f714cea26cdd64f6a0ee72d34a8c"><div class="ttname"><a href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a></div><div class="ttdeci">int64_t weight</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00510">pack.cc:510</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="classoperations__research_1_1sat_1_1_literal_html_a6a5dcff82096cd7a7147bf996dbaa5a8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">operations_research::sat::Literal::Variable</a></div><div class="ttdeci">BooleanVariable Variable() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00082">sat_base.h:82</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem.html">operations_research::sat::CanonicalBooleanLinearProblem</a></div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00142">pb_constraint.h:142</a></div></div>
<div class="ttc" id="log__severity_8h_html_a50e5762f38854b37ee3e2851bc1bb0e7"><div class="ttname"><a href="log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7">WARNING</a></div><div class="ttdeci">const int WARNING</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00031">log_severity.h:31</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ac75d30c113a2b2628f0d77e403467815"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac75d30c113a2b2628f0d77e403467815">operations_research::sat::ProbeAndFindEquivalentLiteral</a></div><div class="ttdeci">void ProbeAndFindEquivalentLiteral(SatSolver *solver, SatPostsolver *postsolver, DratProofHandler *drat_proof_handler, absl::StrongVector&lt; LiteralIndex, LiteralIndex &gt; *mapping)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l01129">simplification.cc:1129</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aa72e6dc6e802fbf5c5fd237efea1131f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa72e6dc6e802fbf5c5fd237efea1131f">operations_research::sat::LoadAndConsumeBooleanProblem</a></div><div class="ttdeci">bool LoadAndConsumeBooleanProblem(LinearBooleanProblem *problem, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00261">boolean_problem.cc:261</a></div></div>
<div class="ttc" id="classabsl_1_1_strong_vector_html_a644718bb2fb240de962dc3c9a1fdf0dc"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a644718bb2fb240de962dc3c9a1fdf0dc">absl::StrongVector::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00156">strong_vector.h:156</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_boolean_assignment_html_a5339b1584860029bfdb4f080683852f5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_boolean_assignment.html#a5339b1584860029bfdb4f080683852f5">operations_research::sat::BooleanAssignment::clear_literals</a></div><div class="ttdeci">void clear_literals()</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01383">boolean_problem.pb.h:1383</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_trail_html_a8ef12397d1682615bc3108c397734179"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">operations_research::sat::Trail::Index</a></div><div class="ttdeci">int Index() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00380">sat_base.h:380</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_proto.html">operations_research::sat::LinearConstraintProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l01134">cp_model.pb.h:1134</a></div></div>
<div class="ttc" id="gscip__solver_8cc_html_a1e2f9a2352c1d9a6cada9544898fceec"><div class="ttname"><a href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a></div><div class="ttdeci">double lower_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00125">gscip_solver.cc:125</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_variables_assignment_html_a49e751eb6f0e9babd957889bb8e7472d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">operations_research::sat::VariablesAssignment::VariableIsAssigned</a></div><div class="ttdeci">bool VariableIsAssigned(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00160">sat_base.h:160</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_constraint_html_adb0496e18c263c65d88c43830b8b205b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_constraint.html#adb0496e18c263c65d88c43830b8b205b">operations_research::sat::LinearBooleanConstraint::upper_bound</a></div><div class="ttdeci">int64_t upper_bound() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01136">boolean_problem.pb.h:1136</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem_html_a03666f2e70e42a9560aa9ce7416d2644"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem.html#a03666f2e70e42a9560aa9ce7416d2644">operations_research::sat::CanonicalBooleanLinearProblem::NumConstraints</a></div><div class="ttdeci">int NumConstraints() const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00156">pb_constraint.h:156</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_a638ebfa975d8dc9f1da7611384c62ecd"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a638ebfa975d8dc9f1da7611384c62ecd">operations_research::sat::LinearBooleanProblem::clear_constraints</a></div><div class="ttdeci">void clear_constraints()</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01531">boolean_problem.pb.h:1531</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_ac01de597eeeff5521a8bf54568bf1373"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ac01de597eeeff5521a8bf54568bf1373">operations_research::sat::CpModelProto::add_constraints</a></div><div class="ttdeci">::operations_research::sat::ConstraintProto * add_constraints()</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12290">cp_model.pb.h:12290</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_ae235e7298a32fce3a6836aee49706bd0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#ae235e7298a32fce3a6836aee49706bd0">operations_research::sat::LinearBooleanProblem::num_variables</a></div><div class="ttdeci">int32_t num_variables() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01511">boolean_problem.pb.h:1511</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_a72d41feda9a93c11089d3d99d6270999"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a72d41feda9a93c11089d3d99d6270999">operations_research::sat::LinearObjective::literals_size</a></div><div class="ttdeci">int literals_size() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01226">boolean_problem.pb.h:1226</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_constraint_html_ada512454ae4423756b5ce9138465f8a2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_constraint.html#ada512454ae4423756b5ce9138465f8a2">operations_research::sat::LinearBooleanConstraint::MergeFrom</a></div><div class="ttdeci">void MergeFrom(const LinearBooleanConstraint &amp;from)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8cc_source.html#l00502">boolean_problem.pb.cc:502</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_variables_assignment_html_ac821b9b8b54da703731ce70864668a89"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#ac821b9b8b54da703731ce70864668a89">operations_research::sat::VariablesAssignment::GetTrueLiteralForAssignedVariable</a></div><div class="ttdeci">Literal GetTrueLiteralForAssignedVariable(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00167">sat_base.h:167</a></div></div>
<div class="ttc" id="graph_2util_8h_html"><div class="ttname"><a href="graph_2util_8h.html">util.h</a></div></div>
<div class="ttc" id="classabsl_1_1_strong_vector_html_a9263000d449fdccb6cb70b303063e60b"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">absl::StrongVector::push_back</a></div><div class="ttdeci">void push_back(const value_type &amp;x)</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00158">strong_vector.h:158</a></div></div>
<div class="ttc" id="parser_8yy_8cc_html_a5a634cf4429798b1c921a81de8250051"><div class="ttname"><a href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a></div><div class="ttdeci">static int input(yyscan_t yyscanner)</div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aab5216003fbe0c2f21e7433084d358e1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1">operations_research::sat::IsAssignmentValid</a></div><div class="ttdeci">bool IsAssignmentValid(const LinearBooleanProblem &amp;problem, const std::vector&lt; bool &gt; &amp;assignment)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00362">boolean_problem.cc:362</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_a24dcbf29c0d6cd766009a182a6484e3b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a24dcbf29c0d6cd766009a182a6484e3b">operations_research::sat::LinearBooleanProblem::name</a></div><div class="ttdeci">const std::string &amp; name() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01439">boolean_problem.pb.h:1439</a></div></div>
<div class="ttc" id="pack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_boolean_assignment_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_boolean_assignment.html">operations_research::sat::BooleanAssignment</a></div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l00545">boolean_problem.pb.h:545</a></div></div>
<div class="ttc" id="port_2proto__utils_8h_html"><div class="ttname"><a href="port_2proto__utils_8h.html">proto_utils.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_ad142870eaf4c9ce09c346a4f51b5be60"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#ad142870eaf4c9ce09c346a4f51b5be60">operations_research::sat::LinearBooleanProblem::var_names</a></div><div class="ttdeci">const std::string &amp; var_names(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01672">boolean_problem.pb.h:1672</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_ac035378cea0ed7b0978105547402faa8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">operations_research::sat::SatSolver::Backtrack</a></div><div class="ttdeci">void Backtrack(int target_level)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00889">sat_solver.cc:889</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_a7a8021e2b57fad24fac287b8e50fb27e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a7a8021e2b57fad24fac287b8e50fb27e">operations_research::sat::LinearObjective::literals</a></div><div class="ttdeci">int32_t literals(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01235">boolean_problem.pb.h:1235</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a05c49a95f6af6f8d873c96cae6ab6653"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653">operations_research::sat::SatSolver::AddLinearConstraint</a></div><div class="ttdeci">bool AddLinearConstraint(bool use_lower_bound, Coefficient lower_bound, bool use_upper_bound, Coefficient upper_bound, std::vector&lt; LiteralWithCoeff &gt; *cst)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00300">sat_solver.cc:300</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_a74f7eb449a6e182b73c8b4a1dbf15ce6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a74f7eb449a6e182b73c8b4a1dbf15ce6">operations_research::sat::LinearBooleanProblem::set_name</a></div><div class="ttdeci">void set_name(ArgT0 &amp;&amp;arg0, ArgT... args)</div></div>
<div class="ttc" id="base_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00894">base/logging.h:894</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_abb66766a5d79e878ff67851bc55ca24f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f">operations_research::sat::ComputeObjectiveValue</a></div><div class="ttdeci">Coefficient ComputeObjectiveValue(const LinearBooleanProblem &amp;problem, const std::vector&lt; bool &gt; &amp;assignment)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00348">boolean_problem.cc:348</a></div></div>
<div class="ttc" id="base_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a6986d13a746e6577bcf0cb190aef8113"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6986d13a746e6577bcf0cb190aef8113">operations_research::sat::FindLinearBooleanProblemSymmetries</a></div><div class="ttdeci">void FindLinearBooleanProblemSymmetries(const LinearBooleanProblem &amp;problem, std::vector&lt; std::unique_ptr&lt; SparsePermutation &gt;&gt; *generators)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00672">boolean_problem.cc:672</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_a5339b1584860029bfdb4f080683852f5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a5339b1584860029bfdb4f080683852f5">operations_research::sat::LinearObjective::clear_literals</a></div><div class="ttdeci">void clear_literals()</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01229">boolean_problem.pb.h:1229</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a66979ace60178ae3fe59f6180e4db42f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a66979ace60178ae3fe59f6180e4db42f">operations_research::sat::AddObjectiveUpperBound</a></div><div class="ttdeci">bool AddObjectiveUpperBound(const LinearBooleanProblem &amp;problem, Coefficient upper_bound, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00330">boolean_problem.cc:330</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a969b5056550d96847f8c35f19fd17f50"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a969b5056550d96847f8c35f19fd17f50">operations_research::sat::kFalseLiteralIndex</a></div><div class="ttdeci">const LiteralIndex kFalseLiteralIndex(-3)</div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_add13e122d8861d6cac9b9bb4a51cfcb7"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#add13e122d8861d6cac9b9bb4a51cfcb7">operations_research::sat::LoadBooleanProblem</a></div><div class="ttdeci">bool LoadBooleanProblem(const LinearBooleanProblem &amp;problem, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00221">boolean_problem.cc:221</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a3f6fa74408ea28eb41f29e9696d9a9a2"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3f6fa74408ea28eb41f29e9696d9a9a2">operations_research::sat::GenerateGraphForSymmetryDetection</a></div><div class="ttdeci">Graph * GenerateGraphForSymmetryDetection(const LinearBooleanProblem &amp;problem, std::vector&lt; int &gt; *initial_equivalence_classes)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00534">boolean_problem.cc:534</a></div></div>
<div class="ttc" id="classoperations__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#l00058">sat_solver.h:58</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_aa245194082b652eaad962f57b38884c3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#aa245194082b652eaad962f57b38884c3">operations_research::sat::LinearBooleanProblem::original_num_variables</a></div><div class="ttdeci">int32_t original_num_variables() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01834">boolean_problem.pb.h:1834</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html">operations_research::sat::LinearObjective</a></div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l00324">boolean_problem.pb.h:324</a></div></div>
<div class="ttc" id="classabsl_1_1_strong_vector_html_a60304b65bf89363bcc3165d3cde67f86"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">absl::StrongVector::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00147">strong_vector.h:147</a></div></div>
<div class="ttc" id="namespaceutil_html_a2f76166dbe0c4055a1f256235ad00478"><div class="ttname"><a href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">util::Graph</a></div><div class="ttdeci">ListGraph Graph</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02362">graph.h:2362</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="classoperations__research_1_1sat_1_1_cp_objective_proto_html_a4b9572c4b6c4b51f1e98efdcd69a7d0f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_objective_proto.html#a4b9572c4b6c4b51f1e98efdcd69a7d0f">operations_research::sat::CpObjectiveProto::add_coeffs</a></div><div class="ttdeci">void add_coeffs(int64_t value)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l11292">cp_model.pb.h:11292</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_variable_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_variable_proto.html">operations_research::sat::IntegerVariableProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00272">cp_model.pb.h:272</a></div></div>
<div class="ttc" id="base_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a9789bf03dba611e9be5679d6e902d0c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">operations_research::sat::SatSolver::Assignment</a></div><div class="ttdeci">const VariablesAssignment &amp; Assignment() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00363">sat_solver.h:363</a></div></div>
<div class="ttc" id="boolean__problem_8cc_html_aa76db68d1f81b1cfd98995e3d0ac26f4"><div class="ttname"><a href="boolean__problem_8cc.html#aa76db68d1f81b1cfd98995e3d0ac26f4">ABSL_FLAG</a></div><div class="ttdeci">ABSL_FLAG(std::string, debug_dump_symmetry_graph_to_file, &quot;&quot;, &quot;If this flag is non-empty, an undirected graph whose&quot; &quot; automorphism group is in one-to-one correspondence with the&quot; &quot; symmetries of the SAT problem will be dumped to a file every&quot; &quot; time FindLinearBooleanProblemSymmetries() is called.&quot;)</div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a955786dcbe82b7c4dc9924a5473ac1e8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a955786dcbe82b7c4dc9924a5473ac1e8">operations_research::sat::SatSolver::SetAssignmentPreference</a></div><div class="ttdeci">void SetAssignmentPreference(Literal literal, double weight)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00151">sat_solver.h:151</a></div></div>
<div class="ttc" id="classabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt; LiteralIndex, LiteralIndex &gt;</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem_html_a05c49a95f6af6f8d873c96cae6ab6653"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem.html#a05c49a95f6af6f8d873c96cae6ab6653">operations_research::sat::CanonicalBooleanLinearProblem::AddLinearConstraint</a></div><div class="ttdeci">bool AddLinearConstraint(bool use_lower_bound, Coefficient lower_bound, bool use_upper_bound, Coefficient upper_bound, std::vector&lt; LiteralWithCoeff &gt; *cst)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00201">pb_constraint.cc:201</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_constraint_html_ad46224dc08b4e9baf8d0125ba4c1d51d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_constraint.html#ad46224dc08b4e9baf8d0125ba4c1d51d">operations_research::sat::LinearBooleanConstraint::Swap</a></div><div class="ttdeci">void Swap(LinearBooleanConstraint *other)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l00143">boolean_problem.pb.h:143</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1math__opt_html_ab61209db5b13f0d424da009e414298fc"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">operations_research::math_opt::Coefficient</a></div><div class="ttdeci">std::tuple&lt; int64_t, int64_t, const double &gt; Coefficient</div><div class="ttdef"><b>Definition:</b> <a href="sparse__collection__matchers_8h_source.html#l00061">sparse_collection_matchers.h:61</a></div></div>
<div class="ttc" id="base_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
<div class="ttc" id="namespaceutil_html_a45fca0c4762006176ad5622ec40dea9c"><div class="ttname"><a href="namespaceutil.html#a45fca0c4762006176ad5622ec40dea9c">util::WriteGraphToFile</a></div><div class="ttdeci">absl::Status WriteGraphToFile(const Graph &amp;graph, const std::string &amp;filename, bool directed, const std::vector&lt; int &gt; &amp;num_nodes_with_color)</div><div class="ttdef"><b>Definition:</b> <a href="io_8h_source.html#l00097">io.h:97</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a15aff33b9baefb846c984351291ae92d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a15aff33b9baefb846c984351291ae92d">operations_research::sat::SatParameters::log_search_progress</a></div><div class="ttdeci">bool log_search_progress() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l05010">sat_parameters.pb.h:5010</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_proto_html_a4b9572c4b6c4b51f1e98efdcd69a7d0f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_proto.html#a4b9572c4b6c4b51f1e98efdcd69a7d0f">operations_research::sat::LinearConstraintProto::add_coeffs</a></div><div class="ttdeci">void add_coeffs(int64_t value)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l07558">cp_model.pb.h:7558</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_constraint_html_a24dcbf29c0d6cd766009a182a6484e3b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_constraint.html#a24dcbf29c0d6cd766009a182a6484e3b">operations_research::sat::LinearBooleanConstraint::name</a></div><div class="ttdeci">const std::string &amp; name() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01161">boolean_problem.pb.h:1161</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_proto_html_abd89087d68515434d861e10adb0f055e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_proto.html#abd89087d68515434d861e10adb0f055e">operations_research::sat::LinearConstraintProto::add_domain</a></div><div class="ttdeci">void add_domain(int64_t value)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l07605">cp_model.pb.h:7605</a></div></div>
<div class="ttc" id="structoperations__research_1_1sat_1_1_literal_with_coeff_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">operations_research::sat::LiteralWithCoeff</a></div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00050">pb_constraint.h:50</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_a6856053080805ee6b73c5c6ad1ea790e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a6856053080805ee6b73c5c6ad1ea790e">operations_research::sat::LinearBooleanProblem::add_constraints</a></div><div class="ttdeci">::operations_research::sat::LinearBooleanConstraint * add_constraints()</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01553">boolean_problem.pb.h:1553</a></div></div>
<div class="ttc" id="namespaceutil_html_aab5724a929530fa1d28749dc82852388"><div class="ttname"><a href="namespaceutil.html#aab5724a929530fa1d28749dc82852388">util::RemapGraph</a></div><div class="ttdeci">std::unique_ptr&lt; Graph &gt; RemapGraph(const Graph &amp;graph, const std::vector&lt; int &gt; &amp;new_node_index)</div><div class="ttdef"><b>Definition:</b> <a href="graph_2util_8h_source.html#l00276">graph/util.h:276</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_variables_assignment_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html">operations_research::sat::VariablesAssignment</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00124">sat_base.h:124</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_a9e32504c3f1bddb0f25f1386ecf7987b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a9e32504c3f1bddb0f25f1386ecf7987b">operations_research::sat::LinearObjective::scaling_factor</a></div><div class="ttdeci">double scaling_factor() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01359">boolean_problem.pb.h:1359</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="commandlineflags_8h_html"><div class="ttname"><a href="commandlineflags_8h.html">commandlineflags.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_ad3badc7aa3d94e81e0126edbfa452fda"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ad3badc7aa3d94e81e0126edbfa452fda">operations_research::sat::CpModelProto::mutable_objective</a></div><div class="ttdeci">::operations_research::sat::CpObjectiveProto * mutable_objective()</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12366">cp_model.pb.h:12366</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a40254eb00d4590a09d811fe94c727c2a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a40254eb00d4590a09d811fe94c727c2a">operations_research::sat::UseObjectiveForSatAssignmentPreference</a></div><div class="ttdeci">void UseObjectiveForSatAssignmentPreference(const LinearBooleanProblem &amp;problem, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00309">boolean_problem.cc:309</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_constraint_html_a72d41feda9a93c11089d3d99d6270999"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_constraint.html#a72d41feda9a93c11089d3d99d6270999">operations_research::sat::LinearBooleanConstraint::literals_size</a></div><div class="ttdeci">int literals_size() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01003">boolean_problem.pb.h:1003</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a562245e719610d5969ca1b4b1b310c9d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a562245e719610d5969ca1b4b1b310c9d">operations_research::sat::ApplyLiteralMapping</a></div><div class="ttdeci">bool ApplyLiteralMapping(const absl::StrongVector&lt; LiteralIndex, LiteralIndex &gt; &amp;mapping, std::vector&lt; LiteralWithCoeff &gt; *cst, Coefficient *bound_shift, Coefficient *max_value)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00103">pb_constraint.cc:103</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_a7d71d78013f83bc05711ba8bf7a60eb2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a7d71d78013f83bc05711ba8bf7a60eb2">operations_research::sat::LinearBooleanProblem::var_names_size</a></div><div class="ttdeci">int var_names_size() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01658">boolean_problem.pb.h:1658</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_postsolver_html_a40432775821777983c4df6b4f2a71d92"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a40432775821777983c4df6b4f2a71d92">operations_research::sat::SatPostsolver::FixVariable</a></div><div class="ttdeci">void FixVariable(Literal x)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00057">simplification.cc:57</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_proto_html_a52d17efda66accf5a25aab163625e0dc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_proto.html#a52d17efda66accf5a25aab163625e0dc">operations_research::sat::LinearConstraintProto::add_vars</a></div><div class="ttdeci">void add_vars(int32_t value)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l07511">cp_model.pb.h:7511</a></div></div>
<div class="ttc" id="classoperations__research_1_1_sparse_permutation_html_ab601acb5aed920b1e61210d497462976"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#ab601acb5aed920b1e61210d497462976">operations_research::SparsePermutation::Support</a></div><div class="ttdeci">const std::vector&lt; int &gt; &amp; Support() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00037">sparse_permutation.h:37</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_afddea8f1f515fb9507a2e5c2ceb1b29e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#afddea8f1f515fb9507a2e5c2ceb1b29e">operations_research::sat::LinearObjective::coefficients_size</a></div><div class="ttdeci">int coefficients_size() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01273">boolean_problem.pb.h:1273</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_objective_proto_html_af02334eb54337092e11b9a74312a4c25"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_objective_proto.html#af02334eb54337092e11b9a74312a4c25">operations_research::sat::CpObjectiveProto::set_scaling_factor</a></div><div class="ttdeci">void set_scaling_factor(double value)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l11350">cp_model.pb.h:11350</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_a96ffc785b7b2135c7980c985883ffdd3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a96ffc785b7b2135c7980c985883ffdd3">operations_research::sat::LinearObjective::offset</a></div><div class="ttdeci">double offset() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01331">boolean_problem.pb.h:1331</a></div></div>
<div class="ttc" id="namespacegtl_html_a7a0f8dc4187504b814d8a8be463b517c"><div class="ttname"><a href="namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c">gtl::LookupOrInsert</a></div><div class="ttdeci">Collection::value_type::second_type &amp; LookupOrInsert(Collection *const collection, const typename Collection::value_type::first_type &amp;key, const typename Collection::value_type::second_type &amp;value)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00237">map_util.h:237</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="classoperations__research_1_1sat_1_1_sat_solver_html_a01fd4c9f5286534866c6c5ee2c160fe9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a01fd4c9f5286534866c6c5ee2c160fe9">operations_research::sat::SatSolver::LiteralTrail</a></div><div class="ttdeci">const Trail &amp; LiteralTrail() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00362">sat_solver.h:362</a></div></div>
<div class="ttc" id="classoperations__research_1_1_sparse_permutation_html_a8c5fc5af6e649a82d169f61e4dab5e33"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a8c5fc5af6e649a82d169f61e4dab5e33">operations_research::SparsePermutation::NumCycles</a></div><div class="ttdeci">int NumCycles() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00033">sparse_permutation.h:33</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_a05eb279096e545e00b296beca5c528e6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a05eb279096e545e00b296beca5c528e6">operations_research::sat::LinearBooleanProblem::mutable_constraints</a></div><div class="ttdeci">::operations_research::sat::LinearBooleanConstraint * mutable_constraints(int index)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01534">boolean_problem.pb.h:1534</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem_html_a95128a258b1f7d9a4058362edfd2158b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem.html#a95128a258b1f7d9a4058362edfd2158b">operations_research::sat::CanonicalBooleanLinearProblem::Constraint</a></div><div class="ttdeci">const std::vector&lt; LiteralWithCoeff &gt; &amp; Constraint(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00158">pb_constraint.h:158</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a8860b588974cb8ffaf2ac97eafd67b3e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8860b588974cb8ffaf2ac97eafd67b3e">operations_research::sat::ComputeBooleanLinearExpressionCanonicalForm</a></div><div class="ttdeci">bool ComputeBooleanLinearExpressionCanonicalForm(std::vector&lt; LiteralWithCoeff &gt; *cst, Coefficient *bound_shift, Coefficient *max_value)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00041">pb_constraint.cc:41</a></div></div>
<div class="ttc" id="demon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
<div class="ttc" id="optimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00085">optimization.cc:85</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_literal_html_ab76ca9049d6f3f1948d7120a98765107"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#ab76ca9049d6f3f1948d7120a98765107">operations_research::sat::Literal::IsPositive</a></div><div class="ttdeci">bool IsPositive() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00083">sat_base.h:83</a></div></div>
<div class="ttc" id="base_2logging_8h_html_ab25e01a2942b821d66371fc68d53f2eb"><div class="ttname"><a href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a></div><div class="ttdeci">#define CHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00703">base/logging.h:703</a></div></div>
<div class="ttc" id="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 class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_a2641e8e8b8ae421aee15c03b4479d2e5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a2641e8e8b8ae421aee15c03b4479d2e5">operations_research::sat::LinearObjective::set_coefficients</a></div><div class="ttdeci">void set_coefficients(int index, int64_t value)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01286">boolean_problem.pb.h:1286</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1glop_html_ac89c7b45754e9a6bdabc08bea586fc4e"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ac89c7b45754e9a6bdabc08bea586fc4e">operations_research::glop::Index</a></div><div class="ttdeci">int32_t Index</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00038">lp_types.h:38</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_a28b4ad4a2515668720c4d8c4a52ef2dc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a28b4ad4a2515668720c4d8c4a52ef2dc">operations_research::sat::LinearObjective::clear_coefficients</a></div><div class="ttdeci">void clear_coefficients()</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01276">boolean_problem.pb.h:1276</a></div></div>
<div class="ttc" id="log__severity_8h_html_ab4a2cbab234914b320b7fae11b6e8cb9"><div class="ttname"><a href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a></div><div class="ttdeci">const int INFO</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00031">log_severity.h:31</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_ab5aebe50cbbd6d7af4a57e3757330eeb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#ab5aebe50cbbd6d7af4a57e3757330eeb">operations_research::sat::LinearObjective::coefficients</a></div><div class="ttdeci">int64_t coefficients(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01282">boolean_problem.pb.h:1282</a></div></div>
2021-01-26 11:28:50 +01:00
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
2020-09-01 16:00:33 +02:00
<!-- 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="boolean__problem_8cc.html">boolean_problem.cc</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
2022-01-16 18:02:36 +01:00
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
2020-09-01 16:00:33 +02:00
</ul>
</div>
</body>
</html>