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