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" / >
2021-01-26 11:28:50 +01:00
< meta name = "generator" content = "Doxygen 1.9.1" / >
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 >
< 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-04-27 23:00:03 +02:00
  < span id = "projectnumber" > 9.0< / span >
2020-09-01 16:00:33 +02:00
< / div >
< / td >
< / tr >
< / tbody >
< / table >
< / div >
<!-- end header part -->
2021-01-26 11:28:50 +01:00
<!-- Generated by Doxygen 1.9.1 -->
2020-09-01 16:00:33 +02:00
< script type = "text/javascript" >
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3& dn=gpl-2.0.txt GPL-v2 */
2021-01-26 11:28:50 +01:00
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
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" >
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3& dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */< / script >
< div id = "main-nav" > < / div >
< / div > <!-- top -->
< div id = "side-nav" class = "ui-resizable side-nav-resizable" >
< div id = "nav-tree" >
< div id = "nav-tree-contents" >
< div id = "nav-sync" class = "sync" > < / div >
< / div >
< / div >
< div id = "splitbar" style = "-moz-user-select:none;"
class="ui-resizable-handle">
< / div >
< / div >
< script type = "text/javascript" >
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3& dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('boolean__problem_8cc_source.html',''); initResizable(); });
/* @license-end */
< / script >
< div id = "doc-content" >
<!-- window showing the filter options -->
< div id = "MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
< / div >
<!-- iframe showing the search results (closed by default) -->
< div id = "MSearchResultsWindow" >
< iframe src = "javascript:void(0)" frameborder = "0"
name="MSearchResults" id="MSearchResults">
< / iframe >
< / div >
< div class = "header" >
< div class = "headertitle" >
< div class = "title" > boolean_problem.cc< / div > < / div >
< / div > <!-- header -->
< div class = "contents" >
2021-04-27 23:00:03 +02: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 >   < span class = "comment" > // Copyright 2010-2021 Google LLC< / span > < / div >
2020-09-01 16:00:33 +02:00
< div class = "line" > < a name = "l00002" > < / a > < span class = "lineno" > 2< / span >   < span class = "comment" > // Licensed under the Apache License, Version 2.0 (the " License" );< / span > < / div >
< div class = "line" > < a name = "l00003" > < / a > < span class = "lineno" > 3< / span >   < span class = "comment" > // you may not use this file except in compliance with the License.< / span > < / div >
< div class = "line" > < a name = "l00004" > < / a > < span class = "lineno" > 4< / span >   < span class = "comment" > // You may obtain a copy of the License at< / span > < / div >
< div class = "line" > < a name = "l00005" > < / a > < span class = "lineno" > 5< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00006" > < / a > < span class = "lineno" > 6< / span >   < span class = "comment" > // http://www.apache.org/licenses/LICENSE-2.0< / span > < / div >
< div class = "line" > < a name = "l00007" > < / a > < span class = "lineno" > 7< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00008" > < / a > < span class = "lineno" > 8< / span >   < span class = "comment" > // Unless required by applicable law or agreed to in writing, software< / span > < / div >
< div class = "line" > < a name = "l00009" > < / a > < span class = "lineno" > 9< / span >   < span class = "comment" > // distributed under the License is distributed on an " AS IS" BASIS,< / span > < / div >
< div class = "line" > < a name = "l00010" > < / a > < span class = "lineno" > 10< / span >   < span class = "comment" > // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.< / span > < / div >
< div class = "line" > < a name = "l00011" > < / a > < span class = "lineno" > 11< / span >   < span class = "comment" > // See the License for the specific language governing permissions and< / span > < / div >
< div class = "line" > < a name = "l00012" > < / a > < span class = "lineno" > 12< / span >   < span class = "comment" > // limitations under the License.< / span > < / div >
< div class = "line" > < a name = "l00013" > < / a > < span class = "lineno" > 13< / span >   < / div >
< div class = "line" > < a name = "l00014" > < / a > < span class = "lineno" > 14< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "boolean__problem_8h.html" > ortools/sat/boolean_problem.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00015" > < / a > < span class = "lineno" > 15< / span >   < / div >
< div class = "line" > < a name = "l00016" > < / a > < span class = "lineno" > 16< / span >   < span class = "preprocessor" > #include < algorithm> < / span > < / div >
2021-04-27 23:00:03 +02:00
< div class = "line" > < a name = "l00017" > < / a > < span class = "lineno" > 17< / span >   < span class = "preprocessor" > #include < cstdint> < / span > < / div >
< div class = "line" > < a name = "l00018" > < / a > < span class = "lineno" > 18< / span >   < span class = "preprocessor" > #include < cstdlib> < / span > < / div >
< div class = "line" > < a name = "l00019" > < / a > < span class = "lineno" > 19< / span >   < span class = "preprocessor" > #include < limits> < / span > < / div >
< div class = "line" > < a name = "l00020" > < / a > < span class = "lineno" > 20< / span >   < span class = "preprocessor" > #include < numeric> < / span > < / div >
< div class = "line" > < a name = "l00021" > < / a > < span class = "lineno" > 21< / span >   < span class = "preprocessor" > #include < utility> < / span > < / div >
< div class = "line" > < a name = "l00022" > < / a > < span class = "lineno" > 22< / span >   < / div >
< div class = "line" > < a name = "l00023" > < / a > < span class = "lineno" > 23< / span >   < span class = "preprocessor" > #include " absl/container/flat_hash_map.h" < / span > < / div >
< div class = "line" > < a name = "l00024" > < / a > < span class = "lineno" > 24< / span >   < span class = "preprocessor" > #include " absl/status/status.h" < / span > < / div >
< div class = "line" > < a name = "l00025" > < / a > < span class = "lineno" > 25< / span >   < span class = "preprocessor" > #include " absl/strings/str_format.h" < / span > < / div >
< div class = "line" > < a name = "l00026" > < / a > < span class = "lineno" > 26< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "commandlineflags_8h.html" > ortools/base/commandlineflags.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00027" > < / a > < span class = "lineno" > 27< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "integral__types_8h.html" > ortools/base/integral_types.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00028" > < / a > < span class = "lineno" > 28< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "base_2logging_8h.html" > ortools/base/logging.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00029" > < / a > < span class = "lineno" > 29< / span >   < span class = "preprocessor" > #if !defined(__PORTABLE_PLATFORM__)< / span > < / div >
< div class = "line" > < a name = "l00030" > < / a > < span class = "lineno" > 30< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "io_8h.html" > ortools/graph/io.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00031" > < / a > < span class = "lineno" > 31< / span >   < span class = "preprocessor" > #endif < / span > < span class = "comment" > // __PORTABLE_PLATFORM__< / span > < / div >
< div class = "line" > < a name = "l00032" > < / a > < span class = "lineno" > 32< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "find__graph__symmetries_8h.html" > ortools/algorithms/find_graph_symmetries.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00033" > < / a > < span class = "lineno" > 33< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "hash_8h.html" > ortools/base/hash.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00034" > < / a > < span class = "lineno" > 34< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "int__type_8h.html" > ortools/base/int_type.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00035" > < / a > < span class = "lineno" > 35< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "map__util_8h.html" > ortools/base/map_util.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00036" > < / a > < span class = "lineno" > 36< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "strong__vector_8h.html" > ortools/base/strong_vector.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00037" > < / a > < span class = "lineno" > 37< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "graph_2util_8h.html" > ortools/graph/util.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00038" > < / a > < span class = "lineno" > 38< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "port_2proto__utils_8h.html" > ortools/port/proto_utils.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00039" > < / a > < span class = "lineno" > 39< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "sat__parameters_8pb_8h.html" > ortools/sat/sat_parameters.pb.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00040" > < / a > < span class = "lineno" > 40< / span >   < / div >
< div class = "line" > < a name = "l00041" > < / a > < span class = "lineno" > < a class = "line" href = "boolean__problem_8cc.html#aa76db68d1f81b1cfd98995e3d0ac26f4" > 41< / a > < / span >   < a class = "code" href = "boolean__problem_8cc.html#aa76db68d1f81b1cfd98995e3d0ac26f4" > ABSL_FLAG< / a > (std::string, debug_dump_symmetry_graph_to_file, < span class = "stringliteral" > " " < / span > ,< / div >
< div class = "line" > < a name = "l00042" > < / a > < span class = "lineno" > 42< / span >   < span class = "stringliteral" > " If this flag is non-empty, an undirected graph whose" < / span > < / div >
< div class = "line" > < a name = "l00043" > < / a > < span class = "lineno" > 43< / span >   < span class = "stringliteral" > " automorphism group is in one-to-one correspondence with the" < / span > < / div >
< div class = "line" > < a name = "l00044" > < / a > < span class = "lineno" > 44< / span >   < span class = "stringliteral" > " symmetries of the SAT problem will be dumped to a file every" < / span > < / div >
< div class = "line" > < a name = "l00045" > < / a > < span class = "lineno" > 45< / span >   < span class = "stringliteral" > " time FindLinearBooleanProblemSymmetries() is called." < / span > );< / div >
< div class = "line" > < a name = "l00046" > < / a > < span class = "lineno" > 46< / span >   < / div >
< div class = "line" > < a name = "l00047" > < / a > < span class = "lineno" > 47< / span >   < span class = "keyword" > namespace < / span > < a class = "code" href = "namespaceoperations__research.html" > operations_research< / a > {< / div >
< div class = "line" > < a name = "l00048" > < / a > < span class = "lineno" > 48< / span >   < span class = "keyword" > namespace < / span > sat {< / div >
< div class = "line" > < a name = "l00049" > < / a > < span class = "lineno" > 49< / span >   < / div >
< div class = "line" > < a name = "l00050" > < / a > < span class = "lineno" > 50< / span >   < span class = "keyword" > using< / span > < a class = "code" href = "namespaceutil.html#aab5724a929530fa1d28749dc82852388" > util::RemapGraph< / a > ;< / div >
< div class = "line" > < a name = "l00051" > < / a > < span class = "lineno" > 51< / span >   < / div >
< div class = "line" > < a name = "l00052" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838" > 52< / a > < / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838" > ExtractAssignment< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00053" > < / a > < span class = "lineno" > 53< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > & solver, std::vector< bool> * assignment) {< / div >
< div class = "line" > < a name = "l00054" > < / a > < span class = "lineno" > 54< / span >   assignment-> clear();< / div >
< div class = "line" > < a name = "l00055" > < / a > < span class = "lineno" > 55< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < problem.num_variables(); ++i) {< / div >
< div class = "line" > < a name = "l00056" > < / a > < span class = "lineno" > 56< / span >   assignment-> push_back(< / div >
< div class = "line" > < a name = "l00057" > < / a > < span class = "lineno" > 57< / span >   solver.< a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8" > Assignment< / a > ().< a class = "code" href = "classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e" > LiteralIsTrue< / a > (< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > (BooleanVariable(i), < span class = "keyword" > true< / span > )));< / div >
< div class = "line" > < a name = "l00058" > < / a > < span class = "lineno" > 58< / span >   }< / div >
< div class = "line" > < a name = "l00059" > < / a > < span class = "lineno" > 59< / span >   }< / div >
< div class = "line" > < a name = "l00060" > < / a > < span class = "lineno" > 60< / span >   < / div >
< div class = "line" > < a name = "l00061" > < / a > < span class = "lineno" > 61< / span >   < span class = "keyword" > namespace < / span > {< / div >
< div class = "line" > < a name = "l00062" > < / a > < span class = "lineno" > 62< / span >   < / div >
< div class = "line" > < a name = "l00063" > < / a > < span class = "lineno" > 63< / span >   < span class = "comment" > // Used by BooleanProblemIsValid() to test that there is no duplicate literals,< / span > < / div >
< div class = "line" > < a name = "l00064" > < / a > < span class = "lineno" > 64< / span >   < span class = "comment" > // that they are all within range and that there is no zero coefficient.< / span > < / div >
< div class = "line" > < a name = "l00065" > < / a > < span class = "lineno" > 65< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00066" > < / a > < span class = "lineno" > 66< / span >   < span class = "comment" > // A non-empty string indicates an error.< / span > < / div >
< div class = "line" > < a name = "l00067" > < / a > < span class = "lineno" > 67< / span >   < span class = "keyword" > template< / span > < < span class = "keyword" > typename< / span > LinearTerms> < / div >
< div class = "line" > < a name = "l00068" > < / a > < span class = "lineno" > 68< / span >   std::string ValidateLinearTerms(< span class = "keyword" > const< / span > LinearTerms& terms,< / div >
< div class = "line" > < a name = "l00069" > < / a > < span class = "lineno" > 69< / span >   std::vector< bool> * variable_seen) {< / div >
< div class = "line" > < a name = "l00070" > < / a > < span class = "lineno" > 70< / span >   < span class = "comment" > // variable_seen already has all items false and is reset before return.< / span > < / div >
< div class = "line" > < a name = "l00071" > < / a > < span class = "lineno" > 71< / span >   std::string err_str;< / div >
< div class = "line" > < a name = "l00072" > < / a > < span class = "lineno" > 72< / span >   < span class = "keywordtype" > int< / span > num_errs = 0;< / div >
< div class = "line" > < a name = "l00073" > < / a > < span class = "lineno" > 73< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > max_num_errs = 100;< / div >
< div class = "line" > < a name = "l00074" > < / a > < span class = "lineno" > 74< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < terms.literals_size(); ++i) {< / div >
< div class = "line" > < a name = "l00075" > < / a > < span class = "lineno" > 75< / span >   < span class = "keywordflow" > if< / span > (terms.literals(i) == 0) {< / div >
< div class = "line" > < a name = "l00076" > < / a > < span class = "lineno" > 76< / span >   < span class = "keywordflow" > if< / span > (++num_errs < = max_num_errs) {< / div >
< div class = "line" > < a name = "l00077" > < / a > < span class = "lineno" > 77< / span >   err_str += absl::StrFormat(< span class = "stringliteral" > " Zero literal at position %d\n" < / span > , i);< / div >
< div class = "line" > < a name = "l00078" > < / a > < span class = "lineno" > 78< / span >   }< / div >
< div class = "line" > < a name = "l00079" > < / a > < span class = "lineno" > 79< / span >   }< / div >
< div class = "line" > < a name = "l00080" > < / a > < span class = "lineno" > 80< / span >   < span class = "keywordflow" > if< / span > (terms.coefficients(i) == 0) {< / div >
< div class = "line" > < a name = "l00081" > < / a > < span class = "lineno" > 81< / span >   < span class = "keywordflow" > if< / span > (++num_errs < = max_num_errs) {< / div >
< div class = "line" > < a name = "l00082" > < / a > < span class = "lineno" > 82< / span >   err_str += absl::StrFormat(< span class = "stringliteral" > " Literal %d has a zero coefficient\n" < / span > ,< / div >
< div class = "line" > < a name = "l00083" > < / a > < span class = "lineno" > 83< / span >   terms.literals(i));< / div >
< div class = "line" > < a name = "l00084" > < / a > < span class = "lineno" > 84< / span >   }< / div >
< div class = "line" > < a name = "l00085" > < / a > < span class = "lineno" > 85< / span >   }< / div >
< div class = "line" > < a name = "l00086" > < / a > < span class = "lineno" > 86< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > = Literal(terms.literals(i)).Variable().value();< / div >
< div class = "line" > < a name = "l00087" > < / a > < span class = "lineno" > 87< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > > = variable_seen-> size()) {< / div >
< div class = "line" > < a name = "l00088" > < / a > < span class = "lineno" > 88< / span >   < span class = "keywordflow" > if< / span > (++num_errs < = max_num_errs) {< / div >
< div class = "line" > < a name = "l00089" > < / a > < span class = "lineno" > 89< / span >   err_str += absl::StrFormat(< span class = "stringliteral" > " Out of bound variable %d\n" < / span > , < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > );< / div >
< div class = "line" > < a name = "l00090" > < / a > < span class = "lineno" > 90< / span >   }< / div >
< div class = "line" > < a name = "l00091" > < / a > < span class = "lineno" > 91< / span >   }< / div >
< div class = "line" > < a name = "l00092" > < / a > < span class = "lineno" > 92< / span >   < span class = "keywordflow" > if< / span > ((*variable_seen)[< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ]) {< / div >
< div class = "line" > < a name = "l00093" > < / a > < span class = "lineno" > 93< / span >   < span class = "keywordflow" > if< / span > (++num_errs < = max_num_errs) {< / div >
< div class = "line" > < a name = "l00094" > < / a > < span class = "lineno" > 94< / span >   err_str += absl::StrFormat(< span class = "stringliteral" > " Duplicated variable %d\n" < / span > , < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > );< / div >
< div class = "line" > < a name = "l00095" > < / a > < span class = "lineno" > 95< / span >   }< / div >
< div class = "line" > < a name = "l00096" > < / a > < span class = "lineno" > 96< / span >   }< / div >
< div class = "line" > < a name = "l00097" > < / a > < span class = "lineno" > 97< / span >   (*variable_seen)[< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ] = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l00098" > < / a > < span class = "lineno" > 98< / span >   }< / div >
< div class = "line" > < a name = "l00099" > < / a > < span class = "lineno" > 99< / span >   < / div >
< div class = "line" > < a name = "l00100" > < / a > < span class = "lineno" > 100< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < terms.literals_size(); ++i) {< / div >
< div class = "line" > < a name = "l00101" > < / a > < span class = "lineno" > 101< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > = Literal(terms.literals(i)).Variable().value();< / div >
< div class = "line" > < a name = "l00102" > < / a > < span class = "lineno" > 102< / span >   (*variable_seen)[< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ] = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l00103" > < / a > < span class = "lineno" > 103< / span >   }< / div >
< div class = "line" > < a name = "l00104" > < / a > < span class = "lineno" > 104< / span >   < span class = "keywordflow" > if< / span > (num_errs) {< / div >
< div class = "line" > < a name = "l00105" > < / a > < span class = "lineno" > 105< / span >   < span class = "keywordflow" > if< / span > (num_errs < = max_num_errs) {< / div >
< div class = "line" > < a name = "l00106" > < / a > < span class = "lineno" > 106< / span >   err_str = absl::StrFormat(< span class = "stringliteral" > " %d validation errors:\n" < / span > , num_errs) + err_str;< / div >
< div class = "line" > < a name = "l00107" > < / a > < span class = "lineno" > 107< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00108" > < / a > < span class = "lineno" > 108< / span >   err_str =< / div >
< div class = "line" > < a name = "l00109" > < / a > < span class = "lineno" > 109< / span >   absl::StrFormat(< span class = "stringliteral" > " %d validation errors; here are the first %d:\n" < / span > ,< / div >
< div class = "line" > < a name = "l00110" > < / a > < span class = "lineno" > 110< / span >   num_errs, max_num_errs) +< / div >
< div class = "line" > < a name = "l00111" > < / a > < span class = "lineno" > 111< / span >   err_str;< / div >
< div class = "line" > < a name = "l00112" > < / a > < span class = "lineno" > 112< / span >   }< / div >
< div class = "line" > < a name = "l00113" > < / a > < span class = "lineno" > 113< / span >   }< / div >
< div class = "line" > < a name = "l00114" > < / a > < span class = "lineno" > 114< / span >   < span class = "keywordflow" > return< / span > err_str;< / div >
< div class = "line" > < a name = "l00115" > < / a > < span class = "lineno" > 115< / span >   }< / div >
< div class = "line" > < a name = "l00116" > < / a > < span class = "lineno" > 116< / span >   < / div >
< div class = "line" > < a name = "l00117" > < / a > < span class = "lineno" > 117< / span >   < span class = "comment" > // Converts a linear expression from the protocol buffer format to a vector< / span > < / div >
< div class = "line" > < a name = "l00118" > < / a > < span class = "lineno" > 118< / span >   < span class = "comment" > // of LiteralWithCoeff.< / span > < / div >
< div class = "line" > < a name = "l00119" > < / a > < span class = "lineno" > 119< / span >   < span class = "keyword" > template< / span > < < span class = "keyword" > typename< / span > ProtoFormat> < / div >
< div class = "line" > < a name = "l00120" > < / a > < span class = "lineno" > 120< / span >   std::vector< LiteralWithCoeff> ConvertLinearExpression(< / div >
< div class = "line" > < a name = "l00121" > < / a > < span class = "lineno" > 121< / span >   < span class = "keyword" > const< / span > ProtoFormat& < a class = "code" href = "parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051" > input< / a > ) {< / div >
< div class = "line" > < a name = "l00122" > < / a > < span class = "lineno" > 122< / span >   std::vector< LiteralWithCoeff> cst;< / div >
< div class = "line" > < a name = "l00123" > < / a > < span class = "lineno" > 123< / span >   cst.reserve(< a class = "code" href = "parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051" > input< / a > .literals_size());< / div >
< div class = "line" > < a name = "l00124" > < / a > < span class = "lineno" > 124< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < < a class = "code" href = "parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051" > input< / a > .literals_size(); ++i) {< / div >
< div class = "line" > < a name = "l00125" > < / a > < span class = "lineno" > 125< / span >   < span class = "keyword" > const< / span > Literal < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > (< a class = "code" href = "parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051" > input< / a > .literals(i));< / div >
< div class = "line" > < a name = "l00126" > < / a > < span class = "lineno" > 126< / span >   cst.push_back(LiteralWithCoeff(< a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > , < a class = "code" href = "parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051" > input< / a > .coefficients(i)));< / div >
< div class = "line" > < a name = "l00127" > < / a > < span class = "lineno" > 127< / span >   }< / div >
< div class = "line" > < a name = "l00128" > < / a > < span class = "lineno" > 128< / span >   < span class = "keywordflow" > return< / span > cst;< / div >
< div class = "line" > < a name = "l00129" > < / a > < span class = "lineno" > 129< / span >   }< / div >
< div class = "line" > < a name = "l00130" > < / a > < span class = "lineno" > 130< / span >   < / div >
< div class = "line" > < a name = "l00131" > < / a > < span class = "lineno" > 131< / span >   } < span class = "comment" > // namespace< / span > < / div >
< div class = "line" > < a name = "l00132" > < / a > < span class = "lineno" > 132< / span >   < / div >
< div class = "line" > < a name = "l00133" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a6004b20c87a172cc7d18754489157868" > 133< / a > < / span >   absl::Status < a class = "code" href = "namespaceoperations__research_1_1sat.html#a6004b20c87a172cc7d18754489157868" > ValidateBooleanProblem< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem) {< / div >
< div class = "line" > < a name = "l00134" > < / a > < span class = "lineno" > 134< / span >   std::vector< bool> variable_seen(problem.num_variables(), < span class = "keyword" > false< / span > );< / div >
< div class = "line" > < a name = "l00135" > < / a > < span class = "lineno" > 135< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < problem.constraints_size(); ++i) {< / div >
< div class = "line" > < a name = "l00136" > < / a > < span class = "lineno" > 136< / span >   < span class = "keyword" > const< / span > LinearBooleanConstraint& constraint = problem.constraints(i);< / div >
< div class = "line" > < a name = "l00137" > < / a > < span class = "lineno" > 137< / span >   < span class = "keyword" > const< / span > std::string error = ValidateLinearTerms(constraint, & variable_seen);< / div >
< div class = "line" > < a name = "l00138" > < / a > < span class = "lineno" > 138< / span >   < span class = "keywordflow" > if< / span > (!error.empty()) {< / div >
< div class = "line" > < a name = "l00139" > < / a > < span class = "lineno" > 139< / span >   < span class = "keywordflow" > return< / span > absl::Status(< / div >
< div class = "line" > < a name = "l00140" > < / a > < span class = "lineno" > 140< / span >   absl::StatusCode::kInvalidArgument,< / div >
< div class = "line" > < a name = "l00141" > < / a > < span class = "lineno" > 141< / span >   absl::StrFormat(< span class = "stringliteral" > " Invalid constraint %i: " < / span > , i) + error);< / div >
< div class = "line" > < a name = "l00142" > < / a > < span class = "lineno" > 142< / span >   }< / div >
< div class = "line" > < a name = "l00143" > < / a > < span class = "lineno" > 143< / span >   }< / div >
< div class = "line" > < a name = "l00144" > < / a > < span class = "lineno" > 144< / span >   < span class = "keyword" > const< / span > std::string error =< / div >
< div class = "line" > < a name = "l00145" > < / a > < span class = "lineno" > 145< / span >   ValidateLinearTerms(problem.objective(), & variable_seen);< / div >
< div class = "line" > < a name = "l00146" > < / a > < span class = "lineno" > 146< / span >   < span class = "keywordflow" > if< / span > (!error.empty()) {< / div >
< div class = "line" > < a name = "l00147" > < / a > < span class = "lineno" > 147< / span >   < span class = "keywordflow" > return< / span > absl::Status(absl::StatusCode::kInvalidArgument,< / div >
< div class = "line" > < a name = "l00148" > < / a > < span class = "lineno" > 148< / span >   absl::StrFormat(< span class = "stringliteral" > " Invalid objective: " < / span > ) + error);< / div >
< div class = "line" > < a name = "l00149" > < / a > < span class = "lineno" > 149< / span >   }< / div >
< div class = "line" > < a name = "l00150" > < / a > < span class = "lineno" > 150< / span >   return ::absl::OkStatus();< / div >
< div class = "line" > < a name = "l00151" > < / a > < span class = "lineno" > 151< / span >   }< / div >
< div class = "line" > < a name = "l00152" > < / a > < span class = "lineno" > 152< / span >   < / div >
< div class = "line" > < a name = "l00153" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#acaccfd2e692c84b7b31c77ac174199cd" > 153< / a > < / span >   CpModelProto < a class = "code" href = "namespaceoperations__research_1_1sat.html#acaccfd2e692c84b7b31c77ac174199cd" > BooleanProblemToCpModelproto< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem) {< / div >
< div class = "line" > < a name = "l00154" > < / a > < span class = "lineno" > 154< / span >   CpModelProto result;< / div >
< div class = "line" > < a name = "l00155" > < / a > < span class = "lineno" > 155< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < problem.num_variables(); ++i) {< / div >
< div class = "line" > < a name = "l00156" > < / a > < span class = "lineno" > 156< / span >   IntegerVariableProto* < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > = result.add_variables();< / div >
< div class = "line" > < a name = "l00157" > < / a > < span class = "lineno" > 157< / span >   < span class = "keywordflow" > if< / span > (problem.var_names_size() > i) {< / div >
< div class = "line" > < a name = "l00158" > < / a > < span class = "lineno" > 158< / span >   < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > -> set_name(problem.var_names(i));< / div >
< div class = "line" > < a name = "l00159" > < / a > < span class = "lineno" > 159< / span >   }< / div >
< div class = "line" > < a name = "l00160" > < / a > < span class = "lineno" > 160< / span >   < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > -> add_domain(0);< / div >
< div class = "line" > < a name = "l00161" > < / a > < span class = "lineno" > 161< / span >   < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > -> add_domain(1);< / div >
< div class = "line" > < a name = "l00162" > < / a > < span class = "lineno" > 162< / span >   }< / div >
< div class = "line" > < a name = "l00163" > < / a > < span class = "lineno" > 163< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > LinearBooleanConstraint& constraint : problem.constraints()) {< / div >
< div class = "line" > < a name = "l00164" > < / a > < span class = "lineno" > 164< / span >   ConstraintProto* < a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > = result.add_constraints();< / div >
< div class = "line" > < a name = "l00165" > < / a > < span class = "lineno" > 165< / span >   < a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > -> set_name(constraint.name());< / div >
< div class = "line" > < a name = "l00166" > < / a > < span class = "lineno" > 166< / span >   LinearConstraintProto* linear = < a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > -> mutable_linear();< / div >
< div class = "line" > < a name = "l00167" > < / a > < span class = "lineno" > 167< / span >   int64_t offset = 0;< / div >
< div class = "line" > < a name = "l00168" > < / a > < span class = "lineno" > 168< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < constraint.literals_size(); ++i) {< / div >
< div class = "line" > < a name = "l00169" > < / a > < span class = "lineno" > 169< / span >   < span class = "comment" > // Note that the new format is slightly different.< / span > < / div >
< div class = "line" > < a name = "l00170" > < / a > < span class = "lineno" > 170< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > lit = constraint.literals(i);< / div >
< div class = "line" > < a name = "l00171" > < / a > < span class = "lineno" > 171< / span >   < span class = "keyword" > const< / span > int64_t coeff = constraint.coefficients(i);< / div >
< div class = "line" > < a name = "l00172" > < / a > < span class = "lineno" > 172< / span >   < span class = "keywordflow" > if< / span > (lit > 0) {< / div >
< div class = "line" > < a name = "l00173" > < / a > < span class = "lineno" > 173< / span >   linear-> add_vars(lit - 1);< / div >
< div class = "line" > < a name = "l00174" > < / a > < span class = "lineno" > 174< / span >   linear-> add_coeffs(coeff);< / div >
< div class = "line" > < a name = "l00175" > < / a > < span class = "lineno" > 175< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00176" > < / a > < span class = "lineno" > 176< / span >   < span class = "comment" > // The term was coeff * (1 - var).< / span > < / div >
< div class = "line" > < a name = "l00177" > < / a > < span class = "lineno" > 177< / span >   linear-> add_vars(-lit - 1);< / div >
< div class = "line" > < a name = "l00178" > < / a > < span class = "lineno" > 178< / span >   linear-> add_coeffs(-coeff);< / div >
< div class = "line" > < a name = "l00179" > < / a > < span class = "lineno" > 179< / span >   offset -= coeff;< / div >
< div class = "line" > < a name = "l00180" > < / a > < span class = "lineno" > 180< / span >   }< / div >
< div class = "line" > < a name = "l00181" > < / a > < span class = "lineno" > 181< / span >   }< / div >
< div class = "line" > < a name = "l00182" > < / a > < span class = "lineno" > 182< / span >   linear-> add_domain(constraint.has_lower_bound()< / div >
< div class = "line" > < a name = "l00183" > < / a > < span class = "lineno" > 183< / span >   ? constraint.lower_bound() + offset< / div >
< div class = "line" > < a name = "l00184" > < / a > < span class = "lineno" > 184< / span >   : < a class = "code" href = "alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045" > std::numeric_limits< int32_t> ::min< / a > () + offset);< / div >
< div class = "line" > < a name = "l00185" > < / a > < span class = "lineno" > 185< / span >   linear-> add_domain(constraint.has_upper_bound()< / div >
< div class = "line" > < a name = "l00186" > < / a > < span class = "lineno" > 186< / span >   ? constraint.upper_bound() + offset< / div >
< div class = "line" > < a name = "l00187" > < / a > < span class = "lineno" > 187< / span >   : < a class = "code" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > std::numeric_limits< int32_t> ::max< / a > () + offset);< / div >
< div class = "line" > < a name = "l00188" > < / a > < span class = "lineno" > 188< / span >   }< / div >
< div class = "line" > < a name = "l00189" > < / a > < span class = "lineno" > 189< / span >   < span class = "keywordflow" > if< / span > (problem.has_objective()) {< / div >
< div class = "line" > < a name = "l00190" > < / a > < span class = "lineno" > 190< / span >   CpObjectiveProto* objective = result.mutable_objective();< / div >
< div class = "line" > < a name = "l00191" > < / a > < span class = "lineno" > 191< / span >   int64_t offset = 0;< / div >
< div class = "line" > < a name = "l00192" > < / a > < span class = "lineno" > 192< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < problem.objective().literals_size(); ++i) {< / div >
< div class = "line" > < a name = "l00193" > < / a > < span class = "lineno" > 193< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > lit = problem.objective().literals(i);< / div >
< div class = "line" > < a name = "l00194" > < / a > < span class = "lineno" > 194< / span >   < span class = "keyword" > const< / span > int64_t coeff = problem.objective().coefficients(i);< / div >
< div class = "line" > < a name = "l00195" > < / a > < span class = "lineno" > 195< / span >   < span class = "keywordflow" > if< / span > (lit > 0) {< / div >
< div class = "line" > < a name = "l00196" > < / a > < span class = "lineno" > 196< / span >   objective-> add_vars(lit - 1);< / div >
< div class = "line" > < a name = "l00197" > < / a > < span class = "lineno" > 197< / span >   objective-> add_coeffs(coeff);< / div >
< div class = "line" > < a name = "l00198" > < / a > < span class = "lineno" > 198< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00199" > < / a > < span class = "lineno" > 199< / span >   objective-> add_vars(-lit - 1);< / div >
< div class = "line" > < a name = "l00200" > < / a > < span class = "lineno" > 200< / span >   objective-> add_coeffs(-coeff);< / div >
< div class = "line" > < a name = "l00201" > < / a > < span class = "lineno" > 201< / span >   offset -= coeff;< / div >
< div class = "line" > < a name = "l00202" > < / a > < span class = "lineno" > 202< / span >   }< / div >
< div class = "line" > < a name = "l00203" > < / a > < span class = "lineno" > 203< / span >   }< / div >
< div class = "line" > < a name = "l00204" > < / a > < span class = "lineno" > 204< / span >   objective-> set_offset(offset + problem.objective().offset());< / div >
< div class = "line" > < a name = "l00205" > < / a > < span class = "lineno" > 205< / span >   objective-> set_scaling_factor(problem.objective().scaling_factor());< / div >
< div class = "line" > < a name = "l00206" > < / a > < span class = "lineno" > 206< / span >   }< / div >
< div class = "line" > < a name = "l00207" > < / a > < span class = "lineno" > 207< / span >   < span class = "keywordflow" > return< / span > result;< / div >
< div class = "line" > < a name = "l00208" > < / a > < span class = "lineno" > 208< / span >   }< / div >
< div class = "line" > < a name = "l00209" > < / a > < span class = "lineno" > 209< / span >   < / div >
< div class = "line" > < a name = "l00210" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#aaf57d784624873d840a2589efa6ff1a1" > 210< / a > < / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#aaf57d784624873d840a2589efa6ff1a1" > ChangeOptimizationDirection< / a > (LinearBooleanProblem* problem) {< / div >
< div class = "line" > < a name = "l00211" > < / a > < span class = "lineno" > 211< / span >   LinearObjective* objective = problem-> mutable_objective();< / div >
< div class = "line" > < a name = "l00212" > < / a > < span class = "lineno" > 212< / span >   objective-> set_scaling_factor(-objective-> scaling_factor());< / div >
< div class = "line" > < a name = "l00213" > < / a > < span class = "lineno" > 213< / span >   objective-> set_offset(-objective-> offset());< / div >
< div class = "line" > < a name = "l00214" > < / a > < span class = "lineno" > 214< / span >   < span class = "comment" > // We need ' auto' here to keep the open-source compilation happy< / span > < / div >
< div class = "line" > < a name = "l00215" > < / a > < span class = "lineno" > 215< / span >   < span class = "comment" > // (it uses the public protobuf release).< / span > < / div >
< div class = "line" > < a name = "l00216" > < / a > < span class = "lineno" > 216< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > auto< / span > & coefficients_ref : *objective-> mutable_coefficients()) {< / div >
< div class = "line" > < a name = "l00217" > < / a > < span class = "lineno" > 217< / span >   coefficients_ref = -coefficients_ref;< / div >
< div class = "line" > < a name = "l00218" > < / a > < span class = "lineno" > 218< / span >   }< / div >
< div class = "line" > < a name = "l00219" > < / a > < span class = "lineno" > 219< / span >   }< / div >
< div class = "line" > < a name = "l00220" > < / a > < span class = "lineno" > 220< / span >   < / div >
< div class = "line" > < a name = "l00221" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#add13e122d8861d6cac9b9bb4a51cfcb7" > 221< / a > < / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#add13e122d8861d6cac9b9bb4a51cfcb7" > LoadBooleanProblem< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00222" > < / a > < span class = "lineno" > 222< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * solver) {< / div >
< div class = "line" > < a name = "l00223" > < / a > < span class = "lineno" > 223< / span >   < span class = "comment" > // TODO(user): Currently, the sat solver can load without any issue< / span > < / div >
< div class = "line" > < a name = "l00224" > < / a > < span class = "lineno" > 224< / span >   < span class = "comment" > // constraints with duplicate variables, so we just output a warning if the< / span > < / div >
< div class = "line" > < a name = "l00225" > < / a > < span class = "lineno" > 225< / span >   < span class = "comment" > // problem is not " valid" . Make this a strong check once we have some< / span > < / div >
< div class = "line" > < a name = "l00226" > < / a > < span class = "lineno" > 226< / span >   < span class = "comment" > // preprocessing step to remove duplicates variable in the constraints.< / span > < / div >
< div class = "line" > < a name = "l00227" > < / a > < span class = "lineno" > 227< / span >   < span class = "keyword" > const< / span > absl::Status status = < a class = "code" href = "namespaceoperations__research_1_1sat.html#a6004b20c87a172cc7d18754489157868" > ValidateBooleanProblem< / a > (problem);< / div >
< div class = "line" > < a name = "l00228" > < / a > < span class = "lineno" > 228< / span >   < span class = "keywordflow" > if< / span > (!status.ok()) {< / div >
< div class = "line" > < a name = "l00229" > < / a > < span class = "lineno" > 229< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7" > WARNING< / a > ) < < < span class = "stringliteral" > " The given problem is invalid!" < / span > ;< / div >
< div class = "line" > < a name = "l00230" > < / a > < span class = "lineno" > 230< / span >   }< / div >
< div class = "line" > < a name = "l00231" > < / a > < span class = "lineno" > 231< / span >   < / div >
< div class = "line" > < a name = "l00232" > < / a > < span class = "lineno" > 232< / span >   < span class = "keywordflow" > if< / span > (solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9" > parameters< / a > ().log_search_progress()) {< / div >
< div class = "line" > < a name = "l00233" > < / a > < span class = "lineno" > 233< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > ) < < < span class = "stringliteral" > " Loading problem ' " < / span > < < problem.name() < < < span class = "stringliteral" > " ' , " < / span > < / div >
< div class = "line" > < a name = "l00234" > < / a > < span class = "lineno" > 234< / span >   < < problem.num_variables() < < < span class = "stringliteral" > " variables, " < / span > < / div >
< div class = "line" > < a name = "l00235" > < / a > < span class = "lineno" > 235< / span >   < < problem.constraints_size() < < < span class = "stringliteral" > " constraints." < / span > ;< / div >
< div class = "line" > < a name = "l00236" > < / a > < span class = "lineno" > 236< / span >   }< / div >
< div class = "line" > < a name = "l00237" > < / a > < span class = "lineno" > 237< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb" > SetNumVariables< / a > (problem.num_variables());< / div >
< div class = "line" > < a name = "l00238" > < / a > < span class = "lineno" > 238< / span >   std::vector< LiteralWithCoeff> cst;< / div >
< div class = "line" > < a name = "l00239" > < / a > < span class = "lineno" > 239< / span >   int64_t num_terms = 0;< / div >
< div class = "line" > < a name = "l00240" > < / a > < span class = "lineno" > 240< / span >   < span class = "keywordtype" > int< / span > num_constraints = 0;< / div >
< div class = "line" > < a name = "l00241" > < / a > < span class = "lineno" > 241< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > LinearBooleanConstraint& constraint : problem.constraints()) {< / div >
< div class = "line" > < a name = "l00242" > < / a > < span class = "lineno" > 242< / span >   num_terms += constraint.literals_size();< / div >
< div class = "line" > < a name = "l00243" > < / a > < span class = "lineno" > 243< / span >   cst = ConvertLinearExpression(constraint);< / div >
< div class = "line" > < a name = "l00244" > < / a > < span class = "lineno" > 244< / span >   < span class = "keywordflow" > if< / span > (!solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653" > AddLinearConstraint< / a > (< / div >
< div class = "line" > < a name = "l00245" > < / a > < span class = "lineno" > 245< / span >   constraint.has_lower_bound(), Coefficient(constraint.lower_bound()),< / div >
< div class = "line" > < a name = "l00246" > < / a > < span class = "lineno" > 246< / span >   constraint.has_upper_bound(), Coefficient(constraint.upper_bound()),< / div >
< div class = "line" > < a name = "l00247" > < / a > < span class = "lineno" > 247< / span >   & cst)) {< / div >
< div class = "line" > < a name = "l00248" > < / a > < span class = "lineno" > 248< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > ) < < < span class = "stringliteral" > " Problem detected to be UNSAT when " < / span > < / div >
< div class = "line" > < a name = "l00249" > < / a > < span class = "lineno" > 249< / span >   < < < span class = "stringliteral" > " adding the constraint #" < / span > < < num_constraints< / div >
< div class = "line" > < a name = "l00250" > < / a > < span class = "lineno" > 250< / span >   < < < span class = "stringliteral" > " with name ' " < / span > < < constraint.name() < < < span class = "stringliteral" > " ' " < / span > ;< / div >
< div class = "line" > < a name = "l00251" > < / a > < span class = "lineno" > 251< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l00252" > < / a > < span class = "lineno" > 252< / span >   }< / div >
< div class = "line" > < a name = "l00253" > < / a > < span class = "lineno" > 253< / span >   ++num_constraints;< / div >
< div class = "line" > < a name = "l00254" > < / a > < span class = "lineno" > 254< / span >   }< / div >
< div class = "line" > < a name = "l00255" > < / a > < span class = "lineno" > 255< / span >   < span class = "keywordflow" > if< / span > (solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9" > parameters< / a > ().log_search_progress()) {< / div >
< div class = "line" > < a name = "l00256" > < / a > < span class = "lineno" > 256< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > ) < < < span class = "stringliteral" > " The problem contains " < / span > < < num_terms < < < span class = "stringliteral" > " terms." < / span > ;< / div >
< div class = "line" > < a name = "l00257" > < / a > < span class = "lineno" > 257< / span >   }< / div >
< div class = "line" > < a name = "l00258" > < / a > < span class = "lineno" > 258< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l00259" > < / a > < span class = "lineno" > 259< / span >   }< / div >
< div class = "line" > < a name = "l00260" > < / a > < span class = "lineno" > 260< / span >   < / div >
< div class = "line" > < a name = "l00261" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#aa72e6dc6e802fbf5c5fd237efea1131f" > 261< / a > < / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#aa72e6dc6e802fbf5c5fd237efea1131f" > LoadAndConsumeBooleanProblem< / a > (LinearBooleanProblem* problem,< / div >
< div class = "line" > < a name = "l00262" > < / a > < span class = "lineno" > 262< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * solver) {< / div >
< div class = "line" > < a name = "l00263" > < / a > < span class = "lineno" > 263< / span >   < span class = "keyword" > const< / span > absl::Status status = < a class = "code" href = "namespaceoperations__research_1_1sat.html#a6004b20c87a172cc7d18754489157868" > ValidateBooleanProblem< / a > (*problem);< / div >
< div class = "line" > < a name = "l00264" > < / a > < span class = "lineno" > 264< / span >   < span class = "keywordflow" > if< / span > (!status.ok()) {< / div >
< div class = "line" > < a name = "l00265" > < / a > < span class = "lineno" > 265< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7" > WARNING< / a > ) < < < span class = "stringliteral" > " The given problem is invalid! " < / span > < < status.message();< / div >
< div class = "line" > < a name = "l00266" > < / a > < span class = "lineno" > 266< / span >   }< / div >
< div class = "line" > < a name = "l00267" > < / a > < span class = "lineno" > 267< / span >   < span class = "keywordflow" > if< / span > (solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9" > parameters< / a > ().log_search_progress()) {< / div >
< div class = "line" > < a name = "l00268" > < / a > < span class = "lineno" > 268< / span >   < span class = "preprocessor" > #if !defined(__PORTABLE_PLATFORM__)< / span > < / div >
< div class = "line" > < a name = "l00269" > < / a > < span class = "lineno" > 269< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > ) < < < span class = "stringliteral" > " LinearBooleanProblem memory: " < / span > < < problem-> SpaceUsedLong();< / div >
< div class = "line" > < a name = "l00270" > < / a > < span class = "lineno" > 270< / span >   < span class = "preprocessor" > #endif< / span > < / div >
< div class = "line" > < a name = "l00271" > < / a > < span class = "lineno" > 271< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > ) < < < span class = "stringliteral" > " Loading problem ' " < / span > < < problem-> name() < < < span class = "stringliteral" > " ' , " < / span > < / div >
< div class = "line" > < a name = "l00272" > < / a > < span class = "lineno" > 272< / span >   < < problem-> num_variables() < < < span class = "stringliteral" > " variables, " < / span > < / div >
< div class = "line" > < a name = "l00273" > < / a > < span class = "lineno" > 273< / span >   < < problem-> constraints_size() < < < span class = "stringliteral" > " constraints." < / span > ;< / div >
< div class = "line" > < a name = "l00274" > < / a > < span class = "lineno" > 274< / span >   }< / div >
< div class = "line" > < a name = "l00275" > < / a > < span class = "lineno" > 275< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb" > SetNumVariables< / a > (problem-> num_variables());< / div >
< div class = "line" > < a name = "l00276" > < / a > < span class = "lineno" > 276< / span >   std::vector< LiteralWithCoeff> cst;< / div >
< div class = "line" > < a name = "l00277" > < / a > < span class = "lineno" > 277< / span >   int64_t num_terms = 0;< / div >
< div class = "line" > < a name = "l00278" > < / a > < span class = "lineno" > 278< / span >   < span class = "keywordtype" > int< / span > num_constraints = 0;< / div >
< div class = "line" > < a name = "l00279" > < / a > < span class = "lineno" > 279< / span >   < / div >
< div class = "line" > < a name = "l00280" > < / a > < span class = "lineno" > 280< / span >   < span class = "comment" > // We will process the constraints backward so we can free the memory used by< / span > < / div >
< div class = "line" > < a name = "l00281" > < / a > < span class = "lineno" > 281< / span >   < span class = "comment" > // each constraint just after processing it. Because of that, we initially< / span > < / div >
< div class = "line" > < a name = "l00282" > < / a > < span class = "lineno" > 282< / span >   < span class = "comment" > // reverse all the constraints to add them in the same order.< / span > < / div >
< div class = "line" > < a name = "l00283" > < / a > < span class = "lineno" > 283< / span >   std::reverse(problem-> mutable_constraints()-> begin(),< / div >
< div class = "line" > < a name = "l00284" > < / a > < span class = "lineno" > 284< / span >   problem-> mutable_constraints()-> end());< / div >
< div class = "line" > < a name = "l00285" > < / a > < span class = "lineno" > 285< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = problem-> constraints_size() - 1; i > = 0; --i) {< / div >
< div class = "line" > < a name = "l00286" > < / a > < span class = "lineno" > 286< / span >   < span class = "keyword" > const< / span > LinearBooleanConstraint& constraint = problem-> constraints(i);< / div >
< div class = "line" > < a name = "l00287" > < / a > < span class = "lineno" > 287< / span >   num_terms += constraint.literals_size();< / div >
< div class = "line" > < a name = "l00288" > < / a > < span class = "lineno" > 288< / span >   cst = ConvertLinearExpression(constraint);< / div >
< div class = "line" > < a name = "l00289" > < / a > < span class = "lineno" > 289< / span >   < span class = "keywordflow" > if< / span > (!solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653" > AddLinearConstraint< / a > (< / div >
< div class = "line" > < a name = "l00290" > < / a > < span class = "lineno" > 290< / span >   constraint.has_lower_bound(), Coefficient(constraint.lower_bound()),< / div >
< div class = "line" > < a name = "l00291" > < / a > < span class = "lineno" > 291< / span >   constraint.has_upper_bound(), Coefficient(constraint.upper_bound()),< / div >
< div class = "line" > < a name = "l00292" > < / a > < span class = "lineno" > 292< / span >   & cst)) {< / div >
< div class = "line" > < a name = "l00293" > < / a > < span class = "lineno" > 293< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > ) < < < span class = "stringliteral" > " Problem detected to be UNSAT when " < / span > < / div >
< div class = "line" > < a name = "l00294" > < / a > < span class = "lineno" > 294< / span >   < < < span class = "stringliteral" > " adding the constraint #" < / span > < < num_constraints< / div >
< div class = "line" > < a name = "l00295" > < / a > < span class = "lineno" > 295< / span >   < < < span class = "stringliteral" > " with name ' " < / span > < < constraint.name() < < < span class = "stringliteral" > " ' " < / span > ;< / div >
< div class = "line" > < a name = "l00296" > < / a > < span class = "lineno" > 296< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l00297" > < / a > < span class = "lineno" > 297< / span >   }< / div >
< div class = "line" > < a name = "l00298" > < / a > < span class = "lineno" > 298< / span >   < span class = "keyword" > delete< / span > problem-> mutable_constraints()-> ReleaseLast();< / div >
< div class = "line" > < a name = "l00299" > < / a > < span class = "lineno" > 299< / span >   ++num_constraints;< / div >
< div class = "line" > < a name = "l00300" > < / a > < span class = "lineno" > 300< / span >   }< / div >
< div class = "line" > < a name = "l00301" > < / a > < span class = "lineno" > 301< / span >   LinearBooleanProblem empty_problem;< / div >
< div class = "line" > < a name = "l00302" > < / a > < span class = "lineno" > 302< / span >   problem-> mutable_constraints()-> Swap(empty_problem.mutable_constraints());< / div >
< div class = "line" > < a name = "l00303" > < / a > < span class = "lineno" > 303< / span >   < span class = "keywordflow" > if< / span > (solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9" > parameters< / a > ().log_search_progress()) {< / div >
< div class = "line" > < a name = "l00304" > < / a > < span class = "lineno" > 304< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > ) < < < span class = "stringliteral" > " The problem contains " < / span > < < num_terms < < < span class = "stringliteral" > " terms." < / span > ;< / div >
< div class = "line" > < a name = "l00305" > < / a > < span class = "lineno" > 305< / span >   }< / div >
< div class = "line" > < a name = "l00306" > < / a > < span class = "lineno" > 306< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l00307" > < / a > < span class = "lineno" > 307< / span >   }< / div >
< div class = "line" > < a name = "l00308" > < / a > < span class = "lineno" > 308< / span >   < / div >
< div class = "line" > < a name = "l00309" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a40254eb00d4590a09d811fe94c727c2a" > 309< / a > < / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a40254eb00d4590a09d811fe94c727c2a" > UseObjectiveForSatAssignmentPreference< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00310" > < / a > < span class = "lineno" > 310< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * solver) {< / div >
< div class = "line" > < a name = "l00311" > < / a > < span class = "lineno" > 311< / span >   < span class = "keyword" > const< / span > LinearObjective& objective = problem.objective();< / div >
< div class = "line" > < a name = "l00312" > < / a > < span class = "lineno" > 312< / span >   < a class = "code" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (objective.literals_size(), objective.coefficients_size());< / div >
< div class = "line" > < a name = "l00313" > < / a > < span class = "lineno" > 313< / span >   int64_t max_abs_weight = 0;< / div >
< div class = "line" > < a name = "l00314" > < / a > < span class = "lineno" > 314< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > int64_t < a class = "code" href = "routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba" > coefficient< / a > : objective.coefficients()) {< / div >
< div class = "line" > < a name = "l00315" > < / a > < span class = "lineno" > 315< / span >   max_abs_weight = < a class = "code" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > std::max< / a > (max_abs_weight, std::abs(< a class = "code" href = "routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba" > coefficient< / a > ));< / div >
< div class = "line" > < a name = "l00316" > < / a > < span class = "lineno" > 316< / span >   }< / div >
< div class = "line" > < a name = "l00317" > < / a > < span class = "lineno" > 317< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > double< / span > max_abs_weight_double = max_abs_weight;< / div >
< div class = "line" > < a name = "l00318" > < / a > < span class = "lineno" > 318< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < objective.literals_size(); ++i) {< / div >
< div class = "line" > < a name = "l00319" > < / a > < span class = "lineno" > 319< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > (objective.literals(i));< / div >
< div class = "line" > < a name = "l00320" > < / a > < span class = "lineno" > 320< / span >   < span class = "keyword" > const< / span > int64_t < a class = "code" href = "routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba" > coefficient< / a > = objective.coefficients(i);< / div >
< div class = "line" > < a name = "l00321" > < / a > < span class = "lineno" > 321< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > double< / span > abs_weight = std::abs(< a class = "code" href = "routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba" > coefficient< / a > ) / max_abs_weight_double;< / div >
< div class = "line" > < a name = "l00322" > < / a > < span class = "lineno" > 322< / span >   < span class = "comment" > // Because this is a minimization problem, we prefer to assign a Boolean< / span > < / div >
< div class = "line" > < a name = "l00323" > < / a > < span class = "lineno" > 323< / span >   < span class = "comment" > // variable to its " low" objective value. So if a literal has a positive< / span > < / div >
< div class = "line" > < a name = "l00324" > < / a > < span class = "lineno" > 324< / span >   < span class = "comment" > // weight when true, we want to set it to false.< / span > < / div >
< div class = "line" > < a name = "l00325" > < / a > < span class = "lineno" > 325< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a955786dcbe82b7c4dc9924a5473ac1e8" > SetAssignmentPreference< / a > (< / div >
< div class = "line" > < a name = "l00326" > < / a > < span class = "lineno" > 326< / span >   < a class = "code" href = "routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba" > coefficient< / a > > 0 ? < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > .< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644" > Negated< / a > () : < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > , abs_weight);< / div >
< div class = "line" > < a name = "l00327" > < / a > < span class = "lineno" > 327< / span >   }< / div >
< div class = "line" > < a name = "l00328" > < / a > < span class = "lineno" > 328< / span >   }< / div >
< div class = "line" > < a name = "l00329" > < / a > < span class = "lineno" > 329< / span >   < / div >
< div class = "line" > < a name = "l00330" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a66979ace60178ae3fe59f6180e4db42f" > 330< / a > < / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a66979ace60178ae3fe59f6180e4db42f" > AddObjectiveUpperBound< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00331" > < / a > < span class = "lineno" > 331< / span >   Coefficient < a class = "code" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > , < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * solver) {< / div >
< div class = "line" > < a name = "l00332" > < / a > < span class = "lineno" > 332< / span >   std::vector< LiteralWithCoeff> cst =< / div >
< div class = "line" > < a name = "l00333" > < / a > < span class = "lineno" > 333< / span >   ConvertLinearExpression(problem.objective());< / div >
< div class = "line" > < a name = "l00334" > < / a > < span class = "lineno" > 334< / span >   < span class = "keywordflow" > return< / span > solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653" > AddLinearConstraint< / a > (< span class = "keyword" > false< / span > , Coefficient(0), < span class = "keyword" > true< / span > , < a class = "code" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ,< / div >
< div class = "line" > < a name = "l00335" > < / a > < span class = "lineno" > 335< / span >   & cst);< / div >
< div class = "line" > < a name = "l00336" > < / a > < span class = "lineno" > 336< / span >   }< / div >
< div class = "line" > < a name = "l00337" > < / a > < span class = "lineno" > 337< / span >   < / div >
< div class = "line" > < a name = "l00338" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a07c4372fa55782d13edd24b86130e3ba" > 338< / a > < / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a07c4372fa55782d13edd24b86130e3ba" > AddObjectiveConstraint< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00339" > < / a > < span class = "lineno" > 339< / span >   < span class = "keywordtype" > bool< / span > use_lower_bound, Coefficient < a class = "code" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > ,< / div >
< div class = "line" > < a name = "l00340" > < / a > < span class = "lineno" > 340< / span >   < span class = "keywordtype" > bool< / span > use_upper_bound, Coefficient < a class = "code" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ,< / div >
< div class = "line" > < a name = "l00341" > < / a > < span class = "lineno" > 341< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * solver) {< / div >
< div class = "line" > < a name = "l00342" > < / a > < span class = "lineno" > 342< / span >   std::vector< LiteralWithCoeff> cst =< / div >
< div class = "line" > < a name = "l00343" > < / a > < span class = "lineno" > 343< / span >   ConvertLinearExpression(problem.objective());< / div >
< div class = "line" > < a name = "l00344" > < / a > < span class = "lineno" > 344< / span >   < span class = "keywordflow" > return< / span > solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653" > AddLinearConstraint< / a > (use_lower_bound, < a class = "code" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > ,< / div >
< div class = "line" > < a name = "l00345" > < / a > < span class = "lineno" > 345< / span >   use_upper_bound, < a class = "code" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > , & cst);< / div >
< div class = "line" > < a name = "l00346" > < / a > < span class = "lineno" > 346< / span >   }< / div >
< div class = "line" > < a name = "l00347" > < / a > < span class = "lineno" > 347< / span >   < / div >
< div class = "line" > < a name = "l00348" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f" > 348< / a > < / span >   Coefficient < a class = "code" href = "namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f" > ComputeObjectiveValue< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00349" > < / a > < span class = "lineno" > 349< / span >   < span class = "keyword" > const< / span > std::vector< bool> & assignment) {< / div >
< div class = "line" > < a name = "l00350" > < / a > < span class = "lineno" > 350< / span >   < a class = "code" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (assignment.size(), problem.num_variables());< / div >
< div class = "line" > < a name = "l00351" > < / a > < span class = "lineno" > 351< / span >   Coefficient sum(0);< / div >
< div class = "line" > < a name = "l00352" > < / a > < span class = "lineno" > 352< / span >   < span class = "keyword" > const< / span > LinearObjective& objective = problem.objective();< / div >
< div class = "line" > < a name = "l00353" > < / a > < span class = "lineno" > 353< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < objective.literals_size(); ++i) {< / div >
< div class = "line" > < a name = "l00354" > < / a > < span class = "lineno" > 354< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > (objective.literals(i));< / div >
< div class = "line" > < a name = "l00355" > < / a > < span class = "lineno" > 355< / span >   < span class = "keywordflow" > if< / span > (assignment[< a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > .< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8" > Variable< / a > ().value()] == < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > .< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#ab76ca9049d6f3f1948d7120a98765107" > IsPositive< / a > ()) {< / div >
< div class = "line" > < a name = "l00356" > < / a > < span class = "lineno" > 356< / span >   sum += objective.coefficients(i);< / div >
< div class = "line" > < a name = "l00357" > < / a > < span class = "lineno" > 357< / span >   }< / div >
< div class = "line" > < a name = "l00358" > < / a > < span class = "lineno" > 358< / span >   }< / div >
< div class = "line" > < a name = "l00359" > < / a > < span class = "lineno" > 359< / span >   < span class = "keywordflow" > return< / span > sum;< / div >
< div class = "line" > < a name = "l00360" > < / a > < span class = "lineno" > 360< / span >   }< / div >
< div class = "line" > < a name = "l00361" > < / a > < span class = "lineno" > 361< / span >   < / div >
< div class = "line" > < a name = "l00362" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1" > 362< / a > < / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1" > IsAssignmentValid< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00363" > < / a > < span class = "lineno" > 363< / span >   < span class = "keyword" > const< / span > std::vector< bool> & assignment) {< / div >
< div class = "line" > < a name = "l00364" > < / a > < span class = "lineno" > 364< / span >   < a class = "code" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (assignment.size(), problem.num_variables());< / div >
< div class = "line" > < a name = "l00365" > < / a > < span class = "lineno" > 365< / span >   < / div >
< div class = "line" > < a name = "l00366" > < / a > < span class = "lineno" > 366< / span >   < span class = "comment" > // Check that all constraints are satisfied.< / span > < / div >
< div class = "line" > < a name = "l00367" > < / a > < span class = "lineno" > 367< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > LinearBooleanConstraint& constraint : problem.constraints()) {< / div >
< div class = "line" > < a name = "l00368" > < / a > < span class = "lineno" > 368< / span >   Coefficient sum(0);< / div >
< div class = "line" > < a name = "l00369" > < / a > < span class = "lineno" > 369< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < constraint.literals_size(); ++i) {< / div >
< div class = "line" > < a name = "l00370" > < / a > < span class = "lineno" > 370< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > (constraint.literals(i));< / div >
< div class = "line" > < a name = "l00371" > < / a > < span class = "lineno" > 371< / span >   < span class = "keywordflow" > if< / span > (assignment[< a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > .< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8" > Variable< / a > ().value()] == < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > .< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#ab76ca9049d6f3f1948d7120a98765107" > IsPositive< / a > ()) {< / div >
< div class = "line" > < a name = "l00372" > < / a > < span class = "lineno" > 372< / span >   sum += constraint.coefficients(i);< / div >
< div class = "line" > < a name = "l00373" > < / a > < span class = "lineno" > 373< / span >   }< / div >
< div class = "line" > < a name = "l00374" > < / a > < span class = "lineno" > 374< / span >   }< / div >
< div class = "line" > < a name = "l00375" > < / a > < span class = "lineno" > 375< / span >   < span class = "keywordflow" > if< / span > (constraint.has_lower_bound() & & sum < constraint.lower_bound()) {< / div >
< div class = "line" > < a name = "l00376" > < / a > < span class = "lineno" > 376< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7" > WARNING< / a > ) < < < span class = "stringliteral" > " Unsatisfied constraint! sum: " < / span > < < sum < < < span class = "stringliteral" > " \n" < / span > < / div >
< div class = "line" > < a name = "l00377" > < / a > < span class = "lineno" > 377< / span >   < < < a class = "code" href = "namespaceoperations__research.html#aba32b1f1ee3ffb4194aa8af155f827cd" > ProtobufDebugString< / a > (constraint);< / div >
< div class = "line" > < a name = "l00378" > < / a > < span class = "lineno" > 378< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l00379" > < / a > < span class = "lineno" > 379< / span >   }< / div >
< div class = "line" > < a name = "l00380" > < / a > < span class = "lineno" > 380< / span >   < span class = "keywordflow" > if< / span > (constraint.has_upper_bound() & & sum > constraint.upper_bound()) {< / div >
< div class = "line" > < a name = "l00381" > < / a > < span class = "lineno" > 381< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7" > WARNING< / a > ) < < < span class = "stringliteral" > " Unsatisfied constraint! sum: " < / span > < < sum < < < span class = "stringliteral" > " \n" < / span > < / div >
< div class = "line" > < a name = "l00382" > < / a > < span class = "lineno" > 382< / span >   < < < a class = "code" href = "namespaceoperations__research.html#aba32b1f1ee3ffb4194aa8af155f827cd" > ProtobufDebugString< / a > (constraint);< / div >
< div class = "line" > < a name = "l00383" > < / a > < span class = "lineno" > 383< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l00384" > < / a > < span class = "lineno" > 384< / span >   }< / div >
< div class = "line" > < a name = "l00385" > < / a > < span class = "lineno" > 385< / span >   }< / div >
< div class = "line" > < a name = "l00386" > < / a > < span class = "lineno" > 386< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l00387" > < / a > < span class = "lineno" > 387< / span >   }< / div >
< div class = "line" > < a name = "l00388" > < / a > < span class = "lineno" > 388< / span >   < / div >
< div class = "line" > < a name = "l00389" > < / a > < span class = "lineno" > 389< / span >   < span class = "comment" > // Note(user): This function makes a few assumptions about the format of the< / span > < / div >
< div class = "line" > < a name = "l00390" > < / a > < span class = "lineno" > 390< / span >   < span class = "comment" > // given LinearBooleanProblem. All constraint coefficients must be 1 (and of the< / span > < / div >
< div class = "line" > < a name = "l00391" > < / a > < span class = "lineno" > 391< / span >   < span class = "comment" > // form > = 1) and all objective weights must be strictly positive.< / span > < / div >
< div class = "line" > < a name = "l00392" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#ae701a64603e2ac22a99d6c0dd0649845" > 392< / a > < / span >   std::string < a class = "code" href = "namespaceoperations__research_1_1sat.html#ae701a64603e2ac22a99d6c0dd0649845" > LinearBooleanProblemToCnfString< / a > (< / div >
< div class = "line" > < a name = "l00393" > < / a > < span class = "lineno" > 393< / span >   < span class = "keyword" > const< / span > LinearBooleanProblem& problem) {< / div >
< div class = "line" > < a name = "l00394" > < / a > < span class = "lineno" > 394< / span >   std::string output;< / div >
< div class = "line" > < a name = "l00395" > < / a > < span class = "lineno" > 395< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > bool< / span > is_wcnf = (problem.objective().coefficients_size() > 0);< / div >
< div class = "line" > < a name = "l00396" > < / a > < span class = "lineno" > 396< / span >   < span class = "keyword" > const< / span > LinearObjective& objective = problem.objective();< / div >
< div class = "line" > < a name = "l00397" > < / a > < span class = "lineno" > 397< / span >   < / div >
< div class = "line" > < a name = "l00398" > < / a > < span class = "lineno" > 398< / span >   < span class = "comment" > // Hack: We know that all the variables with index greater than this have been< / span > < / div >
< div class = "line" > < a name = "l00399" > < / a > < span class = "lineno" > 399< / span >   < span class = "comment" > // created " artificially" in order to encode a max-sat problem into our< / span > < / div >
< div class = "line" > < a name = "l00400" > < / a > < span class = "lineno" > 400< / span >   < span class = "comment" > // format. Each extra variable appear only once, and was used as a slack to< / span > < / div >
< div class = "line" > < a name = "l00401" > < / a > < span class = "lineno" > 401< / span >   < span class = "comment" > // reify a soft clause.< / span > < / div >
< div class = "line" > < a name = "l00402" > < / a > < span class = "lineno" > 402< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > first_slack_variable = problem.original_num_variables();< / div >
< div class = "line" > < a name = "l00403" > < / a > < span class = "lineno" > 403< / span >   < / div >
< div class = "line" > < a name = "l00404" > < / a > < span class = "lineno" > 404< / span >   < span class = "comment" > // This will contains the objective.< / span > < / div >
< div class = "line" > < a name = "l00405" > < / a > < span class = "lineno" > 405< / span >   absl::flat_hash_map< int, int64_t> literal_to_weight;< / div >
< div class = "line" > < a name = "l00406" > < / a > < span class = "lineno" > 406< / span >   std::vector< std::pair< int, int64_t> > non_slack_objective;< / div >
< div class = "line" > < a name = "l00407" > < / a > < span class = "lineno" > 407< / span >   < / div >
< div class = "line" > < a name = "l00408" > < / a > < span class = "lineno" > 408< / span >   < span class = "comment" > // This will be the weight of the " hard" clauses in the wcnf format. It must< / span > < / div >
< div class = "line" > < a name = "l00409" > < / a > < span class = "lineno" > 409< / span >   < span class = "comment" > // be greater than the sum of the weight of all the soft clauses, so we will< / span > < / div >
< div class = "line" > < a name = "l00410" > < / a > < span class = "lineno" > 410< / span >   < span class = "comment" > // just set it to this sum + 1.< / span > < / div >
< div class = "line" > < a name = "l00411" > < / a > < span class = "lineno" > 411< / span >   int64_t hard_weight = 1;< / div >
< div class = "line" > < a name = "l00412" > < / a > < span class = "lineno" > 412< / span >   < span class = "keywordflow" > if< / span > (is_wcnf) {< / div >
< div class = "line" > < a name = "l00413" > < / a > < span class = "lineno" > 413< / span >   < span class = "keywordtype" > int< / span > i = 0;< / div >
< div class = "line" > < a name = "l00414" > < / a > < span class = "lineno" > 414< / span >   < span class = "keywordflow" > for< / span > (int64_t < a class = "code" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > : objective.coefficients()) {< / div >
< div class = "line" > < a name = "l00415" > < / a > < span class = "lineno" > 415< / span >   < a class = "code" href = "base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb" > CHECK_NE< / a > (< a class = "code" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > , 0);< / div >
< div class = "line" > < a name = "l00416" > < / a > < span class = "lineno" > 416< / span >   < span class = "keywordtype" > int< / span > signed_literal = objective.literals(i);< / div >
< div class = "line" > < a name = "l00417" > < / a > < span class = "lineno" > 417< / span >   < / div >
< div class = "line" > < a name = "l00418" > < / a > < span class = "lineno" > 418< / span >   < span class = "comment" > // There is no direct support for an objective offset in the wcnf format.< / span > < / div >
< div class = "line" > < a name = "l00419" > < / a > < span class = "lineno" > 419< / span >   < span class = "comment" > // So this is not a perfect translation of the objective. It is however< / span > < / div >
< div class = "line" > < a name = "l00420" > < / a > < span class = "lineno" > 420< / span >   < span class = "comment" > // possible to achieve the same effect by adding a new variable x, and two< / span > < / div >
< div class = "line" > < a name = "l00421" > < / a > < span class = "lineno" > 421< / span >   < span class = "comment" > // soft clauses: x with weight offset, and -x with weight offset.< / span > < / div >
< div class = "line" > < a name = "l00422" > < / a > < span class = "lineno" > 422< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00423" > < / a > < span class = "lineno" > 423< / span >   < span class = "comment" > // TODO(user): implement this trick.< / span > < / div >
< div class = "line" > < a name = "l00424" > < / a > < span class = "lineno" > 424< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > < 0) {< / div >
< div class = "line" > < a name = "l00425" > < / a > < span class = "lineno" > 425< / span >   signed_literal = -signed_literal;< / div >
< div class = "line" > < a name = "l00426" > < / a > < span class = "lineno" > 426< / span >   < a class = "code" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > = -< a class = "code" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > ;< / div >
< div class = "line" > < a name = "l00427" > < / a > < span class = "lineno" > 427< / span >   }< / div >
< div class = "line" > < a name = "l00428" > < / a > < span class = "lineno" > 428< / span >   literal_to_weight[objective.literals(i)] = < a class = "code" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > ;< / div >
< div class = "line" > < a name = "l00429" > < / a > < span class = "lineno" > 429< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > (signed_literal).Variable() < first_slack_variable) {< / div >
< div class = "line" > < a name = "l00430" > < / a > < span class = "lineno" > 430< / span >   non_slack_objective.push_back(std::make_pair(signed_literal, < a class = "code" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > ));< / div >
< div class = "line" > < a name = "l00431" > < / a > < span class = "lineno" > 431< / span >   }< / div >
< div class = "line" > < a name = "l00432" > < / a > < span class = "lineno" > 432< / span >   hard_weight += < a class = "code" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > ;< / div >
< div class = "line" > < a name = "l00433" > < / a > < span class = "lineno" > 433< / span >   ++i;< / div >
< div class = "line" > < a name = "l00434" > < / a > < span class = "lineno" > 434< / span >   }< / div >
< div class = "line" > < a name = "l00435" > < / a > < span class = "lineno" > 435< / span >   output += absl::StrFormat(< span class = "stringliteral" > " p wcnf %d %d %d\n" < / span > , first_slack_variable,< / div >
< div class = "line" > < a name = "l00436" > < / a > < span class = "lineno" > 436< / span >   < span class = "keyword" > static_cast< < / span > < span class = "keywordtype" > int< / span > < span class = "keyword" > > < / span > (problem.constraints_size() +< / div >
< div class = "line" > < a name = "l00437" > < / a > < span class = "lineno" > 437< / span >   non_slack_objective.size()),< / div >
< div class = "line" > < a name = "l00438" > < / a > < span class = "lineno" > 438< / span >   hard_weight);< / div >
< div class = "line" > < a name = "l00439" > < / a > < span class = "lineno" > 439< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00440" > < / a > < span class = "lineno" > 440< / span >   output += absl::StrFormat(< span class = "stringliteral" > " p cnf %d %d\n" < / span > , problem.num_variables(),< / div >
< div class = "line" > < a name = "l00441" > < / a > < span class = "lineno" > 441< / span >   problem.constraints_size());< / div >
< div class = "line" > < a name = "l00442" > < / a > < span class = "lineno" > 442< / span >   }< / div >
< div class = "line" > < a name = "l00443" > < / a > < span class = "lineno" > 443< / span >   < / div >
< div class = "line" > < a name = "l00444" > < / a > < span class = "lineno" > 444< / span >   std::string constraint_output;< / div >
< div class = "line" > < a name = "l00445" > < / a > < span class = "lineno" > 445< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > LinearBooleanConstraint& constraint : problem.constraints()) {< / div >
< div class = "line" > < a name = "l00446" > < / a > < span class = "lineno" > 446< / span >   < span class = "keywordflow" > if< / span > (constraint.literals_size() == 0) < span class = "keywordflow" > return< / span > < span class = "stringliteral" > " " < / span > ; < span class = "comment" > // Assumption.< / span > < / div >
< div class = "line" > < a name = "l00447" > < / a > < span class = "lineno" > 447< / span >   constraint_output.clear();< / div >
< div class = "line" > < a name = "l00448" > < / a > < span class = "lineno" > 448< / span >   int64_t < a class = "code" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > = hard_weight;< / div >
< div class = "line" > < a name = "l00449" > < / a > < span class = "lineno" > 449< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < constraint.literals_size(); ++i) {< / div >
< div class = "line" > < a name = "l00450" > < / a > < span class = "lineno" > 450< / span >   < span class = "keywordflow" > if< / span > (constraint.coefficients(i) != 1) < span class = "keywordflow" > return< / span > < span class = "stringliteral" > " " < / span > ; < span class = "comment" > // Assumption.< / span > < / div >
< div class = "line" > < a name = "l00451" > < / a > < span class = "lineno" > 451< / span >   < span class = "keywordflow" > if< / span > (is_wcnf & & abs(constraint.literals(i)) - 1 > = first_slack_variable) {< / div >
< div class = "line" > < a name = "l00452" > < / a > < span class = "lineno" > 452< / span >   < a class = "code" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > = literal_to_weight[constraint.literals(i)];< / div >
< div class = "line" > < a name = "l00453" > < / a > < span class = "lineno" > 453< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00454" > < / a > < span class = "lineno" > 454< / span >   < span class = "keywordflow" > if< / span > (i > 0) constraint_output += < span class = "stringliteral" > " " < / span > ;< / div >
< div class = "line" > < a name = "l00455" > < / a > < span class = "lineno" > 455< / span >   constraint_output += < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > (constraint.literals(i)).< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a764be64f3029f8b8e23511061d8de355" > DebugString< / a > ();< / div >
< div class = "line" > < a name = "l00456" > < / a > < span class = "lineno" > 456< / span >   }< / div >
< div class = "line" > < a name = "l00457" > < / a > < span class = "lineno" > 457< / span >   }< / div >
< div class = "line" > < a name = "l00458" > < / a > < span class = "lineno" > 458< / span >   < span class = "keywordflow" > if< / span > (is_wcnf) {< / div >
< div class = "line" > < a name = "l00459" > < / a > < span class = "lineno" > 459< / span >   output += absl::StrFormat(< span class = "stringliteral" > " %d " < / span > , < a class = "code" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > );< / div >
< div class = "line" > < a name = "l00460" > < / a > < span class = "lineno" > 460< / span >   }< / div >
< div class = "line" > < a name = "l00461" > < / a > < span class = "lineno" > 461< / span >   output += constraint_output + < span class = "stringliteral" > " 0\n" < / span > ;< / div >
< div class = "line" > < a name = "l00462" > < / a > < span class = "lineno" > 462< / span >   }< / div >
< div class = "line" > < a name = "l00463" > < / a > < span class = "lineno" > 463< / span >   < / div >
< div class = "line" > < a name = "l00464" > < / a > < span class = "lineno" > 464< / span >   < span class = "comment" > // Output the rest of the objective as singleton constraints.< / span > < / div >
< div class = "line" > < a name = "l00465" > < / a > < span class = "lineno" > 465< / span >   < span class = "keywordflow" > if< / span > (is_wcnf) {< / div >
< div class = "line" > < a name = "l00466" > < / a > < span class = "lineno" > 466< / span >   < span class = "keywordflow" > for< / span > (std::pair< int, int64_t> p : non_slack_objective) {< / div >
< div class = "line" > < a name = "l00467" > < / a > < span class = "lineno" > 467< / span >   < span class = "comment" > // Since it is falsifying this clause that cost " weigtht" , we need to take< / span > < / div >
< div class = "line" > < a name = "l00468" > < / a > < span class = "lineno" > 468< / span >   < span class = "comment" > // its negation.< / span > < / div >
< div class = "line" > < a name = "l00469" > < / a > < span class = "lineno" > 469< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > (-p.first);< / div >
< div class = "line" > < a name = "l00470" > < / a > < span class = "lineno" > 470< / span >   output += absl::StrFormat(< span class = "stringliteral" > " %d %s 0\n" < / span > , p.second, < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > .< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a764be64f3029f8b8e23511061d8de355" > DebugString< / a > ());< / div >
< div class = "line" > < a name = "l00471" > < / a > < span class = "lineno" > 471< / span >   }< / div >
< div class = "line" > < a name = "l00472" > < / a > < span class = "lineno" > 472< / span >   }< / div >
< div class = "line" > < a name = "l00473" > < / a > < span class = "lineno" > 473< / span >   < / div >
< div class = "line" > < a name = "l00474" > < / a > < span class = "lineno" > 474< / span >   < span class = "keywordflow" > return< / span > output;< / div >
< div class = "line" > < a name = "l00475" > < / a > < span class = "lineno" > 475< / span >   }< / div >
< div class = "line" > < a name = "l00476" > < / a > < span class = "lineno" > 476< / span >   < / div >
< div class = "line" > < a name = "l00477" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a25b9a60378da756e4100df6231f29b23" > 477< / a > < / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a25b9a60378da756e4100df6231f29b23" > StoreAssignment< / a > (< span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_variables_assignment.html" > VariablesAssignment< / a > & assignment,< / div >
< div class = "line" > < a name = "l00478" > < / a > < span class = "lineno" > 478< / span >   BooleanAssignment* output) {< / div >
< div class = "line" > < a name = "l00479" > < / a > < span class = "lineno" > 479< / span >   output-> clear_literals();< / div >
< div class = "line" > < a name = "l00480" > < / a > < span class = "lineno" > 480< / span >   < span class = "keywordflow" > for< / span > (BooleanVariable < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > (0); < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > < assignment.< a class = "code" href = "classoperations__research_1_1sat_1_1_variables_assignment.html#ae19413c447377161d432f18d1323a037" > NumberOfVariables< / a > (); ++< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ) {< / div >
< div class = "line" > < a name = "l00481" > < / a > < span class = "lineno" > 481< / span >   < span class = "keywordflow" > if< / span > (assignment.< a class = "code" href = "classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d" > VariableIsAssigned< / a > (< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > )) {< / div >
< div class = "line" > < a name = "l00482" > < / a > < span class = "lineno" > 482< / span >   output-> add_literals(< / div >
< div class = "line" > < a name = "l00483" > < / a > < span class = "lineno" > 483< / span >   assignment.< a class = "code" href = "classoperations__research_1_1sat_1_1_variables_assignment.html#ac821b9b8b54da703731ce70864668a89" > GetTrueLiteralForAssignedVariable< / a > (< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ).< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a44fc3f1a79635fadb162d04cec312341" > SignedValue< / a > ());< / div >
< div class = "line" > < a name = "l00484" > < / a > < span class = "lineno" > 484< / span >   }< / div >
< div class = "line" > < a name = "l00485" > < / a > < span class = "lineno" > 485< / span >   }< / div >
< div class = "line" > < a name = "l00486" > < / a > < span class = "lineno" > 486< / span >   }< / div >
< div class = "line" > < a name = "l00487" > < / a > < span class = "lineno" > 487< / span >   < / div >
< div class = "line" > < a name = "l00488" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a58c0f19bf0e5ad35da0572722b33d6e7" > 488< / a > < / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a58c0f19bf0e5ad35da0572722b33d6e7" > ExtractSubproblem< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00489" > < / a > < span class = "lineno" > 489< / span >   < span class = "keyword" > const< / span > std::vector< int> & constraint_indices,< / div >
< div class = "line" > < a name = "l00490" > < / a > < span class = "lineno" > 490< / span >   LinearBooleanProblem* subproblem) {< / div >
< div class = "line" > < a name = "l00491" > < / a > < span class = "lineno" > 491< / span >   *subproblem = problem;< / div >
< div class = "line" > < a name = "l00492" > < / a > < span class = "lineno" > 492< / span >   subproblem-> set_name(< span class = "stringliteral" > " Subproblem of " < / span > + problem.name());< / div >
< div class = "line" > < a name = "l00493" > < / a > < span class = "lineno" > 493< / span >   subproblem-> clear_constraints();< / div >
< div class = "line" > < a name = "l00494" > < / a > < span class = "lineno" > 494< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > : constraint_indices) {< / div >
< div class = "line" > < a name = "l00495" > < / a > < span class = "lineno" > 495< / span >   < a class = "code" href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > (< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > , problem.constraints_size());< / div >
< div class = "line" > < a name = "l00496" > < / a > < span class = "lineno" > 496< / span >   subproblem-> add_constraints()-> MergeFrom(problem.constraints(< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ));< / div >
< div class = "line" > < a name = "l00497" > < / a > < span class = "lineno" > 497< / span >   }< / div >
< div class = "line" > < a name = "l00498" > < / a > < span class = "lineno" > 498< / span >   }< / div >
< div class = "line" > < a name = "l00499" > < / a > < span class = "lineno" > 499< / span >   < / div >
< div class = "line" > < a name = "l00500" > < / a > < span class = "lineno" > 500< / span >   < span class = "keyword" > namespace < / span > {< / div >
< div class = "line" > < a name = "l00501" > < / a > < span class = "lineno" > 501< / span >   < span class = "comment" > // A simple class to generate equivalence class number for< / span > < / div >
< div class = "line" > < a name = "l00502" > < / a > < span class = "lineno" > 502< / span >   < span class = "comment" > // GenerateGraphForSymmetryDetection().< / span > < / div >
< div class = "line" > < a name = "l00503" > < / a > < span class = "lineno" > 503< / span >   < span class = "keyword" > class < / span > IdGenerator {< / div >
< div class = "line" > < a name = "l00504" > < / a > < span class = "lineno" > 504< / span >   < span class = "keyword" > public< / span > :< / div >
< div class = "line" > < a name = "l00505" > < / a > < span class = "lineno" > 505< / span >   IdGenerator() {}< / div >
< div class = "line" > < a name = "l00506" > < / a > < span class = "lineno" > 506< / span >   < / div >
< div class = "line" > < a name = "l00507" > < / a > < span class = "lineno" > 507< / span >   < span class = "comment" > // If the pair (type, coefficient) was never seen before, then generate< / span > < / div >
< div class = "line" > < a name = "l00508" > < / a > < span class = "lineno" > 508< / span >   < span class = "comment" > // a new id, otherwise return the previously generated id.< / span > < / div >
< div class = "line" > < a name = "l00509" > < / a > < span class = "lineno" > 509< / span >   < span class = "keywordtype" > int< / span > GetId(< span class = "keywordtype" > int< / span > type, Coefficient < a class = "code" href = "routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba" > coefficient< / a > ) {< / div >
< div class = "line" > < a name = "l00510" > < / a > < span class = "lineno" > 510< / span >   < span class = "keyword" > const< / span > std::pair< int, int64_t> key(type, < a class = "code" href = "routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba" > coefficient< / a > .value());< / div >
< div class = "line" > < a name = "l00511" > < / a > < span class = "lineno" > 511< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c" > gtl::LookupOrInsert< / a > (& id_map_, key, id_map_.size());< / div >
< div class = "line" > < a name = "l00512" > < / a > < span class = "lineno" > 512< / span >   }< / div >
< div class = "line" > < a name = "l00513" > < / a > < span class = "lineno" > 513< / span >   < / div >
< div class = "line" > < a name = "l00514" > < / a > < span class = "lineno" > 514< / span >   < span class = "keyword" > private< / span > :< / div >
< div class = "line" > < a name = "l00515" > < / a > < span class = "lineno" > 515< / span >   absl::flat_hash_map< std::pair< int, int64_t> , < span class = "keywordtype" > int< / span > > id_map_;< / div >
< div class = "line" > < a name = "l00516" > < / a > < span class = "lineno" > 516< / span >   };< / div >
< div class = "line" > < a name = "l00517" > < / a > < span class = "lineno" > 517< / span >   } < span class = "comment" > // namespace.< / span > < / div >
< div class = "line" > < a name = "l00518" > < / a > < span class = "lineno" > 518< / span >   < / div >
< div class = "line" > < a name = "l00519" > < / a > < span class = "lineno" > 519< / span >   < span class = "comment" > // Returns a graph whose automorphisms can be mapped back to the symmetries of< / span > < / div >
< div class = "line" > < a name = "l00520" > < / a > < span class = "lineno" > 520< / span >   < span class = "comment" > // the given LinearBooleanProblem.< / span > < / div >
< div class = "line" > < a name = "l00521" > < / a > < span class = "lineno" > 521< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00522" > < / a > < span class = "lineno" > 522< / span >   < span class = "comment" > // Any permutation of the graph that respects the initial_equivalence_classes< / span > < / div >
< div class = "line" > < a name = "l00523" > < / a > < span class = "lineno" > 523< / span >   < span class = "comment" > // output can be mapped to a symmetry of the given problem simply by taking its< / span > < / div >
< div class = "line" > < a name = "l00524" > < / a > < span class = "lineno" > 524< / span >   < span class = "comment" > // restriction on the first 2 * num_variables nodes and interpreting its index< / span > < / div >
< div class = "line" > < a name = "l00525" > < / a > < span class = "lineno" > 525< / span >   < span class = "comment" > // as a literal index. In a sense, a node with a low enough index #i is in< / span > < / div >
< div class = "line" > < a name = "l00526" > < / a > < span class = "lineno" > 526< / span >   < span class = "comment" > // one-to-one correspondence with a literals #i (using the index representation< / span > < / div >
< div class = "line" > < a name = "l00527" > < / a > < span class = "lineno" > 527< / span >   < span class = "comment" > // of literal).< / span > < / div >
< div class = "line" > < a name = "l00528" > < / a > < span class = "lineno" > 528< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00529" > < / a > < span class = "lineno" > 529< / span >   < span class = "comment" > // The format of the initial_equivalence_classes is the same as the one< / span > < / div >
< div class = "line" > < a name = "l00530" > < / a > < span class = "lineno" > 530< / span >   < span class = "comment" > // described in GraphSymmetryFinder::FindSymmetries(). The classes must be dense< / span > < / div >
< div class = "line" > < a name = "l00531" > < / a > < span class = "lineno" > 531< / span >   < span class = "comment" > // in [0, num_classes) and any symmetry will only map nodes with the same class< / span > < / div >
< div class = "line" > < a name = "l00532" > < / a > < span class = "lineno" > 532< / span >   < span class = "comment" > // between each other.< / span > < / div >
< div class = "line" > < a name = "l00533" > < / a > < span class = "lineno" > 533< / span >   < span class = "keyword" > template< / span > < < span class = "keyword" > typename< / span > Graph> < / div >
< div class = "line" > < a name = "l00534" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a3f6fa74408ea28eb41f29e9696d9a9a2" > 534< / a > < / span >   < a class = "code" href = "namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478" > Graph< / a > * < a class = "code" href = "namespaceoperations__research_1_1sat.html#a3f6fa74408ea28eb41f29e9696d9a9a2" > GenerateGraphForSymmetryDetection< / a > (< / div >
< div class = "line" > < a name = "l00535" > < / a > < span class = "lineno" > 535< / span >   < span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00536" > < / a > < span class = "lineno" > 536< / span >   std::vector< int> * initial_equivalence_classes) {< / div >
< div class = "line" > < a name = "l00537" > < / a > < span class = "lineno" > 537< / span >   < span class = "comment" > // First, we convert the problem to its canonical representation.< / span > < / div >
< div class = "line" > < a name = "l00538" > < / a > < span class = "lineno" > 538< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_variables = problem.num_variables();< / div >
< div class = "line" > < a name = "l00539" > < / a > < span class = "lineno" > 539< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem.html" > CanonicalBooleanLinearProblem< / a > canonical_problem;< / div >
< div class = "line" > < a name = "l00540" > < / a > < span class = "lineno" > 540< / span >   std::vector< LiteralWithCoeff> cst;< / div >
< div class = "line" > < a name = "l00541" > < / a > < span class = "lineno" > 541< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > LinearBooleanConstraint& constraint : problem.constraints()) {< / div >
< div class = "line" > < a name = "l00542" > < / a > < span class = "lineno" > 542< / span >   cst = ConvertLinearExpression(constraint);< / div >
< div class = "line" > < a name = "l00543" > < / a > < span class = "lineno" > 543< / span >   < a class = "code" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (canonical_problem.< a class = "code" href = "classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem.html#a05c49a95f6af6f8d873c96cae6ab6653" > AddLinearConstraint< / a > (< / div >
< div class = "line" > < a name = "l00544" > < / a > < span class = "lineno" > 544< / span >   constraint.has_lower_bound(), Coefficient(constraint.lower_bound()),< / div >
< div class = "line" > < a name = "l00545" > < / a > < span class = "lineno" > 545< / span >   constraint.has_upper_bound(), Coefficient(constraint.upper_bound()),< / div >
< div class = "line" > < a name = "l00546" > < / a > < span class = "lineno" > 546< / span >   & cst));< / div >
< div class = "line" > < a name = "l00547" > < / a > < span class = "lineno" > 547< / span >   }< / div >
< div class = "line" > < a name = "l00548" > < / a > < span class = "lineno" > 548< / span >   < / div >
< div class = "line" > < a name = "l00549" > < / a > < span class = "lineno" > 549< / span >   < span class = "comment" > // TODO(user): reserve the memory for the graph? not sure it is worthwhile< / span > < / div >
< div class = "line" > < a name = "l00550" > < / a > < span class = "lineno" > 550< / span >   < span class = "comment" > // since it would require some linear scan of the problem though.< / span > < / div >
< div class = "line" > < a name = "l00551" > < / a > < span class = "lineno" > 551< / span >   < a class = "code" href = "namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478" > Graph< / a > * graph = < span class = "keyword" > new< / span > < a class = "code" href = "namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478" > Graph< / a > ();< / div >
< div class = "line" > < a name = "l00552" > < / a > < span class = "lineno" > 552< / span >   initial_equivalence_classes-> clear();< / div >
< div class = "line" > < a name = "l00553" > < / a > < span class = "lineno" > 553< / span >   < / div >
< div class = "line" > < a name = "l00554" > < / a > < span class = "lineno" > 554< / span >   < span class = "comment" > // We will construct a graph with 3 different types of node that must be< / span > < / div >
< div class = "line" > < a name = "l00555" > < / a > < span class = "lineno" > 555< / span >   < span class = "comment" > // in different equivalent classes.< / span > < / div >
< div class = "line" > < a name = "l00556" > < / a > < span class = "lineno" > 556< / span >   < span class = "keyword" > enum< / span > NodeType { LITERAL_NODE, CONSTRAINT_NODE, CONSTRAINT_COEFFICIENT_NODE };< / div >
< div class = "line" > < a name = "l00557" > < / a > < span class = "lineno" > 557< / span >   IdGenerator id_generator;< / div >
< div class = "line" > < a name = "l00558" > < / a > < span class = "lineno" > 558< / span >   < / div >
< div class = "line" > < a name = "l00559" > < / a > < span class = "lineno" > 559< / span >   < span class = "comment" > // First, we need one node per literal with an edge between each literal< / span > < / div >
< div class = "line" > < a name = "l00560" > < / a > < span class = "lineno" > 560< / span >   < span class = "comment" > // and its negation.< / span > < / div >
< div class = "line" > < a name = "l00561" > < / a > < span class = "lineno" > 561< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < num_variables; ++i) {< / div >
< div class = "line" > < a name = "l00562" > < / a > < span class = "lineno" > 562< / span >   < span class = "comment" > // We have two nodes for each variable.< / span > < / div >
< div class = "line" > < a name = "l00563" > < / a > < span class = "lineno" > 563< / span >   < span class = "comment" > // Note that the indices are in [0, 2 * num_variables) and in one to one< / span > < / div >
< div class = "line" > < a name = "l00564" > < / a > < span class = "lineno" > 564< / span >   < span class = "comment" > // correspondence with the index representation of a literal.< / span > < / div >
< div class = "line" > < a name = "l00565" > < / a > < span class = "lineno" > 565< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > = < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > (BooleanVariable(i), < span class = "keyword" > true< / span > );< / div >
< div class = "line" > < a name = "l00566" > < / a > < span class = "lineno" > 566< / span >   graph-> AddArc(< a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > .< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62" > Index< / a > ().value(), < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > .< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7" > NegatedIndex< / a > ().value());< / div >
< div class = "line" > < a name = "l00567" > < / a > < span class = "lineno" > 567< / span >   graph-> AddArc(< a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > .< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7" > NegatedIndex< / a > ().value(), < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > .< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62" > Index< / a > ().value());< / div >
< div class = "line" > < a name = "l00568" > < / a > < span class = "lineno" > 568< / span >   }< / div >
< div class = "line" > < a name = "l00569" > < / a > < span class = "lineno" > 569< / span >   < / div >
< div class = "line" > < a name = "l00570" > < / a > < span class = "lineno" > 570< / span >   < span class = "comment" > // We use 0 for their initial equivalence class, but that may be modified< / span > < / div >
< div class = "line" > < a name = "l00571" > < / a > < span class = "lineno" > 571< / span >   < span class = "comment" > // with the objective coefficient (see below).< / span > < / div >
< div class = "line" > < a name = "l00572" > < / a > < span class = "lineno" > 572< / span >   initial_equivalence_classes-> assign(< / div >
< div class = "line" > < a name = "l00573" > < / a > < span class = "lineno" > 573< / span >   2 * num_variables,< / div >
< div class = "line" > < a name = "l00574" > < / a > < span class = "lineno" > 574< / span >   id_generator.GetId(NodeType::LITERAL_NODE, Coefficient(0)));< / div >
< div class = "line" > < a name = "l00575" > < / a > < span class = "lineno" > 575< / span >   < / div >
< div class = "line" > < a name = "l00576" > < / a > < span class = "lineno" > 576< / span >   < span class = "comment" > // Literals with different objective coeffs shouldn' t be in the same class.< / span > < / div >
< div class = "line" > < a name = "l00577" > < / a > < span class = "lineno" > 577< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00578" > < / a > < span class = "lineno" > 578< / span >   < span class = "comment" > // We need to canonicalize the objective to regroup literals corresponding< / span > < / div >
< div class = "line" > < a name = "l00579" > < / a > < span class = "lineno" > 579< / span >   < span class = "comment" > // to the same variables. Note that we don' t care about the offset or< / span > < / div >
< div class = "line" > < a name = "l00580" > < / a > < span class = "lineno" > 580< / span >   < span class = "comment" > // optimization direction here, we just care about literals with the same< / span > < / div >
< div class = "line" > < a name = "l00581" > < / a > < span class = "lineno" > 581< / span >   < span class = "comment" > // canonical coefficient.< / span > < / div >
< div class = "line" > < a name = "l00582" > < / a > < span class = "lineno" > 582< / span >   Coefficient shift;< / div >
< div class = "line" > < a name = "l00583" > < / a > < span class = "lineno" > 583< / span >   Coefficient max_value;< / div >
< div class = "line" > < a name = "l00584" > < / a > < span class = "lineno" > 584< / span >   std::vector< LiteralWithCoeff> expr =< / div >
< div class = "line" > < a name = "l00585" > < / a > < span class = "lineno" > 585< / span >   ConvertLinearExpression(problem.objective());< / div >
< div class = "line" > < a name = "l00586" > < / a > < span class = "lineno" > 586< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#a8860b588974cb8ffaf2ac97eafd67b3e" > ComputeBooleanLinearExpressionCanonicalForm< / a > (& expr, & shift, & max_value);< / div >
< div class = "line" > < a name = "l00587" > < / a > < span class = "lineno" > 587< / span >   < span class = "keywordflow" > for< / span > (< a class = "code" href = "structoperations__research_1_1sat_1_1_literal_with_coeff.html" > LiteralWithCoeff< / a > term : expr) {< / div >
< div class = "line" > < a name = "l00588" > < / a > < span class = "lineno" > 588< / span >   (*initial_equivalence_classes)[term.literal.Index().value()] =< / div >
< div class = "line" > < a name = "l00589" > < / a > < span class = "lineno" > 589< / span >   id_generator.GetId(NodeType::LITERAL_NODE, term.coefficient);< / div >
< div class = "line" > < a name = "l00590" > < / a > < span class = "lineno" > 590< / span >   }< / div >
< div class = "line" > < a name = "l00591" > < / a > < span class = "lineno" > 591< / span >   < / div >
< div class = "line" > < a name = "l00592" > < / a > < span class = "lineno" > 592< / span >   < span class = "comment" > // Then, for each constraint, we will have one or more nodes.< / span > < / div >
< div class = "line" > < a name = "l00593" > < / a > < span class = "lineno" > 593< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < canonical_problem.< a class = "code" href = "classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem.html#a03666f2e70e42a9560aa9ce7416d2644" > NumConstraints< / a > (); ++i) {< / div >
< div class = "line" > < a name = "l00594" > < / a > < span class = "lineno" > 594< / span >   < span class = "comment" > // First we have a node for the constraint with an equivalence class< / span > < / div >
< div class = "line" > < a name = "l00595" > < / a > < span class = "lineno" > 595< / span >   < span class = "comment" > // depending on the rhs.< / span > < / div >
< div class = "line" > < a name = "l00596" > < / a > < span class = "lineno" > 596< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00597" > < / a > < span class = "lineno" > 597< / span >   < span class = "comment" > // Note: Since we add nodes one by one, initial_equivalence_classes-> size()< / span > < / div >
< div class = "line" > < a name = "l00598" > < / a > < span class = "lineno" > 598< / span >   < span class = "comment" > // gives the number of nodes at any point, which we use as next node index.< / span > < / div >
< div class = "line" > < a name = "l00599" > < / a > < span class = "lineno" > 599< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > constraint_node_index = initial_equivalence_classes-> size();< / div >
< div class = "line" > < a name = "l00600" > < / a > < span class = "lineno" > 600< / span >   initial_equivalence_classes-> push_back(id_generator.GetId(< / div >
< div class = "line" > < a name = "l00601" > < / a > < span class = "lineno" > 601< / span >   NodeType::CONSTRAINT_NODE, canonical_problem.< a class = "code" href = "classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem.html#a7391d0c784872207477f474cf28f65a5" > Rhs< / a > (i)));< / div >
< div class = "line" > < a name = "l00602" > < / a > < span class = "lineno" > 602< / span >   < / div >
< div class = "line" > < a name = "l00603" > < / a > < span class = "lineno" > 603< / span >   < span class = "comment" > // This node will also be connected to all literals of the constraint< / span > < / div >
< div class = "line" > < a name = "l00604" > < / a > < span class = "lineno" > 604< / span >   < span class = "comment" > // with a coefficient of 1. Literals with new coefficients will be grouped< / span > < / div >
< div class = "line" > < a name = "l00605" > < / a > < span class = "lineno" > 605< / span >   < span class = "comment" > // under a new node connected to the constraint_node_index.< / span > < / div >
< div class = "line" > < a name = "l00606" > < / a > < span class = "lineno" > 606< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00607" > < / a > < span class = "lineno" > 607< / span >   < span class = "comment" > // Note that this works because a canonical constraint is sorted by< / span > < / div >
< div class = "line" > < a name = "l00608" > < / a > < span class = "lineno" > 608< / span >   < span class = "comment" > // increasing coefficient value (all positive).< / span > < / div >
< div class = "line" > < a name = "l00609" > < / a > < span class = "lineno" > 609< / span >   < span class = "keywordtype" > int< / span > current_node_index = constraint_node_index;< / div >
< div class = "line" > < a name = "l00610" > < / a > < span class = "lineno" > 610< / span >   Coefficient previous_coefficient(1);< / div >
< div class = "line" > < a name = "l00611" > < / a > < span class = "lineno" > 611< / span >   < span class = "keywordflow" > for< / span > (< a class = "code" href = "structoperations__research_1_1sat_1_1_literal_with_coeff.html" > LiteralWithCoeff< / a > term : canonical_problem.< a class = "code" href = "classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem.html#a95128a258b1f7d9a4058362edfd2158b" > Constraint< / a > (i)) {< / div >
< div class = "line" > < a name = "l00612" > < / a > < span class = "lineno" > 612< / span >   < span class = "keywordflow" > if< / span > (term.coefficient != previous_coefficient) {< / div >
< div class = "line" > < a name = "l00613" > < / a > < span class = "lineno" > 613< / span >   current_node_index = initial_equivalence_classes-> size();< / div >
< div class = "line" > < a name = "l00614" > < / a > < span class = "lineno" > 614< / span >   initial_equivalence_classes-> push_back(id_generator.GetId(< / div >
< div class = "line" > < a name = "l00615" > < / a > < span class = "lineno" > 615< / span >   NodeType::CONSTRAINT_COEFFICIENT_NODE, term.coefficient));< / div >
< div class = "line" > < a name = "l00616" > < / a > < span class = "lineno" > 616< / span >   previous_coefficient = term.coefficient;< / div >
< div class = "line" > < a name = "l00617" > < / a > < span class = "lineno" > 617< / span >   < / div >
< div class = "line" > < a name = "l00618" > < / a > < span class = "lineno" > 618< / span >   < span class = "comment" > // Connect this node to the constraint node. Note that we don' t< / span > < / div >
< div class = "line" > < a name = "l00619" > < / a > < span class = "lineno" > 619< / span >   < span class = "comment" > // technically need the arcs in both directions, but that may help a bit< / span > < / div >
< div class = "line" > < a name = "l00620" > < / a > < span class = "lineno" > 620< / span >   < span class = "comment" > // the algorithm to find symmetries.< / span > < / div >
< div class = "line" > < a name = "l00621" > < / a > < span class = "lineno" > 621< / span >   graph-> AddArc(constraint_node_index, current_node_index);< / div >
< div class = "line" > < a name = "l00622" > < / a > < span class = "lineno" > 622< / span >   graph-> AddArc(current_node_index, constraint_node_index);< / div >
< div class = "line" > < a name = "l00623" > < / a > < span class = "lineno" > 623< / span >   }< / div >
< div class = "line" > < a name = "l00624" > < / a > < span class = "lineno" > 624< / span >   < / div >
< div class = "line" > < a name = "l00625" > < / a > < span class = "lineno" > 625< / span >   < span class = "comment" > // Connect this node to the associated term.literal node. Note that we< / span > < / div >
< div class = "line" > < a name = "l00626" > < / a > < span class = "lineno" > 626< / span >   < span class = "comment" > // don' t technically need the arcs in both directions, but that may help a< / span > < / div >
< div class = "line" > < a name = "l00627" > < / a > < span class = "lineno" > 627< / span >   < span class = "comment" > // bit the algorithm to find symmetries.< / span > < / div >
< div class = "line" > < a name = "l00628" > < / a > < span class = "lineno" > 628< / span >   graph-> AddArc(current_node_index, term.literal.Index().value());< / div >
< div class = "line" > < a name = "l00629" > < / a > < span class = "lineno" > 629< / span >   graph-> AddArc(term.literal.Index().value(), current_node_index);< / div >
< div class = "line" > < a name = "l00630" > < / a > < span class = "lineno" > 630< / span >   }< / div >
< div class = "line" > < a name = "l00631" > < / a > < span class = "lineno" > 631< / span >   }< / div >
< div class = "line" > < a name = "l00632" > < / a > < span class = "lineno" > 632< / span >   graph-> Build();< / div >
< div class = "line" > < a name = "l00633" > < / a > < span class = "lineno" > 633< / span >   < a class = "code" href = "base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0" > DCHECK_EQ< / a > (graph-> num_nodes(), initial_equivalence_classes-> size());< / div >
< div class = "line" > < a name = "l00634" > < / a > < span class = "lineno" > 634< / span >   < span class = "keywordflow" > return< / span > graph;< / div >
< div class = "line" > < a name = "l00635" > < / a > < span class = "lineno" > 635< / span >   }< / div >
< div class = "line" > < a name = "l00636" > < / a > < span class = "lineno" > 636< / span >   < / div >
< div class = "line" > < a name = "l00637" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#ace3f68c781179d6de36fad9d4b0c386b" > 637< / a > < / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#ace3f68c781179d6de36fad9d4b0c386b" > MakeAllLiteralsPositive< / a > (LinearBooleanProblem* problem) {< / div >
< div class = "line" > < a name = "l00638" > < / a > < span class = "lineno" > 638< / span >   < span class = "comment" > // Objective.< / span > < / div >
< div class = "line" > < a name = "l00639" > < / a > < span class = "lineno" > 639< / span >   LinearObjective* mutable_objective = problem-> mutable_objective();< / div >
< div class = "line" > < a name = "l00640" > < / a > < span class = "lineno" > 640< / span >   int64_t objective_offset = 0;< / div >
< div class = "line" > < a name = "l00641" > < / a > < span class = "lineno" > 641< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < mutable_objective-> literals_size(); ++i) {< / div >
< div class = "line" > < a name = "l00642" > < / a > < span class = "lineno" > 642< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > signed_literal = mutable_objective-> literals(i);< / div >
< div class = "line" > < a name = "l00643" > < / a > < span class = "lineno" > 643< / span >   < span class = "keywordflow" > if< / span > (signed_literal < 0) {< / div >
< div class = "line" > < a name = "l00644" > < / a > < span class = "lineno" > 644< / span >   < span class = "keyword" > const< / span > int64_t < a class = "code" href = "routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba" > coefficient< / a > = mutable_objective-> coefficients(i);< / div >
< div class = "line" > < a name = "l00645" > < / a > < span class = "lineno" > 645< / span >   mutable_objective-> set_literals(i, -signed_literal);< / div >
< div class = "line" > < a name = "l00646" > < / a > < span class = "lineno" > 646< / span >   mutable_objective-> set_coefficients(i, -< a class = "code" href = "routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba" > coefficient< / a > );< / div >
< div class = "line" > < a name = "l00647" > < / a > < span class = "lineno" > 647< / span >   objective_offset += < a class = "code" href = "routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba" > coefficient< / a > ;< / div >
< div class = "line" > < a name = "l00648" > < / a > < span class = "lineno" > 648< / span >   }< / div >
< div class = "line" > < a name = "l00649" > < / a > < span class = "lineno" > 649< / span >   }< / div >
< div class = "line" > < a name = "l00650" > < / a > < span class = "lineno" > 650< / span >   mutable_objective-> set_offset(mutable_objective-> offset() + objective_offset);< / div >
< div class = "line" > < a name = "l00651" > < / a > < span class = "lineno" > 651< / span >   < / div >
< div class = "line" > < a name = "l00652" > < / a > < span class = "lineno" > 652< / span >   < span class = "comment" > // Constraints.< / span > < / div >
< div class = "line" > < a name = "l00653" > < / a > < span class = "lineno" > 653< / span >   < span class = "keywordflow" > for< / span > (LinearBooleanConstraint& constraint :< / div >
< div class = "line" > < a name = "l00654" > < / a > < span class = "lineno" > 654< / span >   *(problem-> mutable_constraints())) {< / div >
< div class = "line" > < a name = "l00655" > < / a > < span class = "lineno" > 655< / span >   int64_t sum = 0;< / div >
< div class = "line" > < a name = "l00656" > < / a > < span class = "lineno" > 656< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < constraint.literals_size(); ++i) {< / div >
< div class = "line" > < a name = "l00657" > < / a > < span class = "lineno" > 657< / span >   < span class = "keywordflow" > if< / span > (constraint.literals(i) < 0) {< / div >
< div class = "line" > < a name = "l00658" > < / a > < span class = "lineno" > 658< / span >   sum += constraint.coefficients(i);< / div >
< div class = "line" > < a name = "l00659" > < / a > < span class = "lineno" > 659< / span >   constraint.set_literals(i, -constraint.literals(i));< / div >
< div class = "line" > < a name = "l00660" > < / a > < span class = "lineno" > 660< / span >   constraint.set_coefficients(i, -constraint.coefficients(i));< / div >
< div class = "line" > < a name = "l00661" > < / a > < span class = "lineno" > 661< / span >   }< / div >
< div class = "line" > < a name = "l00662" > < / a > < span class = "lineno" > 662< / span >   }< / div >
< div class = "line" > < a name = "l00663" > < / a > < span class = "lineno" > 663< / span >   < span class = "keywordflow" > if< / span > (constraint.has_lower_bound()) {< / div >
< div class = "line" > < a name = "l00664" > < / a > < span class = "lineno" > 664< / span >   constraint.set_lower_bound(constraint.lower_bound() - sum);< / div >
< div class = "line" > < a name = "l00665" > < / a > < span class = "lineno" > 665< / span >   }< / div >
< div class = "line" > < a name = "l00666" > < / a > < span class = "lineno" > 666< / span >   < span class = "keywordflow" > if< / span > (constraint.has_upper_bound()) {< / div >
< div class = "line" > < a name = "l00667" > < / a > < span class = "lineno" > 667< / span >   constraint.set_upper_bound(constraint.upper_bound() - sum);< / div >
< div class = "line" > < a name = "l00668" > < / a > < span class = "lineno" > 668< / span >   }< / div >
< div class = "line" > < a name = "l00669" > < / a > < span class = "lineno" > 669< / span >   }< / div >
< div class = "line" > < a name = "l00670" > < / a > < span class = "lineno" > 670< / span >   }< / div >
< div class = "line" > < a name = "l00671" > < / a > < span class = "lineno" > 671< / span >   < / div >
< div class = "line" > < a name = "l00672" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a6986d13a746e6577bcf0cb190aef8113" > 672< / a > < / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a6986d13a746e6577bcf0cb190aef8113" > FindLinearBooleanProblemSymmetries< / a > (< / div >
< div class = "line" > < a name = "l00673" > < / a > < span class = "lineno" > 673< / span >   < span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00674" > < / a > < span class = "lineno" > 674< / span >   std::vector< std::unique_ptr< SparsePermutation> > * generators) {< / div >
< div class = "line" > < a name = "l00675" > < / a > < span class = "lineno" > 675< / span >   < span class = "keyword" > typedef< / span > < a class = "code" href = "classutil_1_1_static_graph.html" > GraphSymmetryFinder::Graph< / a > < a class = "code" href = "namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478" > Graph< / a > ;< / div >
< div class = "line" > < a name = "l00676" > < / a > < span class = "lineno" > 676< / span >   std::vector< int> equivalence_classes;< / div >
< div class = "line" > < a name = "l00677" > < / a > < span class = "lineno" > 677< / span >   std::unique_ptr< Graph> graph(< / div >
< div class = "line" > < a name = "l00678" > < / a > < span class = "lineno" > 678< / span >   GenerateGraphForSymmetryDetection< Graph> (problem, & equivalence_classes));< / div >
< div class = "line" > < a name = "l00679" > < / a > < span class = "lineno" > 679< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > ) < < < span class = "stringliteral" > " Graph has " < / span > < < graph-> num_nodes() < < < span class = "stringliteral" > " nodes and " < / span > < / div >
< div class = "line" > < a name = "l00680" > < / a > < span class = "lineno" > 680< / span >   < < graph-> num_arcs() / 2 < < < span class = "stringliteral" > " edges." < / span > ;< / div >
< div class = "line" > < a name = "l00681" > < / a > < span class = "lineno" > 681< / span >   < span class = "preprocessor" > #if !defined(__PORTABLE_PLATFORM__)< / span > < / div >
< div class = "line" > < a name = "l00682" > < / a > < span class = "lineno" > 682< / span >   < span class = "keywordflow" > if< / span > (!absl::GetFlag(FLAGS_debug_dump_symmetry_graph_to_file).empty()) {< / div >
< div class = "line" > < a name = "l00683" > < / a > < span class = "lineno" > 683< / span >   < span class = "comment" > // Remap the graph nodes to sort them by equivalence classes.< / span > < / div >
< div class = "line" > < a name = "l00684" > < / a > < span class = "lineno" > 684< / span >   std::vector< int> new_node_index(graph-> num_nodes(), -1);< / div >
< div class = "line" > < a name = "l00685" > < / a > < span class = "lineno" > 685< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_classes = 1 + *std::max_element(equivalence_classes.begin(),< / div >
< div class = "line" > < a name = "l00686" > < / a > < span class = "lineno" > 686< / span >   equivalence_classes.end());< / div >
< div class = "line" > < a name = "l00687" > < / a > < span class = "lineno" > 687< / span >   std::vector< int> class_size(num_classes, 0);< / div >
< div class = "line" > < a name = "l00688" > < / a > < span class = "lineno" > 688< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > c : equivalence_classes) ++class_size[c];< / div >
< div class = "line" > < a name = "l00689" > < / a > < span class = "lineno" > 689< / span >   std::vector< int> next_index_by_class(num_classes, 0);< / div >
< div class = "line" > < a name = "l00690" > < / a > < span class = "lineno" > 690< / span >   std::partial_sum(class_size.begin(), class_size.end() - 1,< / div >
< div class = "line" > < a name = "l00691" > < / a > < span class = "lineno" > 691< / span >   next_index_by_class.begin() + 1);< / div >
< div class = "line" > < a name = "l00692" > < / a > < span class = "lineno" > 692< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > node = 0; node < graph-> num_nodes(); ++node) {< / div >
< div class = "line" > < a name = "l00693" > < / a > < span class = "lineno" > 693< / span >   new_node_index[node] = next_index_by_class[equivalence_classes[node]]++;< / div >
< div class = "line" > < a name = "l00694" > < / a > < span class = "lineno" > 694< / span >   }< / div >
< div class = "line" > < a name = "l00695" > < / a > < span class = "lineno" > 695< / span >   std::unique_ptr< Graph> remapped_graph = < a class = "code" href = "namespaceutil.html#aab5724a929530fa1d28749dc82852388" > RemapGraph< / a > (*graph, new_node_index);< / div >
< div class = "line" > < a name = "l00696" > < / a > < span class = "lineno" > 696< / span >   < span class = "keyword" > const< / span > absl::Status status = < a class = "code" href = "namespaceutil.html#a45fca0c4762006176ad5622ec40dea9c" > util::WriteGraphToFile< / a > (< / div >
< div class = "line" > < a name = "l00697" > < / a > < span class = "lineno" > 697< / span >   *remapped_graph, absl::GetFlag(FLAGS_debug_dump_symmetry_graph_to_file),< / div >
< div class = "line" > < a name = "l00698" > < / a > < span class = "lineno" > 698< / span >   < span class = "comment" > /*directed=*/< / span > < span class = "keyword" > false< / span > , class_size);< / div >
< div class = "line" > < a name = "l00699" > < / a > < span class = "lineno" > 699< / span >   < span class = "keywordflow" > if< / span > (!status.ok()) {< / div >
< div class = "line" > < a name = "l00700" > < / a > < span class = "lineno" > 700< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (DFATAL) < < < span class = "stringliteral" > " Error when writing the symmetry graph to file: " < / span > < / div >
< div class = "line" > < a name = "l00701" > < / a > < span class = "lineno" > 701< / span >   < < status;< / div >
< div class = "line" > < a name = "l00702" > < / a > < span class = "lineno" > 702< / span >   }< / div >
< div class = "line" > < a name = "l00703" > < / a > < span class = "lineno" > 703< / span >   }< / div >
< div class = "line" > < a name = "l00704" > < / a > < span class = "lineno" > 704< / span >   < span class = "preprocessor" > #endif < / span > < span class = "comment" > // __PORTABLE_PLATFORM__< / span > < / div >
< div class = "line" > < a name = "l00705" > < / a > < span class = "lineno" > 705< / span >   < a class = "code" href = "classoperations__research_1_1_graph_symmetry_finder.html" > GraphSymmetryFinder< / a > symmetry_finder(*graph,< / div >
< div class = "line" > < a name = "l00706" > < / a > < span class = "lineno" > 706< / span >   < span class = "comment" > /*is_undirected=*/< / span > < span class = "keyword" > true< / span > );< / div >
< div class = "line" > < a name = "l00707" > < / a > < span class = "lineno" > 707< / span >   std::vector< int> factorized_automorphism_group_size;< / div >
< div class = "line" > < a name = "l00708" > < / a > < span class = "lineno" > 708< / span >   < span class = "comment" > // TODO(user): inject the appropriate time limit here.< / span > < / div >
< div class = "line" > < a name = "l00709" > < / a > < span class = "lineno" > 709< / span >   < a class = "code" href = "base_2logging_8h.html#a9f96ed9f06763f0821fdbb4d29031d8d" > CHECK_OK< / a > (symmetry_finder.< a class = "code" href = "classoperations__research_1_1_graph_symmetry_finder.html#ad1f88654797ab9271206d6a4c013a94e" > FindSymmetries< / a > (& equivalence_classes, generators,< / div >
< div class = "line" > < a name = "l00710" > < / a > < span class = "lineno" > 710< / span >   & factorized_automorphism_group_size));< / div >
< div class = "line" > < a name = "l00711" > < / a > < span class = "lineno" > 711< / span >   < / div >
< div class = "line" > < a name = "l00712" > < / a > < span class = "lineno" > 712< / span >   < span class = "comment" > // Remove from the permutations the part not concerning the literals.< / span > < / div >
< div class = "line" > < a name = "l00713" > < / a > < span class = "lineno" > 713< / span >   < span class = "comment" > // Note that some permutation may becomes empty, which means that we had< / span > < / div >
< div class = "line" > < a name = "l00714" > < / a > < span class = "lineno" > 714< / span >   < span class = "comment" > // duplicates constraints. TODO(user): Remove them beforehand?< / span > < / div >
< div class = "line" > < a name = "l00715" > < / a > < span class = "lineno" > 715< / span >   < span class = "keywordtype" > double< / span > average_support_size = 0.0;< / div >
< div class = "line" > < a name = "l00716" > < / a > < span class = "lineno" > 716< / span >   < span class = "keywordtype" > int< / span > num_generators = 0;< / div >
< div class = "line" > < a name = "l00717" > < / a > < span class = "lineno" > 717< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < generators-> size(); ++i) {< / div >
< div class = "line" > < a name = "l00718" > < / a > < span class = "lineno" > 718< / span >   < a class = "code" href = "classoperations__research_1_1_sparse_permutation.html" > SparsePermutation< / a > * permutation = (*generators)[i].get();< / div >
< div class = "line" > < a name = "l00719" > < / a > < span class = "lineno" > 719< / span >   std::vector< int> to_delete;< / div >
< div class = "line" > < a name = "l00720" > < / a > < span class = "lineno" > 720< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > j = 0; j < permutation-> < a class = "code" href = "classoperations__research_1_1_sparse_permutation.html#a8c5fc5af6e649a82d169f61e4dab5e33" > NumCycles< / a > (); ++j) {< / div >
< div class = "line" > < a name = "l00721" > < / a > < span class = "lineno" > 721< / span >   < span class = "keywordflow" > if< / span > (*(permutation-> < a class = "code" href = "classoperations__research_1_1_sparse_permutation.html#af567b4e287e268eb9ecee908f63e5b64" > Cycle< / a > (j).< a class = "code" href = "structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a8497b34029ee966694083aa34c9022b5" > begin< / a > ()) > = 2 * problem.num_variables()) {< / div >
< div class = "line" > < a name = "l00722" > < / a > < span class = "lineno" > 722< / span >   to_delete.push_back(j);< / div >
< div class = "line" > < a name = "l00723" > < / a > < span class = "lineno" > 723< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "macros_8h.html#a7f536a3b33f9bed8f75734e035d30725" > DEBUG_MODE< / a > ) {< / div >
< div class = "line" > < a name = "l00724" > < / a > < span class = "lineno" > 724< / span >   < span class = "comment" > // Verify that the cycle' s entire support does not touch any variable.< / span > < / div >
< div class = "line" > < a name = "l00725" > < / a > < span class = "lineno" > 725< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > node : permutation-> < a class = "code" href = "classoperations__research_1_1_sparse_permutation.html#af567b4e287e268eb9ecee908f63e5b64" > Cycle< / a > (j)) {< / div >
< div class = "line" > < a name = "l00726" > < / a > < span class = "lineno" > 726< / span >   < a class = "code" href = "base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295" > DCHECK_GE< / a > (node, 2 * problem.num_variables());< / div >
< div class = "line" > < a name = "l00727" > < / a > < span class = "lineno" > 727< / span >   }< / div >
< div class = "line" > < a name = "l00728" > < / a > < span class = "lineno" > 728< / span >   }< / div >
< div class = "line" > < a name = "l00729" > < / a > < span class = "lineno" > 729< / span >   }< / div >
< div class = "line" > < a name = "l00730" > < / a > < span class = "lineno" > 730< / span >   }< / div >
< div class = "line" > < a name = "l00731" > < / a > < span class = "lineno" > 731< / span >   permutation-> < a class = "code" href = "classoperations__research_1_1_sparse_permutation.html#a9add43490c45e4334099bb15b6e6eab0" > RemoveCycles< / a > (to_delete);< / div >
< div class = "line" > < a name = "l00732" > < / a > < span class = "lineno" > 732< / span >   < span class = "keywordflow" > if< / span > (!permutation-> < a class = "code" href = "classoperations__research_1_1_sparse_permutation.html#ab601acb5aed920b1e61210d497462976" > Support< / a > ().empty()) {< / div >
< div class = "line" > < a name = "l00733" > < / a > < span class = "lineno" > 733< / span >   average_support_size += permutation-> < a class = "code" href = "classoperations__research_1_1_sparse_permutation.html#ab601acb5aed920b1e61210d497462976" > Support< / a > ().size();< / div >
< div class = "line" > < a name = "l00734" > < / a > < span class = "lineno" > 734< / span >   < a class = "code" href = "namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2" > swap< / a > ((*generators)[num_generators], (*generators)[i]);< / div >
< div class = "line" > < a name = "l00735" > < / a > < span class = "lineno" > 735< / span >   ++num_generators;< / div >
< div class = "line" > < a name = "l00736" > < / a > < span class = "lineno" > 736< / span >   }< / div >
< div class = "line" > < a name = "l00737" > < / a > < span class = "lineno" > 737< / span >   }< / div >
< div class = "line" > < a name = "l00738" > < / a > < span class = "lineno" > 738< / span >   generators-> resize(num_generators);< / div >
< div class = "line" > < a name = "l00739" > < / a > < span class = "lineno" > 739< / span >   average_support_size /= num_generators;< / div >
< div class = "line" > < a name = "l00740" > < / a > < span class = "lineno" > 740< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > ) < < < span class = "stringliteral" > " # of generators: " < / span > < < num_generators;< / div >
< div class = "line" > < a name = "l00741" > < / a > < span class = "lineno" > 741< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > ) < < < span class = "stringliteral" > " Average support size: " < / span > < < average_support_size;< / div >
< div class = "line" > < a name = "l00742" > < / a > < span class = "lineno" > 742< / span >   }< / div >
< div class = "line" > < a name = "l00743" > < / a > < span class = "lineno" > 743< / span >   < / div >
< div class = "line" > < a name = "l00744" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#aa9848f5a312eda3dad1aa59ed96e2519" > 744< / a > < / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#aa9848f5a312eda3dad1aa59ed96e2519" > ApplyLiteralMappingToBooleanProblem< / a > (< / div >
< div class = "line" > < a name = "l00745" > < / a > < span class = "lineno" > 745< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classabsl_1_1_strong_vector.html" > absl::StrongVector< LiteralIndex, LiteralIndex> < / a > & mapping,< / div >
< div class = "line" > < a name = "l00746" > < / a > < span class = "lineno" > 746< / span >   LinearBooleanProblem* problem) {< / div >
< div class = "line" > < a name = "l00747" > < / a > < span class = "lineno" > 747< / span >   Coefficient bound_shift;< / div >
< div class = "line" > < a name = "l00748" > < / a > < span class = "lineno" > 748< / span >   Coefficient max_value;< / div >
< div class = "line" > < a name = "l00749" > < / a > < span class = "lineno" > 749< / span >   std::vector< LiteralWithCoeff> cst;< / div >
< div class = "line" > < a name = "l00750" > < / a > < span class = "lineno" > 750< / span >   < / div >
< div class = "line" > < a name = "l00751" > < / a > < span class = "lineno" > 751< / span >   < span class = "comment" > // First the objective.< / span > < / div >
< div class = "line" > < a name = "l00752" > < / a > < span class = "lineno" > 752< / span >   cst = ConvertLinearExpression(problem-> objective());< / div >
< div class = "line" > < a name = "l00753" > < / a > < span class = "lineno" > 753< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#a562245e719610d5969ca1b4b1b310c9d" > ApplyLiteralMapping< / a > (mapping, & cst, & bound_shift, & max_value);< / div >
< div class = "line" > < a name = "l00754" > < / a > < span class = "lineno" > 754< / span >   LinearObjective* mutable_objective = problem-> mutable_objective();< / div >
< div class = "line" > < a name = "l00755" > < / a > < span class = "lineno" > 755< / span >   mutable_objective-> clear_literals();< / div >
< div class = "line" > < a name = "l00756" > < / a > < span class = "lineno" > 756< / span >   mutable_objective-> clear_coefficients();< / div >
< div class = "line" > < a name = "l00757" > < / a > < span class = "lineno" > 757< / span >   mutable_objective-> set_offset(mutable_objective-> offset() -< / div >
< div class = "line" > < a name = "l00758" > < / a > < span class = "lineno" > 758< / span >   bound_shift.value());< / div >
< div class = "line" > < a name = "l00759" > < / a > < span class = "lineno" > 759< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code" href = "structoperations__research_1_1sat_1_1_literal_with_coeff.html" > LiteralWithCoeff< / a > & entry : cst) {< / div >
< div class = "line" > < a name = "l00760" > < / a > < span class = "lineno" > 760< / span >   mutable_objective-> add_literals(entry.literal.SignedValue());< / div >
< div class = "line" > < a name = "l00761" > < / a > < span class = "lineno" > 761< / span >   mutable_objective-> add_coefficients(entry.coefficient.value());< / div >
< div class = "line" > < a name = "l00762" > < / a > < span class = "lineno" > 762< / span >   }< / div >
< div class = "line" > < a name = "l00763" > < / a > < span class = "lineno" > 763< / span >   < / div >
< div class = "line" > < a name = "l00764" > < / a > < span class = "lineno" > 764< / span >   < span class = "comment" > // Now the clauses.< / span > < / div >
< div class = "line" > < a name = "l00765" > < / a > < span class = "lineno" > 765< / span >   < span class = "keywordflow" > for< / span > (LinearBooleanConstraint& constraint : *problem-> mutable_constraints()) {< / div >
< div class = "line" > < a name = "l00766" > < / a > < span class = "lineno" > 766< / span >   cst = ConvertLinearExpression(constraint);< / div >
< div class = "line" > < a name = "l00767" > < / a > < span class = "lineno" > 767< / span >   constraint.clear_literals();< / div >
< div class = "line" > < a name = "l00768" > < / a > < span class = "lineno" > 768< / span >   constraint.clear_coefficients();< / div >
< div class = "line" > < a name = "l00769" > < / a > < span class = "lineno" > 769< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#a562245e719610d5969ca1b4b1b310c9d" > ApplyLiteralMapping< / a > (mapping, & cst, & bound_shift, & max_value);< / div >
< div class = "line" > < a name = "l00770" > < / a > < span class = "lineno" > 770< / span >   < / div >
< div class = "line" > < a name = "l00771" > < / a > < span class = "lineno" > 771< / span >   < span class = "comment" > // Add bound_shift to the bounds and remove a bound if it is now trivial.< / span > < / div >
< div class = "line" > < a name = "l00772" > < / a > < span class = "lineno" > 772< / span >   < span class = "keywordflow" > if< / span > (constraint.has_upper_bound()) {< / div >
< div class = "line" > < a name = "l00773" > < / a > < span class = "lineno" > 773< / span >   constraint.set_upper_bound(constraint.upper_bound() +< / div >
< div class = "line" > < a name = "l00774" > < / a > < span class = "lineno" > 774< / span >   bound_shift.value());< / div >
< div class = "line" > < a name = "l00775" > < / a > < span class = "lineno" > 775< / span >   < span class = "keywordflow" > if< / span > (max_value < = constraint.upper_bound()) {< / div >
< div class = "line" > < a name = "l00776" > < / a > < span class = "lineno" > 776< / span >   constraint.clear_upper_bound();< / div >
< div class = "line" > < a name = "l00777" > < / a > < span class = "lineno" > 777< / span >   }< / div >
< div class = "line" > < a name = "l00778" > < / a > < span class = "lineno" > 778< / span >   }< / div >
< div class = "line" > < a name = "l00779" > < / a > < span class = "lineno" > 779< / span >   < span class = "keywordflow" > if< / span > (constraint.has_lower_bound()) {< / div >
< div class = "line" > < a name = "l00780" > < / a > < span class = "lineno" > 780< / span >   constraint.set_lower_bound(constraint.lower_bound() +< / div >
< div class = "line" > < a name = "l00781" > < / a > < span class = "lineno" > 781< / span >   bound_shift.value());< / div >
< div class = "line" > < a name = "l00782" > < / a > < span class = "lineno" > 782< / span >   < span class = "comment" > // This is because ApplyLiteralMapping make all coefficient positive.< / span > < / div >
< div class = "line" > < a name = "l00783" > < / a > < span class = "lineno" > 783< / span >   < span class = "keywordflow" > if< / span > (constraint.lower_bound() < = 0) {< / div >
< div class = "line" > < a name = "l00784" > < / a > < span class = "lineno" > 784< / span >   constraint.clear_lower_bound();< / div >
< div class = "line" > < a name = "l00785" > < / a > < span class = "lineno" > 785< / span >   }< / div >
< div class = "line" > < a name = "l00786" > < / a > < span class = "lineno" > 786< / span >   }< / div >
< div class = "line" > < a name = "l00787" > < / a > < span class = "lineno" > 787< / span >   < / div >
< div class = "line" > < a name = "l00788" > < / a > < span class = "lineno" > 788< / span >   < span class = "comment" > // If the constraint is always true, we just leave it empty.< / span > < / div >
< div class = "line" > < a name = "l00789" > < / a > < span class = "lineno" > 789< / span >   < span class = "keywordflow" > if< / span > (constraint.has_lower_bound() || constraint.has_upper_bound()) {< / div >
< div class = "line" > < a name = "l00790" > < / a > < span class = "lineno" > 790< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code" href = "structoperations__research_1_1sat_1_1_literal_with_coeff.html" > LiteralWithCoeff< / a > & entry : cst) {< / div >
< div class = "line" > < a name = "l00791" > < / a > < span class = "lineno" > 791< / span >   constraint.add_literals(entry.literal.SignedValue());< / div >
< div class = "line" > < a name = "l00792" > < / a > < span class = "lineno" > 792< / span >   constraint.add_coefficients(entry.coefficient.value());< / div >
< div class = "line" > < a name = "l00793" > < / a > < span class = "lineno" > 793< / span >   }< / div >
< div class = "line" > < a name = "l00794" > < / a > < span class = "lineno" > 794< / span >   }< / div >
< div class = "line" > < a name = "l00795" > < / a > < span class = "lineno" > 795< / span >   }< / div >
< div class = "line" > < a name = "l00796" > < / a > < span class = "lineno" > 796< / span >   < / div >
< div class = "line" > < a name = "l00797" > < / a > < span class = "lineno" > 797< / span >   < span class = "comment" > // Remove empty constraints.< / span > < / div >
< div class = "line" > < a name = "l00798" > < / a > < span class = "lineno" > 798< / span >   < span class = "keywordtype" > int< / span > new_index = 0;< / div >
< div class = "line" > < a name = "l00799" > < / a > < span class = "lineno" > 799< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_constraints = problem-> constraints_size();< / div >
< div class = "line" > < a name = "l00800" > < / a > < span class = "lineno" > 800< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < num_constraints; ++i) {< / div >
< div class = "line" > < a name = "l00801" > < / a > < span class = "lineno" > 801< / span >   < span class = "keywordflow" > if< / span > (!(problem-> constraints(i).literals_size() == 0)) {< / div >
< div class = "line" > < a name = "l00802" > < / a > < span class = "lineno" > 802< / span >   problem-> mutable_constraints()-> SwapElements(i, new_index);< / div >
< div class = "line" > < a name = "l00803" > < / a > < span class = "lineno" > 803< / span >   ++new_index;< / div >
< div class = "line" > < a name = "l00804" > < / a > < span class = "lineno" > 804< / span >   }< / div >
< div class = "line" > < a name = "l00805" > < / a > < span class = "lineno" > 805< / span >   }< / div >
< div class = "line" > < a name = "l00806" > < / a > < span class = "lineno" > 806< / span >   problem-> mutable_constraints()-> DeleteSubrange(new_index,< / div >
< div class = "line" > < a name = "l00807" > < / a > < span class = "lineno" > 807< / span >   num_constraints - new_index);< / div >
< div class = "line" > < a name = "l00808" > < / a > < span class = "lineno" > 808< / span >   < / div >
< div class = "line" > < a name = "l00809" > < / a > < span class = "lineno" > 809< / span >   < span class = "comment" > // Computes the new number of variables and set it.< / span > < / div >
< div class = "line" > < a name = "l00810" > < / a > < span class = "lineno" > 810< / span >   < span class = "keywordtype" > int< / span > num_vars = 0;< / div >
< div class = "line" > < a name = "l00811" > < / a > < span class = "lineno" > 811< / span >   < span class = "keywordflow" > for< / span > (LiteralIndex < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > : mapping) {< / div >
< div class = "line" > < a name = "l00812" > < / a > < span class = "lineno" > 812< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > > = 0) {< / div >
< div class = "line" > < a name = "l00813" > < / a > < span class = "lineno" > 813< / span >   num_vars = < a class = "code" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > std::max< / a > (num_vars, < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > (< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ).Variable().< a class = "code" href = "demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514" > value< / a > () + 1);< / div >
< div class = "line" > < a name = "l00814" > < / a > < span class = "lineno" > 814< / span >   }< / div >
< div class = "line" > < a name = "l00815" > < / a > < span class = "lineno" > 815< / span >   }< / div >
< div class = "line" > < a name = "l00816" > < / a > < span class = "lineno" > 816< / span >   problem-> set_num_variables(num_vars);< / div >
< div class = "line" > < a name = "l00817" > < / a > < span class = "lineno" > 817< / span >   < / div >
< div class = "line" > < a name = "l00818" > < / a > < span class = "lineno" > 818< / span >   < span class = "comment" > // TODO(user): The names is currently all scrambled. Do something about it< / span > < / div >
< div class = "line" > < a name = "l00819" > < / a > < span class = "lineno" > 819< / span >   < span class = "comment" > // so that non-fixed variables keep their names.< / span > < / div >
< div class = "line" > < a name = "l00820" > < / a > < span class = "lineno" > 820< / span >   problem-> mutable_var_names()-> DeleteSubrange(< / div >
< div class = "line" > < a name = "l00821" > < / a > < span class = "lineno" > 821< / span >   num_vars, problem-> var_names_size() - num_vars);< / div >
< div class = "line" > < a name = "l00822" > < / a > < span class = "lineno" > 822< / span >   }< / div >
< div class = "line" > < a name = "l00823" > < / a > < span class = "lineno" > 823< / span >   < / div >
< div class = "line" > < a name = "l00824" > < / a > < span class = "lineno" > 824< / span >   < span class = "comment" > // A simple preprocessing step that does basic probing and removes the< / span > < / div >
< div class = "line" > < a name = "l00825" > < / a > < span class = "lineno" > 825< / span >   < span class = "comment" > // equivalent literals.< / span > < / div >
< div class = "line" > < a name = "l00826" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#ab55a8cd2852ff07c9900f5cff231b329" > 826< / a > < / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#ab55a8cd2852ff07c9900f5cff231b329" > ProbeAndSimplifyProblem< / a > (< a class = "code" href = "classoperations__research_1_1sat_1_1_sat_postsolver.html" > SatPostsolver< / a > * postsolver,< / div >
< div class = "line" > < a name = "l00827" > < / a > < span class = "lineno" > 827< / span >   LinearBooleanProblem* problem) {< / div >
< div class = "line" > < a name = "l00828" > < / a > < span class = "lineno" > 828< / span >   < span class = "comment" > // TODO(user): expose the number of iterations as a parameter.< / span > < / div >
< div class = "line" > < a name = "l00829" > < / a > < span class = "lineno" > 829< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > iter = 0; iter < 6; ++iter) {< / div >
< div class = "line" > < a name = "l00830" > < / a > < span class = "lineno" > 830< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > solver;< / div >
< div class = "line" > < a name = "l00831" > < / a > < span class = "lineno" > 831< / span >   < span class = "keywordflow" > if< / span > (!< a class = "code" href = "namespaceoperations__research_1_1sat.html#add13e122d8861d6cac9b9bb4a51cfcb7" > LoadBooleanProblem< / a > (*problem, & solver)) {< / div >
< div class = "line" > < a name = "l00832" > < / a > < span class = "lineno" > 832< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > ) < < < span class = "stringliteral" > " UNSAT when loading the problem." < / span > ;< / div >
< div class = "line" > < a name = "l00833" > < / a > < span class = "lineno" > 833< / span >   }< / div >
< div class = "line" > < a name = "l00834" > < / a > < span class = "lineno" > 834< / span >   < / div >
< div class = "line" > < a name = "l00835" > < / a > < span class = "lineno" > 835< / span >   < a class = "code" href = "classabsl_1_1_strong_vector.html" > absl::StrongVector< LiteralIndex, LiteralIndex> < / a > equiv_map;< / div >
< div class = "line" > < a name = "l00836" > < / a > < span class = "lineno" > 836< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#ac75d30c113a2b2628f0d77e403467815" > ProbeAndFindEquivalentLiteral< / a > (& solver, postsolver, < span class = "comment" > /*drat_writer=*/< / span > < span class = "keyword" > nullptr< / span > ,< / div >
< div class = "line" > < a name = "l00837" > < / a > < span class = "lineno" > 837< / span >   & equiv_map);< / div >
< div class = "line" > < a name = "l00838" > < / a > < span class = "lineno" > 838< / span >   < / div >
< div class = "line" > < a name = "l00839" > < / a > < span class = "lineno" > 839< / span >   < span class = "comment" > // We can abort if no information is learned.< / span > < / div >
< div class = "line" > < a name = "l00840" > < / a > < span class = "lineno" > 840< / span >   < span class = "keywordflow" > if< / span > (equiv_map.< a class = "code" href = "classabsl_1_1_strong_vector.html#a644718bb2fb240de962dc3c9a1fdf0dc" > empty< / a > () & & solver.< a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a01fd4c9f5286534866c6c5ee2c160fe9" > LiteralTrail< / a > ().< a class = "code" href = "classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179" > Index< / a > () == 0) < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l00841" > < / a > < span class = "lineno" > 841< / span >   < / div >
< div class = "line" > < a name = "l00842" > < / a > < span class = "lineno" > 842< / span >   < span class = "keywordflow" > if< / span > (equiv_map.< a class = "code" href = "classabsl_1_1_strong_vector.html#a644718bb2fb240de962dc3c9a1fdf0dc" > empty< / a > ()) {< / div >
< div class = "line" > < a name = "l00843" > < / a > < span class = "lineno" > 843< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_literals = 2 * solver.< a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2" > NumVariables< / a > ();< / div >
< div class = "line" > < a name = "l00844" > < / a > < span class = "lineno" > 844< / span >   < span class = "keywordflow" > for< / span > (LiteralIndex < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > (0); < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > < num_literals; ++< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ) {< / div >
< div class = "line" > < a name = "l00845" > < / a > < span class = "lineno" > 845< / span >   equiv_map.< a class = "code" href = "classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b" > push_back< / a > (< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > );< / div >
< div class = "line" > < a name = "l00846" > < / a > < span class = "lineno" > 846< / span >   }< / div >
< div class = "line" > < a name = "l00847" > < / a > < span class = "lineno" > 847< / span >   }< / div >
< div class = "line" > < a name = "l00848" > < / a > < span class = "lineno" > 848< / span >   < / div >
< div class = "line" > < a name = "l00849" > < / a > < span class = "lineno" > 849< / span >   < span class = "comment" > // Fix fixed variables in the equivalence map and in the postsolver.< / span > < / div >
< div class = "line" > < a name = "l00850" > < / a > < span class = "lineno" > 850< / span >   solver.< a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l00851" > < / a > < span class = "lineno" > 851< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < solver.< a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a01fd4c9f5286534866c6c5ee2c160fe9" > LiteralTrail< / a > ().< a class = "code" href = "namespaceoperations__research_1_1glop.html#ac89c7b45754e9a6bdabc08bea586fc4e" > Index< / a > (); ++i) {< / div >
< div class = "line" > < a name = "l00852" > < / a > < span class = "lineno" > 852< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > l = solver.< a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a01fd4c9f5286534866c6c5ee2c160fe9" > LiteralTrail< / a > ()[i];< / div >
< div class = "line" > < a name = "l00853" > < / a > < span class = "lineno" > 853< / span >   equiv_map[l.< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62" > Index< / a > ()] = < a class = "code" href = "namespaceoperations__research_1_1sat.html#a7ab45c5256e605ee3da3bf3abd1df2e1" > kTrueLiteralIndex< / a > ;< / div >
< div class = "line" > < a name = "l00854" > < / a > < span class = "lineno" > 854< / span >   equiv_map[l.< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7" > NegatedIndex< / a > ()] = < a class = "code" href = "namespaceoperations__research_1_1sat.html#a969b5056550d96847f8c35f19fd17f50" > kFalseLiteralIndex< / a > ;< / div >
< div class = "line" > < a name = "l00855" > < / a > < span class = "lineno" > 855< / span >   postsolver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_postsolver.html#a40432775821777983c4df6b4f2a71d92" > FixVariable< / a > (l);< / div >
< div class = "line" > < a name = "l00856" > < / a > < span class = "lineno" > 856< / span >   }< / div >
< div class = "line" > < a name = "l00857" > < / a > < span class = "lineno" > 857< / span >   < / div >
< div class = "line" > < a name = "l00858" > < / a > < span class = "lineno" > 858< / span >   < span class = "comment" > // Remap the variables into a dense set. All the variables for which the< / span > < / div >
< div class = "line" > < a name = "l00859" > < / a > < span class = "lineno" > 859< / span >   < span class = "comment" > // equiv_map is not the identity are no longer needed.< / span > < / div >
< div class = "line" > < a name = "l00860" > < / a > < span class = "lineno" > 860< / span >   BooleanVariable new_var(0);< / div >
< div class = "line" > < a name = "l00861" > < / a > < span class = "lineno" > 861< / span >   < a class = "code" href = "classabsl_1_1_strong_vector.html" > absl::StrongVector< BooleanVariable, BooleanVariable> < / a > var_map;< / div >
< div class = "line" > < a name = "l00862" > < / a > < span class = "lineno" > 862< / span >   < span class = "keywordflow" > for< / span > (BooleanVariable < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > (0); < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > < solver.< a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2" > NumVariables< / a > (); ++< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ) {< / div >
< div class = "line" > < a name = "l00863" > < / a > < span class = "lineno" > 863< / span >   < span class = "keywordflow" > if< / span > (equiv_map[< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > (< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > , < span class = "keyword" > true< / span > ).< a class = "code" href = "namespaceoperations__research_1_1glop.html#ac89c7b45754e9a6bdabc08bea586fc4e" > Index< / a > ()] == < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > (< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > , < span class = "keyword" > true< / span > ).< a class = "code" href = "namespaceoperations__research_1_1glop.html#ac89c7b45754e9a6bdabc08bea586fc4e" > Index< / a > ()) {< / div >
< div class = "line" > < a name = "l00864" > < / a > < span class = "lineno" > 864< / span >   var_map.< a class = "code" href = "classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b" > push_back< / a > (new_var);< / div >
< div class = "line" > < a name = "l00865" > < / a > < span class = "lineno" > 865< / span >   ++new_var;< / div >
< div class = "line" > < a name = "l00866" > < / a > < span class = "lineno" > 866< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00867" > < / a > < span class = "lineno" > 867< / span >   var_map.< a class = "code" href = "classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b" > push_back< / a > (BooleanVariable(-1));< / div >
< div class = "line" > < a name = "l00868" > < / a > < span class = "lineno" > 868< / span >   }< / div >
< div class = "line" > < a name = "l00869" > < / a > < span class = "lineno" > 869< / span >   }< / div >
< div class = "line" > < a name = "l00870" > < / a > < span class = "lineno" > 870< / span >   < / div >
< div class = "line" > < a name = "l00871" > < / a > < span class = "lineno" > 871< / span >   < span class = "comment" > // Apply the variable mapping.< / span > < / div >
< div class = "line" > < a name = "l00872" > < / a > < span class = "lineno" > 872< / span >   postsolver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_postsolver.html#a8155216960c6e1f5d476e1c28b2d34fa" > ApplyMapping< / a > (var_map);< / div >
< div class = "line" > < a name = "l00873" > < / a > < span class = "lineno" > 873< / span >   < span class = "keywordflow" > for< / span > (LiteralIndex < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > (0); < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > < equiv_map.< a class = "code" href = "classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86" > size< / a > (); ++< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ) {< / div >
< div class = "line" > < a name = "l00874" > < / a > < span class = "lineno" > 874< / span >   < span class = "keywordflow" > if< / span > (equiv_map[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ] > = 0) {< / div >
< div class = "line" > < a name = "l00875" > < / a > < span class = "lineno" > 875< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > l(equiv_map[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ]);< / div >
< div class = "line" > < a name = "l00876" > < / a > < span class = "lineno" > 876< / span >   < span class = "keyword" > const< / span > BooleanVariable image = var_map[l.< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8" > Variable< / a > ()];< / div >
< div class = "line" > < a name = "l00877" > < / a > < span class = "lineno" > 877< / span >   < a class = "code" href = "base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb" > CHECK_NE< / a > (image, BooleanVariable(-1));< / div >
< div class = "line" > < a name = "l00878" > < / a > < span class = "lineno" > 878< / span >   equiv_map[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ] = < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > (image, l.< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#ab76ca9049d6f3f1948d7120a98765107" > IsPositive< / a > ()).< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62" > Index< / a > ();< / div >
< div class = "line" > < a name = "l00879" > < / a > < span class = "lineno" > 879< / span >   }< / div >
< div class = "line" > < a name = "l00880" > < / a > < span class = "lineno" > 880< / span >   }< / div >
< div class = "line" > < a name = "l00881" > < / a > < span class = "lineno" > 881< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#aa9848f5a312eda3dad1aa59ed96e2519" > ApplyLiteralMappingToBooleanProblem< / a > (equiv_map, problem);< / div >
< div class = "line" > < a name = "l00882" > < / a > < span class = "lineno" > 882< / span >   }< / div >
< div class = "line" > < a name = "l00883" > < / a > < span class = "lineno" > 883< / span >   }< / div >
< div class = "line" > < a name = "l00884" > < / a > < span class = "lineno" > 884< / span >   < / div >
< div class = "line" > < a name = "l00885" > < / a > < span class = "lineno" > 885< / span >   } < span class = "comment" > // namespace sat< / span > < / div >
< div class = "line" > < a name = "l00886" > < / a > < span class = "lineno" > 886< / span >   } < span class = "comment" > // namespace operations_research< / span > < / div >
< div class = "ttc" id = "aalldiff__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 = "aalldiff__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 >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "abase_2logging_8h_html" > < div class = "ttname" > < a href = "base_2logging_8h.html" > logging.h< / a > < / div > < / div >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "abase_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#l00498" > base/logging.h:498< / a > < / div > < / div >
< div class = "ttc" id = "abase_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#l00708" > base/logging.h:708< / a > < / div > < / div >
< div class = "ttc" id = "abase_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#l00705" > base/logging.h:705< / a > < / div > < / div >
< div class = "ttc" id = "abase_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#l00042" > base/logging.h:42< / a > < / div > < / div >
< div class = "ttc" id = "abase_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#l00897" > base/logging.h:897< / a > < / div > < / div >
< div class = "ttc" id = "abase_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#l00706" > base/logging.h:706< / a > < / div > < / div >
< div class = "ttc" id = "abase_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#l00423" > base/logging.h:423< / a > < / div > < / div >
< div class = "ttc" id = "abase_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#l00893" > base/logging.h:893< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aboolean__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, " " , " If this flag is non-empty, an undirected graph whose" " automorphism group is in one-to-one correspondence with the" " symmetries of the SAT problem will be dumped to a file every" " time FindLinearBooleanProblemSymmetries() is called." )< / div > < / div >
< div class = "ttc" id = "aboolean__problem_8h_html" > < div class = "ttname" > < a href = "boolean__problem_8h.html" > boolean_problem.h< / a > < / div > < / div >
< div class = "ttc" id = "aclassabsl_1_1_strong_vector_html" > < div class = "ttname" > < a href = "classabsl_1_1_strong_vector.html" > absl::StrongVector< LiteralIndex, LiteralIndex > < / a > < / div > < / div >
2020-12-07 17:47:46 +01:00
< div class = "ttc" id = "aclassabsl_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 >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aclassabsl_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 = "aclassabsl_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 & 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 = "aclassoperations__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 >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "aclassoperations__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< int > *node_equivalence_classes_io, std::vector< std::unique_ptr< SparsePermutation > > *generators, std::vector< int > *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 >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aclassoperations__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 = "aclassoperations__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 = "aclassoperations__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< int > & 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 = "aclassoperations__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< int > & 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 = "aclassoperations__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 >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "aclassoperations__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 = "aclassoperations__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 >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aclassoperations__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< LiteralWithCoeff > *cst)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "pb__constraint_8cc_source.html#l00201" > pb_constraint.cc:201< / a > < / div > < / div >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "aclassoperations__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 = "aclassoperations__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< LiteralWithCoeff > & 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 = "aclassoperations__research_1_1sat_1_1_literal_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_literal.html" > operations_research::sat::Literal< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__base_8h_source.html#l00065" > sat_base.h:65< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__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#l00086" > sat_base.h:86< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__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#l00088" > sat_base.h:88< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__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#l00085" > sat_base.h:85< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__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#l00081" > sat_base.h:81< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__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#l00094" > sat_base.h:94< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_literal_html_a886e9c024f7209181c0a850b6e90c644" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644" > operations_research::sat::Literal::Negated< / a > < / div > < div class = "ttdeci" > Literal Negated() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__base_8h_source.html#l00092" > sat_base.h:92< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__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#l00082" > sat_base.h:82< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__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 = "aclassoperations__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#l00058" > simplification.cc:58< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__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< BooleanVariable, BooleanVariable > & mapping)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "simplification_8cc_source.html#l00063" > simplification.cc:63< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html" > operations_research::sat::SatSolver< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00058" > sat_solver.h:58< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__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 & 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 = "aclassoperations__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< LiteralWithCoeff > *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 = "aclassoperations__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 = "aclassoperations__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 & 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 = "aclassoperations__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 = "aclassoperations__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 & 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 = "aclassoperations__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 = "aclassoperations__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 = "aclassoperations__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#l00379" > sat_base.h:379< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__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#l00123" > sat_base.h:123< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__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#l00159" > sat_base.h:159< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__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#l00151" > sat_base.h:151< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__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#l00166" > sat_base.h:166< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__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#l00171" > sat_base.h:171< / a > < / div > < / div >
< div class = "ttc" id = "aclassutil_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#l00398" > graph.h:398< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "acommandlineflags_8h_html" > < div class = "ttname" > < a href = "commandlineflags_8h.html" > commandlineflags.h< / a > < / div > < / div >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "ademon__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 = "ademon__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 = "aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465" > < div class = "ttname" > < a href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > < / div > < div class = "ttdeci" > IntVar * var< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "expr__array_8cc_source.html#l01874" > expr_array.cc:1874< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "afind__graph__symmetries_8h_html" > < div class = "ttname" > < a href = "find__graph__symmetries_8h.html" > find_graph_symmetries.h< / a > < / div > < / div >
2020-09-01 16:00:33 +02:00
< div class = "ttc" id = "agraph_2util_8h_html" > < div class = "ttname" > < a href = "graph_2util_8h.html" > util.h< / a > < / div > < / div >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "agscip__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 = "agscip__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 >
2020-09-01 16:00:33 +02:00
< div class = "ttc" id = "ahash_8h_html" > < div class = "ttname" > < a href = "hash_8h.html" > hash.h< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aint__type_8h_html" > < div class = "ttname" > < a href = "int__type_8h.html" > int_type.h< / a > < / div > < / div >
< div class = "ttc" id = "aintegral__types_8h_html" > < div class = "ttname" > < a href = "integral__types_8h.html" > integral_types.h< / a > < / div > < / div >
< div class = "ttc" id = "aio_8h_html" > < div class = "ttname" > < a href = "io_8h.html" > io.h< / a > < / div > < / div >
< div class = "ttc" id = "alog__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 = "alog__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 = "amacros_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 = "amap__util_8h_html" > < div class = "ttname" > < a href = "map__util_8h.html" > map_util.h< / a > < / div > < / div >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "anamespacegtl_html_a7a0f8dc4187504b814d8a8be463b517c" > < div class = "ttname" > < a href = "namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c" > gtl::LookupOrInsert< / a > < / div > < div class = "ttdeci" > Collection::value_type::second_type & LookupOrInsert(Collection *const collection, const typename Collection::value_type::first_type & key, const typename Collection::value_type::second_type & 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 = "anamespaceoperations__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 = "anamespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2" > operations_research::math_opt::swap< / a > < / div > < div class = "ttdeci" > void swap(IdMap< K, V > & a, IdMap< K, V > & b)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "id__map_8h_source.html#l00263" > id_map.h:263< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__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 & 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 = "anamespaceoperations__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 & 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 = "anamespaceoperations__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 & problem, std::vector< int > *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 = "anamespaceoperations__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 & 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 >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "anamespaceoperations__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< LiteralIndex, LiteralIndex > & mapping, std::vector< LiteralWithCoeff > *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 >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "anamespaceoperations__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 & problem, const std::vector< int > & 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 = "anamespaceoperations__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 & 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 = "anamespaceoperations__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 & 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 = "anamespaceoperations__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 & problem, std::vector< std::unique_ptr< SparsePermutation > > *generators)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "boolean__problem_8cc_source.html#l00672" > boolean_problem.cc:672< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "anamespaceoperations__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 = "anamespaceoperations__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< LiteralWithCoeff > *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 = "anamespaceoperations__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 >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "anamespaceoperations__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 = "anamespaceoperations__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< LiteralIndex, LiteralIndex > & 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 = "anamespaceoperations__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 & problem, const std::vector< bool > & 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 = "anamespaceoperations__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 = "anamespaceoperations__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 = "anamespaceoperations__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 & problem, const std::vector< bool > & 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 = "anamespaceoperations__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< LiteralIndex, LiteralIndex > *mapping)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "simplification_8cc_source.html#l01130" > simplification.cc:1130< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__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 & 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 = "anamespaceoperations__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 = "anamespaceoperations__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 & 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 = "anamespaceoperations__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 & 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 = "anamespaceoperations__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 & problem, const SatSolver & solver, std::vector< bool > *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 = "anamespaceoperations__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 = "anamespaceoperations__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 & message)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "port_2proto__utils_8h_source.html#l00028" > port/proto_utils.h:28< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceutil_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#l02361" > graph.h:2361< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceutil_html_a45fca0c4762006176ad5622ec40dea9c" > < div class = "ttname" > < a href = "namespaceutil.html#a45fca0c4762006176ad5622ec40dea9c" > util::WriteGraphToFile< / a > < / div > < div class = "ttdeci" > absl::Status WriteGraphToFile(const Graph & graph, const std::string & filename, bool directed, const std::vector< int > & num_nodes_with_color)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "io_8h_source.html#l00235" > io.h:235< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceutil_html_aab5724a929530fa1d28749dc82852388" > < div class = "ttname" > < a href = "namespaceutil.html#aab5724a929530fa1d28749dc82852388" > util::RemapGraph< / a > < / div > < div class = "ttdeci" > std::unique_ptr< Graph > RemapGraph(const Graph & graph, const std::vector< int > & 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 = "aoptimization_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 = "apack_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 = "apack_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 >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aparser_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 = "aport_2proto__utils_8h_html" > < div class = "ttname" > < a href = "port_2proto__utils_8h.html" > proto_utils.h< / a > < / div > < / div >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "arouting__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#l00985" > routing_filters.cc:985< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "asat__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 = "astrong__vector_8h_html" > < div class = "ttname" > < a href = "strong__vector_8h.html" > strong_vector.h< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_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< int > ::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 >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "astructoperations__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 >
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" >
2021-01-26 11:28:50 +01:00
< img class = "footer" src = "doxygen.png" alt = "doxygen" / > < / a > 1.9.1 < / li >
2020-09-01 16:00:33 +02:00
< / ul >
< / div >
< / body >
< / html >
