679 lines
149 KiB
HTML
679 lines
149 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.3"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: encoding.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
|
|
 <span id="projectnumber">9.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('encoding_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">encoding.cc</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="encoding_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" 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 id="l00003" 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 id="l00004" 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 id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" 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 id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" 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 id="l00009" 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 id="l00010" 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 id="l00011" 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 id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include "<a class="code" href="encoding_8h.html">ortools/sat/encoding.h</a>"</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <deque></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <queue></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span> </div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</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 id="l00023" name="l00023"></a><span class="lineno"> 23</span> </div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> </div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a24ab1a268b54af8be091271be8d86236"> 27</a></span><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#afcc0ba7af448641ff70c751416efb4ae">EncodingNode::EncodingNode</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l)</div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> : depth_(0),</div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> lb_(0),</div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> ub_(1),</div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> for_sorting_(l.Variable()),</div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> child_a_(nullptr),</div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> child_b_(nullptr),</div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> literals_(1, l) {}</div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> </div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6e81565ea8f030c21126024751b8d4be"> 36</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6e81565ea8f030c21126024751b8d4be">EncodingNode::InitializeFullNode</a>(<span class="keywordtype">int</span> n, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>,</div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver) {</div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(literals_.empty()) << <span class="stringliteral">"Already initialized"</span>;</div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <a class="code hl_define" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(n, 0);</div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keyword">const</span> BooleanVariable first_var_index(solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2">NumVariables</a>());</div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb">SetNumVariables</a>(solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2">NumVariables</a>() + n);</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; ++i) {</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> literals_.push_back(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(first_var_index + i, <span class="keyword">true</span>));</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keywordflow">if</span> (i > 0) {</div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(i - 1), <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(i).Negated());</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> }</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> }</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> lb_ = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->lb_ + <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->lb_;</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> ub_ = lb_ + n;</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> depth_ = 1 + <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->depth_, <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->depth_);</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> child_a_ = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>;</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> child_b_ = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>;</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> for_sorting_ = first_var_index;</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span>}</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> </div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6bea440eb7f63954ecf88b597d182ecb"> 56</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6bea440eb7f63954ecf88b597d182ecb">EncodingNode::InitializeLazyNode</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>,</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver) {</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(literals_.empty()) << <span class="stringliteral">"Already initialized"</span>;</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keyword">const</span> BooleanVariable first_var_index(solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2">NumVariables</a>());</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb">SetNumVariables</a>(solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2">NumVariables</a>() + 1);</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> literals_.emplace_back(first_var_index, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> child_a_ = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>;</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> child_b_ = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>;</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> ub_ = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->ub_ + <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->ub_;</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> lb_ = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->lb_ + <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->lb_;</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> depth_ = 1 + <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->depth_, <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->depth_);</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> </div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// Merging the node of the same depth in order seems to help a bit.</span></div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> for_sorting_ = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->for_sorting_, <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->for_sorting_);</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span>}</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> </div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a29f3df8e348017bbeaab35d77a4b3fa8"> 72</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a29f3df8e348017bbeaab35d77a4b3fa8">EncodingNode::IncreaseCurrentUB</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver) {</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!literals_.empty());</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a4101c336fb4c5135ceef3ab532d755cd">current_ub</a>() == ub_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> literals_.emplace_back(BooleanVariable(solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2">NumVariables</a>()), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb">SetNumVariables</a>(solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2">NumVariables</a>() + 1);</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(literals_.back().Negated(),</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> literals_[literals_.size() - 2]);</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span>}</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> </div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a1fadb46d73a6b7e1b449e6070cfa697f"> 82</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a1fadb46d73a6b7e1b449e6070cfa697f">EncodingNode::Reduce</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>& solver) {</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordtype">int</span> i = 0;</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">while</span> (i < literals_.size() &&</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> solver.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(literals_[i])) {</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> ++i;</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> ++lb_;</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> literals_.erase(literals_.begin(), literals_.begin() + i);</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="keywordflow">while</span> (!literals_.empty() &&</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> solver.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(literals_.back())) {</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> literals_.pop_back();</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> ub_ = lb_ + literals_.size();</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> }</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordflow">return</span> i;</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span>}</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> </div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a59474db663a04e9b041c7683afd9bea1"> 98</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a59474db663a04e9b041c7683afd9bea1">EncodingNode::ApplyUpperBound</a>(int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver) {</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>() <= <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>; i < <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>(); ++i) {</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">AddUnitClause</a>(<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(i).<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>());</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> }</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> literals_.resize(<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> ub_ = lb_ + literals_.size();</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span>}</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> </div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a99e372550892ddd117f7a23e4fd73518"> 107</a></span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a99e372550892ddd117f7a23e4fd73518">LazyMerge</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver) {</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a> n;</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> n.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6bea440eb7f63954ecf88b597d182ecb">InitializeLazyNode</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, solver);</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->literal(0).Negated(), n.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(0));</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->literal(0).Negated(), n.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(0));</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0e8b0117614d340615ab66abec430d78">AddTernaryClause</a>(n.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(0).<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>(), <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->literal(0),</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->literal(0));</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keywordflow">return</span> n;</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span>}</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> </div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a6af701ea48c91ef8a59a67b5b8d355c2"> 117</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a6af701ea48c91ef8a59a67b5b8d355c2">IncreaseNodeSize</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* node, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver) {</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keywordflow">if</span> (!node-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a29f3df8e348017bbeaab35d77a4b3fa8">IncreaseCurrentUB</a>(solver)) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> std::vector<EncodingNode*> to_process;</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> to_process.push_back(node);</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> </div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// Only one side of the constraint is mandatory (the one propagating the ones</span></div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// to the top of the encoding tree), and it seems more efficient not to encode</span></div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// the other side.</span></div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// TODO(user): Experiment more.</span></div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> complete_encoding = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> </div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keywordflow">while</span> (!to_process.empty()) {</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* n = to_process.back();</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> = n-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#ab4a971df4b55922bdbff74843db10dd1">child_a</a>();</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = n-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a4534d0c2b93a62ca6b7b08ec4c8a1365">child_b</a>();</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> to_process.pop_back();</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> </div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="comment">// Note that since we were able to increase its size, n must have children.</span></div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="comment">// n->GreaterThan(target) is the new literal of n.</span></div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(n-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>(), 2);</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keyword">const</span> <span class="keywordtype">int</span> target = n-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a4101c336fb4c5135ceef3ab532d755cd">current_ub</a>() - 1;</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> </div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// Add a literal to a if needed.</span></div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="comment">// That is, now that the node n can go up to it new current_ub, if we need</span></div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// to increase the current_ub of a.</span></div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->current_ub() != <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->ub()) {</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->current_ub() - 1 + <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->lb(), target - 1);</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->current_ub() - 1 + <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->lb() < target) {</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->IncreaseCurrentUB(solver));</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> to_process.push_back(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>);</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> }</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> }</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> </div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// Add a literal to b if needed.</span></div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->current_ub() != <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->ub()) {</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->current_ub() - 1 + <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->lb(), target - 1);</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->current_ub() - 1 + <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->lb() < target) {</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->IncreaseCurrentUB(solver));</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> to_process.push_back(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> }</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> }</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> </div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="comment">// Wire the new literal of n correctly with its two children.</span></div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ia = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->lb(); ia < a->current_ub(); ++ia) {</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="keyword">const</span> <span class="keywordtype">int</span> ib = target - ia;</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="keywordflow">if</span> (complete_encoding && ib >= <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->lb() && ib < b->current_ub()) {</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="comment">// if x <= ia and y <= ib then x + y <= ia + ib.</span></div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0e8b0117614d340615ab66abec430d78">AddTernaryClause</a>(n-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#ad43b46262f3e4103bd59aae627925fdf">GreaterThan</a>(target).<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>(),</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->GreaterThan(ia), <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->GreaterThan(ib));</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> }</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="keywordflow">if</span> (complete_encoding && ib == <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->ub()) {</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(n-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#ad43b46262f3e4103bd59aae627925fdf">GreaterThan</a>(target).<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>(),</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->GreaterThan(ia));</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> }</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> </div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="keywordflow">if</span> (ib - 1 == <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->lb() - 1) {</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(n-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#ad43b46262f3e4103bd59aae627925fdf">GreaterThan</a>(target),</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->GreaterThan(ia).Negated());</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> }</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="keywordflow">if</span> ((ib - 1) >= <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->lb() && (ib - 1) < <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->current_ub()) {</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="comment">// if x > ia and y > ib - 1 then x + y > ia + ib.</span></div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0e8b0117614d340615ab66abec430d78">AddTernaryClause</a>(n-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#ad43b46262f3e4103bd59aae627925fdf">GreaterThan</a>(target),</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->GreaterThan(ia).Negated(),</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->GreaterThan(ib - 1).Negated());</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> }</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> }</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> </div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="comment">// Case ia = a->lb() - 1; a->GreaterThan(ia) always true.</span></div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> {</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="keyword">const</span> <span class="keywordtype">int</span> ib = target - (<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->lb() - 1);</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="keywordflow">if</span> ((ib - 1) == <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->lb() - 1) {</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">AddUnitClause</a>(n-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#ad43b46262f3e4103bd59aae627925fdf">GreaterThan</a>(target));</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> }</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="keywordflow">if</span> ((ib - 1) >= <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->lb() && (ib - 1) < <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->current_ub()) {</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(n-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#ad43b46262f3e4103bd59aae627925fdf">GreaterThan</a>(target),</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->GreaterThan(ib - 1).Negated());</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> }</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> }</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> </div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="comment">// case ia == a->ub; a->GreaterThan(ia) always false.</span></div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> {</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="keyword">const</span> <span class="keywordtype">int</span> ib = target - <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->ub();</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="keywordflow">if</span> (complete_encoding && ib >= <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->lb() && ib < <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->current_ub()) {</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(n-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#ad43b46262f3e4103bd59aae627925fdf">GreaterThan</a>(target).<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>(),</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->GreaterThan(ib));</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> }</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="keywordflow">if</span> (ib == <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->ub()) {</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">AddUnitClause</a>(n-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#ad43b46262f3e4103bd59aae627925fdf">GreaterThan</a>(target).<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>());</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> }</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> }</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> }</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span>}</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> </div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#aa357501e62925d41514301a6fd211c3e"> 213</a></span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aa357501e62925d41514301a6fd211c3e">FullMerge</a>(<a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>,</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver) {</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a> n;</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size =</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(<a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->size() + <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->size()), <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>).value();</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> n.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6e81565ea8f030c21126024751b8d4be">InitializeFullNode</a>(size, <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, solver);</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ia = 0; ia < <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->size(); ++ia) {</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="keywordflow">if</span> (ia + <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->size() < size) {</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(n.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(ia + <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->size()).<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>(),</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->literal(ia));</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> }</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="keywordflow">if</span> (ia < size) {</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(n.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(ia), <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->literal(ia).Negated());</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="comment">// Fix the variable to false because of the given upper_bound.</span></div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">AddUnitClause</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->literal(ia).Negated());</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> }</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> }</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ib = 0; ib < <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->size(); ++ib) {</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="keywordflow">if</span> (ib + <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->size() < size) {</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(n.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(ib + <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->size()).<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>(),</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->literal(ib));</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> }</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <span class="keywordflow">if</span> (ib < size) {</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(n.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(ib), <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->literal(ib).Negated());</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="comment">// Fix the variable to false because of the given upper_bound.</span></div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">AddUnitClause</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->literal(ib).Negated());</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> }</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> }</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ia = 0; ia < <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->size(); ++ia) {</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ib = 0; ib < <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->size(); ++ib) {</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="keywordflow">if</span> (ia + ib < size) {</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="comment">// if x <= ia and y <= ib, then x + y <= ia + ib.</span></div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0e8b0117614d340615ab66abec430d78">AddTernaryClause</a>(n.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(ia + ib).<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>(), <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->literal(ia),</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->literal(ib));</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> }</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="keywordflow">if</span> (ia + ib + 1 < size) {</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="comment">// if x > ia and y > ib, then x + y > ia + ib + 1.</span></div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0e8b0117614d340615ab66abec430d78">AddTernaryClause</a>(n.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(ia + ib + 1),</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->literal(ia).Negated(),</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->literal(ib).Negated());</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->literal(ia).Negated(),</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->literal(ib).Negated());</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> }</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> }</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> }</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <span class="keywordflow">return</span> n;</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span>}</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> </div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a29ff75f2188e0ac1c58fa4b0cf793a00"> 264</a></span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a29ff75f2188e0ac1c58fa4b0cf793a00">MergeAllNodesWithDeque</a>(<a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>,</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="keyword">const</span> std::vector<EncodingNode*>& <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>,</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver,</div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> std::deque<EncodingNode>* repository) {</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> std::deque<EncodingNode*> dq(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.begin(), <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.end());</div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="keywordflow">while</span> (dq.size() > 1) {</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> = dq.front();</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> dq.pop_front();</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = dq.front();</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> dq.pop_front();</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> repository->push_back(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aa357501e62925d41514301a6fd211c3e">FullMerge</a>(<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, solver));</div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> dq.push_back(&repository->back());</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> }</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="keywordflow">return</span> dq.front();</div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span>}</div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> </div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span><span class="keyword">struct </span>SortEncodingNodePointers {</div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="keywordtype">bool</span> operator()(EncodingNode* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, EncodingNode* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> *<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> < *<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>; }</div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span>};</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> </div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a58a0f80524e7d3e00ba0eb8e3ff27048"> 286</a></span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a58a0f80524e7d3e00ba0eb8e3ff27048">LazyMergeAllNodeWithPQ</a>(<span class="keyword">const</span> std::vector<EncodingNode*>& <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>,</div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver,</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> std::deque<EncodingNode>* repository) {</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> std::priority_queue<EncodingNode*, std::vector<EncodingNode*>,</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> SortEncodingNodePointers></div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> pq(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.begin(), <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.end());</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="keywordflow">while</span> (pq.size() > 1) {</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> = pq.top();</div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> pq.pop();</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = pq.top();</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> pq.pop();</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> repository->push_back(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a99e372550892ddd117f7a23e4fd73518">LazyMerge</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, solver));</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> pq.push(&repository->back());</div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> }</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <span class="keywordflow">return</span> pq.top();</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span>}</div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> </div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8"> 303</a></span>std::vector<EncodingNode*> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8">CreateInitialEncodingNodes</a>(</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> <span class="keyword">const</span> std::vector<Literal>& literals,</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> <span class="keyword">const</span> std::vector<Coefficient>& coeffs, <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>* offset,</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> std::deque<EncodingNode>* repository) {</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(literals.size(), coeffs.size());</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> *offset = 0;</div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> std::vector<EncodingNode*> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>;</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < literals.size(); ++i) {</div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="comment">// We want to maximize the cost when this literal is true.</span></div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="keywordflow">if</span> (coeffs[i] > 0) {</div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> repository->emplace_back(literals[i]);</div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.push_back(&repository->back());</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.back()->set_weight(coeffs[i]);</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> repository->emplace_back(literals[i].Negated());</div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.push_back(&repository->back());</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.back()->set_weight(-coeffs[i]);</div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> </div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> <span class="comment">// Note that this increase the offset since the coeff is negative.</span></div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> *offset -= coeffs[i];</div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> }</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> }</div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>;</div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span>}</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> </div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a49120b088df93ff6c25f3cf357fdab0e"> 328</a></span>std::vector<EncodingNode*> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8">CreateInitialEncodingNodes</a>(</div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_objective.html">LinearObjective</a>& objective_proto, <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>* offset,</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> std::deque<EncodingNode>* repository) {</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> *offset = 0;</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> std::vector<EncodingNode*> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>;</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < objective_proto.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#a72d41feda9a93c11089d3d99d6270999">literals_size</a>(); ++i) {</div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>(objective_proto.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#a7a8021e2b57fad24fac287b8e50fb27e">literals</a>(i));</div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> </div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> <span class="comment">// We want to maximize the cost when this literal is true.</span></div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> <span class="keywordflow">if</span> (objective_proto.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#ab5aebe50cbbd6d7af4a57e3757330eeb">coefficients</a>(i) > 0) {</div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> repository->emplace_back(<a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.push_back(&repository->back());</div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.back()->set_weight(<a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>(objective_proto.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#ab5aebe50cbbd6d7af4a57e3757330eeb">coefficients</a>(i)));</div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> repository->emplace_back(<a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>());</div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.push_back(&repository->back());</div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.back()->set_weight(<a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>(-objective_proto.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#ab5aebe50cbbd6d7af4a57e3757330eeb">coefficients</a>(i)));</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> </div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <span class="comment">// Note that this increase the offset since the coeff is negative.</span></div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> *offset -= objective_proto.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#ab5aebe50cbbd6d7af4a57e3757330eeb">coefficients</a>(i);</div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> }</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> }</div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>;</div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span>}</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> </div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> </div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span><span class="keywordtype">bool</span> EncodingNodeByWeight(<span class="keyword">const</span> EncodingNode* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <span class="keyword">const</span> EncodingNode* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->weight() < <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->weight();</div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span>}</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> </div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span><span class="keywordtype">bool</span> EncodingNodeByDepth(<span class="keyword">const</span> EncodingNode* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <span class="keyword">const</span> EncodingNode* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->depth() < <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>->depth();</div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span>}</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> </div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span><span class="keywordtype">bool</span> EmptyEncodingNode(<span class="keyword">const</span> EncodingNode* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>) { <span class="keywordflow">return</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>->size() == 0; }</div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> </div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> </div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a3c7b9fb850d243d90ea59790db13a676"> 367</a></span>std::vector<Literal> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a3c7b9fb850d243d90ea59790db13a676">ReduceNodesAndExtractAssumptions</a>(</div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> stratified_lower_bound,</div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>* <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, std::vector<EncodingNode*>* <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>,</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver) {</div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> <span class="comment">// Remove the left-most variables fixed to one from each node.</span></div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> <span class="comment">// Also update the lower_bound. Note that Reduce() needs the solver to be</span></div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> <span class="comment">// at the root node in order to work.</span></div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* n : *<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) {</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> *<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a> += n->Reduce(*solver) * n->weight();</div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> }</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> </div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> <span class="comment">// Fix the nodes right-most variables that are above the gap.</span></div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> != <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">kCoefficientMax</a>) {</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> gap = <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> - *<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>;</div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> <span class="keywordflow">if</span> (gap <= 0) <span class="keywordflow">return</span> {};</div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* n : *<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) {</div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> n->ApplyUpperBound((gap / n->weight()).value(), solver);</div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> }</div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> }</div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> </div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> <span class="comment">// Remove the empty nodes.</span></div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->erase(std::remove_if(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->begin(), <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->end(), EmptyEncodingNode),</div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->end());</div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> </div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> <span class="comment">// Sort the nodes.</span></div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> <span class="keywordflow">switch</span> (solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9">parameters</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a35c4fc852d59980d1a2fbe34b61b0f9d">max_sat_assumption_order</a>()) {</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> <span class="keywordflow">case</span> <a class="code hl_variable" href="classoperations__research_1_1sat_1_1_sat_parameters.html#ab1ab29c97ded021a53858d0ba7bd12c5">SatParameters::DEFAULT_ASSUMPTION_ORDER</a>:</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> <span class="keywordflow">case</span> <a class="code hl_variable" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a0bcea66bd1127463ce1bd0d52786e4ca">SatParameters::ORDER_ASSUMPTION_BY_DEPTH</a>:</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> std::sort(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->begin(), <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->end(), EncodingNodeByDepth);</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> <span class="keywordflow">case</span> <a class="code hl_variable" href="classoperations__research_1_1sat_1_1_sat_parameters.html#abc042796b719277e4839c4217f070865">SatParameters::ORDER_ASSUMPTION_BY_WEIGHT</a>:</div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> std::sort(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->begin(), <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->end(), EncodingNodeByWeight);</div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> }</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> <span class="keywordflow">if</span> (solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9">parameters</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#adf7c93a08b43e54870d77295dedd7496">max_sat_reverse_assumption_order</a>()) {</div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> <span class="comment">// TODO(user): with DEFAULT_ASSUMPTION_ORDER, this will lead to a somewhat</span></div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> <span class="comment">// weird behavior, since we will reverse the nodes at each iteration...</span></div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> std::reverse(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->begin(), <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->end());</div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> }</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> </div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> <span class="comment">// Extract the assumptions from the nodes.</span></div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> std::vector<Literal> assumptions;</div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* n : *<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) {</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> <span class="keywordflow">if</span> (n->weight() >= stratified_lower_bound) {</div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> assumptions.push_back(n->literal(0).Negated());</div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> }</div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> }</div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> <span class="keywordflow">return</span> assumptions;</div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span>}</div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> </div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a1c9d74b9b207b6e5513334dd135a00a9"> 419</a></span><a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1c9d74b9b207b6e5513334dd135a00a9">ComputeCoreMinWeight</a>(<span class="keyword">const</span> std::vector<EncodingNode*>& <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>,</div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> <span class="keyword">const</span> std::vector<Literal>& core) {</div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> min_weight = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">kCoefficientMax</a>;</div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0;</div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < core.size(); ++i) {</div>
|
|
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> <span class="keywordflow">for</span> (;</div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.size() && <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]-><a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>(0).Negated() != core[i];</div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> ++<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> }</div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.size());</div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> min_weight = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_weight, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]-><a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a>());</div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> }</div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <span class="keywordflow">return</span> min_weight;</div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span>}</div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> </div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ad6c9cfad7e2fa7ae1bbff31720394436"> 434</a></span><a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ad6c9cfad7e2fa7ae1bbff31720394436">MaxNodeWeightSmallerThan</a>(<span class="keyword">const</span> std::vector<EncodingNode*>& <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>,</div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> result(0);</div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* n : <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) {</div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> <a class="code hl_define" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(n->weight(), 0);</div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> <span class="keywordflow">if</span> (n->weight() < <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> result = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(result, n->weight());</div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> }</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> }</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span>}</div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> </div>
|
|
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ab87119f7f6691eca8af4c552828fc4c4"> 446</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ab87119f7f6691eca8af4c552828fc4c4">ProcessCore</a>(<span class="keyword">const</span> std::vector<Literal>& core, <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> min_weight,</div>
|
|
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> std::deque<EncodingNode>* repository,</div>
|
|
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> std::vector<EncodingNode*>* <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver) {</div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> <span class="comment">// Backtrack to be able to add new constraints.</span></div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> </div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> <span class="keywordflow">if</span> (core.size() == 1) {</div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> <span class="comment">// The core will be reduced at the beginning of the next loop.</span></div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> <span class="comment">// Find the associated node, and call IncreaseNodeSize() on it.</span></div>
|
|
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(core[0]));</div>
|
|
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* n : *<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) {</div>
|
|
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> <span class="keywordflow">if</span> (n->literal(0).Negated() == core[0]) {</div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a6af701ea48c91ef8a59a67b5b8d355c2">IncreaseNodeSize</a>(n, solver);</div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> }</div>
|
|
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> }</div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Node with literal "</span> << core[0] << <span class="stringliteral">" not found!"</span>;</div>
|
|
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> }</div>
|
|
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> </div>
|
|
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <span class="comment">// Remove from nodes the EncodingNode in the core, merge them, and add the</span></div>
|
|
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> <span class="comment">// resulting EncodingNode at the back.</span></div>
|
|
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0;</div>
|
|
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> <span class="keywordtype">int</span> new_node_index = 0;</div>
|
|
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> std::vector<EncodingNode*> to_merge;</div>
|
|
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < core.size(); ++i) {</div>
|
|
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> <span class="comment">// Since the nodes appear in order in the core, we can find the</span></div>
|
|
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> <span class="comment">// relevant "objective" variable efficiently with a simple linear scan</span></div>
|
|
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> <span class="comment">// in the nodes vector (done with index).</span></div>
|
|
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> <span class="keywordflow">for</span> (; (*nodes)[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->literal(0).Negated() != core[i]; ++<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->size());</div>
|
|
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> (*nodes)[new_node_index] = (*nodes)[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> ++new_node_index;</div>
|
|
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> }</div>
|
|
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->size());</div>
|
|
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> to_merge.push_back((*<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>)[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> </div>
|
|
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> <span class="comment">// Special case if the weight > min_weight. we keep it, but reduce its</span></div>
|
|
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> <span class="comment">// cost. This is the same "trick" as in WPM1 used to deal with weight.</span></div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> <span class="comment">// We basically split a clause with a larger weight in two identical</span></div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> <span class="comment">// clauses, one with weight min_weight that will be merged and one with</span></div>
|
|
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> <span class="comment">// the remaining weight.</span></div>
|
|
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> <span class="keywordflow">if</span> ((*<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>)[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]-><a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a>() > min_weight) {</div>
|
|
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> (*nodes)[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->set_weight((*<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>)[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]-><a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a>() - min_weight);</div>
|
|
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> (*nodes)[new_node_index] = (*nodes)[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> ++new_node_index;</div>
|
|
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> }</div>
|
|
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> ++<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> }</div>
|
|
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> <span class="keywordflow">for</span> (; <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->size(); ++<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> (*nodes)[new_node_index] = (*nodes)[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> ++new_node_index;</div>
|
|
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> }</div>
|
|
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->resize(new_node_index);</div>
|
|
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->push_back(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a58a0f80524e7d3e00ba0eb8e3ff27048">LazyMergeAllNodeWithPQ</a>(to_merge, solver, repository));</div>
|
|
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a6af701ea48c91ef8a59a67b5b8d355c2">IncreaseNodeSize</a>(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->back(), solver);</div>
|
|
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->back()->set_weight(min_weight);</div>
|
|
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">AddUnitClause</a>(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->back()->literal(0)));</div>
|
|
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span>}</div>
|
|
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> </div>
|
|
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span>} <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</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>
|
|
<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#l00495">base/logging.h:495</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#l00705">base/logging.h:705</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#l00702">base/logging.h:702</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(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_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00707">base/logging.h:707</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#l00420">base/logging.h:420</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html">operations_research::sat::EncodingNode</a></div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00054">encoding.h:54</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a1fadb46d73a6b7e1b449e6070cfa697f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a1fadb46d73a6b7e1b449e6070cfa697f">operations_research::sat::EncodingNode::Reduce</a></div><div class="ttdeci">int Reduce(const SatSolver &solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00082">encoding.cc:82</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a29f3df8e348017bbeaab35d77a4b3fa8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a29f3df8e348017bbeaab35d77a4b3fa8">operations_research::sat::EncodingNode::IncreaseCurrentUB</a></div><div class="ttdeci">bool IncreaseCurrentUB(SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00072">encoding.cc:72</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a4101c336fb4c5135ceef3ab532d755cd"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a4101c336fb4c5135ceef3ab532d755cd">operations_research::sat::EncodingNode::current_ub</a></div><div class="ttdeci">int current_ub() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00111">encoding.h:111</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a4534d0c2b93a62ca6b7b08ec4c8a1365"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a4534d0c2b93a62ca6b7b08ec4c8a1365">operations_research::sat::EncodingNode::child_b</a></div><div class="ttdeci">EncodingNode * child_b() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00114">encoding.h:114</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a59474db663a04e9b041c7683afd9bea1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a59474db663a04e9b041c7683afd9bea1">operations_research::sat::EncodingNode::ApplyUpperBound</a></div><div class="ttdeci">void ApplyUpperBound(int64_t upper_bound, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00098">encoding.cc:98</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a6bea440eb7f63954ecf88b597d182ecb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a6bea440eb7f63954ecf88b597d182ecb">operations_research::sat::EncodingNode::InitializeLazyNode</a></div><div class="ttdeci">void InitializeLazyNode(EncodingNode *a, EncodingNode *b, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00056">encoding.cc:56</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a6e81565ea8f030c21126024751b8d4be"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a6e81565ea8f030c21126024751b8d4be">operations_research::sat::EncodingNode::InitializeFullNode</a></div><div class="ttdeci">void InitializeFullNode(int n, EncodingNode *a, EncodingNode *b, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00036">encoding.cc:36</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a8d59d3e1fa9887ff055c7a6853055198"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">operations_research::sat::EncodingNode::literal</a></div><div class="ttdeci">Literal literal(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00079">encoding.h:79</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_ab4a971df4b55922bdbff74843db10dd1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#ab4a971df4b55922bdbff74843db10dd1">operations_research::sat::EncodingNode::child_a</a></div><div class="ttdeci">EncodingNode * child_a() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00113">encoding.h:113</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_ad43b46262f3e4103bd59aae627925fdf"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#ad43b46262f3e4103bd59aae627925fdf">operations_research::sat::EncodingNode::GreaterThan</a></div><div class="ttdeci">Literal GreaterThan(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00075">encoding.h:75</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_af9593d4a5ff4274efaf429cb4f9e57cc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#af9593d4a5ff4274efaf429cb4f9e57cc">operations_research::sat::EncodingNode::size</a></div><div class="ttdeci">int size() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00078">encoding.h:78</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_afcc0ba7af448641ff70c751416efb4ae"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#afcc0ba7af448641ff70c751416efb4ae">operations_research::sat::EncodingNode::EncodingNode</a></div><div class="ttdeci">EncodingNode()</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00056">encoding.h:56</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_objective_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html">operations_research::sat::LinearObjective</a></div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l00324">boolean_problem.pb.h:325</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_objective_html_a72d41feda9a93c11089d3d99d6270999"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a72d41feda9a93c11089d3d99d6270999">operations_research::sat::LinearObjective::literals_size</a></div><div class="ttdeci">int literals_size() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01226">boolean_problem.pb.h:1226</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_objective_html_a7a8021e2b57fad24fac287b8e50fb27e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a7a8021e2b57fad24fac287b8e50fb27e">operations_research::sat::LinearObjective::literals</a></div><div class="ttdeci">int32_t literals(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01235">boolean_problem.pb.h:1235</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_objective_html_ab5aebe50cbbd6d7af4a57e3757330eeb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#ab5aebe50cbbd6d7af4a57e3757330eeb">operations_research::sat::LinearObjective::coefficients</a></div><div class="ttdeci">int64_t coefficients(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01282">boolean_problem.pb.h:1282</a></div></div>
|
|
<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#l00066">sat_base.h:66</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#l00093">sat_base.h:93</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_a0bcea66bd1127463ce1bd0d52786e4ca"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a0bcea66bd1127463ce1bd0d52786e4ca">operations_research::sat::SatParameters::ORDER_ASSUMPTION_BY_DEPTH</a></div><div class="ttdeci">static constexpr MaxSatAssumptionOrder ORDER_ASSUMPTION_BY_DEPTH</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00712">sat_parameters.pb.h:712</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_a35c4fc852d59980d1a2fbe34b61b0f9d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a35c4fc852d59980d1a2fbe34b61b0f9d">operations_research::sat::SatParameters::max_sat_assumption_order</a></div><div class="ttdeci">::operations_research::sat::SatParameters_MaxSatAssumptionOrder max_sat_assumption_order() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l05947">sat_parameters.pb.h:5947</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_ab1ab29c97ded021a53858d0ba7bd12c5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#ab1ab29c97ded021a53858d0ba7bd12c5">operations_research::sat::SatParameters::DEFAULT_ASSUMPTION_ORDER</a></div><div class="ttdeci">static constexpr MaxSatAssumptionOrder DEFAULT_ASSUMPTION_ORDER</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00710">sat_parameters.pb.h:710</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_abc042796b719277e4839c4217f070865"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#abc042796b719277e4839c4217f070865">operations_research::sat::SatParameters::ORDER_ASSUMPTION_BY_WEIGHT</a></div><div class="ttdeci">static constexpr MaxSatAssumptionOrder ORDER_ASSUMPTION_BY_WEIGHT</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00714">sat_parameters.pb.h:714</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_adf7c93a08b43e54870d77295dedd7496"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#adf7c93a08b43e54870d77295dedd7496">operations_research::sat::SatParameters::max_sat_reverse_assumption_order</a></div><div class="ttdeci">bool max_sat_reverse_assumption_order() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l05976">sat_parameters.pb.h:5976</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_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_a0e8b0117614d340615ab66abec430d78"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a0e8b0117614d340615ab66abec430d78">operations_research::sat::SatSolver::AddTernaryClause</a></div><div class="ttdeci">bool AddTernaryClause(Literal a, Literal b, Literal c)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00192">sat_solver.cc:192</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_a4793952607a98dfddfbcc17abfabbb4b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">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_aac912e9410b8989493f492fcbb2d9094"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">operations_research::sat::SatSolver::AddBinaryClause</a></div><div class="ttdeci">bool AddBinaryClause(Literal a, Literal b)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00181">sat_solver.cc:181</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_sat_solver_html_afbbbc2f0845a82a5a5cfb3f00a61abe9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">operations_research::sat::SatSolver::AddUnitClause</a></div><div class="ttdeci">bool AddUnitClause(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00165">sat_solver.cc:165</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#l00152">sat_base.h:152</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_acfd1646011e643f58fd7dc66d9cc90a5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">operations_research::sat::VariablesAssignment::LiteralIsFalse</a></div><div class="ttdeci">bool LiteralIsFalse(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00149">sat_base.h:149</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_acb18315d548212835cd8ed4287e6c0b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a></div><div class="ttdeci">int64_t a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00046">constraint_solver/table.cc:46</a></div></div>
|
|
<div class="ttc" id="aencoding_8h_html"><div class="ttname"><a href="encoding_8h.html">encoding.h</a></div></div>
|
|
<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#l00137">gscip_solver.cc:137</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#l00136">gscip_solver.cc:136</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_acdd38e3c9f22f127d7776920e3079eda"><div class="ttname"><a href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a></div><div class="ttdeci">const int FATAL</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00032">log_severity.h:32</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ab61209db5b13f0d424da009e414298fc"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">operations_research::math_opt::Coefficient</a></div><div class="ttdeci">std::tuple< int64_t, int64_t, const double > Coefficient</div><div class="ttdef"><b>Definition:</b> <a href="sparse__collection__matchers_8h_source.html#l00061">sparse_collection_matchers.h:61</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1c9d74b9b207b6e5513334dd135a00a9"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1c9d74b9b207b6e5513334dd135a00a9">operations_research::sat::ComputeCoreMinWeight</a></div><div class="ttdeci">Coefficient ComputeCoreMinWeight(const std::vector< EncodingNode * > &nodes, const std::vector< Literal > &core)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00419">encoding.cc:419</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a29ff75f2188e0ac1c58fa4b0cf793a00"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a29ff75f2188e0ac1c58fa4b0cf793a00">operations_research::sat::MergeAllNodesWithDeque</a></div><div class="ttdeci">EncodingNode * MergeAllNodesWithDeque(Coefficient upper_bound, const std::vector< EncodingNode * > &nodes, SatSolver *solver, std::deque< EncodingNode > *repository)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00264">encoding.cc:264</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3c7b9fb850d243d90ea59790db13a676"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3c7b9fb850d243d90ea59790db13a676">operations_research::sat::ReduceNodesAndExtractAssumptions</a></div><div class="ttdeci">std::vector< Literal > ReduceNodesAndExtractAssumptions(Coefficient upper_bound, Coefficient stratified_lower_bound, Coefficient *lower_bound, std::vector< EncodingNode * > *nodes, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00367">encoding.cc:367</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a58a0f80524e7d3e00ba0eb8e3ff27048"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a58a0f80524e7d3e00ba0eb8e3ff27048">operations_research::sat::LazyMergeAllNodeWithPQ</a></div><div class="ttdeci">EncodingNode * LazyMergeAllNodeWithPQ(const std::vector< EncodingNode * > &nodes, SatSolver *solver, std::deque< EncodingNode > *repository)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00286">encoding.cc:286</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a6af701ea48c91ef8a59a67b5b8d355c2"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6af701ea48c91ef8a59a67b5b8d355c2">operations_research::sat::IncreaseNodeSize</a></div><div class="ttdeci">void IncreaseNodeSize(EncodingNode *node, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00117">encoding.cc:117</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a99e372550892ddd117f7a23e4fd73518"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a99e372550892ddd117f7a23e4fd73518">operations_research::sat::LazyMerge</a></div><div class="ttdeci">EncodingNode LazyMerge(EncodingNode *a, EncodingNode *b, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00107">encoding.cc:107</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aa357501e62925d41514301a6fd211c3e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa357501e62925d41514301a6fd211c3e">operations_research::sat::FullMerge</a></div><div class="ttdeci">EncodingNode FullMerge(Coefficient upper_bound, EncodingNode *a, EncodingNode *b, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00213">encoding.cc:213</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ab87119f7f6691eca8af4c552828fc4c4"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab87119f7f6691eca8af4c552828fc4c4">operations_research::sat::ProcessCore</a></div><div class="ttdeci">void ProcessCore(const std::vector< Literal > &core, Coefficient min_weight, std::deque< EncodingNode > *repository, std::vector< EncodingNode * > *nodes, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00446">encoding.cc:446</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ad6c9cfad7e2fa7ae1bbff31720394436"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ad6c9cfad7e2fa7ae1bbff31720394436">operations_research::sat::MaxNodeWeightSmallerThan</a></div><div class="ttdeci">Coefficient MaxNodeWeightSmallerThan(const std::vector< EncodingNode * > &nodes, Coefficient upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00434">encoding.cc:434</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aea70549adb843d22d06bef763a0960c8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8">operations_research::sat::CreateInitialEncodingNodes</a></div><div class="ttdeci">std::vector< EncodingNode * > CreateInitialEncodingNodes(const std::vector< Literal > &literals, const std::vector< Coefficient > &coeffs, Coefficient *offset, std::deque< EncodingNode > *repository)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00303">encoding.cc:303</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_afd482f2c4b9533b4d1f7379a578e9b18"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">operations_research::sat::kCoefficientMax</a></div><div class="ttdeci">const Coefficient kCoefficientMax(std::numeric_limits< Coefficient::ValueType >::max())</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="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>
|
|
<div class="ttc" id="arouting__search_8cc_html_a6b7983ccd32c86cbbc3d4d9cda4cac17"><div class="ttname"><a href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a></div><div class="ttdeci">int nodes</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03866">routing_search.cc:3866</a></div></div>
|
|
<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><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="encoding_8cc.html">encoding.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|