1103 lines
236 KiB
HTML
1103 lines
236 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: clause.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">9.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<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','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih: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('clause_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">clause.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="clause_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-2021 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">// This file contains the solver internal representation of the clauses and the</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// classes used for their propagation.</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  </div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#ifndef OR_TOOLS_SAT_CLAUSE_H_</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#define OR_TOOLS_SAT_CLAUSE_H_</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  </div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <cstdint></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 <string></span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  </div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "absl/container/inlined_vector.h"</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "absl/random/bit_gen_ref.h"</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "absl/types/span.h"</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="hash_8h.html">ortools/base/hash.h</a>"</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</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="l00033"></a><span class="lineno"> 33</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="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include "<a class="code" href="strong__vector_8h.html">ortools/base/strong_vector.h</a>"</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include "<a class="code" href="drat__proof__handler_8h.html">ortools/sat/drat_proof_handler.h</a>"</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include "<a class="code" href="sat_2model_8h.html">ortools/sat/model.h</a>"</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</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="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include "<a class="code" href="sat__parameters_8pb_8h.html">ortools/sat/sat_parameters.pb.h</a>"</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor">#include "<a class="code" href="sat_2util_8h.html">ortools/sat/util.h</a>"</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#include "<a class="code" href="bitset_8h.html">ortools/util/bitset.h</a>"</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#include "<a class="code" href="stats_8h.html">ortools/util/stats.h</a>"</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#include "<a class="code" href="time__limit_8h.html">ortools/util/time_limit.h</a>"</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  </div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  </div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// This is how the SatSolver stores a clause. A clause is just a disjunction of</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// literals. In many places, we just use vector<literal> to encode one. But in</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// the critical propagation code, we use this class to remove one memory</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// indirection.</span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html"> 52</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a> {</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">// Creates a sat clause. There must be at least 2 literals. Smaller clause are</span></div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// treated separatly and never constructed. In practice, we do use</span></div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">// BinaryImplicationGraph for the clause of size 2, so this is mainly used for</span></div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// size at least 3.</span></div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">static</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#ad891f84075141b619317c2634891d010">Create</a>(absl::Span<const Literal> literals);</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">// Non-sized delete because this is a tail-padded class.</span></div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#a86107594327f3a001230df9802cd4422"> 61</a></span>  <span class="keywordtype">void</span> <span class="keyword">operator</span> <span class="keyword">delete</span>(<span class="keywordtype">void</span>* p) {</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  ::operator <span class="keyword">delete</span>(p); <span class="comment">// non-sized delete</span></div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  }</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  </div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// Number of literals in the clause.</span></div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#af9593d4a5ff4274efaf429cb4f9e57cc"> 66</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> size_; }</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#a78c28538faebd5f023cd4511df6ffee4"> 67</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a78c28538faebd5f023cd4511df6ffee4">empty</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> size_ == 0; }</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  </div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="comment">// Allows for range based iteration: for (Literal literal : clause) {}.</span></div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#ae475fa887548c9841d591b2040d83b08"> 70</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>* <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#ae475fa887548c9841d591b2040d83b08">begin</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> &(literals_[0]); }</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#a140ffada20bd79a6fbf8c1c31f52b5c4"> 71</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>* <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a140ffada20bd79a6fbf8c1c31f52b5c4">end</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> &(literals_[size_]); }</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  </div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// Returns the first and second literals. These are always the watched</span></div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// literals if the clause is attached in the LiteralWatchers.</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#ad6fa965d41774098c99258d76677fa02"> 75</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_sat_clause.html#ad6fa965d41774098c99258d76677fa02">FirstLiteral</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> literals_[0]; }</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#a32e91bfa50c69a7b51346b9de33831ea"> 76</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_sat_clause.html#a32e91bfa50c69a7b51346b9de33831ea">SecondLiteral</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> literals_[1]; }</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  </div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// Returns the literal that was propagated to true. This only works for a</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="comment">// clause that just propagated this literal. Otherwise, this will just returns</span></div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// a literal of the clause.</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#a43aee08d7cb1f81a9fee85b46820f175"> 81</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_sat_clause.html#a43aee08d7cb1f81a9fee85b46820f175">PropagatedLiteral</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> literals_[0]; }</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>  <span class="comment">// Returns the reason for the last unit propagation of this clause. The</span></div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// preconditions are the same as for PropagatedLiteral(). Note that we don't</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// need to include the propagated literal.</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#a411b77da6c8687d6a0a6153a7afcd19f"> 86</a></span>  absl::Span<const Literal> <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a411b77da6c8687d6a0a6153a7afcd19f">PropagationReason</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> absl::Span<const Literal>(&(literals_[1]), size_ - 1);</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</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>  <span class="comment">// Returns a Span<> representation of the clause.</span></div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#a05691332c1a49213875440568a7580aa"> 91</a></span>  absl::Span<const Literal> <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a05691332c1a49213875440568a7580aa">AsSpan</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">return</span> absl::Span<const Literal>(&(literals_[0]), 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>  </div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// Removes literals that are fixed. This should only be called at level 0</span></div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">// where a literal is fixed iff it is assigned. Aborts and returns true if</span></div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// they are not all false.</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// Note that the removed literal can still be accessed in the portion [size,</span></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// old_size) of literals().</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a69422a656b68d50692a1b01e2b0d22ae">RemoveFixedLiteralsAndTestIfTrue</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html">VariablesAssignment</a>& assignment);</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  </div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// Returns true if the clause is satisfied for the given assignment. Note that</span></div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// the assignment may be partial, so false does not mean that the clause can't</span></div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// be satisfied by completing the assignment.</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a6095b00a4734d32844a85927b355ce32">IsSatisfied</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html">VariablesAssignment</a>& assignment) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  </div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// Returns true if the clause is attached to a LiteralWatchers.</span></div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#ad8932e395fe5c508700b7f95d3064aef"> 109</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#ad8932e395fe5c508700b7f95d3064aef">IsAttached</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> size_ > 0; }</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  </div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  std::string <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  </div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">// LiteralWatchers needs to permute the order of literals in the clause and</span></div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// call Clear()/Rewrite.</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#a441b0302a38e88ed3a19874b76709b81"> 116</a></span>  <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html">LiteralWatchers</a>;</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  </div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>* literals() { <span class="keywordflow">return</span> &(literals_[0]); }</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  </div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// Marks the clause so that the next call to CleanUpWatchers() can identify it</span></div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="comment">// and actually detach it. We use size_ = 0 for this since the clause will</span></div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// never be used afterwards.</span></div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordtype">void</span> Clear() { size_ = 0; }</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">// Rewrites a clause with another shorter one. Note that the clause shouldn't</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// be attached when this is called.</span></div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordtype">void</span> Rewrite(absl::Span<const Literal> new_clause) {</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  size_ = 0;</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : new_clause) literals_[size_++] = l;</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  }</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  </div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  int32_t size_;</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">// This class store the literals inline, and literals_ mark the starts of the</span></div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="comment">// variable length portion.</span></div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  Literal literals_[0];</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  </div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <a class="code" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(SatClause);</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>  </div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment">// Clause information used for the clause database management. Note that only</span></div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// the clauses that can be removed have an info. The problem clauses and</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment">// the learned one that we wants to keep forever do not have one.</span></div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_clause_info.html"> 144</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1sat_1_1_clause_info.html">ClauseInfo</a> {</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_clause_info.html#ac3e857ac5cab6563bdbf0dd5632df5ea"> 145</a></span>  <span class="keywordtype">double</span> <a class="code" href="structoperations__research_1_1sat_1_1_clause_info.html#ac3e857ac5cab6563bdbf0dd5632df5ea">activity</a> = 0.0;</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_clause_info.html#aeae764750e16aaa4d963129a5dd92b6d"> 146</a></span>  int32_t <a class="code" href="structoperations__research_1_1sat_1_1_clause_info.html#aeae764750e16aaa4d963129a5dd92b6d">lbd</a> = 0;</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_clause_info.html#a88057f377391af0e1ebe4b97af753d19"> 147</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1sat_1_1_clause_info.html#a88057f377391af0e1ebe4b97af753d19">protected_during_next_cleanup</a> = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> };</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> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html">BinaryImplicationGraph</a>;</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">// Stores the 2-watched literals data structure. See</span></div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// http://www.cs.berkeley.edu/~necula/autded/lecture24-sat.pdf for</span></div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// detail.</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment">// This class is also responsible for owning the clause memory and all related</span></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// information.</span></div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment">// TODO(user): Rename ClauseManager. This does more than just watching the</span></div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment">// clauses and is the place where all the clauses are stored.</span></div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html"> 161</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html">LiteralWatchers</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html">SatPropagator</a> {</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1c7c594a8c50b3a60f4b67b74da2e4ed">LiteralWatchers</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ac5790e264f5bf7307a81ca51f1e0db66">~LiteralWatchers</a>() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  </div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// Must be called before adding clauses refering to such variables.</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#af7fbbd00f0e631ce361b5ce6636b2017">Resize</a>(<span class="keywordtype">int</span> num_variables);</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="comment">// SatPropagator API.</span></div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1f591be5334541874ba049873235f0a9">Propagate</a>(<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail) <span class="keyword">final</span>;</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  absl::Span<const Literal> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a5aa25e6e306c7158c11d2053170379a2">Reason</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail,</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordtype">int</span> trail_index) <span class="keyword">const</span> <span class="keyword">final</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="comment">// Returns the reason of the variable at given trail_index. This only works</span></div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">// for variable propagated by this class and is almost the same as Reason()</span></div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">// with a different return format.</span></div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaf9f3bc83c843a94dd2240e2a81a5e3b">ReasonClause</a>(<span class="keywordtype">int</span> trail_index) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  </div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// Adds a new clause and perform initial propagation for this clause only.</span></div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaec5e05be5e5e385c6222c023587cb05">AddClause</a>(absl::Span<const Literal> literals, <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail);</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaec5e05be5e5e385c6222c023587cb05">AddClause</a>(absl::Span<const Literal> literals);</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  </div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// Same as AddClause() for a removable clause. This is only called on learned</span></div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">// conflict, so this should never have all its literal at false (CHECKED).</span></div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a6af58ea401f90fe1a40be4558dba478a">AddRemovableClause</a>(<span class="keyword">const</span> std::vector<Literal>& literals,</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail);</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="comment">// Lazily detach the given clause. The deletion will actually occur when</span></div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// CleanUpWatchers() is called. The later needs to be called before any other</span></div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// function in this class can be called. This is DCHECKed.</span></div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// Note that we remove the clause from clauses_info_ right away.</span></div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab6bd51395bef8b42ac66ad9b52635084">LazyDetach</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause);</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ae57f3c4e72eb63a34fa09e707a18e6d3">CleanUpWatchers</a>();</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>  <span class="comment">// Detaches the given clause right away.</span></div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// TODO(user): It might be better to have a "slower" mode in</span></div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// PropagateOnFalse() that deal with detached clauses in the watcher list and</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">// is activated until the next CleanUpWatchers() calls.</span></div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#af3769ff2cdf469ae4a13cc4f6b15bc14">Detach</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause);</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  </div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// Attaches the given clause. The first two literal of the clause must</span></div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// be unassigned and the clause must not be already attached.</span></div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aab96a842b592211bf178caaf41e41f1d">Attach</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause, <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail);</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">// Reclaims the memory of the lazily removed clauses (their size was set to</span></div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="comment">// zero) and remove them from AllClausesInCreationOrder() this work in</span></div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="comment">// O(num_clauses()).</span></div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ae234022ee7c496416290d1946f56e1ad">DeleteRemovedClauses</a>();</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a9e43736bb5ad76519001b5beeb0eac6d"> 211</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a9e43736bb5ad76519001b5beeb0eac6d">num_clauses</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> clauses_.size(); }</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a0569d77056e622964bd02dd901950ede"> 212</a></span>  <span class="keyword">const</span> std::vector<SatClause*>& <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a0569d77056e622964bd02dd901950ede">AllClausesInCreationOrder</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">return</span> clauses_;</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  }</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  </div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">// True if removing this clause will not change the set of feasible solution.</span></div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// This is the case for clauses that were learned during search. Note however</span></div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// that some learned clause are kept forever (heuristics) and do not appear</span></div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">// here.</span></div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab054db78fc1b1e1681d2fc4e9fd1ca45"> 220</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab054db78fc1b1e1681d2fc4e9fd1ca45">IsRemovable</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* <span class="keyword">const</span> clause)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">return</span> <a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(clauses_info_, clause);</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  }</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab80681ada3f207791a16617205935937"> 223</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab80681ada3f207791a16617205935937">num_removable_clauses</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> clauses_info_.size(); }</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1ba4013455d8c21e62115060dabf9364"> 224</a></span>  absl::flat_hash_map<SatClause*, ClauseInfo>* <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1ba4013455d8c21e62115060dabf9364">mutable_clauses_info</a>() {</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">return</span> &clauses_info_;</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  }</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  </div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">// Total number of clauses inspected during calls to PropagateOnFalse().</span></div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a70c5a070f03810d5467c5758f6bb916e"> 229</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a70c5a070f03810d5467c5758f6bb916e">num_inspected_clauses</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> num_inspected_clauses_; }</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ad78bb381916ac421212217a3e5cb03ab"> 230</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ad78bb381916ac421212217a3e5cb03ab">num_inspected_clause_literals</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">return</span> num_inspected_clause_literals_;</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  }</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  </div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">// The number of different literals (always twice the number of variables).</span></div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#af18b28ba180d18c4e4f524d6fde71f28"> 235</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#af18b28ba180d18c4e4f524d6fde71f28">literal_size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> needs_cleaning_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a2fa637a68bc1b88e3d5da4f97932411a">size</a>().value(); }</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  </div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="comment">// Number of clauses currently watched.</span></div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab6174cc15ef4df301b31aff43216039e"> 238</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab6174cc15ef4df301b31aff43216039e">num_watched_clauses</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> num_watched_clauses_; }</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  </div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a75f1d17f36330a1c8a96e43fe8805598"> 240</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a75f1d17f36330a1c8a96e43fe8805598">SetDratProofHandler</a>(<a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html">DratProofHandler</a>* drat_proof_handler) {</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  drat_proof_handler_ = drat_proof_handler;</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  }</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  </div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">// Really basic algorithm to return a clause to try to minimize. We simply</span></div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="comment">// loop over the clause that we keep forever, in creation order. This starts</span></div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// by the problem clauses and then the learned one that we keep forever.</span></div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aab21bb15f39af99c400610195b7c682d"> 247</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aab21bb15f39af99c400610195b7c682d">NextClauseToMinimize</a>() {</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">for</span> (; to_minimize_index_ < clauses_.size(); ++to_minimize_index_) {</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">if</span> (!clauses_[to_minimize_index_]->IsAttached()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab054db78fc1b1e1681d2fc4e9fd1ca45">IsRemovable</a>(clauses_[to_minimize_index_])) {</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">return</span> clauses_[to_minimize_index_++];</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  }</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  }</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  </div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">// Restart the scan in NextClauseToMinimize() from the first problem clause.</span></div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ada4c57ad822069c6c61a93973dc39c4d"> 258</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ada4c57ad822069c6c61a93973dc39c4d">ResetToMinimizeIndex</a>() { to_minimize_index_ = 0; }</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="comment">// During an inprocessing phase, it is easier to detach all clause first,</span></div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">// then simplify and then reattach them. Note however that during these</span></div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">// two calls, it is not possible to use the solver unit-progation.</span></div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// Important: When reattach is called, we assume that none of their literal</span></div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="comment">// are fixed, so we don't do any special checks.</span></div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">// These functions can be called multiple-time and do the right things. This</span></div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="comment">// way before doing something, you can call the corresponding function and be</span></div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="comment">// sure to be in a good state. I.e. always AttachAllClauses() before</span></div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">// propagation and DetachAllClauses() before going to do an inprocessing pass</span></div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="comment">// that might transform them.</span></div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a38c7c4ca12035b254d9497a401606e0c">DetachAllClauses</a>();</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a56cba28a88a7cffa362a362fdce24dc3">AttachAllClauses</a>();</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  </div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">// These must only be called between [Detach/Attach]AllClauses() calls.</span></div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a287676c504a640a5569710d352ef6585">InprocessingRemoveClause</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause);</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a0ddf4dc22639ee58f75985d875d1fd2d">InprocessingFixLiteral</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> true_literal);</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab17b31190c5ab58a1334139848335283">InprocessingRewriteClause</a>(</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause, absl::Span<const Literal> new_clause);</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  </div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="comment">// This can return nullptr if new_clause was of size one or two as these are</span></div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="comment">// treated differently. Note that none of the variable should be fixed in the</span></div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">// given new clause.</span></div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a74971b631e1b357b2f440dff321b5c9b">InprocessingAddClause</a>(absl::Span<const Literal> new_clause);</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  </div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="comment">// Contains, for each literal, the list of clauses that need to be inspected</span></div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="comment">// when the corresponding literal becomes false.</span></div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html"> 288</a></span>  <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html">Watcher</a> {</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#a4a0473c811fac417fd412079d44641bc"> 289</a></span>  <a class="code" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#a4a0473c811fac417fd412079d44641bc">Watcher</a>() {}</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#a8a2bf3687ccbe5c521d93a13c07d6d77"> 290</a></span>  <a class="code" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#a8a2bf3687ccbe5c521d93a13c07d6d77">Watcher</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* c, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, <span class="keywordtype">int</span> i = 2)</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  : <a class="code" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#aac01b9da5c153681e4b792e0fa0b8d41">blocking_literal</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>), <a class="code" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#a6382444169ace737c31ed66f4aaa4911">start_index</a>(i), <a class="code" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#ad6bf9b00a3144ebd5ded72037f2b577f">clause</a>(c) {}</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  </div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="comment">// Optimization. A literal from the clause that sometimes allow to not even</span></div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="comment">// look at the clause memory when true.</span></div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#aac01b9da5c153681e4b792e0fa0b8d41"> 295</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#aac01b9da5c153681e4b792e0fa0b8d41">blocking_literal</a>;</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  </div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// Optimization. An index in the clause. Instead of looking for another</span></div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">// literal to watch from the start, we will start from here instead, and</span></div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// loop around if needed. This allows to avoid bad quadratric corner cases</span></div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="comment">// and lead to an "optimal" complexity. See "Optimal Implementation of</span></div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="comment">// Watched Literals and more General Techniques", Ian P. Gent.</span></div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="comment">// Note that ideally, this should be part of a SatClause, so it can be</span></div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="comment">// shared across watchers. However, since we have 32 bits for "free" here</span></div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="comment">// because of the struct alignment, we store it here instead.</span></div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#a6382444169ace737c31ed66f4aaa4911"> 306</a></span>  int32_t <a class="code" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#a6382444169ace737c31ed66f4aaa4911">start_index</a>;</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  </div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#ad6bf9b00a3144ebd5ded72037f2b577f"> 308</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* <a class="code" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#ad6bf9b00a3144ebd5ded72037f2b577f">clause</a>;</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  };</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  </div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// This is exposed since some inprocessing code can heuristically exploit the</span></div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="comment">// currently watched literal and blocking literal to do some simplification.</span></div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a9662224096e0c22fce84cdab66562093"> 313</a></span>  <span class="keyword">const</span> std::vector<Watcher>& <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a9662224096e0c22fce84cdab66562093">WatcherListOnFalse</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> false_literal)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">return</span> watchers_on_false_[false_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()];</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  </div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="comment">// Attaches the given clause. This eventually propagates a literal which is</span></div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">// enqueued on the trail. Returns false if a contradiction was encountered.</span></div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordtype">bool</span> AttachAndPropagate(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause, <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail);</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  </div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="comment">// Launches all propagation when the given literal becomes false.</span></div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="comment">// Returns false if a contradiction was encountered.</span></div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordtype">bool</span> PropagateOnFalse(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> false_literal, <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail);</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>  <span class="comment">// Attaches the given clause to the event: the given literal becomes false.</span></div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="comment">// The blocking_literal can be any literal from the clause, it is used to</span></div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="comment">// speed up PropagateOnFalse() by skipping the clause if it is true.</span></div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordtype">void</span> AttachOnFalse(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> blocking_literal,</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause);</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  </div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="comment">// Common code between LazyDetach() and Detach().</span></div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordtype">void</span> InternalDetach(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause);</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>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, std::vector<Watcher></a>> watchers_on_false_;</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  </div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">// SatClause reasons by trail_index.</span></div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  std::vector<SatClause*> reasons_;</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  </div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">// Indicates if the corresponding watchers_on_false_ list need to be</span></div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">// cleaned. The boolean is_clean_ is just used in DCHECKs.</span></div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <a class="code" href="classoperations__research_1_1_sparse_bitset.html">SparseBitset<LiteralIndex></a> needs_cleaning_;</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keywordtype">bool</span> is_clean_ = <span class="keyword">true</span>;</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>  <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html">BinaryImplicationGraph</a>* implication_graph_;</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail_;</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>  int64_t num_inspected_clauses_;</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  int64_t num_inspected_clause_literals_;</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  int64_t num_watched_clauses_;</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">mutable</span> <a class="code" href="classoperations__research_1_1_stats_group.html">StatsGroup</a> stats_;</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  </div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="comment">// For DetachAllClauses()/AttachAllClauses().</span></div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordtype">bool</span> all_clauses_are_attached_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  </div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="comment">// All the clauses currently in memory. This vector has ownership of the</span></div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="comment">// pointers. We currently do not use std::unique_ptr<SatClause> because it</span></div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="comment">// can't be used with some STL algorithms like std::partition.</span></div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="comment">// Note that the unit clauses are not kept here and if the parameter</span></div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="comment">// treat_binary_clauses_separately is true, the binary clause are not kept</span></div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="comment">// here either.</span></div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  std::vector<SatClause*> clauses_;</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  </div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordtype">int</span> to_minimize_index_ = 0;</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  </div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="comment">// Only contains removable clause.</span></div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  absl::flat_hash_map<SatClause*, ClauseInfo> clauses_info_;</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  </div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html">DratProofHandler</a>* drat_proof_handler_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  </div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html">LiteralWatchers</a>);</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span> };</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  </div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span> <span class="comment">// A binary clause. This is used by BinaryClauseManager.</span></div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_binary_clause.html"> 376</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html">BinaryClause</a> {</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_binary_clause.html#acfdf00e98421d5336252330c6ee85e21"> 377</a></span>  <a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#acfdf00e98421d5336252330c6ee85e21">BinaryClause</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> _a, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> _b) : <a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a886d202fca076745c336601d66363bb9">a</a>(_a), <a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a477754d976ebc5e37cccff698e299613">b</a>(_b) {}</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_binary_clause.html#a1fb4d33282747e00e9587898f7bd7c1d"> 378</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a1fb4d33282747e00e9587898f7bd7c1d">operator==</a>(<a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html">BinaryClause</a> o)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a886d202fca076745c336601d66363bb9">a</a> == o.<a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a886d202fca076745c336601d66363bb9">a</a> && <a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a477754d976ebc5e37cccff698e299613">b</a> == o.<a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a477754d976ebc5e37cccff698e299613">b</a>; }</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_binary_clause.html#a6e41fd727b3db90295d6f86f9a24691f"> 379</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a6e41fd727b3db90295d6f86f9a24691f">operator!=</a>(<a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html">BinaryClause</a> o)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a886d202fca076745c336601d66363bb9">a</a> != o.<a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a886d202fca076745c336601d66363bb9">a</a> || <a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a477754d976ebc5e37cccff698e299613">b</a> != o.<a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a477754d976ebc5e37cccff698e299613">b</a>; }</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_binary_clause.html#a886d202fca076745c336601d66363bb9"> 380</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a886d202fca076745c336601d66363bb9">a</a>;</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_binary_clause.html#a477754d976ebc5e37cccff698e299613"> 381</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a477754d976ebc5e37cccff698e299613">b</a>;</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span> };</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  </div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="comment">// A simple class to manage a set of binary clauses.</span></div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html"> 385</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html">BinaryClauseManager</a> {</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#ab8021c937cf1eaa07cdfa85ed1bb5e43"> 387</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#ab8021c937cf1eaa07cdfa85ed1bb5e43">BinaryClauseManager</a>() {}</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a235d38393e2379eb6a016446341d2102"> 388</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a235d38393e2379eb6a016446341d2102">NumClauses</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> set_.size(); }</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  </div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="comment">// Adds a new binary clause to the manager and returns true if it wasn't</span></div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="comment">// already present.</span></div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a4690b2e5ad68f70322cca80950f5bf7d"> 392</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a4690b2e5ad68f70322cca80950f5bf7d">Add</a>(<a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html">BinaryClause</a> c) {</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  std::pair<int, int> p(c.<a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a886d202fca076745c336601d66363bb9">a</a>.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a44fc3f1a79635fadb162d04cec312341">SignedValue</a>(), c.<a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html#a477754d976ebc5e37cccff698e299613">b</a>.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a44fc3f1a79635fadb162d04cec312341">SignedValue</a>());</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">if</span> (p.first > p.second) <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(p.first, p.second);</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordflow">if</span> (set_.find(p) == set_.end()) {</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  set_.insert(p);</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  newly_added_.push_back(c);</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  }</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">return</span> <span class="keyword">false</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>  </div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="comment">// Returns the newly added BinaryClause since the last ClearNewlyAdded() call.</span></div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a04c08271d60e84b5610ec8ed9bd7b9dc"> 404</a></span>  <span class="keyword">const</span> std::vector<BinaryClause>& <a class="code" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a04c08271d60e84b5610ec8ed9bd7b9dc">newly_added</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> newly_added_; }</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a47e143bc6df345d913315f79e0c3d290"> 405</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a47e143bc6df345d913315f79e0c3d290">ClearNewlyAdded</a>() { newly_added_.clear(); }</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>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  absl::flat_hash_set<std::pair<int, int>> set_;</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  std::vector<BinaryClause> newly_added_;</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html">BinaryClauseManager</a>);</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span> };</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  </div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span> <span class="comment">// Special class to store and propagate clauses of size 2 (i.e. implication).</span></div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="comment">// Such clauses are never deleted. Together, they represent the 2-SAT part of</span></div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="comment">// the problem. Note that 2-SAT satisfiability is a polynomial problem, but</span></div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="comment">// W2SAT (weighted 2-SAT) is NP-complete.</span></div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="comment">// TODO(user): Most of the note below are done, but we currently only applies</span></div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="comment">// the reduction before the solve. We should consider doing more in-processing.</span></div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="comment">// The code could probably still be improved too.</span></div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="comment">// Note(user): All the variables in a strongly connected component are</span></div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="comment">// equivalent and can be thus merged as one. This is relatively cheap to compute</span></div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="comment">// from time to time (linear complexity). We will also get contradiction (a <=></span></div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="comment">// not a) this way. This is done by DetectEquivalences().</span></div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="comment">// Note(user): An implication (a => not a) implies that a is false. I am not</span></div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="comment">// sure it is worth detecting that because if the solver assign a to true, it</span></div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="comment">// will learn that right away. I don't think we can do it faster.</span></div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="comment">// Note(user): The implication graph can be pruned. This is called the</span></div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="comment">// transitive reduction of a graph. For instance If a => {b,c} and b => {c},</span></div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="comment">// then there is no need to store a => {c}. The transitive reduction is unique</span></div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="comment">// on an acyclic graph. Computing it will allow for a faster propagation and</span></div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span> <span class="comment">// memory reduction. It is however not cheap. Maybe simple lazy heuristics to</span></div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="comment">// remove redundant arcs are better. Note that all the learned clauses we add</span></div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="comment">// will never be redundant (but they could introduce cycles). This is done</span></div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="comment">// by ComputeTransitiveReduction().</span></div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="comment">// Note(user): This class natively support at most one constraints. This is</span></div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="comment">// a way to reduced significantly the memory and size of some 2-SAT instances.</span></div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="comment">// However, it is not fully exploited for pure SAT problems. See</span></div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span> <span class="comment">// TransformIntoMaxCliques().</span></div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span> <span class="comment">// Note(user): Add a preprocessor to remove duplicates in the implication lists.</span></div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span> <span class="comment">// Note that all the learned clauses we add will never create duplicates.</span></div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span> <span class="comment">// References for most of the above and more:</span></div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span> <span class="comment">// - Brafman RI, "A simplifier for propositional formulas with many binary</span></div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="comment">// clauses", IEEE Trans Syst Man Cybern B Cybern. 2004 Feb;34(1):52-9.</span></div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="comment">// http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.4911</span></div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span> <span class="comment">// - Marijn J. H. Heule, Matti Järvisalo, Armin Biere, "Efficient CNF</span></div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span> <span class="comment">// Simplification Based on Binary Implication Graphs", Theory and Applications</span></div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="comment">// of Satisfiability Testing - SAT 2011, Lecture Notes in Computer Science</span></div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span> <span class="comment">// Volume 6695, 2011, pp 201-215</span></div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span> <span class="comment">// http://www.cs.helsinki.fi/u/mjarvisa/papers/heule-jarvisalo-biere.sat11.pdf</span></div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html"> 457</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html">BinaryImplicationGraph</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html">SatPropagator</a> {</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a84754e7c05874d36ad86a9372d6ca728"> 459</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a84754e7c05874d36ad86a9372d6ca728">BinaryImplicationGraph</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html">SatPropagator</a>(<span class="stringliteral">"BinaryImplicationGraph"</span>),</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  stats_(<span class="stringliteral">"BinaryImplicationGraph"</span>),</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  time_limit_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>>()),</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  random_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_model_random_generator.html">ModelRandomGenerator</a>>()),</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>()) {</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a120ef5f82f667fe8a6a38db137bfd2a7">RegisterPropagator</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  }</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  </div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a2ae3332e0712d632910bb5c5e06a3d2d"> 468</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a2ae3332e0712d632910bb5c5e06a3d2d">~BinaryImplicationGraph</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <a class="code" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>({</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << stats_.<a class="code" href="classoperations__research_1_1_stats_group.html#af9bc435481ae9e6e60d66a65d5394a7f">StatString</a>();</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"num_redundant_implications "</span> << num_redundant_implications_;</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  });</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  }</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  </div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="comment">// SatPropagator interface.</span></div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a1f591be5334541874ba049873235f0a9">Propagate</a>(<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail) <span class="keyword">final</span>;</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  absl::Span<const Literal> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a5aa25e6e306c7158c11d2053170379a2">Reason</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail,</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordtype">int</span> trail_index) <span class="keyword">const</span> <span class="keyword">final</span>;</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  </div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="comment">// Resizes the data structure.</span></div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af7fbbd00f0e631ce361b5ce6636b2017">Resize</a>(<span class="keywordtype">int</span> num_variables);</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  </div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="comment">// Returns true if there is no constraints in this class.</span></div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a357657ded604ecb97b76251146f7ac75"> 484</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a357657ded604ecb97b76251146f7ac75">IsEmpty</a>() { <span class="keywordflow">return</span> num_implications_ == 0 && at_most_ones_.<a class="code" href="classabsl_1_1_strong_vector.html#a644718bb2fb240de962dc3c9a1fdf0dc">empty</a>(); }</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  </div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="comment">// Adds the binary clause (a OR b), which is the same as (not a => b).</span></div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="comment">// Note that it is also equivalent to (not b => a).</span></div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a26fc07b3630b79be6914e6387b63a073">AddBinaryClause</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a94e79ff0c0a978e876dd1d44add9bc11"> 489</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a94e79ff0c0a978e876dd1d44add9bc11">AddImplication</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a26fc07b3630b79be6914e6387b63a073">AddBinaryClause</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.Negated(), <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  }</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="comment">// Same as AddBinaryClause() but enqueues a possible unit propagation. Note</span></div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">// that if the binary clause propagates, it must do so at the last level, this</span></div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="comment">// is DCHECKed.</span></div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="comment">// Return false and do nothing if both a and b are currently false.</span></div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a4a2107f2a0daf6968b6c0dded5964497">AddBinaryClauseDuringSearch</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  </div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="comment">// An at most one constraint of size n is a compact way to encode n * (n - 1)</span></div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">// implications. This must only be called at level zero.</span></div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="comment">// Returns false if this creates a conflict. Currently this can only happens</span></div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="comment">// if there is duplicate literal already assigned to true in this constraint.</span></div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#aec717d6bc59b3b48bb21276a081c62c1">AddAtMostOne</a>(absl::Span<const Literal> at_most_one);</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  </div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="comment">// Uses the binary implication graph to minimize the given conflict by</span></div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="comment">// removing literals that implies others. The idea is that if a and b are two</span></div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="comment">// literals from the given conflict and a => b (which is the same as not(b) =></span></div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="comment">// not(a)) then a is redundant and can be removed.</span></div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="comment">// Note that removing as many literals as possible is too time consuming, so</span></div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="comment">// we use different heuristics/algorithms to do this minimization.</span></div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="comment">// See the binary_minimization_algorithm SAT parameter and the .cc for more</span></div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="comment">// details about the different algorithms.</span></div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a311c7dc55d8a10542d54dfeabca48450">MinimizeConflictWithReachability</a>(std::vector<Literal>* c);</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af30fd0373e896f83bb84d2295a310492">MinimizeConflictExperimental</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail,</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  std::vector<Literal>* c);</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a95cb5284ae22d2cbca6cd69a275d8a98">MinimizeConflictFirst</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail, std::vector<Literal>* c,</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <a class="code" href="classoperations__research_1_1_sparse_bitset.html">SparseBitset<BooleanVariable></a>* marked);</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6cbb84e00be8d376ad8bf7d0e333a46a">MinimizeConflictFirstWithTransitiveReduction</a>(</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail, std::vector<Literal>* c,</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <a class="code" href="classoperations__research_1_1_sparse_bitset.html">SparseBitset<BooleanVariable></a>* marked, absl::BitGenRef random);</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  </div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="comment">// This must only be called at decision level 0 after all the possible</span></div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="comment">// propagations. It:</span></div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="comment">// - Removes the variable at true from the implications lists.</span></div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="comment">// - Frees the propagation list of the assigned literals.</span></div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abcad56047cef75a12528fe99794a6e1e">RemoveFixedVariables</a>();</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  </div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="comment">// Returns false if the model is unsat, otherwise detects equivalent variable</span></div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="comment">// (with respect to the implications only) and reorganize the propagation</span></div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="comment">// lists accordingly.</span></div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="comment">// TODO(user): Completely get rid of such literal instead? it might not be</span></div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="comment">// reasonable code-wise to remap our literals in all of our constraints</span></div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="comment">// though.</span></div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#aac261e221628d6a51be7243563659929">DetectEquivalences</a>(<span class="keywordtype">bool</span> log_info = <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  </div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="comment">// Returns true if DetectEquivalences() has been called and no new binary</span></div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="comment">// clauses have been added since then. When this is true then there is no</span></div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="comment">// cycle in the binary implication graph (modulo the redundant literals that</span></div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="comment">// form a cycle with their representative).</span></div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ad7144ed926660fe38c0cfbeedbaa8dfc"> 544</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ad7144ed926660fe38c0cfbeedbaa8dfc">IsDag</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> is_dag_; }</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  </div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="comment">// One must call DetectEquivalences() first, this is CHECKed.</span></div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="comment">// Returns a list so that if x => y, then x is after y.</span></div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a159201373cdb82c7511c6ea81913e9b2"> 548</a></span>  <span class="keyword">const</span> std::vector<LiteralIndex>& <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a159201373cdb82c7511c6ea81913e9b2">ReverseTopologicalOrder</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(is_dag_);</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordflow">return</span> reverse_topological_order_;</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  }</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  </div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="comment">// Returns the list of literal "directly" implied by l. Beware that this can</span></div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="comment">// easily change behind your back if you modify the solver state.</span></div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#acad035fe25e6b55ab773b5d454c946ad"> 555</a></span>  <span class="keyword">const</span> absl::InlinedVector<Literal, 6>& <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#acad035fe25e6b55ab773b5d454c946ad">Implications</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordflow">return</span> implications_[l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()];</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  }</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  </div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="comment">// Returns the representative of the equivalence class of l (or l itself if it</span></div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="comment">// is on its own). Note that DetectEquivalences() should have been called to</span></div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="comment">// get any non-trival results.</span></div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6fac58ca16fd746d7488a0a97f6965bd"> 562</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_binary_implication_graph.html#a6fac58ca16fd746d7488a0a97f6965bd">RepresentativeOf</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="keywordflow">if</span> (l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>() >= representative_of_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) <span class="keywordflow">return</span> l;</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keywordflow">if</span> (representative_of_[l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()] == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) <span class="keywordflow">return</span> l;</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(representative_of_[l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()]);</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  }</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  </div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="comment">// Prunes the implication graph by calling first DetectEquivalences() to</span></div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="comment">// remove cycle and then by computing the transitive reduction of the</span></div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="comment">// remaining DAG.</span></div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="comment">// Note that this can be slow (num_literals graph traversals), so we abort</span></div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="comment">// early if we start doing too much work.</span></div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="comment">// Returns false if the model is detected to be UNSAT (this needs to call</span></div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="comment">// DetectEquivalences() if not already done).</span></div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a29218ade45d7df87f01459565526cfe2">ComputeTransitiveReduction</a>(<span class="keywordtype">bool</span> log_info = <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  </div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="comment">// Another way of representing an implication graph is a list of maximal "at</span></div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="comment">// most one" constraints, each forming a max-clique in the incompatibility</span></div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="comment">// graph. This representation is useful for having a good linear relaxation.</span></div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="comment">// This function will transform each of the given constraint into a maximal</span></div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="comment">// one in the underlying implication graph. Constraints that are redundant</span></div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="comment">// after other have been expanded (i.e. included into) will be cleared.</span></div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="comment">// Returns false if the model is detected to be UNSAT (this needs to call</span></div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="comment">// DetectEquivalences() if not already done).</span></div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ad157fa9ca5a314f9f4c10a111792c5c6">TransformIntoMaxCliques</a>(std::vector<std::vector<Literal>>* at_most_ones,</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  int64_t max_num_explored_nodes = 1e8);</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  </div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="comment">// LP clique cut heuristic. Returns a set of "at most one" constraints on the</span></div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="comment">// given literals or their negation that are violated by the current LP</span></div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">// solution. Note that this assumes that</span></div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="comment">// lp_value(lit) = 1 - lp_value(lit.Negated()).</span></div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="comment">// The literal and lp_values vector are in one to one correspondence. We will</span></div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="comment">// only generate clique with these literals or their negation.</span></div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="comment">// TODO(user): Refine the heuristic and unit test!</span></div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keyword">const</span> std::vector<std::vector<Literal>>& <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a547f00a3da71d429424aa6dc92c487bc">GenerateAtMostOnesWithLargeWeight</a>(</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keyword">const</span> std::vector<Literal>& literals,</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keyword">const</span> std::vector<double>& lp_values);</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  </div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="comment">// Number of literal propagated by this class (including conflicts).</span></div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abaadd9bf3136af09f2d2ae695439c4fa"> 606</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abaadd9bf3136af09f2d2ae695439c4fa">num_propagations</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> num_propagations_; }</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  </div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="comment">// Number of literals inspected by this class during propagation.</span></div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a869f65709fd34e4f4ed967bab630f707"> 609</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a869f65709fd34e4f4ed967bab630f707">num_inspections</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> num_inspections_; }</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  </div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="comment">// MinimizeClause() stats.</span></div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ac43fb21cb946317348b377dbdd1589f2"> 612</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ac43fb21cb946317348b377dbdd1589f2">num_minimization</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> num_minimization_; }</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ab65ae480cf60d2f92e32e6420ba55cdb"> 613</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ab65ae480cf60d2f92e32e6420ba55cdb">num_literals_removed</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> num_literals_removed_; }</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  </div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="comment">// Returns true if this literal is fixed or is equivalent to another literal.</span></div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// This means that it can just be ignored in most situation.</span></div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="comment">// Note that the set (and thus number) of redundant literal can only grow over</span></div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="comment">// time. This is because we always use the lowest index as representative of</span></div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">// an equivalent class, so a redundant literal will stay that way.</span></div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a92844929b07caef45924b8c5e3a5a05c"> 621</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a92844929b07caef45924b8c5e3a5a05c">IsRedundant</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> is_redundant_[l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()]; }</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a76e3f946eaf9d02fbf3cf8193466e4c7"> 622</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a76e3f946eaf9d02fbf3cf8193466e4c7">num_redundant_literals</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(num_redundant_literals_ % 2, 0);</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="keywordflow">return</span> num_redundant_literals_;</div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  }</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  </div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="comment">// Number of implications removed by transitive reduction.</span></div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a8b070b41da109f3928f19f48d043958d"> 628</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a8b070b41da109f3928f19f48d043958d">num_redundant_implications</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keywordflow">return</span> num_redundant_implications_;</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  }</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  </div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="comment">// Returns the number of current implications. Note that a => b and not(b) =></span></div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="comment">// not(a) are counted separately since they appear separately in our</span></div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="comment">// propagation lists. The number of size 2 clauses that represent the same</span></div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="comment">// thing is half this number.</span></div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ae9a2f518d6edd64467abcef2c70934ff"> 636</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ae9a2f518d6edd64467abcef2c70934ff">num_implications</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> num_implications_; }</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af18b28ba180d18c4e4f524d6fde71f28"> 637</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af18b28ba180d18c4e4f524d6fde71f28">literal_size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> implications_.size(); }</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  </div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="comment">// Extract all the binary clauses managed by this class. The Output type must</span></div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="comment">// support an AddBinaryClause(Literal a, Literal b) function.</span></div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="comment">// Important: This currently does NOT include at most one constraints.</span></div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="comment">// TODO(user): When extracting to cp_model.proto we could be more efficient</span></div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="comment">// by extracting bool_and constraint with many lhs terms.</span></div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> Output></div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a558f9dd435d1f46d7408d60d0e9969f1"> 647</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a558f9dd435d1f46d7408d60d0e9969f1">ExtractAllBinaryClauses</a>(Output* out)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="comment">// TODO(user): Ideally we should just never have duplicate clauses in this</span></div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="comment">// class. But it seems we do in some corner cases, so lets not output them</span></div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="comment">// twice.</span></div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  absl::flat_hash_set<std::pair<LiteralIndex, LiteralIndex>></div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  duplicate_detection;</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keywordflow">for</span> (LiteralIndex i(0); i < implications_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(i).<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>();</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> : implications_[i]) {</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="comment">// Note(user): We almost always have both a => b and not(b) => not(a) in</span></div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="comment">// our implications_ database. Except if ComputeTransitiveReduction()</span></div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="comment">// was aborted early, but in this case, if only one is present, the</span></div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="comment">// other could be removed, so we shouldn't need to output it.</span></div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> < <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> &&</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  duplicate_detection.insert({a.Index(), b.Index()}).second) {</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  out->AddBinaryClause(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  }</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  }</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  }</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  }</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  </div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a75f1d17f36330a1c8a96e43fe8805598"> 668</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a75f1d17f36330a1c8a96e43fe8805598">SetDratProofHandler</a>(<a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html">DratProofHandler</a>* drat_proof_handler) {</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  drat_proof_handler_ = drat_proof_handler;</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  }</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  </div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="comment">// Changes the reason of the variable at trail index to a binary reason.</span></div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="comment">// Note that the implication "new_reason => trail_[trail_index]" should be</span></div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="comment">// part of the implication graph.</span></div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a3f5b39642fef6e2bf3d7b3e2a0dd2c87"> 675</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a3f5b39642fef6e2bf3d7b3e2a0dd2c87">ChangeReason</a>(<span class="keywordtype">int</span> trail_index, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> new_reason) {</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(new_reason));</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  reasons_[trail_index] = new_reason.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>();</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a28bc96741547301bfc21fd9648b9ee13">ChangeReason</a>(trail_index, <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a0af2aa6e387b8037179350b735fe127e">propagator_id_</a>);</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  }</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  </div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="comment">// The literals that are "directly" implied when literal is set to true. This</span></div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="comment">// is not a full "reachability". It includes at most ones propagation. The set</span></div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="comment">// of all direct implications is enough to describe the implications graph</span></div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="comment">// completely.</span></div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="comment">// When doing blocked clause elimination of bounded variable elimination, one</span></div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="comment">// only need to consider this list and not the full reachability.</span></div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keyword">const</span> std::vector<Literal>& <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a7eb6126b57ff4ab8246fe54f4e5550f4">DirectImplications</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  </div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="comment">// A proxy for DirectImplications().size(), However we currently do not</span></div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="comment">// maintain it perfectly. It is exact each time DirectImplications() is</span></div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="comment">// called, and we update it in some situation but we don't deal with fixed</span></div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="comment">// variables, at_most ones and duplicates implications for now.</span></div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#afc581e906dd97aacce13dd14d6a12cf3"> 694</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#afc581e906dd97aacce13dd14d6a12cf3">DirectImplicationsEstimatedSize</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keywordflow">return</span> estimated_sizes_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()];</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  }</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  </div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="comment">// Variable elimination by replacing everything of the form a => var => b by a</span></div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="comment">// => b. We ignore any a => a so the number of new implications is not always</span></div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="comment">// just the product of the two direct implication list of var and not(var).</span></div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="comment">// However, if a => var => a, then a and var are equivalent, so this case will</span></div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="comment">// be removed if one run DetectEquivalences() before this. Similarly, if a =></span></div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="comment">// var => not(a) then a must be false and this is detected and dealt with by</span></div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="comment">// FindFailedLiteralAroundVar().</span></div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abbf0624c5d966c4dcf29eece343e0592">FindFailedLiteralAroundVar</a>(BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keywordtype">bool</span>* is_unsat);</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a1858011d343c77f650753e14778c5232">NumImplicationOnVariableRemoval</a>(BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ab95a602604a2056d11cba9119e490236">RemoveBooleanVariable</a>(</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, std::deque<std::vector<Literal>>* postsolve_clauses);</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ad2d9e6c6ea7ab13e0d0002a035a6d308"> 709</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ad2d9e6c6ea7ab13e0d0002a035a6d308">IsRemoved</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> is_removed_[l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()]; }</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  </div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="comment">// TODO(user): consider at most ones.</span></div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ab64429b401679aee0bbd618449a9152a">CleanupAllRemovedVariables</a>();</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  </div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="comment">// Simple wrapper to not forget to output newly fixed variable to the DRAT</span></div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="comment">// proof if needed. This will propagate rigth away the implications.</span></div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keywordtype">bool</span> FixLiteral(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> true_literal);</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  </div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="comment">// Propagates all the direct implications of the given literal becoming true.</span></div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="comment">// Returns false if a conflict was encountered, in which case</span></div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="comment">// trail->SetFailingClause() will be called with the correct size 2 clause.</span></div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="comment">// This calls trail->Enqueue() on the newly assigned literals.</span></div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keywordtype">bool</span> PropagateOnTrue(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> true_literal, <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail);</div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  </div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="comment">// Remove any literal whose negation is marked (except the first one).</span></div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keywordtype">void</span> RemoveRedundantLiterals(std::vector<Literal>* conflict);</div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  </div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="comment">// Fill is_marked_ with all the descendant of root.</span></div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="comment">// Note that this also use dfs_stack_.</span></div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="keywordtype">void</span> MarkDescendants(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> root);</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  </div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="comment">// Expands greedily the given at most one until we get a maximum clique in</span></div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="comment">// the underlying incompatibility graph. Note that there is no guarantee that</span></div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <span class="comment">// if this is called with any sub-clique of the result we will get the same</span></div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="comment">// maximal clique.</span></div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  std::vector<Literal> ExpandAtMostOne(</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keyword">const</span> absl::Span<const Literal> at_most_one);</div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  </div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="comment">// Same as ExpandAtMostOne() but try to maximize the weight in the clique.</span></div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  std::vector<Literal> ExpandAtMostOneWithWeight(</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="keyword">const</span> absl::Span<const Literal> at_most_one,</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, bool></a>& can_be_included,</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, double></a>& expanded_lp_values);</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  </div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="comment">// Process all at most one constraints starting at or after base_index in</span></div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="comment">// at_most_one_buffer_. This replace literal by their representative, remove</span></div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="comment">// fixed literals and deal with duplicates. Return false iff the model is</span></div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="comment">// UNSAT.</span></div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keywordtype">bool</span> CleanUpAndAddAtMostOnes(<span class="keyword">const</span> <span class="keywordtype">int</span> base_index);</div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  </div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keyword">mutable</span> <a class="code" href="classoperations__research_1_1_stats_group.html">StatsGroup</a> stats_;</div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* time_limit_;</div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <a class="code" href="classoperations__research_1_1sat_1_1_model_random_generator.html">ModelRandomGenerator</a>* random_;</div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail_;</div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html">DratProofHandler</a>* drat_proof_handler_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  </div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="comment">// Binary reasons by trail_index. We need a deque because we kept pointers to</span></div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="comment">// elements of this array and this can dynamically change size.</span></div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  std::deque<Literal> reasons_;</div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  </div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="comment">// This is indexed by the Index() of a literal. Each list stores the</span></div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="comment">// literals that are implied if the index literal becomes true.</span></div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="comment">// Using InlinedVector helps quite a bit because on many problems, a literal</span></div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="comment">// only implies a few others. Note that on a 64 bits computer we get exactly</span></div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="comment">// 6 inlined int32_t elements without extra space, and the size of the inlined</span></div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="comment">// vector is 4 times 64 bits.</span></div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="comment">// TODO(user): We could be even more efficient since a size of int32_t is</span></div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="comment">// enough for us and we could store in common the inlined/not-inlined size.</span></div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, absl::InlinedVector<Literal, 6></a>></div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  implications_;</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  int64_t num_implications_ = 0;</div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  </div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="comment">// Internal representation of at_most_one constraints. Each entry point to the</span></div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="comment">// start of a constraint in the buffer. Contraints are terminated by</span></div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="comment">// kNoLiteral. When LiteralIndex is true, then all entry in the at most one</span></div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="comment">// constraint must be false except the one refering to LiteralIndex.</span></div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="comment">// TODO(user): We could be more cache efficient by combining this with</span></div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <span class="comment">// implications_ in some way. Do some propagation speed benchmark.</span></div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, absl::InlinedVector<int32_t, 6></a>></div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  at_most_ones_;</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  std::vector<Literal> at_most_one_buffer_;</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  </div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="comment">// Used by GenerateAtMostOnesWithLargeWeight().</span></div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  std::vector<std::vector<Literal>> tmp_cuts_;</div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  </div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="comment">// Some stats.</span></div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  int64_t num_propagations_ = 0;</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  int64_t num_inspections_ = 0;</div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  int64_t num_minimization_ = 0;</div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  int64_t num_literals_removed_ = 0;</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  int64_t num_redundant_implications_ = 0;</div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  int64_t num_redundant_literals_ = 0;</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  </div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="comment">// Bitset used by MinimizeClause().</span></div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="comment">// TODO(user): use the same one as the one used in the classic minimization</span></div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="comment">// because they are already initialized. Moreover they contains more</span></div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="comment">// information.</span></div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <a class="code" href="classoperations__research_1_1_sparse_bitset.html">SparseBitset<LiteralIndex></a> is_marked_;</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <a class="code" href="classoperations__research_1_1_sparse_bitset.html">SparseBitset<LiteralIndex></a> is_simplified_;</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  </div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="comment">// Temporary stack used by MinimizeClauseWithReachability().</span></div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  std::vector<Literal> dfs_stack_;</div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  </div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="comment">// Used to limit the work done by ComputeTransitiveReduction() and</span></div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="comment">// TransformIntoMaxCliques().</span></div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  int64_t work_done_in_mark_descendants_ = 0;</div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  </div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="comment">// Filled by DetectEquivalences().</span></div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keywordtype">bool</span> is_dag_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  std::vector<LiteralIndex> reverse_topological_order_;</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, bool></a> is_redundant_;</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, LiteralIndex></a> representative_of_;</div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  </div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="comment">// For in-processing and removing variables.</span></div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  std::vector<Literal> direct_implications_;</div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  std::vector<Literal> direct_implications_of_negated_literal_;</div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, bool></a> in_direct_implications_;</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, bool></a> is_removed_;</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, int></a> estimated_sizes_;</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  </div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="comment">// For RemoveFixedVariables().</span></div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keywordtype">int</span> num_processed_fixed_variables_ = 0;</div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  </div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html">BinaryImplicationGraph</a>);</div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span> };</div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  </div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  </div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span> <span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_SAT_CLAUSE_H_</span></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#l00498">base/logging.h:498</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00705">base/logging.h:705</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00423">base/logging.h:423</a></div></div>
|
|
<div class="ttc" id="abitset_8h_html"><div class="ttname"><a href="bitset_8h.html">bitset.h</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector</a></div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00076">strong_vector.h:76</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a60304b65bf89363bcc3165d3cde67f86"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">absl::StrongVector::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00147">strong_vector.h:147</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a644718bb2fb240de962dc3c9a1fdf0dc"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a644718bb2fb240de962dc3c9a1fdf0dc">absl::StrongVector::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00156">strong_vector.h:156</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html">operations_research::SparseBitset< LiteralIndex ></a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_a2fa637a68bc1b88e3d5da4f97932411a"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a2fa637a68bc1b88e3d5da4f97932411a">operations_research::SparseBitset::size</a></div><div class="ttdeci">IntegerType size() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00770">bitset.h:770</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_stats_group_html"><div class="ttname"><a href="classoperations__research_1_1_stats_group.html">operations_research::StatsGroup</a></div><div class="ttdef"><b>Definition:</b> <a href="stats_8h_source.html#l00131">stats.h:131</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_stats_group_html_af9bc435481ae9e6e60d66a65d5394a7f"><div class="ttname"><a href="classoperations__research_1_1_stats_group.html#af9bc435481ae9e6e60d66a65d5394a7f">operations_research::StatsGroup::StatString</a></div><div class="ttdeci">std::string StatString() const</div><div class="ttdef"><b>Definition:</b> <a href="stats_8cc_source.html#l00071">stats.cc:71</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00105">time_limit.h:105</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_clause_manager_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_clause_manager.html">operations_research::sat::BinaryClauseManager</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00385">clause.h:385</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_clause_manager_html_a04c08271d60e84b5610ec8ed9bd7b9dc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a04c08271d60e84b5610ec8ed9bd7b9dc">operations_research::sat::BinaryClauseManager::newly_added</a></div><div class="ttdeci">const std::vector< BinaryClause > & newly_added() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00404">clause.h:404</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_clause_manager_html_a235d38393e2379eb6a016446341d2102"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a235d38393e2379eb6a016446341d2102">operations_research::sat::BinaryClauseManager::NumClauses</a></div><div class="ttdeci">int NumClauses() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00388">clause.h:388</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_clause_manager_html_a4690b2e5ad68f70322cca80950f5bf7d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a4690b2e5ad68f70322cca80950f5bf7d">operations_research::sat::BinaryClauseManager::Add</a></div><div class="ttdeci">bool Add(BinaryClause c)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00392">clause.h:392</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_clause_manager_html_a47e143bc6df345d913315f79e0c3d290"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a47e143bc6df345d913315f79e0c3d290">operations_research::sat::BinaryClauseManager::ClearNewlyAdded</a></div><div class="ttdeci">void ClearNewlyAdded()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00405">clause.h:405</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_clause_manager_html_ab8021c937cf1eaa07cdfa85ed1bb5e43"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#ab8021c937cf1eaa07cdfa85ed1bb5e43">operations_research::sat::BinaryClauseManager::BinaryClauseManager</a></div><div class="ttdeci">BinaryClauseManager()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00387">clause.h:387</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html">operations_research::sat::BinaryImplicationGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00457">clause.h:457</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a159201373cdb82c7511c6ea81913e9b2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a159201373cdb82c7511c6ea81913e9b2">operations_research::sat::BinaryImplicationGraph::ReverseTopologicalOrder</a></div><div class="ttdeci">const std::vector< LiteralIndex > & ReverseTopologicalOrder() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00548">clause.h:548</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a1858011d343c77f650753e14778c5232"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a1858011d343c77f650753e14778c5232">operations_research::sat::BinaryImplicationGraph::NumImplicationOnVariableRemoval</a></div><div class="ttdeci">int64_t NumImplicationOnVariableRemoval(BooleanVariable var)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01898">clause.cc:1898</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a1f591be5334541874ba049873235f0a9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a1f591be5334541874ba049873235f0a9">operations_research::sat::BinaryImplicationGraph::Propagate</a></div><div class="ttdeci">bool Propagate(Trail *trail) final</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00759">clause.cc:759</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a26fc07b3630b79be6914e6387b63a073"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a26fc07b3630b79be6914e6387b63a073">operations_research::sat::BinaryImplicationGraph::AddBinaryClause</a></div><div class="ttdeci">void AddBinaryClause(Literal a, Literal b)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00492">clause.cc:492</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a29218ade45d7df87f01459565526cfe2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a29218ade45d7df87f01459565526cfe2">operations_research::sat::BinaryImplicationGraph::ComputeTransitiveReduction</a></div><div class="ttdeci">bool ComputeTransitiveReduction(bool log_info=false)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01342">clause.cc:1342</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a2ae3332e0712d632910bb5c5e06a3d2d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a2ae3332e0712d632910bb5c5e06a3d2d">operations_research::sat::BinaryImplicationGraph::~BinaryImplicationGraph</a></div><div class="ttdeci">~BinaryImplicationGraph() override</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00468">clause.h:468</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a311c7dc55d8a10542d54dfeabca48450"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a311c7dc55d8a10542d54dfeabca48450">operations_research::sat::BinaryImplicationGraph::MinimizeConflictWithReachability</a></div><div class="ttdeci">void MinimizeConflictWithReachability(std::vector< Literal > *c)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00783">clause.cc:783</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a357657ded604ecb97b76251146f7ac75"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a357657ded604ecb97b76251146f7ac75">operations_research::sat::BinaryImplicationGraph::IsEmpty</a></div><div class="ttdeci">bool IsEmpty()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00484">clause.h:484</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a3f5b39642fef6e2bf3d7b3e2a0dd2c87"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a3f5b39642fef6e2bf3d7b3e2a0dd2c87">operations_research::sat::BinaryImplicationGraph::ChangeReason</a></div><div class="ttdeci">void ChangeReason(int trail_index, Literal new_reason)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00675">clause.h:675</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a4a2107f2a0daf6968b6c0dded5964497"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a4a2107f2a0daf6968b6c0dded5964497">operations_research::sat::BinaryImplicationGraph::AddBinaryClauseDuringSearch</a></div><div class="ttdeci">bool AddBinaryClauseDuringSearch(Literal a, Literal b)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00509">clause.cc:509</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a547f00a3da71d429424aa6dc92c487bc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a547f00a3da71d429424aa6dc92c487bc">operations_research::sat::BinaryImplicationGraph::GenerateAtMostOnesWithLargeWeight</a></div><div class="ttdeci">const std::vector< std::vector< Literal > > & GenerateAtMostOnesWithLargeWeight(const std::vector< Literal > &literals, const std::vector< double > &lp_values)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01676">clause.cc:1676</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a558f9dd435d1f46d7408d60d0e9969f1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a558f9dd435d1f46d7408d60d0e9969f1">operations_research::sat::BinaryImplicationGraph::ExtractAllBinaryClauses</a></div><div class="ttdeci">void ExtractAllBinaryClauses(Output *out) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00647">clause.h:647</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a5aa25e6e306c7158c11d2053170379a2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a5aa25e6e306c7158c11d2053170379a2">operations_research::sat::BinaryImplicationGraph::Reason</a></div><div class="ttdeci">absl::Span< const Literal > Reason(const Trail &trail, int trail_index) const final</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00771">clause.cc:771</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a6cbb84e00be8d376ad8bf7d0e333a46a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6cbb84e00be8d376ad8bf7d0e333a46a">operations_research::sat::BinaryImplicationGraph::MinimizeConflictFirstWithTransitiveReduction</a></div><div class="ttdeci">void MinimizeConflictFirstWithTransitiveReduction(const Trail &trail, std::vector< Literal > *c, SparseBitset< BooleanVariable > *marked, absl::BitGenRef random)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00878">clause.cc:878</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a6fac58ca16fd746d7488a0a97f6965bd"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6fac58ca16fd746d7488a0a97f6965bd">operations_research::sat::BinaryImplicationGraph::RepresentativeOf</a></div><div class="ttdeci">Literal RepresentativeOf(Literal l) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00562">clause.h:562</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a75f1d17f36330a1c8a96e43fe8805598"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a75f1d17f36330a1c8a96e43fe8805598">operations_research::sat::BinaryImplicationGraph::SetDratProofHandler</a></div><div class="ttdeci">void SetDratProofHandler(DratProofHandler *drat_proof_handler)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00668">clause.h:668</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a76e3f946eaf9d02fbf3cf8193466e4c7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a76e3f946eaf9d02fbf3cf8193466e4c7">operations_research::sat::BinaryImplicationGraph::num_redundant_literals</a></div><div class="ttdeci">int64_t num_redundant_literals() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00622">clause.h:622</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a7eb6126b57ff4ab8246fe54f4e5550f4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a7eb6126b57ff4ab8246fe54f4e5550f4">operations_research::sat::BinaryImplicationGraph::DirectImplications</a></div><div class="ttdeci">const std::vector< Literal > & DirectImplications(Literal literal)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01830">clause.cc:1830</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a84754e7c05874d36ad86a9372d6ca728"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a84754e7c05874d36ad86a9372d6ca728">operations_research::sat::BinaryImplicationGraph::BinaryImplicationGraph</a></div><div class="ttdeci">BinaryImplicationGraph(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00459">clause.h:459</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a869f65709fd34e4f4ed967bab630f707"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a869f65709fd34e4f4ed967bab630f707">operations_research::sat::BinaryImplicationGraph::num_inspections</a></div><div class="ttdeci">int64_t num_inspections() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00609">clause.h:609</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a8b070b41da109f3928f19f48d043958d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a8b070b41da109f3928f19f48d043958d">operations_research::sat::BinaryImplicationGraph::num_redundant_implications</a></div><div class="ttdeci">int64_t num_redundant_implications() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00628">clause.h:628</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a92844929b07caef45924b8c5e3a5a05c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a92844929b07caef45924b8c5e3a5a05c">operations_research::sat::BinaryImplicationGraph::IsRedundant</a></div><div class="ttdeci">bool IsRedundant(Literal l) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00621">clause.h:621</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a94e79ff0c0a978e876dd1d44add9bc11"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a94e79ff0c0a978e876dd1d44add9bc11">operations_research::sat::BinaryImplicationGraph::AddImplication</a></div><div class="ttdeci">void AddImplication(Literal a, Literal b)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00489">clause.h:489</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a95cb5284ae22d2cbca6cd69a275d8a98"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a95cb5284ae22d2cbca6cd69a275d8a98">operations_research::sat::BinaryImplicationGraph::MinimizeConflictFirst</a></div><div class="ttdeci">void MinimizeConflictFirst(const Trail &trail, std::vector< Literal > *c, SparseBitset< BooleanVariable > *marked)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00860">clause.cc:860</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_aac261e221628d6a51be7243563659929"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#aac261e221628d6a51be7243563659929">operations_research::sat::BinaryImplicationGraph::DetectEquivalences</a></div><div class="ttdeci">bool DetectEquivalences(bool log_info=false)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01155">clause.cc:1155</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_ab64429b401679aee0bbd618449a9152a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ab64429b401679aee0bbd618449a9152a">operations_research::sat::BinaryImplicationGraph::CleanupAllRemovedVariables</a></div><div class="ttdeci">void CleanupAllRemovedVariables()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01961">clause.cc:1961</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_ab65ae480cf60d2f92e32e6420ba55cdb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ab65ae480cf60d2f92e32e6420ba55cdb">operations_research::sat::BinaryImplicationGraph::num_literals_removed</a></div><div class="ttdeci">int64_t num_literals_removed() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00613">clause.h:613</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_ab95a602604a2056d11cba9119e490236"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ab95a602604a2056d11cba9119e490236">operations_research::sat::BinaryImplicationGraph::RemoveBooleanVariable</a></div><div class="ttdeci">void RemoveBooleanVariable(BooleanVariable var, std::deque< std::vector< Literal >> *postsolve_clauses)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01918">clause.cc:1918</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_abaadd9bf3136af09f2d2ae695439c4fa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abaadd9bf3136af09f2d2ae695439c4fa">operations_research::sat::BinaryImplicationGraph::num_propagations</a></div><div class="ttdeci">int64_t num_propagations() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00606">clause.h:606</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_abbf0624c5d966c4dcf29eece343e0592"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abbf0624c5d966c4dcf29eece343e0592">operations_research::sat::BinaryImplicationGraph::FindFailedLiteralAroundVar</a></div><div class="ttdeci">bool FindFailedLiteralAroundVar(BooleanVariable var, bool *is_unsat)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01873">clause.cc:1873</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_abcad56047cef75a12528fe99794a6e1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abcad56047cef75a12528fe99794a6e1e">operations_research::sat::BinaryImplicationGraph::RemoveFixedVariables</a></div><div class="ttdeci">void RemoveFixedVariables()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00991">clause.cc:991</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_ac43fb21cb946317348b377dbdd1589f2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ac43fb21cb946317348b377dbdd1589f2">operations_research::sat::BinaryImplicationGraph::num_minimization</a></div><div class="ttdeci">int64_t num_minimization() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00612">clause.h:612</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_acad035fe25e6b55ab773b5d454c946ad"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#acad035fe25e6b55ab773b5d454c946ad">operations_research::sat::BinaryImplicationGraph::Implications</a></div><div class="ttdeci">const absl::InlinedVector< Literal, 6 > & Implications(Literal l) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00555">clause.h:555</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_ad157fa9ca5a314f9f4c10a111792c5c6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ad157fa9ca5a314f9f4c10a111792c5c6">operations_research::sat::BinaryImplicationGraph::TransformIntoMaxCliques</a></div><div class="ttdeci">bool TransformIntoMaxCliques(std::vector< std::vector< Literal >> *at_most_ones, int64_t max_num_explored_nodes=1e8)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01531">clause.cc:1531</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_ad2d9e6c6ea7ab13e0d0002a035a6d308"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ad2d9e6c6ea7ab13e0d0002a035a6d308">operations_research::sat::BinaryImplicationGraph::IsRemoved</a></div><div class="ttdeci">bool IsRemoved(Literal l) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00709">clause.h:709</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_ad7144ed926660fe38c0cfbeedbaa8dfc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ad7144ed926660fe38c0cfbeedbaa8dfc">operations_research::sat::BinaryImplicationGraph::IsDag</a></div><div class="ttdeci">bool IsDag() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00544">clause.h:544</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_ae9a2f518d6edd64467abcef2c70934ff"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ae9a2f518d6edd64467abcef2c70934ff">operations_research::sat::BinaryImplicationGraph::num_implications</a></div><div class="ttdeci">int64_t num_implications() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00636">clause.h:636</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_aec717d6bc59b3b48bb21276a081c62c1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#aec717d6bc59b3b48bb21276a081c62c1">operations_research::sat::BinaryImplicationGraph::AddAtMostOne</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool AddAtMostOne(absl::Span< const Literal > at_most_one)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00532">clause.cc:532</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_af18b28ba180d18c4e4f524d6fde71f28"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af18b28ba180d18c4e4f524d6fde71f28">operations_research::sat::BinaryImplicationGraph::literal_size</a></div><div class="ttdeci">int64_t literal_size() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00637">clause.h:637</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_af30fd0373e896f83bb84d2295a310492"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af30fd0373e896f83bb84d2295a310492">operations_research::sat::BinaryImplicationGraph::MinimizeConflictExperimental</a></div><div class="ttdeci">void MinimizeConflictExperimental(const Trail &trail, std::vector< Literal > *c)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00940">clause.cc:940</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_af7fbbd00f0e631ce361b5ce6636b2017"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af7fbbd00f0e631ce361b5ce6636b2017">operations_research::sat::BinaryImplicationGraph::Resize</a></div><div class="ttdeci">void Resize(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00478">clause.cc:478</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_afc581e906dd97aacce13dd14d6a12cf3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#afc581e906dd97aacce13dd14d6a12cf3">operations_research::sat::BinaryImplicationGraph::DirectImplicationsEstimatedSize</a></div><div class="ttdeci">int DirectImplicationsEstimatedSize(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00694">clause.h:694</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_proof_handler_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_proof_handler.html">operations_research::sat::DratProofHandler</a></div><div class="ttdef"><b>Definition:</b> <a href="drat__proof__handler_8h_source.html#l00040">drat_proof_handler.h:40</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00065">sat_base.h:65</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html_a44fc3f1a79635fadb162d04cec312341"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a44fc3f1a79635fadb162d04cec312341">operations_research::sat::Literal::SignedValue</a></div><div class="ttdeci">int SignedValue() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00088">sat_base.h:88</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html_a4a11c7c4d7706c09de5e18707c3b5c62"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">operations_research::sat::Literal::Index</a></div><div class="ttdeci">LiteralIndex Index() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00085">sat_base.h:85</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html_a886e9c024f7209181c0a850b6e90c644"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">operations_research::sat::Literal::Negated</a></div><div class="ttdeci">Literal Negated() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00092">sat_base.h:92</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html">operations_research::sat::LiteralWatchers</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00161">clause.h:161</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a0569d77056e622964bd02dd901950ede"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a0569d77056e622964bd02dd901950ede">operations_research::sat::LiteralWatchers::AllClausesInCreationOrder</a></div><div class="ttdeci">const std::vector< SatClause * > & AllClausesInCreationOrder() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00212">clause.h:212</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a0ddf4dc22639ee58f75985d875d1fd2d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a0ddf4dc22639ee58f75985d875d1fd2d">operations_research::sat::LiteralWatchers::InprocessingFixLiteral</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool InprocessingFixLiteral(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00340">clause.cc:340</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a1ba4013455d8c21e62115060dabf9364"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1ba4013455d8c21e62115060dabf9364">operations_research::sat::LiteralWatchers::mutable_clauses_info</a></div><div class="ttdeci">absl::flat_hash_map< SatClause *, ClauseInfo > * mutable_clauses_info()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00224">clause.h:224</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a1c7c594a8c50b3a60f4b67b74da2e4ed"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1c7c594a8c50b3a60f4b67b74da2e4ed">operations_research::sat::LiteralWatchers::LiteralWatchers</a></div><div class="ttdeci">LiteralWatchers(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00054">clause.cc:54</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a1f591be5334541874ba049873235f0a9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1f591be5334541874ba049873235f0a9">operations_research::sat::LiteralWatchers::Propagate</a></div><div class="ttdeci">bool Propagate(Trail *trail) final</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00184">clause.cc:184</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a287676c504a640a5569710d352ef6585"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a287676c504a640a5569710d352ef6585">operations_research::sat::LiteralWatchers::InprocessingRemoveClause</a></div><div class="ttdeci">void InprocessingRemoveClause(SatClause *clause)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00359">clause.cc:359</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a38c7c4ca12035b254d9497a401606e0c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a38c7c4ca12035b254d9497a401606e0c">operations_research::sat::LiteralWatchers::DetachAllClauses</a></div><div class="ttdeci">void DetachAllClauses()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00312">clause.cc:312</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a56cba28a88a7cffa362a362fdce24dc3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a56cba28a88a7cffa362a362fdce24dc3">operations_research::sat::LiteralWatchers::AttachAllClauses</a></div><div class="ttdeci">void AttachAllClauses()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00323">clause.cc:323</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a5aa25e6e306c7158c11d2053170379a2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a5aa25e6e306c7158c11d2053170379a2">operations_research::sat::LiteralWatchers::Reason</a></div><div class="ttdeci">absl::Span< const Literal > Reason(const Trail &trail, int trail_index) const final</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00193">clause.cc:193</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a6af58ea401f90fe1a40be4558dba478a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a6af58ea401f90fe1a40be4558dba478a">operations_research::sat::LiteralWatchers::AddRemovableClause</a></div><div class="ttdeci">SatClause * AddRemovableClause(const std::vector< Literal > &literals, Trail *trail)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00213">clause.cc:213</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a70c5a070f03810d5467c5758f6bb916e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a70c5a070f03810d5467c5758f6bb916e">operations_research::sat::LiteralWatchers::num_inspected_clauses</a></div><div class="ttdeci">int64_t num_inspected_clauses() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00229">clause.h:229</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a74971b631e1b357b2f440dff321b5c9b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a74971b631e1b357b2f440dff321b5c9b">operations_research::sat::LiteralWatchers::InprocessingAddClause</a></div><div class="ttdeci">SatClause * InprocessingAddClause(absl::Span< const Literal > new_clause)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00416">clause.cc:416</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a75f1d17f36330a1c8a96e43fe8805598"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a75f1d17f36330a1c8a96e43fe8805598">operations_research::sat::LiteralWatchers::SetDratProofHandler</a></div><div class="ttdeci">void SetDratProofHandler(DratProofHandler *drat_proof_handler)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00240">clause.h:240</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a9662224096e0c22fce84cdab66562093"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a9662224096e0c22fce84cdab66562093">operations_research::sat::LiteralWatchers::WatcherListOnFalse</a></div><div class="ttdeci">const std::vector< Watcher > & WatcherListOnFalse(Literal false_literal) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00313">clause.h:313</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a9e43736bb5ad76519001b5beeb0eac6d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a9e43736bb5ad76519001b5beeb0eac6d">operations_research::sat::LiteralWatchers::num_clauses</a></div><div class="ttdeci">int64_t num_clauses() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00211">clause.h:211</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_aab21bb15f39af99c400610195b7c682d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#aab21bb15f39af99c400610195b7c682d">operations_research::sat::LiteralWatchers::NextClauseToMinimize</a></div><div class="ttdeci">SatClause * NextClauseToMinimize()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00247">clause.h:247</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_aab96a842b592211bf178caaf41e41f1d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#aab96a842b592211bf178caaf41e41f1d">operations_research::sat::LiteralWatchers::Attach</a></div><div class="ttdeci">void Attach(SatClause *clause, Trail *trail)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00275">clause.cc:275</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_aaec5e05be5e5e385c6222c023587cb05"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaec5e05be5e5e385c6222c023587cb05">operations_research::sat::LiteralWatchers::AddClause</a></div><div class="ttdeci">bool AddClause(absl::Span< const Literal > literals, Trail *trail)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00206">clause.cc:206</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_aaf9f3bc83c843a94dd2240e2a81a5e3b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaf9f3bc83c843a94dd2240e2a81a5e3b">operations_research::sat::LiteralWatchers::ReasonClause</a></div><div class="ttdeci">SatClause * ReasonClause(int trail_index) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00198">clause.cc:198</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ab054db78fc1b1e1681d2fc4e9fd1ca45"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab054db78fc1b1e1681d2fc4e9fd1ca45">operations_research::sat::LiteralWatchers::IsRemovable</a></div><div class="ttdeci">bool IsRemovable(SatClause *const clause) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00220">clause.h:220</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ab17b31190c5ab58a1334139848335283"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab17b31190c5ab58a1334139848335283">operations_research::sat::LiteralWatchers::InprocessingRewriteClause</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool InprocessingRewriteClause(SatClause *clause, absl::Span< const Literal > new_clause)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00368">clause.cc:368</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ab6174cc15ef4df301b31aff43216039e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab6174cc15ef4df301b31aff43216039e">operations_research::sat::LiteralWatchers::num_watched_clauses</a></div><div class="ttdeci">int64_t num_watched_clauses() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00238">clause.h:238</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ab6bd51395bef8b42ac66ad9b52635084"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab6bd51395bef8b42ac66ad9b52635084">operations_research::sat::LiteralWatchers::LazyDetach</a></div><div class="ttdeci">void LazyDetach(SatClause *clause)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00295">clause.cc:295</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ab80681ada3f207791a16617205935937"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab80681ada3f207791a16617205935937">operations_research::sat::LiteralWatchers::num_removable_clauses</a></div><div class="ttdeci">int64_t num_removable_clauses() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00223">clause.h:223</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ac5790e264f5bf7307a81ca51f1e0db66"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ac5790e264f5bf7307a81ca51f1e0db66">operations_research::sat::LiteralWatchers::~LiteralWatchers</a></div><div class="ttdeci">~LiteralWatchers() override</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00065">clause.cc:65</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ad78bb381916ac421212217a3e5cb03ab"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ad78bb381916ac421212217a3e5cb03ab">operations_research::sat::LiteralWatchers::num_inspected_clause_literals</a></div><div class="ttdeci">int64_t num_inspected_clause_literals() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00230">clause.h:230</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ada4c57ad822069c6c61a93973dc39c4d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ada4c57ad822069c6c61a93973dc39c4d">operations_research::sat::LiteralWatchers::ResetToMinimizeIndex</a></div><div class="ttdeci">void ResetToMinimizeIndex()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00258">clause.h:258</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ae234022ee7c496416290d1946f56e1ad"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ae234022ee7c496416290d1946f56e1ad">operations_research::sat::LiteralWatchers::DeleteRemovedClauses</a></div><div class="ttdeci">void DeleteRemovedClauses()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00455">clause.cc:455</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ae57f3c4e72eb63a34fa09e707a18e6d3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ae57f3c4e72eb63a34fa09e707a18e6d3">operations_research::sat::LiteralWatchers::CleanUpWatchers</a></div><div class="ttdeci">void CleanUpWatchers()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00442">clause.cc:442</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_af18b28ba180d18c4e4f524d6fde71f28"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#af18b28ba180d18c4e4f524d6fde71f28">operations_research::sat::LiteralWatchers::literal_size</a></div><div class="ttdeci">int64_t literal_size() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00235">clause.h:235</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_af3769ff2cdf469ae4a13cc4f6b15bc14"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#af3769ff2cdf469ae4a13cc4f6b15bc14">operations_research::sat::LiteralWatchers::Detach</a></div><div class="ttdeci">void Detach(SatClause *clause)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00302">clause.cc:302</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_af7fbbd00f0e631ce361b5ce6636b2017"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#af7fbbd00f0e631ce361b5ce6636b2017">operations_research::sat::LiteralWatchers::Resize</a></div><div class="ttdeci">void Resize(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00070">clause.cc:70</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_random_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model_random_generator.html">operations_research::sat::ModelRandomGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8h_source.html#l00040">sat/util.h:40</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html">operations_research::sat::SatClause</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00052">clause.h:52</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html_a05691332c1a49213875440568a7580aa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html#a05691332c1a49213875440568a7580aa">operations_research::sat::SatClause::AsSpan</a></div><div class="ttdeci">absl::Span< const Literal > AsSpan() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00091">clause.h:91</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html_a140ffada20bd79a6fbf8c1c31f52b5c4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html#a140ffada20bd79a6fbf8c1c31f52b5c4">operations_research::sat::SatClause::end</a></div><div class="ttdeci">const Literal *const end() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00071">clause.h:71</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html_a32e91bfa50c69a7b51346b9de33831ea"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html#a32e91bfa50c69a7b51346b9de33831ea">operations_research::sat::SatClause::SecondLiteral</a></div><div class="ttdeci">Literal SecondLiteral() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00076">clause.h:76</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html_a411b77da6c8687d6a0a6153a7afcd19f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html#a411b77da6c8687d6a0a6153a7afcd19f">operations_research::sat::SatClause::PropagationReason</a></div><div class="ttdeci">absl::Span< const Literal > PropagationReason() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00086">clause.h:86</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html_a43aee08d7cb1f81a9fee85b46820f175"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html#a43aee08d7cb1f81a9fee85b46820f175">operations_research::sat::SatClause::PropagatedLiteral</a></div><div class="ttdeci">Literal PropagatedLiteral() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00081">clause.h:81</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html_a6095b00a4734d32844a85927b355ce32"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html#a6095b00a4734d32844a85927b355ce32">operations_research::sat::SatClause::IsSatisfied</a></div><div class="ttdeci">bool IsSatisfied(const VariablesAssignment &assignment) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l02015">clause.cc:2015</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html_a69422a656b68d50692a1b01e2b0d22ae"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html#a69422a656b68d50692a1b01e2b0d22ae">operations_research::sat::SatClause::RemoveFixedLiteralsAndTestIfTrue</a></div><div class="ttdeci">bool RemoveFixedLiteralsAndTestIfTrue(const VariablesAssignment &assignment)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01991">clause.cc:1991</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html#a764be64f3029f8b8e23511061d8de355">operations_research::sat::SatClause::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l02022">clause.cc:2022</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html_a78c28538faebd5f023cd4511df6ffee4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html#a78c28538faebd5f023cd4511df6ffee4">operations_research::sat::SatClause::empty</a></div><div class="ttdeci">int empty() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00067">clause.h:67</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html_ad6fa965d41774098c99258d76677fa02"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html#ad6fa965d41774098c99258d76677fa02">operations_research::sat::SatClause::FirstLiteral</a></div><div class="ttdeci">Literal FirstLiteral() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00075">clause.h:75</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html_ad891f84075141b619317c2634891d010"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html#ad891f84075141b619317c2634891d010">operations_research::sat::SatClause::Create</a></div><div class="ttdeci">static SatClause * Create(absl::Span< const Literal > literals)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01978">clause.cc:1978</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html_ad8932e395fe5c508700b7f95d3064aef"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html#ad8932e395fe5c508700b7f95d3064aef">operations_research::sat::SatClause::IsAttached</a></div><div class="ttdeci">bool IsAttached() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00109">clause.h:109</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html_ae475fa887548c9841d591b2040d83b08"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html#ae475fa887548c9841d591b2040d83b08">operations_research::sat::SatClause::begin</a></div><div class="ttdeci">const Literal *const begin() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00070">clause.h:70</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html_af9593d4a5ff4274efaf429cb4f9e57cc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html#af9593d4a5ff4274efaf429cb4f9e57cc">operations_research::sat::SatClause::size</a></div><div class="ttdeci">int size() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00066">clause.h:66</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_propagator.html">operations_research::sat::SatPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00446">sat_base.h:446</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_propagator_html_a0af2aa6e387b8037179350b735fe127e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_propagator.html#a0af2aa6e387b8037179350b735fe127e">operations_research::sat::SatPropagator::propagator_id_</a></div><div class="ttdeci">int propagator_id_</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00507">sat_base.h:507</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html">operations_research::sat::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00234">sat_base.h:234</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a120ef5f82f667fe8a6a38db137bfd2a7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a120ef5f82f667fe8a6a38db137bfd2a7">operations_research::sat::Trail::RegisterPropagator</a></div><div class="ttdeci">void RegisterPropagator(SatPropagator *propagator)</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00552">sat_base.h:552</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a28bc96741547301bfc21fd9648b9ee13"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a28bc96741547301bfc21fd9648b9ee13">operations_research::sat::Trail::ChangeReason</a></div><div class="ttdeci">void ChangeReason(int trail_index, int propagator_id)</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00336">sat_base.h:336</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a9789bf03dba611e9be5679d6e902d0c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">operations_research::sat::Trail::Assignment</a></div><div class="ttdeci">const VariablesAssignment & Assignment() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00381">sat_base.h:381</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html">operations_research::sat::VariablesAssignment</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00123">sat_base.h:123</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_a5300129913f51dcb0b1c531e3248490e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">operations_research::sat::VariablesAssignment::LiteralIsTrue</a></div><div class="ttdeci">bool LiteralIsTrue(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00151">sat_base.h:151</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_acb18315d548212835cd8ed4287e6c0b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a></div><div class="ttdeci">int64_t a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00046">constraint_solver/table.cc:46</a></div></div>
|
|
<div class="ttc" id="adrat__proof__handler_8h_html"><div class="ttname"><a href="drat__proof__handler_8h.html">drat_proof_handler.h</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00273">gurobi_interface.cc:273</a></div></div>
|
|
<div class="ttc" id="ahash_8h_html"><div class="ttname"><a href="hash_8h.html">hash.h</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="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_ab4a2cbab234914b320b7fae11b6e8cb9"><div class="ttname"><a href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a></div><div class="ttdeci">const int INFO</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00031">log_severity.h:31</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html_af8df3547bfde53a5acb93e2607b0034a"><div class="ttname"><a href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a></div><div class="ttdeci">#define DISALLOW_COPY_AND_ASSIGN(TypeName)</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00029">macros.h:29</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_aae28e97bd1fa93cb0032642550da7455"><div class="ttname"><a href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a></div><div class="ttdeci">bool ContainsKey(const Collection &collection, const Key &key)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00200">map_util.h:200</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap< K, V > &a, IdMap< K, V > &b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00263">id_map.h:263</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a2dbcb7017d468a17bdb30252af5c6c31"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">operations_research::sat::kNoLiteralIndex</a></div><div class="ttdeci">const LiteralIndex kNoLiteralIndex(-1)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="aoptimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00085">optimization.cc:85</a></div></div>
|
|
<div class="ttc" id="asat_2model_8h_html"><div class="ttname"><a href="sat_2model_8h.html">model.h</a></div></div>
|
|
<div class="ttc" id="asat_2util_8h_html"><div class="ttname"><a href="sat_2util_8h.html">util.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="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="astats_8h_html"><div class="ttname"><a href="stats_8h.html">stats.h</a></div></div>
|
|
<div class="ttc" id="astats_8h_html_a3c3e6b102f0d91c523099325c98e1887"><div class="ttname"><a href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a></div><div class="ttdeci">#define IF_STATS_ENABLED(instructions)</div><div class="ttdef"><b>Definition:</b> <a href="stats_8h_source.html#l00437">stats.h:437</a></div></div>
|
|
<div class="ttc" id="astrong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_binary_clause_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_binary_clause.html">operations_research::sat::BinaryClause</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00376">clause.h:376</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_binary_clause_html_a1fb4d33282747e00e9587898f7bd7c1d"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_binary_clause.html#a1fb4d33282747e00e9587898f7bd7c1d">operations_research::sat::BinaryClause::operator==</a></div><div class="ttdeci">bool operator==(BinaryClause o) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00378">clause.h:378</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_binary_clause_html_a477754d976ebc5e37cccff698e299613"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_binary_clause.html#a477754d976ebc5e37cccff698e299613">operations_research::sat::BinaryClause::b</a></div><div class="ttdeci">Literal b</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00381">clause.h:381</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_binary_clause_html_a6e41fd727b3db90295d6f86f9a24691f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_binary_clause.html#a6e41fd727b3db90295d6f86f9a24691f">operations_research::sat::BinaryClause::operator!=</a></div><div class="ttdeci">bool operator!=(BinaryClause o) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00379">clause.h:379</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_binary_clause_html_a886d202fca076745c336601d66363bb9"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_binary_clause.html#a886d202fca076745c336601d66363bb9">operations_research::sat::BinaryClause::a</a></div><div class="ttdeci">Literal a</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00380">clause.h:380</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_binary_clause_html_acfdf00e98421d5336252330c6ee85e21"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_binary_clause.html#acfdf00e98421d5336252330c6ee85e21">operations_research::sat::BinaryClause::BinaryClause</a></div><div class="ttdeci">BinaryClause(Literal _a, Literal _b)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00377">clause.h:377</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_clause_info_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_clause_info.html">operations_research::sat::ClauseInfo</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00144">clause.h:144</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_clause_info_html_a88057f377391af0e1ebe4b97af753d19"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_clause_info.html#a88057f377391af0e1ebe4b97af753d19">operations_research::sat::ClauseInfo::protected_during_next_cleanup</a></div><div class="ttdeci">bool protected_during_next_cleanup</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00147">clause.h:147</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_clause_info_html_ac3e857ac5cab6563bdbf0dd5632df5ea"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_clause_info.html#ac3e857ac5cab6563bdbf0dd5632df5ea">operations_research::sat::ClauseInfo::activity</a></div><div class="ttdeci">double activity</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00145">clause.h:145</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_clause_info_html_aeae764750e16aaa4d963129a5dd92b6d"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_clause_info.html#aeae764750e16aaa4d963129a5dd92b6d">operations_research::sat::ClauseInfo::lbd</a></div><div class="ttdeci">int32_t lbd</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00146">clause.h:146</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html">operations_research::sat::LiteralWatchers::Watcher</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00288">clause.h:288</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher_html_a4a0473c811fac417fd412079d44641bc"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#a4a0473c811fac417fd412079d44641bc">operations_research::sat::LiteralWatchers::Watcher::Watcher</a></div><div class="ttdeci">Watcher()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00289">clause.h:289</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher_html_a6382444169ace737c31ed66f4aaa4911"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#a6382444169ace737c31ed66f4aaa4911">operations_research::sat::LiteralWatchers::Watcher::start_index</a></div><div class="ttdeci">int32_t start_index</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00306">clause.h:306</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher_html_a8a2bf3687ccbe5c521d93a13c07d6d77"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#a8a2bf3687ccbe5c521d93a13c07d6d77">operations_research::sat::LiteralWatchers::Watcher::Watcher</a></div><div class="ttdeci">Watcher(SatClause *c, Literal b, int i=2)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00290">clause.h:290</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher_html_aac01b9da5c153681e4b792e0fa0b8d41"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#aac01b9da5c153681e4b792e0fa0b8d41">operations_research::sat::LiteralWatchers::Watcher::blocking_literal</a></div><div class="ttdeci">Literal blocking_literal</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00295">clause.h:295</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher_html_ad6bf9b00a3144ebd5ded72037f2b577f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#ad6bf9b00a3144ebd5ded72037f2b577f">operations_research::sat::LiteralWatchers::Watcher::clause</a></div><div class="ttdeci">SatClause * clause</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00308">clause.h:308</a></div></div>
|
|
<div class="ttc" id="atime__limit_8h_html"><div class="ttname"><a href="time__limit_8h.html">time_limit.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="clause_8h.html">clause.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.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|