359 lines
60 KiB
HTML
359 lines
60 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.h 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.0</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_8h_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.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="encoding_8h.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="comment">// Algorithms to encode constraints into their SAT representation. Currently,</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// this contains one possible encoding of a cardinality constraint as used by</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// the core-based optimization algorithm in optimization.h.</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>  </div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#ifndef OR_TOOLS_SAT_ENCODING_H_</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#define OR_TOOLS_SAT_ENCODING_H_</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 <deque></span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  </div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="int__type_8h.html">ortools/base/int_type.h</a>"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="boolean__problem_8pb_8h.html">ortools/sat/boolean_problem.pb.h</a>"</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="pb__constraint_8h.html">ortools/sat/pb_constraint.h</a>"</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  </div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  </div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// This class represents a number in [0, ub]. The encoding uses ub binary</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// variables x_i with i in [0, ub) where x_i means that the number is > i. It is</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// called an EncodingNode, because it represents one node of the tree used to</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// encode a cardinality constraint.</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// In practice, not all literals are explicitly created:</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// - Only the literals in [lb, current_ub) are "active" at a given time.</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// - The represented number is known to be >= lb.</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// - It may be greater than current_ub, but the extra literals will be only</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// created lazily. In all our solves, the literal current_ub - 1, will always</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// be assumed to false (i.e. the number will be <= current_ub - 1).</span></div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// - Note that lb may increase and ub decrease as more information is learned</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// about this node by the sat solver.</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// This is roughly based on the cardinality constraint encoding described in:</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// Bailleux and Yacine Boufkhad, "Efficient CNF Encoding of Boolean Cardinality</span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// Constraints", In Proc. of CP 2003, pages 108-122, 2003.</span></div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html"> 53</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a> {</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">public</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#afcc0ba7af448641ff70c751416efb4ae"> 55</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#afcc0ba7af448641ff70c751416efb4ae">EncodingNode</a>() {}</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  </div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// Constructs a EncodingNode of size one, just formed by the given literal.</span></div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#afcc0ba7af448641ff70c751416efb4ae">EncodingNode</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l);</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  </div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// Creates a "full" encoding node on n new variables, the represented number</span></div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// beeing in [lb, ub = lb + n). The variables are added to the given solver</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// with the basic implications linking them:</span></div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="comment">// literal(0) >= ... >= literal(n-1)</span></div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6e81565ea8f030c21126024751b8d4be">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="l00065"></a><span class="lineno"> 65</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver);</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">// Creates a "lazy" encoding node representing the sum of a and b.</span></div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="comment">// Only one literals will be created by this operation. Note that no clauses</span></div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="comment">// linking it with a or b are added by this function.</span></div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6bea440eb7f63954ecf88b597d182ecb">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>, <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver);</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  </div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// Returns a literal with the meaning 'this node number is > i'.</span></div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// The given i must be in [lb_, current_ub).</span></div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#ad43b46262f3e4103bd59aae627925fdf"> 74</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#ad43b46262f3e4103bd59aae627925fdf">GreaterThan</a>(<span class="keywordtype">int</span> i)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(i - lb_); }</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  </div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// Accessors to size() and literals in [lb, current_ub).</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#af9593d4a5ff4274efaf429cb4f9e57cc"> 77</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> literals_.size(); }</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198"> 78</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(<span class="keywordtype">int</span> i)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  CHECK_GE(i, 0);</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  CHECK_LT(i, literals_.size());</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">return</span> literals_[i];</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  </div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// Sort by decreasing depth first and then by increasing variable index.</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// This is meant to be used by the priority queue in MergeAllNodesWithPQ().</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#afcf37f1f013451c059ca2074be226078"> 86</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#afcf37f1f013451c059ca2074be226078">operator<</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> depth_ > other.depth_ ||</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  (depth_ == other.depth_ && other.for_sorting_ > for_sorting_);</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  </div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// Creates a new literals and increases current_ub.</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// Returns false if we were already at the upper bound for this node.</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#a29f3df8e348017bbeaab35d77a4b3fa8">IncreaseCurrentUB</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver);</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  </div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// Removes the left-side literals fixed to 1 and returns the number of</span></div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">// literals removed this way. Note that this increases lb_ and reduces the</span></div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// number of active literals. It also removes any right-side literals fixed to</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// 0. If such a literal exists, ub is updated accordingly.</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#a1fadb46d73a6b7e1b449e6070cfa697f">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="l00100"></a><span class="lineno"> 100</span>  </div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// Fix the right-side variables with indices >= to the given upper_bound to</span></div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// false.</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#aa8ff3ff545b564b3bdde393df6c37faa">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="l00104"></a><span class="lineno"> 104</span>  </div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#ac92f797a3120e43647b75cc41aa9033e"> 105</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#ac92f797a3120e43647b75cc41aa9033e">set_weight</a>(Coefficient w) { weight_ = w; }</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a7f57c0d3f4a1efca82d8c0721556b9d7"> 106</a></span>  Coefficient <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#a7f57c0d3f4a1efca82d8c0721556b9d7">weight</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> weight_; }</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  </div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6fdd73f8011695b97659f2bea29325cb"> 108</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6fdd73f8011695b97659f2bea29325cb">depth</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> depth_; }</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a42fc122b08d9872df0fe327946356be9"> 109</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#a42fc122b08d9872df0fe327946356be9">lb</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> lb_; }</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a4101c336fb4c5135ceef3ab532d755cd"> 110</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#a4101c336fb4c5135ceef3ab532d755cd">current_ub</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> lb_ + literals_.size(); }</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a45469cb8257ad81b6b29393836a4ac5b"> 111</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#a45469cb8257ad81b6b29393836a4ac5b">ub</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> ub_; }</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a27d90c80eb645f49ebc49be959505d54"> 112</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#a27d90c80eb645f49ebc49be959505d54">child_a</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> child_a_; }</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#ab068d566c00fb2de9fdb252752ca839b"> 113</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html#ab068d566c00fb2de9fdb252752ca839b">child_b</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> child_b_; }</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>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordtype">int</span> depth_;</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordtype">int</span> lb_;</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordtype">int</span> ub_;</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  BooleanVariable for_sorting_;</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>  Coefficient weight_;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* child_a_;</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <a class="code" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* child_b_;</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  </div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// The literals of this node in order.</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  std::vector<Literal> literals_;</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>  </div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="preprocessor">#if defined(_M_X64) && defined(_DEBUG)</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment">// In debug std::Vector<T> is 32</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> static_assert(<span class="keyword">sizeof</span>(EncodingNode) == 72,</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="stringliteral">"ERROR_EncodingNode_is_not_well_compacted"</span>);</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="preprocessor">#else</span></div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// Note that we use <= because on 32 bits architecture, the size will actually</span></div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment">// be smaller than 64 bytes.</span></div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> static_assert(<span class="keyword">sizeof</span>(EncodingNode) <= 64,</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="stringliteral">"ERROR_EncodingNode_is_not_well_compacted"</span>);</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  </div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// Merges the two given EncodingNodes by creating a new node that corresponds to</span></div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment">// the sum of the two given ones. Only the left-most binary variable is created</span></div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// for the parent node, the other ones will be created later when needed.</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> EncodingNode <a class="code" href="namespaceoperations__research_1_1sat.html#a99e372550892ddd117f7a23e4fd73518">LazyMerge</a>(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>, SatSolver* solver);</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  </div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// Increases the size of the given node by one. To keep all the needed relations</span></div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// with its children, we also need to increase their size by one, and so on</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// recursively. Also adds all the necessary clauses linking the newly added</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// literals.</span></div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a6af701ea48c91ef8a59a67b5b8d355c2">IncreaseNodeSize</a>(EncodingNode* node, SatSolver* solver);</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> <span class="comment">// Merges the two given EncodingNode by creating a new node that corresponds to</span></div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment">// the sum of the two given ones. The given upper_bound is interpreted as a</span></div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// bound on this sum, and allows creating fewer binary variables.</span></div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> EncodingNode <a class="code" href="namespaceoperations__research_1_1sat.html#aa357501e62925d41514301a6fd211c3e">FullMerge</a>(Coefficient upper_bound, EncodingNode* <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>,</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  EncodingNode* <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, SatSolver* solver);</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  </div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// Merges all the given nodes two by two until there is only one left. Returns</span></div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment">// the final node which encodes the sum of all the given nodes.</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> EncodingNode* <a class="code" href="namespaceoperations__research_1_1sat.html#a29ff75f2188e0ac1c58fa4b0cf793a00">MergeAllNodesWithDeque</a>(Coefficient upper_bound,</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keyword">const</span> std::vector<EncodingNode*>& nodes,</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  SatSolver* solver,</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  std::deque<EncodingNode>* repository);</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  </div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment">// Same as MergeAllNodesWithDeque() but use a priority queue to merge in</span></div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment">// priority nodes with smaller sizes.</span></div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> EncodingNode* <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="l00167"></a><span class="lineno"> 167</span>  SatSolver* solver,</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  std::deque<EncodingNode>* repository);</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  </div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment">// Returns a vector with one new EncodingNode by variable in the given</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment">// objective. Sets the offset to the negated sum of the negative coefficient,</span></div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment">// because in this case we negate the literals to have only positive</span></div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="comment">// coefficients.</span></div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span> std::vector<EncodingNode*> <a class="code" href="namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8">CreateInitialEncodingNodes</a>(</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keyword">const</span> std::vector<Literal>& literals,</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keyword">const</span> std::vector<Coefficient>& coeffs, Coefficient* offset,</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  std::deque<EncodingNode>* repository);</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span> std::vector<EncodingNode*> <a class="code" href="namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8">CreateInitialEncodingNodes</a>(</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keyword">const</span> LinearObjective& objective_proto, Coefficient* offset,</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  std::deque<EncodingNode>* repository);</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  </div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment">// Reduces the nodes using the now fixed literals, update the lower-bound, and</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment">// returns the set of assumptions for the next round of the core-based</span></div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment">// algorithm. Returns an empty set of assumptions if everything is fixed.</span></div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span> std::vector<Literal> <a class="code" href="namespaceoperations__research_1_1sat.html#a3c7b9fb850d243d90ea59790db13a676">ReduceNodesAndExtractAssumptions</a>(</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  Coefficient upper_bound, Coefficient stratified_lower_bound,</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  Coefficient* lower_bound, std::vector<EncodingNode*>* nodes,</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  SatSolver* solver);</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  </div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment">// Returns the minimum weight of the nodes in the core. Note that the literal in</span></div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment">// the core must appear in the same order as the one in nodes.</span></div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</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="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">const</span> std::vector<Literal>& core);</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  </div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment">// Returns the maximum node weight under the given upper_bound. Returns zero if</span></div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment">// no such weight exist (note that a node weight is strictly positive, so this</span></div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment">// make sense).</span></div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</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="l00199"></a><span class="lineno"> 199</span>  Coefficient upper_bound);</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  </div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment">// Updates the encoding using the given core. The literals in the core must</span></div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment">// match the order in nodes.</span></div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</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="l00204"></a><span class="lineno"> 204</span>  std::deque<EncodingNode>* repository,</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  std::vector<EncodingNode*>* nodes, SatSolver* solver);</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  </div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> } <span class="comment">// namespace operations_research</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> <span class="preprocessor">#endif // OR_TOOLS_SAT_ENCODING_H_</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a42fc122b08d9872df0fe327946356be9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a42fc122b08d9872df0fe327946356be9">operations_research::sat::EncodingNode::lb</a></div><div class="ttdeci">int lb() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00109">encoding.h:109</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a6fdd73f8011695b97659f2bea29325cb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a6fdd73f8011695b97659f2bea29325cb">operations_research::sat::EncodingNode::depth</a></div><div class="ttdeci">int depth() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00108">encoding.h:108</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.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="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="aclassoperations__research_1_1sat_1_1_encoding_node_html_afcf37f1f013451c059ca2074be226078"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#afcf37f1f013451c059ca2074be226078">operations_research::sat::EncodingNode::operator<</a></div><div class="ttdeci">bool operator<(const EncodingNode &other) const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00086">encoding.h:86</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</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="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_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="asat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="asat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
|
<div class="ttc" id="apb__constraint_8h_html"><div class="ttname"><a href="pb__constraint_8h.html">pb_constraint.h</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="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="aint__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></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="aboolean__problem_8pb_8h_html"><div class="ttname"><a href="boolean__problem_8pb_8h.html">boolean_problem.pb.h</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="aclassoperations__research_1_1sat_1_1_encoding_node_html_a45469cb8257ad81b6b29393836a4ac5b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a45469cb8257ad81b6b29393836a4ac5b">operations_research::sat::EncodingNode::ub</a></div><div class="ttdeci">int ub() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00111">encoding.h:111</a></div></div>
|
|
<div class="ttc" id="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_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_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_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="aclassoperations__research_1_1sat_1_1_encoding_node_html_a7f57c0d3f4a1efca82d8c0721556b9d7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a7f57c0d3f4a1efca82d8c0721556b9d7">operations_research::sat::EncodingNode::weight</a></div><div class="ttdeci">Coefficient weight() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00106">encoding.h:106</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="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_ac92f797a3120e43647b75cc41aa9033e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#ac92f797a3120e43647b75cc41aa9033e">operations_research::sat::EncodingNode::set_weight</a></div><div class="ttdeci">void set_weight(Coefficient w)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00105">encoding.h:105</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>
|
|
<!-- 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_8h.html">encoding.h</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>
|