2260 lines
428 KiB
HTML
2260 lines
428 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.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">8.2</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_8cc_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">clause.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="clause_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="clause_8h.html">ortools/sat/clause.h</a>"</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <functional></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  </div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="stl__util_8h.html">ortools/base/stl_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</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="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="timer_8h.html">ortools/base/timer.h</a>"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="strongly__connected__components_8h.html">ortools/graph/strongly_connected_components.h</a>"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  </div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  </div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  </div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// Returns true if the given watcher list contains the given clause.</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Watcher></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="keywordtype">bool</span> WatcherListContains(<span class="keyword">const</span> std::vector<Watcher>& list,</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keyword">const</span> SatClause& candidate) {</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Watcher& watcher : list) {</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keywordflow">if</span> (watcher.clause == &candidate) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  }</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> }</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  </div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// A simple wrapper to simplify the erase(std::remove_if()) pattern.</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Container, <span class="keyword">typename</span> Predicate></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="keywordtype">void</span> RemoveIf(Container c, Predicate p) {</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  c->erase(std::remove_if(c->begin(), c->end(), p), c->end());</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>  </div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// ----- LiteralWatchers -----</span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  </div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1c7c594a8c50b3a60f4b67b74da2e4ed"> 53</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1c7c594a8c50b3a60f4b67b74da2e4ed">LiteralWatchers::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="l00054"></a><span class="lineno"> 54</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html">SatPropagator</a>(<span class="stringliteral">"LiteralWatchers"</span>),</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  implication_graph_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html">BinaryImplicationGraph</a>>()),</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</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="l00057"></a><span class="lineno"> 57</span>  num_inspected_clauses_(0),</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  num_inspected_clause_literals_(0),</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  num_watched_clauses_(0),</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  stats_(<span class="stringliteral">"LiteralWatchers"</span>) {</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</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="l00062"></a><span class="lineno"> 62</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"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ac5790e264f5bf7307a81ca51f1e0db66"> 64</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ac5790e264f5bf7307a81ca51f1e0db66">LiteralWatchers::~LiteralWatchers</a>() {</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <a class="code" href="namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6">gtl::STLDeleteElements</a>(&clauses_);</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <a class="code" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>(<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="l00067"></a><span class="lineno"> 67</span> }</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  </div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#af7fbbd00f0e631ce361b5ce6636b2017"> 69</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#af7fbbd00f0e631ce361b5ce6636b2017">LiteralWatchers::Resize</a>(<span class="keywordtype">int</span> num_variables) {</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_clean_);</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  watchers_on_false_.resize(num_variables << 1);</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  reasons_.resize(num_variables);</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  needs_cleaning_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#abf34ab06e7250e92954c2b5a263e5612">Resize</a>(LiteralIndex(num_variables << 1));</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> }</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  </div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// Note that this is the only place where we add Watcher so the DCHECK</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// guarantees that there are no duplicates.</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="keywordtype">void</span> LiteralWatchers::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="l00079"></a><span class="lineno"> 79</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause) {</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_clean_);</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!WatcherListContains(watchers_on_false_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()], *clause));</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  watchers_on_false_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()].push_back(</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  Watcher(clause, blocking_literal));</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> }</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  </div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="keywordtype">bool</span> LiteralWatchers::PropagateOnFalse(Literal false_literal, <a class="code" href="structoperations__research_1_1_trail.html">Trail</a>* trail) {</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_clean_);</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  std::vector<Watcher>& watchers = watchers_on_false_[false_literal.Index()];</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">const</span> VariablesAssignment& assignment = trail->Assignment();</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  </div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// Note(user): It sounds better to inspect the list in order, this is because</span></div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// small clauses like binary or ternary clauses will often propagate and thus</span></div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// stay at the beginning of the list.</span></div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">auto</span> new_it = watchers.begin();</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">const</span> <span class="keyword">auto</span> end = watchers.end();</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">while</span> (new_it != end && assignment.LiteralIsTrue(new_it->blocking_literal)) {</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  ++new_it;</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = new_it; it != end; ++it) {</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// Don't even look at the clause memory if the blocking literal is true.</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">if</span> (assignment.LiteralIsTrue(it->blocking_literal)) {</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  *new_it++ = *it;</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  ++num_inspected_clauses_;</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  </div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// If the other watched literal is true, just change the blocking literal.</span></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">// Note that we use the fact that the first two literals of the clause are</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">// the ones currently watched.</span></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  Literal* literals = it->clause->literals();</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">const</span> Literal other_watched_literal(</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  LiteralIndex(literals[0].<a class="code" href="namespaceoperations__research_1_1glop.html#abec9e934a51aa2ab519684cc0f446a41">Index</a>().<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>() ^ literals[1].<a class="code" href="namespaceoperations__research_1_1glop.html#abec9e934a51aa2ab519684cc0f446a41">Index</a>().<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>() ^</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  false_literal.Index().value()));</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">if</span> (assignment.LiteralIsTrue(other_watched_literal)) {</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  *new_it = *it;</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  new_it->blocking_literal = other_watched_literal;</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  ++new_it;</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  ++num_inspected_clause_literals_;</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  }</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  </div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// Look for another literal to watch. We go through the list in a cyclic</span></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// fashion from start. The first two literals can be ignored as they are the</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// watched ones.</span></div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  {</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> start = it->start_index;</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = it->clause->size();</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(start, 2);</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>  <span class="keywordtype">int</span> i = start;</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">while</span> (i < size && assignment.LiteralIsFalse(literals[i])) ++i;</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  num_inspected_clause_literals_ += i - start + 2;</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">if</span> (i >= size) {</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  i = 2;</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">while</span> (i < start && assignment.LiteralIsFalse(literals[i])) ++i;</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  num_inspected_clause_literals_ += i - 2;</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">if</span> (i >= start) i = size;</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="keywordflow">if</span> (i < size) {</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="comment">// literal[i] is unassigned or true, it's now the new literal to watch.</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// Note that by convention, we always keep the two watched literals at</span></div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// the beginning of the clause.</span></div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  literals[0] = other_watched_literal;</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  literals[1] = literals[i];</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  literals[i] = false_literal;</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  watchers_on_false_[literals[1].Index()].emplace_back(</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  it->clause, other_watched_literal, i + 1);</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  }</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  }</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  </div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// At this point other_watched_literal is either false or unassigned, all</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// other literals are false.</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (assignment.LiteralIsFalse(other_watched_literal)) {</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">// Conflict: All literals of it->clause are false.</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">// Note(user): we could avoid a copy here, but the conflict analysis</span></div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="comment">// complexity will be a lot higher than this anyway.</span></div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  trail->MutableConflict()->assign(it->clause->begin(), it->clause->end());</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  trail->SetFailingSatClause(it->clause);</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  num_inspected_clause_literals_ += it - watchers.begin() + 1;</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  watchers.erase(new_it, it);</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="comment">// Propagation: other_watched_literal is unassigned, set it to true and</span></div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// put it at position 0. Note that the position 0 is important because</span></div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// we will need later to recover the literal that was propagated from the</span></div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// clause using this convention.</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  literals[0] = other_watched_literal;</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  literals[1] = false_literal;</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  reasons_[trail->Index()] = it->clause;</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  trail->Enqueue(other_watched_literal, <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a0af2aa6e387b8037179350b735fe127e">propagator_id_</a>);</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  *new_it++ = *it;</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  }</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  }</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  num_inspected_clause_literals_ += watchers.size(); <span class="comment">// The blocking ones.</span></div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  watchers.erase(new_it, end);</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span> }</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  </div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1f591be5334541874ba049873235f0a9"> 183</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1f591be5334541874ba049873235f0a9">LiteralWatchers::Propagate</a>(<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail) {</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_index = trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">while</span> (trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>() == old_index && <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a> < old_index) {</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = (*trail)[<a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a>++];</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">if</span> (!PropagateOnFalse(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Negated(), trail)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span> }</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  </div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a5aa25e6e306c7158c11d2053170379a2"> 192</a></span> absl::Span<const Literal> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a5aa25e6e306c7158c11d2053170379a2">LiteralWatchers::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="l00193"></a><span class="lineno"> 193</span>  <span class="keywordtype">int</span> trail_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">return</span> reasons_[trail_index]->PropagationReason();</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span> }</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  </div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaf9f3bc83c843a94dd2240e2a81a5e3b"> 197</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#aaf9f3bc83c843a94dd2240e2a81a5e3b">LiteralWatchers::ReasonClause</a>(<span class="keywordtype">int</span> trail_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">return</span> reasons_[trail_index];</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> }</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  </div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a7d2183715f2bb5f2583cf4393f958266"> 201</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaec5e05be5e5e385c6222c023587cb05">LiteralWatchers::AddClause</a>(absl::Span<const Literal> literals) {</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaec5e05be5e5e385c6222c023587cb05">AddClause</a>(literals, trail_);</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span> }</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  </div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaec5e05be5e5e385c6222c023587cb05"> 205</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaec5e05be5e5e385c6222c023587cb05">LiteralWatchers::AddClause</a>(absl::Span<const Literal> literals,</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail) {</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <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_sat_clause.html#ad891f84075141b619317c2634891d010">SatClause::Create</a>(literals);</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  clauses_.push_back(clause);</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">return</span> AttachAndPropagate(clause, trail);</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> }</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  </div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a6af58ea401f90fe1a40be4558dba478a"> 212</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#a6af58ea401f90fe1a40be4558dba478a">LiteralWatchers::AddRemovableClause</a>(</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">const</span> std::vector<Literal>& literals, <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail) {</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <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_sat_clause.html#ad891f84075141b619317c2634891d010">SatClause::Create</a>(literals);</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  clauses_.push_back(clause);</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(AttachAndPropagate(clause, trail));</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">return</span> clause;</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span> }</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  </div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="comment">// Sets up the 2-watchers data structure. It selects two non-false literals</span></div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="comment">// and attaches the clause to the event: one of the watched literals become</span></div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="comment">// false. It returns false if the clause only contains literals assigned to</span></div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment">// false. If only one literals is not false, it propagates it to true if it</span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment">// is not already assigned.</span></div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="keywordtype">bool</span> LiteralWatchers::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="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</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="keyword">const</span> <span class="keywordtype">int</span> size = clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>();</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>* literals = clause->literals();</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  </div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="comment">// Select the first two literals that are not assigned to false and put them</span></div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">// on position 0 and 1.</span></div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordtype">int</span> num_literal_not_false = 0;</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">if</span> (!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#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(literals[i])) {</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  std::swap(literals[i], literals[num_literal_not_false]);</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  ++num_literal_not_false;</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">if</span> (num_literal_not_false == 2) {</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  }</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  }</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">// Returns false if all the literals were false.</span></div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="comment">// This should only happen on an UNSAT problem, and there is no need to attach</span></div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// the clause in this case.</span></div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">if</span> (num_literal_not_false == 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  </div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">if</span> (num_literal_not_false == 1) {</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="comment">// To maintain the validity of the 2-watcher algorithm, we need to watch</span></div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="comment">// the false literal with the highest decision level.</span></div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordtype">int</span> max_level = trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(literals[1].Variable()).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#afefd28242df91e46e762af1f7eaf623f">level</a>;</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i < size; ++i) {</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> level = trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(literals[i].Variable()).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#afefd28242df91e46e762af1f7eaf623f">level</a>;</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">if</span> (level > max_level) {</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  max_level = level;</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  std::swap(literals[1], literals[i]);</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  }</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  </div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">// Propagates literals[0] if it is unassigned.</span></div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">if</span> (!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>(literals[0])) {</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  reasons_[trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>()] = clause;</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a12c36a7cb228d80bcad42fa38a103f92">Enqueue</a>(literals[0], <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a0af2aa6e387b8037179350b735fe127e">propagator_id_</a>);</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  }</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  }</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  </div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  ++num_watched_clauses_;</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  AttachOnFalse(literals[0], literals[1], clause);</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  AttachOnFalse(literals[1], literals[0], clause);</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span> }</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  </div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aab96a842b592211bf178caaf41e41f1d"> 274</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aab96a842b592211bf178caaf41e41f1d">LiteralWatchers::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="l00275"></a><span class="lineno"> 275</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>* literals = clause->literals();</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</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#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(literals[0]));</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</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#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(literals[1]));</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  </div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  ++num_watched_clauses_;</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  AttachOnFalse(literals[0], literals[1], clause);</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  AttachOnFalse(literals[1], literals[0], clause);</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span> }</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  </div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="keywordtype">void</span> LiteralWatchers::InternalDetach(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause) {</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  --num_watched_clauses_;</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> size = clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>();</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">if</span> (drat_proof_handler_ != <span class="keyword">nullptr</span> && size > 2) {</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a18349231154d0f5eaee94fe213f347e6">DeleteClause</a>({clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#ae475fa887548c9841d591b2040d83b08">begin</a>(), size});</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  }</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  clauses_info_.erase(clause);</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  clause->Clear();</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>  </div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab6bd51395bef8b42ac66ad9b52635084"> 294</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab6bd51395bef8b42ac66ad9b52635084">LiteralWatchers::LazyDetach</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause) {</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  InternalDetach(clause);</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  is_clean_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  needs_cleaning_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#ad6fa965d41774098c99258d76677fa02">FirstLiteral</a>().<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>());</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  needs_cleaning_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a32e91bfa50c69a7b51346b9de33831ea">SecondLiteral</a>().<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>());</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span> }</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  </div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#af3769ff2cdf469ae4a13cc4f6b15bc14"> 301</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#af3769ff2cdf469ae4a13cc4f6b15bc14">LiteralWatchers::Detach</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause) {</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  InternalDetach(clause);</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</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> l : {clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#ad6fa965d41774098c99258d76677fa02">FirstLiteral</a>(), clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a32e91bfa50c69a7b51346b9de33831ea">SecondLiteral</a>()}) {</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  needs_cleaning_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(l.Index());</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  RemoveIf(&(watchers_on_false_[l.Index()]), [](<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html">Watcher</a>& watcher) {</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  return !watcher.clause->IsAttached();</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  });</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  }</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 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"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a38c7c4ca12035b254d9497a401606e0c"> 311</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a38c7c4ca12035b254d9497a401606e0c">LiteralWatchers::DetachAllClauses</a>() {</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">if</span> (!all_clauses_are_attached_) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  all_clauses_are_attached_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  </div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="comment">// This is easy, and this allows to reset memory if some watcher lists where</span></div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="comment">// really long at some point.</span></div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  is_clean_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  num_watched_clauses_ = 0;</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  watchers_on_false_.clear();</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span> }</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  </div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a56cba28a88a7cffa362a362fdce24dc3"> 322</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a56cba28a88a7cffa362a362fdce24dc3">LiteralWatchers::AttachAllClauses</a>() {</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">if</span> (all_clauses_are_attached_) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  all_clauses_are_attached_ = <span class="keyword">true</span>;</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>  needs_cleaning_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#aa7d76b766faf39c1652b6617eac5fe20">ClearAll</a>(); <span class="comment">// This doesn't resize it.</span></div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  watchers_on_false_.resize(needs_cleaning_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a2fa637a68bc1b88e3d5da4f97932411a">size</a>().value());</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  </div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ae234022ee7c496416290d1946f56e1ad">DeleteRemovedClauses</a>();</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause : clauses_) {</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  ++num_watched_clauses_;</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>(), 2);</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  AttachOnFalse(clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#ad6fa965d41774098c99258d76677fa02">FirstLiteral</a>(), clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a32e91bfa50c69a7b51346b9de33831ea">SecondLiteral</a>(), clause);</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  AttachOnFalse(clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a32e91bfa50c69a7b51346b9de33831ea">SecondLiteral</a>(), clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#ad6fa965d41774098c99258d76677fa02">FirstLiteral</a>(), clause);</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  }</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span> }</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  </div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="comment">// This one do not need the clause to be detached.</span></div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a0ddf4dc22639ee58f75985d875d1fd2d"> 339</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a0ddf4dc22639ee58f75985d875d1fd2d">LiteralWatchers::InprocessingFixLiteral</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> true_literal) {</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">if</span> (drat_proof_handler_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a98bacf41c50979896b4a5f5e41fb0ccf">AddClause</a>({true_literal});</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  }</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="comment">// TODO(user): remove the test when the DRAT issue with fixed literal is</span></div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">// resolved.</span></div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">if</span> (!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>(true_literal)) {</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#afb89e56bea39296ff292b51a84491875">EnqueueWithUnitReason</a>(true_literal);</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  </div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment">// Even when all clauses are detached, we can propagate the implication</span></div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="comment">// graph and we do that right away.</span></div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keywordflow">return</span> implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a1f591be5334541874ba049873235f0a9">Propagate</a>(trail_);</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="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</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">// TODO(user): We could do something slower if the clauses are attached like</span></div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="comment">// we do for InprocessingRewriteClause().</span></div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a287676c504a640a5569710d352ef6585"> 358</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a287676c504a640a5569710d352ef6585">LiteralWatchers::InprocessingRemoveClause</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause) {</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!all_clauses_are_attached_);</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordflow">if</span> (drat_proof_handler_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a18349231154d0f5eaee94fe213f347e6">DeleteClause</a>(clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a05691332c1a49213875440568a7580aa">AsSpan</a>());</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  }</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  clauses_info_.erase(clause);</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  clause->Clear();</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span> }</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  </div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab17b31190c5ab58a1334139848335283"> 367</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab17b31190c5ab58a1334139848335283">LiteralWatchers::InprocessingRewriteClause</a>(</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</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="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">if</span> (new_clause.empty()) <span class="keywordflow">return</span> <span class="keyword">false</span>; <span class="comment">// UNSAT.</span></div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  </div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</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> l : new_clause) {</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</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#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(l));</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>  }</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  </div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">if</span> (new_clause.size() == 1) {</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a0ddf4dc22639ee58f75985d875d1fd2d">InprocessingFixLiteral</a>(new_clause[0])) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a287676c504a640a5569710d352ef6585">InprocessingRemoveClause</a>(clause);</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  }</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>  <span class="keywordflow">if</span> (new_clause.size() == 2) {</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a26fc07b3630b79be6914e6387b63a073">AddBinaryClause</a>(new_clause[0], new_clause[1]);</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a287676c504a640a5569710d352ef6585">InprocessingRemoveClause</a>(clause);</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  }</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  </div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">if</span> (drat_proof_handler_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="comment">// We must write the new clause before we delete the old one.</span></div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a98bacf41c50979896b4a5f5e41fb0ccf">AddClause</a>(new_clause);</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a18349231154d0f5eaee94fe213f347e6">DeleteClause</a>(clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a05691332c1a49213875440568a7580aa">AsSpan</a>());</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  }</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  </div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordflow">if</span> (all_clauses_are_attached_) {</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="comment">// We can still rewrite the clause, but it is inefficient. We first</span></div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="comment">// detach it in a non-lazy way.</span></div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  --num_watched_clauses_;</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  clause->Clear();</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</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> l : {clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#ad6fa965d41774098c99258d76677fa02">FirstLiteral</a>(), clause-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a32e91bfa50c69a7b51346b9de33831ea">SecondLiteral</a>()}) {</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  needs_cleaning_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(l.Index());</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  RemoveIf(&(watchers_on_false_[l.Index()]), [](<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html">Watcher</a>& watcher) {</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  return !watcher.clause->IsAttached();</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  });</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  }</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  }</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  </div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  clause->Rewrite(new_clause);</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  </div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="comment">// And we re-attach it.</span></div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">if</span> (all_clauses_are_attached_) <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aab96a842b592211bf178caaf41e41f1d">Attach</a>(clause, trail_);</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span> }</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  </div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a74971b631e1b357b2f440dff321b5c9b"> 415</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#a74971b631e1b357b2f440dff321b5c9b">LiteralWatchers::InprocessingAddClause</a>(</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  absl::Span<const Literal> new_clause) {</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!new_clause.empty());</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!all_clauses_are_attached_);</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</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> l : new_clause) {</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</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#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(l));</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  }</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  }</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  </div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">if</span> (new_clause.size() == 1) {</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="comment">// TODO(user): We should return false...</span></div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a0ddf4dc22639ee58f75985d875d1fd2d">InprocessingFixLiteral</a>(new_clause[0])) <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  }</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  </div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">if</span> (new_clause.size() == 2) {</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a26fc07b3630b79be6914e6387b63a073">AddBinaryClause</a>(new_clause[0], new_clause[1]);</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  }</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  </div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <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_sat_clause.html#ad891f84075141b619317c2634891d010">SatClause::Create</a>(new_clause);</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  clauses_.push_back(clause);</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">return</span> clause;</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span> }</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  </div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ae57f3c4e72eb63a34fa09e707a18e6d3"> 441</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ae57f3c4e72eb63a34fa09e707a18e6d3">LiteralWatchers::CleanUpWatchers</a>() {</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keywordflow">for</span> (LiteralIndex <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : needs_cleaning_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(needs_cleaning_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  RemoveIf(&(watchers_on_false_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]), [](<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html">Watcher</a>& watcher) {</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">return</span> !watcher.<a class="code" href="structoperations__research_1_1sat_1_1_literal_watchers_1_1_watcher.html#ad6bf9b00a3144ebd5ded72037f2b577f">clause</a>-><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#ad8932e395fe5c508700b7f95d3064aef">IsAttached</a>();</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  });</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  needs_cleaning_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  }</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  needs_cleaning_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a399d93a7ffba068b02341291d703fef7">NotifyAllClear</a>();</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  is_clean_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span> }</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  </div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ae234022ee7c496416290d1946f56e1ad"> 454</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ae234022ee7c496416290d1946f56e1ad">LiteralWatchers::DeleteRemovedClauses</a>() {</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_clean_);</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  </div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="comment">// Update to_minimize_index_.</span></div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keywordflow">if</span> (to_minimize_index_ >= clauses_.size()) {</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  to_minimize_index_ = clauses_.size();</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  }</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  to_minimize_index_ =</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  std::stable_partition(clauses_.begin(),</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  clauses_.begin() + to_minimize_index_,</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  [](<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>) { return a->IsAttached(); }) -</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  clauses_.begin();</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>  <span class="comment">// Do the proper deletion.</span></div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  std::vector<SatClause*>::iterator iter =</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  std::stable_partition(clauses_.begin(), clauses_.end(),</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  [](<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>) { return a->IsAttached(); });</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <a class="code" href="namespacegtl.html#a88a7129153c63a150516ea2f617b767b">gtl::STLDeleteContainerPointers</a>(iter, clauses_.end());</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  clauses_.erase(iter, clauses_.end());</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">// ----- BinaryImplicationGraph -----</span></div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  </div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af7fbbd00f0e631ce361b5ce6636b2017"> 477</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af7fbbd00f0e631ce361b5ce6636b2017">BinaryImplicationGraph::Resize</a>(<span class="keywordtype">int</span> num_variables) {</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  implications_.resize(num_variables << 1);</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  is_redundant_.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(implications_.size(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  is_removed_.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(implications_.size(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  estimated_sizes_.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(implications_.size(), 0);</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  in_direct_implications_.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(implications_.size(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  reasons_.resize(num_variables);</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span> }</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  </div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span> <span class="comment">// TODO(user): Not all of the solver knows about representative literal, do</span></div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span> <span class="comment">// use them here and in AddBinaryClauseDuringSearch() to maintains invariant?</span></div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span> <span class="comment">// Explore this when we start cleaning our clauses using equivalence during</span></div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span> <span class="comment">// search. We can easily do it for every conflict we learn instead of here.</span></div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a26fc07b3630b79be6914e6387b63a073"> 491</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a26fc07b3630b79be6914e6387b63a073">BinaryImplicationGraph::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#af730895c6c6ef6e03caaf6251192dfd2">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#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keywordflow">if</span> (drat_proof_handler_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">// TODO(user): Like this we will duplicate all binary clause from the</span></div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="comment">// problem. However this leads to a simpler API (since we don't need to</span></div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="comment">// special case the loading of the original clauses) and we mainly use drat</span></div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="comment">// proof for testing anyway.</span></div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a98bacf41c50979896b4a5f5e41fb0ccf">AddClause</a>({<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>});</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>  estimated_sizes_[<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.NegatedIndex()]++;</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  estimated_sizes_[<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.NegatedIndex()]++;</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  implications_[<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.NegatedIndex()].push_back(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>);</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  implications_[<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.NegatedIndex()].push_back(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>);</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  is_dag_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  num_implications_ += 2;</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>  </div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a4a2107f2a0daf6968b6c0dded5964497"> 508</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a4a2107f2a0daf6968b6c0dded5964497">BinaryImplicationGraph::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#af730895c6c6ef6e03caaf6251192dfd2">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#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">if</span> (num_implications_ == 0) <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a> = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</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#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>);</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  </div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& assignment = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>();</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">if</span> (assignment.LiteralIsFalse(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>)) {</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordflow">if</span> (assignment.LiteralIsAssigned(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>)) {</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordflow">if</span> (assignment.LiteralIsFalse(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  reasons_[trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>()] = <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>;</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a12c36a7cb228d80bcad42fa38a103f92">Enqueue</a>(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a0af2aa6e387b8037179350b735fe127e">propagator_id_</a>);</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  }</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (assignment.LiteralIsFalse(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>)) {</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordflow">if</span> (!assignment.LiteralIsAssigned(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>)) {</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  reasons_[trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>()] = <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>;</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a12c36a7cb228d80bcad42fa38a103f92">Enqueue</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a0af2aa6e387b8037179350b735fe127e">propagator_id_</a>);</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  }</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  }</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  is_dag_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span> }</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  </div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#aec717d6bc59b3b48bb21276a081c62c1"> 531</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#aec717d6bc59b3b48bb21276a081c62c1">BinaryImplicationGraph::AddAtMostOne</a>(</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  absl::Span<const Literal> at_most_one) {</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">if</span> (at_most_one.size() <= 1) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  </div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="comment">// Temporarily copy the at_most_one constraint at the end of</span></div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="comment">// at_most_one_buffer_. It will be cleaned up and added by</span></div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="comment">// CleanUpAndAddAtMostOnes().</span></div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> base_index = at_most_one_buffer_.size();</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  at_most_one_buffer_.insert(at_most_one_buffer_.end(), at_most_one.begin(),</div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  at_most_one.end());</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  at_most_one_buffer_.push_back(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>));</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  </div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  is_dag_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordflow">return</span> CleanUpAndAddAtMostOnes(base_index);</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span> }</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  </div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span> <span class="comment">// TODO(user): remove duplication with</span></div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span> <span class="comment">// LiteralWatchers::InprocessingFixLiteral();</span></div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span> <span class="keywordtype">bool</span> BinaryImplicationGraph::FixLiteral(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> true_literal) {</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keywordflow">if</span> (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>(true_literal)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordflow">if</span> (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#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(true_literal)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  </div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordflow">if</span> (drat_proof_handler_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a98bacf41c50979896b4a5f5e41fb0ccf">AddClause</a>({true_literal});</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  }</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>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#afb89e56bea39296ff292b51a84491875">EnqueueWithUnitReason</a>(true_literal);</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a1f591be5334541874ba049873235f0a9">Propagate</a>(trail_);</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span> }</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  </div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span> <span class="comment">// This works by doing a linear scan on the at_most_one_buffer_ and</span></div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span> <span class="comment">// cleaning/copying the at most ones on the fly to the beginning of the same</span></div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span> <span class="comment">// buffer.</span></div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span> <span class="keywordtype">bool</span> BinaryImplicationGraph::CleanUpAndAddAtMostOnes(<span class="keyword">const</span> <span class="keywordtype">int</span> base_index) {</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keyword">const</span> VariablesAssignment& assignment = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>();</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keywordtype">int</span> local_end = base_index;</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> buffer_size = at_most_one_buffer_.size();</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = base_index; i < buffer_size; ++i) {</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="keywordflow">if</span> (at_most_one_buffer_[i].<a class="code" href="namespaceoperations__research_1_1glop.html#abec9e934a51aa2ab519684cc0f446a41">Index</a>() == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  </div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="comment">// Process a new at most one.</span></div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="comment">// It will be copied into buffer[local_start, local_end].</span></div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> local_start = local_end;</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="keywordtype">bool</span> set_all_left_to_false = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keywordflow">for</span> (;; ++i) {</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keyword">const</span> Literal l = at_most_one_buffer_[i];</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keywordflow">if</span> (l.Index() == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordflow">if</span> (assignment.LiteralIsFalse(l)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keywordflow">if</span> (is_removed_[l.Index()]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keywordflow">if</span> (!set_all_left_to_false && assignment.LiteralIsTrue(l)) {</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  set_all_left_to_false = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  }</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  at_most_one_buffer_[local_end++] = <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6fac58ca16fd746d7488a0a97f6965bd">RepresentativeOf</a>(l);</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  }</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  </div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="comment">// Deal with all false.</span></div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">if</span> (set_all_left_to_false) {</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = local_start; j < local_end; ++j) {</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keyword">const</span> Literal l = at_most_one_buffer_[j];</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordflow">if</span> (assignment.LiteralIsFalse(l)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keywordflow">if</span> (assignment.LiteralIsTrue(l)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordflow">if</span> (!FixLiteral(l.Negated())) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  }</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  local_end = local_start;</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  }</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  </div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="comment">// Deal with duplicates.</span></div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="comment">// Any duplicate in an "at most one" must be false.</span></div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  {</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordtype">int</span> new_local_end = local_start;</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  std::sort(&at_most_one_buffer_[local_start],</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  &at_most_one_buffer_[local_end]);</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = local_start; j < local_end; ++j) {</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keyword">const</span> Literal l = at_most_one_buffer_[j];</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="keywordflow">if</span> (new_local_end > local_start &&</div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  l == at_most_one_buffer_[new_local_end - 1]) {</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keywordflow">if</span> (assignment.LiteralIsTrue(l)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordflow">if</span> (!assignment.LiteralIsFalse(l)) {</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="keywordflow">if</span> (!FixLiteral(l.Negated())) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  }</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  --new_local_end;</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  }</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  at_most_one_buffer_[new_local_end++] = l;</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  }</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  local_end = new_local_end;</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  }</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  </div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="comment">// Create a Span<> to simplify the code below.</span></div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keyword">const</span> absl::Span<const Literal> at_most_one(</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  &at_most_one_buffer_[local_start], local_end - local_start);</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>  <span class="comment">// We expand small sizes into implications.</span></div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="comment">// TODO(user): Investigate what the best threshold is.</span></div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keywordflow">if</span> (at_most_one.size() < 10) {</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="comment">// Note that his automatically skip size 0 and 1.</span></div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a> : at_most_one) {</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a> : at_most_one) {</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a> == <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  implications_[<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.Index()].push_back(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.Negated());</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  }</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  }</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  num_implications_ += at_most_one.size() * (at_most_one.size() - 1);</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  </div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="comment">// This will erase the at_most_one from the buffer.</span></div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  local_end = local_start;</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  }</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  </div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="comment">// Index the new at most one.</span></div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : at_most_one) {</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keywordflow">if</span> (l.Index() >= at_most_ones_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) {</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  at_most_ones_.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(l.Index().value() + 1);</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  }</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!is_redundant_[l.Index()]);</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  at_most_ones_[l.Index()].<a class="code" href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(local_start);</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  }</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  </div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="comment">// Add sentinel.</span></div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  at_most_one_buffer_[local_end++] = Literal(<a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>);</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  }</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  </div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  at_most_one_buffer_.resize(local_end);</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span> }</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  </div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span> <span class="keywordtype">bool</span> BinaryImplicationGraph::PropagateOnTrue(Literal true_literal,</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  Trail* trail) {</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</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>  <span class="keyword">const</span> VariablesAssignment& assignment = trail->Assignment();</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(assignment.LiteralIsTrue(true_literal));</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>  <span class="comment">// Note(user): This update is not exactly correct because in case of conflict</span></div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="comment">// we don't inspect that much clauses. But doing ++num_inspections_ inside the</span></div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="comment">// loop does slow down the code by a few percent.</span></div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  num_inspections_ += implications_[true_literal.Index()].size();</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="keywordflow">for</span> (Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : implications_[true_literal.Index()]) {</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keywordflow">if</span> (assignment.LiteralIsTrue(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) {</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="comment">// Note(user): I tried to update the reason here if the literal was</span></div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="comment">// enqueued after the true_literal on the trail. This property is</span></div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="comment">// important for ComputeFirstUIPConflict() to work since it needs the</span></div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="comment">// trail order to be a topological order for the deduction graph.</span></div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="comment">// But the performance was not too good...</span></div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keywordflow">continue</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>  </div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  ++num_propagations_;</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="keywordflow">if</span> (assignment.LiteralIsFalse(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) {</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="comment">// Conflict.</span></div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  *(trail->MutableConflict()) = {true_literal.Negated(), <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>};</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="comment">// Propagation.</span></div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  reasons_[trail->Index()] = true_literal.Negated();</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  trail->Enqueue(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>, <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a0af2aa6e387b8037179350b735fe127e">propagator_id_</a>);</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  }</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  }</div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  </div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="comment">// Propagate the at_most_one constraints.</span></div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keywordflow">if</span> (true_literal.Index() < at_most_ones_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) {</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> start : at_most_ones_[true_literal.Index()]) {</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keywordtype">bool</span> seen = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = start;; ++i) {</div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keyword">const</span> Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = at_most_one_buffer_[i];</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="keywordflow">if</span> (<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index() == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  </div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  ++num_inspections_;</div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keywordflow">if</span> (<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> == true_literal) {</div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!seen);</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  seen = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  }</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  }</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keywordflow">if</span> (assignment.LiteralIsFalse(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  </div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  ++num_propagations_;</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keywordflow">if</span> (assignment.LiteralIsTrue(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) {</div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="comment">// Conflict.</span></div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  *(trail->MutableConflict()) = {true_literal.Negated(),</div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Negated()};</div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="comment">// Propagation.</span></div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  reasons_[trail->Index()] = true_literal.Negated();</div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  trail->Enqueue(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Negated(), <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a0af2aa6e387b8037179350b735fe127e">propagator_id_</a>);</div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  }</div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  }</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>  }</div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  </div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span> }</div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  </div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a1f591be5334541874ba049873235f0a9"> 730</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a1f591be5334541874ba049873235f0a9">BinaryImplicationGraph::Propagate</a>(<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail) {</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a357657ded604ecb97b76251146f7ac75">IsEmpty</a>()) {</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a> = trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  }</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="keywordflow">while</span> (propagation_trail_index_ < trail-><a class="code" href="namespaceoperations__research_1_1glop.html#abec9e934a51aa2ab519684cc0f446a41">Index</a>()) {</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = (*trail)[<a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a>++];</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keywordflow">if</span> (!PropagateOnTrue(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>, trail)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</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="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span> }</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  </div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a5aa25e6e306c7158c11d2053170379a2"> 742</a></span> absl::Span<const Literal> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a5aa25e6e306c7158c11d2053170379a2">BinaryImplicationGraph::Reason</a>(</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail, <span class="keywordtype">int</span> trail_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="keywordflow">return</span> {&reasons_[trail_index], 1};</div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span> }</div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  </div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span> <span class="comment">// Here, we remove all the literal whose negation are implied by the negation of</span></div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span> <span class="comment">// the 1-UIP literal (which always appear first in the given conflict). Note</span></div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span> <span class="comment">// that this algorithm is "optimal" in the sense that it leads to a minimized</span></div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span> <span class="comment">// conflict with a backjump level as low as possible. However, not all possible</span></div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span> <span class="comment">// literals are removed.</span></div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span> <span class="comment">// TODO(user): Also consider at most one?</span></div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a311c7dc55d8a10542d54dfeabca48450"> 754</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a311c7dc55d8a10542d54dfeabca48450">BinaryImplicationGraph::MinimizeConflictWithReachability</a>(</div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  std::vector<Literal>* conflict) {</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  dfs_stack_.clear();</div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  </div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="comment">// Compute the reachability from the literal "not(conflict->front())" using</span></div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="comment">// an iterative dfs.</span></div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keyword">const</span> LiteralIndex root_literal_index = conflict->front().NegatedIndex();</div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(LiteralIndex(implications_.size()));</div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(root_literal_index);</div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  </div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="comment">// TODO(user): This sounds like a good idea, but somehow it seems better not</span></div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="comment">// to do that even though it is almost for free. Investigate more.</span></div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="comment">// The idea here is that since we already compute the reachability from the</span></div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="comment">// root literal, we can use this computation to remove any implication</span></div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="comment">// root_literal => b if there is already root_literal => a and b is reachable</span></div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="comment">// from a.</span></div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> also_prune_direct_implication_list = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  </div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="comment">// We treat the direct implications differently so we can also remove the</span></div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="comment">// redundant implications from this list at the same time.</span></div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keyword">auto</span>& direct_implications = implications_[root_literal_index];</div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</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> l : direct_implications) {</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="keywordflow">if</span> (is_marked_[l.Index()]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  dfs_stack_.push_back(l);</div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordflow">while</span> (!dfs_stack_.empty()) {</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <span class="keyword">const</span> LiteralIndex <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = dfs_stack_.back().Index();</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  dfs_stack_.pop_back();</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keywordflow">if</span> (!is_marked_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) {</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> implied : implications_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) {</div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="keywordflow">if</span> (!is_marked_[implied.Index()]) dfs_stack_.push_back(implied);</div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  }</div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  }</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  }</div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  </div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="comment">// The "trick" is to unmark 'l'. This way, if we explore it twice, it means</span></div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="comment">// that this l is reachable from some other 'l' from the direct implication</span></div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="comment">// list. Remarks:</span></div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="comment">// - We don't loose too much complexity when this happen since a literal</span></div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="comment">// can be unmarked only once, so in the worst case we loop twice over its</span></div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="comment">// children. Moreover, this literal will be pruned for later calls.</span></div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="comment">// - This is correct, i.e. we can't prune too many literals because of a</span></div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="comment">// strongly connected component. Proof by contradiction: If we take the</span></div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="comment">// first (in direct_implications) literal from a removed SCC, it must</span></div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="comment">// have marked all the others. But because they are marked, they will not</span></div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <span class="comment">// be explored again and so can't mark the first literal.</span></div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keywordflow">if</span> (also_prune_direct_implication_list) {</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(l.Index());</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  }</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  }</div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  </div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="comment">// Now we can prune the direct implications list and make sure are the</span></div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="comment">// literals there are marked.</span></div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keywordflow">if</span> (also_prune_direct_implication_list) {</div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</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> l : direct_implications) {</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keywordflow">if</span> (!is_marked_[l.Index()]) {</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(l.Index());</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  direct_implications[new_size] = l;</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  ++new_size;</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>  }</div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="keywordflow">if</span> (new_size < direct_implications.size()) {</div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  num_redundant_implications_ += direct_implications.size() - new_size;</div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  direct_implications.resize(new_size);</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  }</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  }</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  </div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  RemoveRedundantLiterals(conflict);</div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span> }</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> <span class="comment">// Same as MinimizeConflictWithReachability() but also mark (in the given</span></div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span> <span class="comment">// SparseBitset) the reachable literal already assigned to false. These literals</span></div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span> <span class="comment">// will be implied if the 1-UIP literal is assigned to false, and the classic</span></div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span> <span class="comment">// minimization algorithm can take advantage of that.</span></div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a95cb5284ae22d2cbca6cd69a275d8a98"> 831</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a95cb5284ae22d2cbca6cd69a275d8a98">BinaryImplicationGraph::MinimizeConflictFirst</a>(</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail, std::vector<Literal>* conflict,</div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <a class="code" href="classoperations__research_1_1_sparse_bitset.html">SparseBitset<BooleanVariable></a>* marked) {</div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!conflict->empty());</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(LiteralIndex(implications_.size()));</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  MarkDescendants(conflict->front().Negated());</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LiteralIndex i : is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="keywordflow">if</span> (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#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(i))) {</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  marked-><a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(i).Variable());</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  }</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  }</div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  RemoveRedundantLiterals(conflict);</div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span> }</div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  </div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span> <span class="comment">// Same as MinimizeConflictFirst() but take advantage of this reachability</span></div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span> <span class="comment">// computation to remove redundant implication in the implication list of the</span></div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span> <span class="comment">// first UIP conflict.</span></div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6cbb84e00be8d376ad8bf7d0e333a46a"> 849</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6cbb84e00be8d376ad8bf7d0e333a46a">BinaryImplicationGraph::MinimizeConflictFirstWithTransitiveReduction</a>(</div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail, std::vector<Literal>* conflict,</div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</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="l00852"></a><span class="lineno"> 852</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="keyword">const</span> LiteralIndex root_literal_index = conflict->front().NegatedIndex();</div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(LiteralIndex(implications_.size()));</div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(root_literal_index);</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  </div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keyword">auto</span>& direct_implications = implications_[root_literal_index];</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  </div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="comment">// The randomization allow to find more redundant implication since to find</span></div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="comment">// a => b and remove b, a must be before b in direct_implications. Note that</span></div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="comment">// a std::reverse() could work too. But randomization seems to work better.</span></div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <span class="comment">// Probably because it has other impact on the search tree.</span></div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  std::shuffle(direct_implications.begin(), direct_implications.end(), random);</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  dfs_stack_.clear();</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</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> l : direct_implications) {</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="keywordflow">if</span> (is_marked_[l.Index()]) {</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="comment">// The literal is already marked! so it must be implied by one of the</span></div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="comment">// previous literal in the direct_implications list. We can safely remove</span></div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="comment">// it.</span></div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  }</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  direct_implications[new_size++] = l;</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  dfs_stack_.push_back(l);</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="keywordflow">while</span> (!dfs_stack_.empty()) {</div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keyword">const</span> LiteralIndex <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = dfs_stack_.back().Index();</div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  dfs_stack_.pop_back();</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="keywordflow">if</span> (!is_marked_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) {</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> implied : implications_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) {</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="keywordflow">if</span> (!is_marked_[implied.Index()]) dfs_stack_.push_back(implied);</div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  }</div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  }</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  }</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  }</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="keywordflow">if</span> (new_size < direct_implications.size()) {</div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  num_redundant_implications_ += direct_implications.size() - new_size;</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  direct_implications.resize(new_size);</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  }</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  RemoveRedundantLiterals(conflict);</div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span> }</div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  </div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span> <span class="keywordtype">void</span> BinaryImplicationGraph::RemoveRedundantLiterals(</div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  std::vector<Literal>* conflict) {</div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordtype">int</span> new_index = 1;</div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < conflict->size(); ++i) {</div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="keywordflow">if</span> (!is_marked_[(*conflict)[i].NegatedIndex()]) {</div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  (*conflict)[new_index] = (*conflict)[i];</div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  ++new_index;</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  }</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  }</div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="keywordflow">if</span> (new_index < conflict->size()) {</div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  ++num_minimization_;</div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  num_literals_removed_ += conflict->size() - new_index;</div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  conflict->resize(new_index);</div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  }</div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span> }</div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  </div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span> <span class="comment">// TODO(user): Also consider at most one?</span></div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af30fd0373e896f83bb84d2295a310492"> 911</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af30fd0373e896f83bb84d2295a310492">BinaryImplicationGraph::MinimizeConflictExperimental</a>(</div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail, std::vector<Literal>* conflict) {</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(LiteralIndex(implications_.size()));</div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  is_simplified_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(LiteralIndex(implications_.size()));</div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> lit : *conflict) {</div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(lit.Index());</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  }</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  </div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="comment">// Identify and remove the redundant literals from the given conflict.</span></div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="comment">// 1/ If a -> b then a can be removed from the conflict clause.</span></div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="comment">// This is because not b -> not a.</span></div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="comment">// 2/ a -> b can only happen if level(a) <= level(b).</span></div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="comment">// 3/ Because of 2/, cycles can appear only at the same level.</span></div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="comment">// The vector is_simplified_ is used to avoid removing all elements of a</span></div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="comment">// cycle. Note that this is not optimal in the sense that we may not remove</span></div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="comment">// a literal that can be removed.</span></div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  <span class="comment">// Note that there is no need to explore the unique literal of the highest</span></div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="comment">// decision level since it can't be removed. Because this is a conflict, such</span></div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="comment">// literal is always at position 0, so we start directly at 1.</span></div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 1;</div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < conflict->size(); ++i) {</div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> lit = (*conflict)[i];</div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> lit_level = trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(lit.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">Variable</a>()).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#afefd28242df91e46e762af1f7eaf623f">level</a>;</div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="keywordtype">bool</span> keep_literal = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> implied : implications_[lit.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()]) {</div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="keywordflow">if</span> (is_marked_[implied.Index()]) {</div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(lit_level, trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(implied.Variable()).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#afefd28242df91e46e762af1f7eaf623f">level</a>);</div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <span class="keywordflow">if</span> (lit_level == trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(implied.Variable()).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#afefd28242df91e46e762af1f7eaf623f">level</a> &&</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  is_simplified_[implied.Index()]) {</div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  }</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  keep_literal = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  }</div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  }</div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="keywordflow">if</span> (keep_literal) {</div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  (*conflict)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = lit;</div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  is_simplified_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(lit.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>());</div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  }</div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  }</div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="keywordflow">if</span> (index < conflict->size()) {</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  ++num_minimization_;</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  num_literals_removed_ += conflict->size() - <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  conflict->erase(conflict->begin() + <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, conflict->end());</div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  }</div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span> }</div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  </div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abcad56047cef75a12528fe99794a6e1e"> 962</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abcad56047cef75a12528fe99794a6e1e">BinaryImplicationGraph::RemoveFixedVariables</a>() {</div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  </div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="comment">// Nothing to do if nothing changed since last call.</span></div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_num_fixed = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <span class="keywordflow">if</span> (num_processed_fixed_variables_ == new_num_fixed) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  </div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html">VariablesAssignment</a>& assignment = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>();</div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(LiteralIndex(implications_.size()));</div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  <span class="keywordflow">for</span> (; num_processed_fixed_variables_ < new_num_fixed;</div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  ++num_processed_fixed_variables_) {</div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> true_literal = (*trail_)[num_processed_fixed_variables_];</div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="comment">// The code assumes that everything is already propagated.</span></div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  <span class="comment">// Otherwise we will remove implications that didn't propagate yet!</span></div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</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> lit : implications_[true_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()]) {</div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</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>(lit));</div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  }</div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  }</div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  </div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="comment">// If b is true and a -> b then because not b -> not a, all the</span></div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="comment">// implications list that contains b will be marked by this process.</span></div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="comment">// And the ones that contains not(b) should correspond to a false literal!</span></div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="comment">// TODO(user): This might not be true if we remove implication by</span></div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <span class="comment">// transitive reduction and the process was aborted due to the computation</span></div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  <span class="comment">// limit. I think it will be good to maintain that invariant though,</span></div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="comment">// otherwise fixed literals might never be removed from these lists...</span></div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</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> lit : implications_[true_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7">NegatedIndex</a>()]) {</div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(lit.NegatedIndex());</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  }</div>
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <a class="code" href="namespacegtl.html#a92a0e7b0e74024284adc849a4499940f">gtl::STLClearObject</a>(&(implications_[true_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()]));</div>
|
|
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  <a class="code" href="namespacegtl.html#a92a0e7b0e74024284adc849a4499940f">gtl::STLClearObject</a>(&(implications_[true_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7">NegatedIndex</a>()]));</div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  </div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="keywordflow">if</span> (true_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>() < at_most_ones_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) {</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <a class="code" href="namespacegtl.html#a92a0e7b0e74024284adc849a4499940f">gtl::STLClearObject</a>(&(at_most_ones_[true_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()]));</div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  }</div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="keywordflow">if</span> (true_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7">NegatedIndex</a>() < at_most_ones_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) {</div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  <a class="code" href="namespacegtl.html#a92a0e7b0e74024284adc849a4499940f">gtl::STLClearObject</a>(&(at_most_ones_[true_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7">NegatedIndex</a>()]));</div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  }</div>
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  }</div>
|
|
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LiteralIndex i : is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  RemoveIf(&implications_[i], [&assignment](<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>& lit) {</div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  <span class="keywordflow">return</span> assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(lit);</div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  });</div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  }</div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  </div>
|
|
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <span class="comment">// TODO(user): This might be a bit slow. Do not call all the time if needed,</span></div>
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <span class="comment">// this shouldn't change the correctness of the code.</span></div>
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  at_most_ones_.<a class="code" href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">clear</a>();</div>
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  CleanUpAndAddAtMostOnes(<span class="comment">/*base_index=*/</span>0);</div>
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span> }</div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  </div>
|
|
<div class="line"><a name="l01016"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scc_graph.html"> 1016</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_scc_graph.html">SccGraph</a> {</div>
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scc_graph.html#a8bad98ca2ee58f84c5712343915fac3d"> 1018</a></span>  <span class="keyword">using</span> <a class="code" href="classabsl_1_1_strong_vector.html">Implication</a> =</div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</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="l01020"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scc_graph.html#a44eb65054e70676d6ee0b15f6be085d7"> 1020</a></span>  <span class="keyword">using</span> <a class="code" href="classabsl_1_1_strong_vector.html">AtMostOne</a> =</div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, absl::InlinedVector<int32, 6></a>>;</div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scc_graph.html#ad8034e0fd9aa989127ca75bacc78a961"> 1022</a></span>  <span class="keyword">using</span> <a class="code" href="class_strongly_connected_components_finder.html">SccFinder</a> =</div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <a class="code" href="class_strongly_connected_components_finder.html">StronglyConnectedComponentsFinder</a><<a class="code" href="integral__types_8h.html#a56f1a81c92849566ae864511088eb7e8">int32</a>, <a class="code" href="classoperations__research_1_1sat_1_1_scc_graph.html#a026a87568634d8f2dcdd1d61bb990b1f">SccGraph</a>,</div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  std::vector<std::vector<int32>>>;</div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  </div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scc_graph.html#a026a87568634d8f2dcdd1d61bb990b1f"> 1026</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_scc_graph.html#a026a87568634d8f2dcdd1d61bb990b1f">SccGraph</a>(<a class="code" href="class_strongly_connected_components_finder.html">SccFinder</a>* finder, <a class="code" href="classabsl_1_1_strong_vector.html">Implication</a>* graph,</div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <a class="code" href="classabsl_1_1_strong_vector.html">AtMostOne</a>* at_most_ones,</div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  std::vector<Literal>* at_most_one_buffer)</div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  : finder_(*finder),</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  implications_(*graph),</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  at_most_ones_(*at_most_ones),</div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  at_most_one_buffer_(*at_most_one_buffer) {}</div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  </div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scc_graph.html#a229be75ad057c526a4209b079bc6c621"> 1034</a></span>  <span class="keyword">const</span> std::vector<int32>& <a class="code" href="classoperations__research_1_1sat_1_1_scc_graph.html#a229be75ad057c526a4209b079bc6c621">operator[]</a>(<a class="code" href="integral__types_8h.html#a56f1a81c92849566ae864511088eb7e8">int32</a> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  tmp_.clear();</div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</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> l : implications_[LiteralIndex(node)]) {</div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  tmp_.push_back(l.Index().value());</div>
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="keywordflow">if</span> (finder_.<a class="code" href="class_strongly_connected_components_finder.html#a4db5c4e5c0437428c74f692ac4601af7">NodeIsInCurrentDfsPath</a>(l.NegatedIndex().value())) {</div>
|
|
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scc_graph.html#a47d33ec3614dcb20228fc964e0886a9b">to_fix_</a>.push_back(l);</div>
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  }</div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  }</div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  <span class="keywordflow">if</span> (node < at_most_ones_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) {</div>
|
|
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> start : at_most_ones_[LiteralIndex(node)]) {</div>
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  <span class="keywordflow">if</span> (start >= at_most_one_already_explored_.size()) {</div>
|
|
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  at_most_one_already_explored_.resize(start + 1, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  previous_node_to_explore_at_most_one_.resize(start + 1);</div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  }</div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  </div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="comment">// In the presence of at_most_ones_ contraints, expanding them</span></div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="comment">// implicitely to implications in the SCC computation can result in a</span></div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  <span class="comment">// quadratic complexity rather than a linear one in term of the input</span></div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  <span class="comment">// data structure size. So this test here is critical on problem with</span></div>
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  <span class="comment">// large at_most ones like the "ivu06-big.mps.gz" where without it, the</span></div>
|
|
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  <span class="comment">// full FindStronglyConnectedComponents() take more than on hour instead</span></div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="comment">// of less than a second!</span></div>
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  <span class="keywordflow">if</span> (at_most_one_already_explored_[start]) {</div>
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="comment">// We never expand a node twice.</span></div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> first_node = previous_node_to_explore_at_most_one_[start];</div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(node, first_node);</div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  </div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  <span class="keywordflow">if</span> (finder_.<a class="code" href="class_strongly_connected_components_finder.html#a4db5c4e5c0437428c74f692ac4601af7">NodeIsInCurrentDfsPath</a>(first_node)) {</div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  <span class="comment">// If the first node is not settled, then we do explore the</span></div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <span class="comment">// at_most_one constraint again. In "Mixed-Integer-Programming:</span></div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="comment">// Analyzing 12 years of progress", Tobias Achterberg and Roland</span></div>
|
|
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  <span class="comment">// Wunderling explains that an at most one need to be looped over at</span></div>
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  <span class="comment">// most twice. I am not sure exactly how that works, so for now we</span></div>
|
|
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="comment">// are not fully linear, but on actual instances, we only rarely</span></div>
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  <span class="comment">// run into this case.</span></div>
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  <span class="comment">// Note that we change the previous node to explore at most one</span></div>
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="comment">// since the current node will be settled before the old ones.</span></div>
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <span class="comment">// TODO(user): avoid looping more than twice on the same at most one</span></div>
|
|
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  <span class="comment">// constraints? Note that the second time we loop we have x => y =></span></div>
|
|
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="comment">// not(x), so we can already detect that x must be false which we</span></div>
|
|
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="comment">// detect below.</span></div>
|
|
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  previous_node_to_explore_at_most_one_[start] = node;</div>
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="comment">// The first node is already settled and so are all its child. Only</span></div>
|
|
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="comment">// not(first_node) might still need exploring.</span></div>
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  tmp_.push_back(</div>
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(LiteralIndex(first_node)).NegatedIndex().<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>());</div>
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  }</div>
|
|
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  at_most_one_already_explored_[start] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  previous_node_to_explore_at_most_one_[start] = node;</div>
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  }</div>
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  </div>
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = start;; ++i) {</div>
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l = at_most_one_buffer_[i];</div>
|
|
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  <span class="keywordflow">if</span> (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">break</span>;</div>
|
|
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="keywordflow">if</span> (l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>() == node) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  tmp_.push_back(l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7">NegatedIndex</a>().value());</div>
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="keywordflow">if</span> (finder_.<a class="code" href="class_strongly_connected_components_finder.html#a4db5c4e5c0437428c74f692ac4601af7">NodeIsInCurrentDfsPath</a>(l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>().value())) {</div>
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scc_graph.html#a47d33ec3614dcb20228fc964e0886a9b">to_fix_</a>.push_back(l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>());</div>
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  }</div>
|
|
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  }</div>
|
|
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  }</div>
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  }</div>
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scc_graph.html#a720d8d1dd697348d6cdc4b9752321ebc">work_done_</a> += tmp_.size();</div>
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="keywordflow">return</span> tmp_;</div>
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  }</div>
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  </div>
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <span class="comment">// All these literals where detected to be true during the SCC computation.</span></div>
|
|
<div class="line"><a name="l01106"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scc_graph.html#a47d33ec3614dcb20228fc964e0886a9b"> 1106</a></span>  <span class="keyword">mutable</span> std::vector<Literal> <a class="code" href="classoperations__research_1_1sat_1_1_scc_graph.html#a47d33ec3614dcb20228fc964e0886a9b">to_fix_</a>;</div>
|
|
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  </div>
|
|
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="comment">// For the deterministic time.</span></div>
|
|
<div class="line"><a name="l01109"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scc_graph.html#a720d8d1dd697348d6cdc4b9752321ebc"> 1109</a></span>  <span class="keyword">mutable</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1sat_1_1_scc_graph.html#a720d8d1dd697348d6cdc4b9752321ebc">work_done_</a> = 0;</div>
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  </div>
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  <span class="keyword">const</span> <a class="code" href="class_strongly_connected_components_finder.html">SccFinder</a>& finder_;</div>
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">Implication</a>& implications_;</div>
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">AtMostOne</a>& at_most_ones_;</div>
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  <span class="keyword">const</span> std::vector<Literal>& at_most_one_buffer_;</div>
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  </div>
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  <span class="keyword">mutable</span> std::vector<int32> tmp_;</div>
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  </div>
|
|
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <span class="comment">// Used to get a non-quadratic complexity in the presence of at most ones.</span></div>
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  <span class="keyword">mutable</span> std::vector<bool> at_most_one_already_explored_;</div>
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  <span class="keyword">mutable</span> std::vector<int> previous_node_to_explore_at_most_one_;</div>
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span> };</div>
|
|
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  </div>
|
|
<div class="line"><a name="l01124"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#aac261e221628d6a51be7243563659929"> 1124</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#aac261e221628d6a51be7243563659929">BinaryImplicationGraph::DetectEquivalences</a>(<span class="keywordtype">bool</span> log_info) {</div>
|
|
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <span class="comment">// This was already called, and no new constraint where added. Note that new</span></div>
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <span class="comment">// fixed variable cannote create new equivalence, only new binary clauses do.</span></div>
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="keywordflow">if</span> (is_dag_) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <a class="code" href="class_wall_timer.html">WallTimer</a> <a class="code" href="cp__model__solver_8cc.html#ace0951799e72ee99fc07d5e509bc7cbf">wall_timer</a>;</div>
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <a class="code" href="cp__model__solver_8cc.html#ace0951799e72ee99fc07d5e509bc7cbf">wall_timer</a>.<a class="code" href="class_wall_timer.html#a07aaf1227e4d645f15e0a964f54ef291">Start</a>();</div>
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  log_info |= <a class="code" href="vlog__is__on_8h.html#a956152cad330225654d128f35c00efce">VLOG_IS_ON</a>(1);</div>
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  </div>
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  <span class="comment">// Lets remove all fixed variables first.</span></div>
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a1f591be5334541874ba049873235f0a9">Propagate</a>(trail_)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abcad56047cef75a12528fe99794a6e1e">RemoveFixedVariables</a>();</div>
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html">VariablesAssignment</a>& assignment = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>();</div>
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  </div>
|
|
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="comment">// TODO(user): We could just do it directly though.</span></div>
|
|
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  <span class="keywordtype">int</span> num_fixed_during_scc = 0;</div>
|
|
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a56f1a81c92849566ae864511088eb7e8">int32</a> size(implications_.size());</div>
|
|
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  std::vector<std::vector<int32>> scc;</div>
|
|
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  <span class="keywordtype">double</span> dtime = 0.0;</div>
|
|
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  {</div>
|
|
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  <a class="code" href="class_strongly_connected_components_finder.html">SccGraph::SccFinder</a> finder;</div>
|
|
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scc_graph.html">SccGraph</a> graph(&finder, &implications_, &at_most_ones_,</div>
|
|
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  &at_most_one_buffer_);</div>
|
|
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  finder.<a class="code" href="class_strongly_connected_components_finder.html#ae578e6662172f4c25bb8ad068a597ba5">FindStronglyConnectedComponents</a>(size, graph, &scc);</div>
|
|
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  dtime += 4e-8 * graph.<a class="code" href="classoperations__research_1_1sat_1_1_scc_graph.html#a720d8d1dd697348d6cdc4b9752321ebc">work_done_</a>;</div>
|
|
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  </div>
|
|
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</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> l : graph.<a class="code" href="classoperations__research_1_1sat_1_1_scc_graph.html#a47d33ec3614dcb20228fc964e0886a9b">to_fix_</a>) {</div>
|
|
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <span class="keywordflow">if</span> (assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(l)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  <span class="keywordflow">if</span> (assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(l)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  ++num_fixed_during_scc;</div>
|
|
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  <span class="keywordflow">if</span> (!FixLiteral(l)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  }</div>
|
|
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  }</div>
|
|
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  </div>
|
|
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="comment">// The old values will still be valid.</span></div>
|
|
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  representative_of_.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(size, <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>);</div>
|
|
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  is_redundant_.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(size, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  </div>
|
|
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  <span class="keywordtype">int</span> num_equivalences = 0;</div>
|
|
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  reverse_topological_order_.clear();</div>
|
|
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  <span class="keywordflow">for</span> (std::vector<int32>& component : scc) {</div>
|
|
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  <span class="comment">// If one is fixed then all must be fixed. Note that the reason why the</span></div>
|
|
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  <span class="comment">// propagation didn't already do that and we don't always get fixed</span></div>
|
|
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  <span class="comment">// component of size 1 is because of the potential newly fixed literals</span></div>
|
|
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  <span class="comment">// above.</span></div>
|
|
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  <span class="comment">// In any case, all fixed literals are marked as redundant.</span></div>
|
|
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  {</div>
|
|
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  <span class="keywordtype">bool</span> all_fixed = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  <span class="keywordtype">bool</span> all_true = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a56f1a81c92849566ae864511088eb7e8">int32</a> i : component) {</div>
|
|
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(LiteralIndex(i));</div>
|
|
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="keywordflow">if</span> (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#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(l)) {</div>
|
|
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  all_fixed = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  all_true = 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>(l);</div>
|
|
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  }</div>
|
|
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  }</div>
|
|
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keywordflow">if</span> (all_fixed) {</div>
|
|
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a56f1a81c92849566ae864511088eb7e8">int32</a> i : component) {</div>
|
|
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(LiteralIndex(i));</div>
|
|
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  <span class="keywordflow">if</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="l01185"></a><span class="lineno"> 1185</span>  ++num_redundant_literals_;</div>
|
|
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  is_redundant_[l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  }</div>
|
|
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> to_fix = all_true ? l : l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>();</div>
|
|
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="keywordflow">if</span> (assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(to_fix)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  <span class="keywordflow">if</span> (assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(to_fix)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  ++num_fixed_during_scc;</div>
|
|
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="keywordflow">if</span> (!FixLiteral(l)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  }</div>
|
|
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  </div>
|
|
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  <span class="comment">// Next component.</span></div>
|
|
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  }</div>
|
|
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  }</div>
|
|
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  </div>
|
|
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <span class="comment">// We ignore variable that appear in no constraints.</span></div>
|
|
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  <span class="keywordflow">if</span> (component.size() == 1 && is_removed_[LiteralIndex(component[0])]) {</div>
|
|
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  }</div>
|
|
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  </div>
|
|
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  <span class="comment">// We always take the smallest literal index (which also corresponds to the</span></div>
|
|
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  <span class="comment">// smallest BooleanVariable index) as a representative. This make sure that</span></div>
|
|
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  <span class="comment">// the representative of a literal l and the one of not(l) will be the</span></div>
|
|
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <span class="comment">// negation of each other. There is also reason to think that it is</span></div>
|
|
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  <span class="comment">// heuristically better to use a BooleanVariable that was created first.</span></div>
|
|
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  std::sort(component.begin(), component.end());</div>
|
|
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  <span class="keyword">const</span> LiteralIndex <a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>(component[0]);</div>
|
|
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  reverse_topological_order_.push_back(<a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>);</div>
|
|
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  </div>
|
|
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  <span class="keywordflow">if</span> (component.size() == 1) {</div>
|
|
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  <span class="comment">// Note that because we process list in reverse topological order, this</span></div>
|
|
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  <span class="comment">// is only needed if there is any equivalence before this point.</span></div>
|
|
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <span class="keywordflow">if</span> (num_equivalences > 0) {</div>
|
|
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  <span class="keyword">auto</span>& representative_list = implications_[<a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>];</div>
|
|
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>& ref : representative_list) {</div>
|
|
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <span class="keyword">const</span> LiteralIndex rep = representative_of_[ref.Index()];</div>
|
|
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  <span class="keywordflow">if</span> (rep == <a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  <span class="keywordflow">if</span> (rep == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  ref = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(rep);</div>
|
|
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  }</div>
|
|
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&representative_list);</div>
|
|
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  }</div>
|
|
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  }</div>
|
|
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  </div>
|
|
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  <span class="comment">// Sets the representative.</span></div>
|
|
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < component.size(); ++i) {</div>
|
|
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(LiteralIndex(component[i]));</div>
|
|
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  <span class="keywordflow">if</span> (!is_redundant_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()]) {</div>
|
|
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  ++num_redundant_literals_;</div>
|
|
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  is_redundant_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  }</div>
|
|
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  representative_of_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()] = <a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>;</div>
|
|
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  </div>
|
|
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  <span class="comment">// Detect if x <=> not(x) which means unsat. Note that we relly on the</span></div>
|
|
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  <span class="comment">// fact that when sorted, they will both be consecutive in the list.</span></div>
|
|
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(LiteralIndex(component[i - 1])).Negated() == <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>) {</div>
|
|
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  <a class="code" href="base_2logging_8h.html#a09f7d88282cf92c9f231270ac113e5c6">LOG_IF</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>, log_info) << <span class="stringliteral">"Trivially UNSAT in DetectEquivalences()"</span>;</div>
|
|
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  }</div>
|
|
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  }</div>
|
|
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  </div>
|
|
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  <span class="comment">// Merge all the lists in implications_[representative].</span></div>
|
|
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  <span class="comment">// Note that we do not want representative in its own list.</span></div>
|
|
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  <span class="keyword">auto</span>& representative_list = implications_[<a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>];</div>
|
|
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</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> l : representative_list) {</div>
|
|
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> rep = <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6fac58ca16fd746d7488a0a97f6965bd">RepresentativeOf</a>(l);</div>
|
|
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  <span class="keywordflow">if</span> (rep.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>() == <a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  representative_list[new_size++] = rep;</div>
|
|
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  }</div>
|
|
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  representative_list.resize(new_size);</div>
|
|
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < component.size(); ++i) {</div>
|
|
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(LiteralIndex(component[i]));</div>
|
|
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  <span class="keyword">auto</span>& ref = implications_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()];</div>
|
|
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</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> l : ref) {</div>
|
|
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> rep = <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6fac58ca16fd746d7488a0a97f6965bd">RepresentativeOf</a>(l);</div>
|
|
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  <span class="keywordflow">if</span> (rep.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>() != <a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>) representative_list.push_back(rep);</div>
|
|
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  }</div>
|
|
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  </div>
|
|
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  <span class="comment">// Add representative <=> literal.</span></div>
|
|
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  <span class="comment">// Remark: this relation do not need to be added to a DRAT proof since</span></div>
|
|
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  <span class="comment">// the redundant variables should never be used again for a pure SAT</span></div>
|
|
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  <span class="comment">// problem.</span></div>
|
|
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  representative_list.push_back(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  ref.clear();</div>
|
|
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  ref.push_back(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>));</div>
|
|
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  }</div>
|
|
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&representative_list);</div>
|
|
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  num_equivalences += component.size() - 1;</div>
|
|
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  }</div>
|
|
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  </div>
|
|
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  is_dag_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  <span class="keywordflow">if</span> (num_equivalences != 0) {</div>
|
|
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  <span class="comment">// Remap all at most ones. Remove fixed variables, process duplicates. Note</span></div>
|
|
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  <span class="comment">// that this might result in more implications when we expand small at most</span></div>
|
|
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  <span class="comment">// one.</span></div>
|
|
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  at_most_ones_.<a class="code" href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">clear</a>();</div>
|
|
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  CleanUpAndAddAtMostOnes(<span class="comment">/*base_index=*/</span>0);</div>
|
|
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  </div>
|
|
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  num_implications_ = 0;</div>
|
|
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  <span class="keywordflow">for</span> (LiteralIndex i(0); i < size; ++i) {</div>
|
|
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  num_implications_ += implications_[i].size();</div>
|
|
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  }</div>
|
|
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  dtime += 2e-8 * num_implications_;</div>
|
|
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  }</div>
|
|
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  </div>
|
|
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#af90cfd1fc238433fc303ee28c5914eb9">AdvanceDeterministicTime</a>(dtime);</div>
|
|
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  <a class="code" href="base_2logging_8h.html#a09f7d88282cf92c9f231270ac113e5c6">LOG_IF</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>, log_info) << <span class="stringliteral">"SCC. "</span> << num_equivalences</div>
|
|
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  << <span class="stringliteral">" redundant equivalent literals. "</span></div>
|
|
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  << num_fixed_during_scc << <span class="stringliteral">" fixed. "</span></div>
|
|
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  << num_implications_ << <span class="stringliteral">" implications left. "</span></div>
|
|
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  << implications_.size() << <span class="stringliteral">" literals."</span></div>
|
|
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  << <span class="stringliteral">" size of at_most_one buffer = "</span></div>
|
|
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  << at_most_one_buffer_.size() << <span class="stringliteral">"."</span></div>
|
|
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  << <span class="stringliteral">" dtime: "</span> << dtime</div>
|
|
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  << <span class="stringliteral">" wtime: "</span> << <a class="code" href="cp__model__solver_8cc.html#ace0951799e72ee99fc07d5e509bc7cbf">wall_timer</a>.<a class="code" href="class_wall_timer.html#aec56fe080959ecebec3feaed9dafde84">Get</a>();</div>
|
|
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span> }</div>
|
|
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  </div>
|
|
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span> <span class="comment">// Note that as a side effect this also do a full "failed literal probing"</span></div>
|
|
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span> <span class="comment">// using the binary implication graph only.</span></div>
|
|
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span> <span class="comment">// TODO(user): Track which literal have new implications, and only process</span></div>
|
|
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span> <span class="comment">// the antecedants of these.</span></div>
|
|
<div class="line"><a name="l01311"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a29218ade45d7df87f01459565526cfe2"> 1311</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a29218ade45d7df87f01459565526cfe2">BinaryImplicationGraph::ComputeTransitiveReduction</a>(<span class="keywordtype">bool</span> log_info) {</div>
|
|
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#aac261e221628d6a51be7243563659929">DetectEquivalences</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  </div>
|
|
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  <span class="comment">// TODO(user): the situation with fixed variable is not really "clean".</span></div>
|
|
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  <span class="comment">// Simplify the code so we are sure we don't run into issue or have to deal</span></div>
|
|
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  <span class="comment">// with any of that here.</span></div>
|
|
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a1f591be5334541874ba049873235f0a9">Propagate</a>(trail_)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abcad56047cef75a12528fe99794a6e1e">RemoveFixedVariables</a>();</div>
|
|
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  </div>
|
|
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  log_info |= <a class="code" href="vlog__is__on_8h.html#a956152cad330225654d128f35c00efce">VLOG_IS_ON</a>(1);</div>
|
|
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  <a class="code" href="class_wall_timer.html">WallTimer</a> <a class="code" href="cp__model__solver_8cc.html#ace0951799e72ee99fc07d5e509bc7cbf">wall_timer</a>;</div>
|
|
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  <a class="code" href="cp__model__solver_8cc.html#ace0951799e72ee99fc07d5e509bc7cbf">wall_timer</a>.<a class="code" href="class_wall_timer.html#a07aaf1227e4d645f15e0a964f54ef291">Start</a>();</div>
|
|
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  </div>
|
|
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_fixed = 0;</div>
|
|
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_new_redundant_implications = 0;</div>
|
|
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  <span class="keywordtype">bool</span> aborted = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  work_done_in_mark_descendants_ = 0;</div>
|
|
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  <span class="keywordtype">int</span> marked_index = 0;</div>
|
|
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  </div>
|
|
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  <span class="comment">// For each node we do a graph traversal and only keep the literals</span></div>
|
|
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <span class="comment">// at maximum distance 1. This only works because we have a DAG when ignoring</span></div>
|
|
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  <span class="comment">// the "redundant" literal marked by DetectEquivalences(). Note that we also</span></div>
|
|
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  <span class="comment">// need no duplicates in the implications list for correctness which is also</span></div>
|
|
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  <span class="comment">// guaranteed by DetectEquivalences().</span></div>
|
|
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  <span class="comment">// TODO(user): We should be able to reuse some propagation like it is done for</span></div>
|
|
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  <span class="comment">// tree-look. Once a node is processed, we just need to process a node that</span></div>
|
|
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  <span class="comment">// implies it. Test if we can make this faster. Alternatively, only clear</span></div>
|
|
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <span class="comment">// a part of is_marked_ (after the first child of root in reverse topo order).</span></div>
|
|
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  <span class="comment">// TODO(user): Can we exploit the fact that the implication graph is a</span></div>
|
|
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  <span class="comment">// skew-symmetric graph (isomorphic to its transposed) so that we do less</span></div>
|
|
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  <span class="comment">// work? Also it would be nice to keep the property that even if we abort</span></div>
|
|
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  <span class="comment">// during the algorithm, if a => b, then not(b) => not(a) is also present in</span></div>
|
|
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  <span class="comment">// the other direct implication list.</span></div>
|
|
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  <span class="keyword">const</span> LiteralIndex size(implications_.size());</div>
|
|
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  LiteralIndex previous = <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>;</div>
|
|
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LiteralIndex root : reverse_topological_order_) {</div>
|
|
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  <span class="comment">// In most situation reverse_topological_order_ contains no redundant, fixed</span></div>
|
|
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  <span class="comment">// or removed variables. But the reverse_topological_order_ is only</span></div>
|
|
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  <span class="comment">// recomputed when new binary are added to the graph, not when new variable</span></div>
|
|
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  <span class="comment">// are fixed.</span></div>
|
|
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  <span class="keywordflow">if</span> (is_redundant_[root]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  <span class="keywordflow">if</span> (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#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(root))) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  </div>
|
|
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  <span class="keyword">auto</span>& direct_implications = implications_[root];</div>
|
|
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  <span class="keywordflow">if</span> (direct_implications.empty()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  </div>
|
|
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  <span class="comment">// This is a "poor" version of the tree look stuff, but it does show good</span></div>
|
|
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  <span class="comment">// improvement. If we just processed one of the child of root, we don't</span></div>
|
|
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  <span class="comment">// need to re-explore it.</span></div>
|
|
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  <span class="comment">// TODO(user): Another optim we can do is that we never need to expand</span></div>
|
|
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  <span class="comment">// any node with a reverse topo order smaller or equal to the min of the</span></div>
|
|
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  <span class="comment">// ones in this list.</span></div>
|
|
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  <span class="keywordtype">bool</span> clear_previous_reachability = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</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> direct_child : direct_implications) {</div>
|
|
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="keywordflow">if</span> (direct_child.Index() == previous) {</div>
|
|
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  clear_previous_reachability = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(previous);</div>
|
|
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  }</div>
|
|
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  }</div>
|
|
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  <span class="keywordflow">if</span> (clear_previous_reachability) {</div>
|
|
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(size);</div>
|
|
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  marked_index = 0;</div>
|
|
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  }</div>
|
|
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  previous = root;</div>
|
|
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  </div>
|
|
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</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> direct_child : direct_implications) {</div>
|
|
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="keywordflow">if</span> (is_redundant_[direct_child.Index()]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  <span class="keywordflow">if</span> (is_marked_[direct_child.Index()]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  </div>
|
|
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  <span class="comment">// This is a corner case where because of equivalent literal, root</span></div>
|
|
<div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  <span class="comment">// appear in implications_[root], we will remove it below.</span></div>
|
|
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  <span class="keywordflow">if</span> (direct_child.Index() == root) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  </div>
|
|
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  <span class="comment">// When this happens, then root must be false, we handle this just after</span></div>
|
|
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  <span class="comment">// the loop.</span></div>
|
|
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  <span class="keywordflow">if</span> (direct_child.NegatedIndex() == root) {</div>
|
|
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(direct_child.Index());</div>
|
|
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  }</div>
|
|
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  </div>
|
|
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  MarkDescendants(direct_child);</div>
|
|
<div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  </div>
|
|
<div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  <span class="comment">// We have a DAG, so direct_child could only be marked first.</span></div>
|
|
<div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(direct_child.Index());</div>
|
|
<div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  }</div>
|
|
<div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!is_marked_[root])</div>
|
|
<div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  << <span class="stringliteral">"DetectEquivalences() should have removed cycles!"</span>;</div>
|
|
<div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(root);</div>
|
|
<div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  </div>
|
|
<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  <span class="comment">// Failed literal probing. If both x and not(x) are marked then root must be</span></div>
|
|
<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  <span class="comment">// false. Note that because we process "roots" in reverse topological order,</span></div>
|
|
<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  <span class="comment">// we will fix the LCA of x and not(x) first.</span></div>
|
|
<div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& marked_positions = is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>();</div>
|
|
<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  <span class="keywordflow">for</span> (; marked_index < marked_positions.size(); ++marked_index) {</div>
|
|
<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  <span class="keyword">const</span> LiteralIndex i = marked_positions[marked_index];</div>
|
|
<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  <span class="keywordflow">if</span> (is_marked_[<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(i).NegatedIndex()]) {</div>
|
|
<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  <span class="comment">// We tested that at the beginning.</span></div>
|
|
<div class="line"><a name="l01413"></a><span class="lineno"> 1413</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#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(root)));</div>
|
|
<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  </div>
|
|
<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  <span class="comment">// We propagate right away the binary implications so that we do not</span></div>
|
|
<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  <span class="comment">// need to consider all antecedants of root in the transitive</span></div>
|
|
<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  <span class="comment">// reduction.</span></div>
|
|
<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  ++num_fixed;</div>
|
|
<div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  <span class="keywordflow">if</span> (!FixLiteral(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(root).Negated())) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  }</div>
|
|
<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  }</div>
|
|
<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  </div>
|
|
<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  <span class="comment">// Note that direct_implications will be cleared by</span></div>
|
|
<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  <span class="comment">// RemoveFixedVariables() that will need to inspect it to completely</span></div>
|
|
<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  <span class="comment">// remove Literal(root) from all lists.</span></div>
|
|
<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  <span class="keywordflow">if</span> (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#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(root))) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  </div>
|
|
<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  <span class="comment">// Only keep the non-marked literal (and the redundant one which are never</span></div>
|
|
<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  <span class="comment">// marked). We mark root to remove it in the corner case where it was</span></div>
|
|
<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  <span class="comment">// there.</span></div>
|
|
<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a name="l01433"></a><span class="lineno"> 1433</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> l : direct_implications) {</div>
|
|
<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  <span class="keywordflow">if</span> (!is_marked_[l.Index()]) {</div>
|
|
<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  direct_implications[new_size++] = l;</div>
|
|
<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!is_redundant_[l.Index()]);</div>
|
|
<div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  }</div>
|
|
<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  }</div>
|
|
<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> diff = direct_implications.size() - new_size;</div>
|
|
<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  direct_implications.resize(new_size);</div>
|
|
<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  direct_implications.shrink_to_fit();</div>
|
|
<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  num_new_redundant_implications += diff;</div>
|
|
<div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>  num_implications_ -= diff;</div>
|
|
<div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  </div>
|
|
<div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  <span class="comment">// Abort if the computation involved is too big.</span></div>
|
|
<div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  <span class="keywordflow">if</span> (work_done_in_mark_descendants_ > 1e8) {</div>
|
|
<div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  aborted = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  }</div>
|
|
<div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  }</div>
|
|
<div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  </div>
|
|
<div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(size);</div>
|
|
<div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  </div>
|
|
<div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> dtime = 1e-8 * work_done_in_mark_descendants_;</div>
|
|
<div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#af90cfd1fc238433fc303ee28c5914eb9">AdvanceDeterministicTime</a>(dtime);</div>
|
|
<div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  num_redundant_implications_ += num_new_redundant_implications;</div>
|
|
<div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  <a class="code" href="base_2logging_8h.html#a09f7d88282cf92c9f231270ac113e5c6">LOG_IF</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>, log_info) << <span class="stringliteral">"Transitive reduction removed "</span></div>
|
|
<div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  << num_new_redundant_implications << <span class="stringliteral">" literals. "</span></div>
|
|
<div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  << num_fixed << <span class="stringliteral">" fixed. "</span> << num_implications_</div>
|
|
<div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  << <span class="stringliteral">" implications left. "</span> << implications_.size()</div>
|
|
<div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  << <span class="stringliteral">" literals."</span></div>
|
|
<div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  << <span class="stringliteral">" dtime: "</span> << dtime</div>
|
|
<div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  << <span class="stringliteral">" wtime: "</span> << <a class="code" href="cp__model__solver_8cc.html#ace0951799e72ee99fc07d5e509bc7cbf">wall_timer</a>.<a class="code" href="class_wall_timer.html#aec56fe080959ecebec3feaed9dafde84">Get</a>()</div>
|
|
<div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  << (aborted ? <span class="stringliteral">" Aborted."</span> : <span class="stringliteral">""</span>);</div>
|
|
<div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01467"></a><span class="lineno"> 1467</span> }</div>
|
|
<div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  </div>
|
|
<div class="line"><a name="l01469"></a><span class="lineno"> 1469</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  </div>
|
|
<div class="line"><a name="l01471"></a><span class="lineno"> 1471</span> <span class="keywordtype">bool</span> IntersectionIsEmpty(<span class="keyword">const</span> std::vector<int>& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <span class="keyword">const</span> std::vector<int>& <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::is_sorted(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.begin(), <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.end()));</div>
|
|
<div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::is_sorted(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.begin(), <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.end()));</div>
|
|
<div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>  <span class="keywordtype">int</span> i = 0;</div>
|
|
<div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  <span class="keywordtype">int</span> j = 0;</div>
|
|
<div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  <span class="keywordflow">for</span> (; i < <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.size() && j < <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.size();) {</div>
|
|
<div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>[i] == <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>[j]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>[i] < <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>[j]) {</div>
|
|
<div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  ++i;</div>
|
|
<div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  ++j;</div>
|
|
<div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  }</div>
|
|
<div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  }</div>
|
|
<div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01485"></a><span class="lineno"> 1485</span> }</div>
|
|
<div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  </div>
|
|
<div class="line"><a name="l01487"></a><span class="lineno"> 1487</span> <span class="comment">// Used by TransformIntoMaxCliques().</span></div>
|
|
<div class="line"><a name="l01488"></a><span class="lineno"> 1488</span> <span class="keyword">struct </span>VectorHash {</div>
|
|
<div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  std::size_t operator()(<span class="keyword">const</span> std::vector<Literal>& at_most_one)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  <span class="keywordtype">size_t</span> <a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a> = 0;</div>
|
|
<div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  <span class="keywordflow">for</span> (Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : at_most_one) {</div>
|
|
<div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  <a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a> = <a class="code" href="namespaceutil__hash.html#aa2ba7114404f5416e797636b0e1eddcd">util_hash::Hash</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index().value(), <a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a>);</div>
|
|
<div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  }</div>
|
|
<div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  <span class="keywordflow">return</span> <a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a>;</div>
|
|
<div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  }</div>
|
|
<div class="line"><a name="l01496"></a><span class="lineno"> 1496</span> };</div>
|
|
<div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  </div>
|
|
<div class="line"><a name="l01498"></a><span class="lineno"> 1498</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  </div>
|
|
<div class="line"><a name="l01500"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ab4ed77545127809d811ea158c29e9ef7"> 1500</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ab4ed77545127809d811ea158c29e9ef7">BinaryImplicationGraph::TransformIntoMaxCliques</a>(</div>
|
|
<div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  std::vector<std::vector<Literal>>* at_most_ones,</div>
|
|
<div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_num_explored_nodes) {</div>
|
|
<div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  <span class="comment">// The code below assumes a DAG.</span></div>
|
|
<div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#aac261e221628d6a51be7243563659929">DetectEquivalences</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  work_done_in_mark_descendants_ = 0;</div>
|
|
<div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  </div>
|
|
<div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  <span class="keywordtype">int</span> num_extended = 0;</div>
|
|
<div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  <span class="keywordtype">int</span> num_removed = 0;</div>
|
|
<div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  <span class="keywordtype">int</span> num_added = 0;</div>
|
|
<div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  </div>
|
|
<div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  absl::flat_hash_set<std::vector<Literal>, VectorHash> max_cliques;</div>
|
|
<div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, std::vector<int></a>> max_cliques_containing(</div>
|
|
<div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  implications_.size());</div>
|
|
<div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  </div>
|
|
<div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  <span class="comment">// We starts by processing larger constraints first.</span></div>
|
|
<div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  std::sort(at_most_ones->begin(), at_most_ones->end(),</div>
|
|
<div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  [](<span class="keyword">const</span> std::vector<Literal> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <span class="keyword">const</span> std::vector<Literal> <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  return a.size() > b.size();</div>
|
|
<div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  });</div>
|
|
<div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  <span class="keywordflow">for</span> (std::vector<Literal>& clique : *at_most_ones) {</div>
|
|
<div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_size = clique.size();</div>
|
|
<div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  </div>
|
|
<div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  <span class="comment">// Remap the clique to only use representative.</span></div>
|
|
<div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  <span class="comment">// Note(user): Because we always use literal with the smallest variable</span></div>
|
|
<div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  <span class="comment">// indices as representative, this make sure that if possible, we express</span></div>
|
|
<div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  <span class="comment">// the clique in term of user provided variable (that are always created</span></div>
|
|
<div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  <span class="comment">// first).</span></div>
|
|
<div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>& ref : clique) {</div>
|
|
<div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(ref.Index(), representative_of_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>());</div>
|
|
<div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  <span class="keyword">const</span> LiteralIndex rep = representative_of_[ref.Index()];</div>
|
|
<div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  <span class="keywordflow">if</span> (rep == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  ref = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(rep);</div>
|
|
<div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  }</div>
|
|
<div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  </div>
|
|
<div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  <span class="comment">// Special case for clique of size 2, we don't expand them if they</span></div>
|
|
<div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  <span class="comment">// are included in an already added clique.</span></div>
|
|
<div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  <span class="comment">// TODO(user): the second condition means the literal must be false!</span></div>
|
|
<div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  <span class="keywordflow">if</span> (old_size == 2 && clique[0] != clique[1]) {</div>
|
|
<div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  <span class="keywordflow">if</span> (!IntersectionIsEmpty(max_cliques_containing[clique[0].<a class="code" href="namespaceoperations__research_1_1glop.html#abec9e934a51aa2ab519684cc0f446a41">Index</a>()],</div>
|
|
<div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  max_cliques_containing[clique[1].<a class="code" href="namespaceoperations__research_1_1glop.html#abec9e934a51aa2ab519684cc0f446a41">Index</a>()])) {</div>
|
|
<div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  ++num_removed;</div>
|
|
<div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  clique.clear();</div>
|
|
<div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  }</div>
|
|
<div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  }</div>
|
|
<div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  </div>
|
|
<div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  <span class="comment">// We only expand the clique as long as we didn't spend too much time.</span></div>
|
|
<div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  <span class="keywordflow">if</span> (work_done_in_mark_descendants_ < max_num_explored_nodes) {</div>
|
|
<div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  clique = ExpandAtMostOne(clique);</div>
|
|
<div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  }</div>
|
|
<div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  std::sort(clique.begin(), clique.end());</div>
|
|
<div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespacegtl.html#a3ea1e2b26e83387a5eea8d83d9406d34">gtl::InsertIfNotPresent</a>(&max_cliques, clique)) {</div>
|
|
<div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  ++num_removed;</div>
|
|
<div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  clique.clear();</div>
|
|
<div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  }</div>
|
|
<div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  </div>
|
|
<div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> clique_index = max_cliques.size();</div>
|
|
<div class="line"><a name="l01561"></a><span class="lineno"> 1561</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> l : clique) {</div>
|
|
<div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  max_cliques_containing[l.Index()].<a class="code" href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(clique_index);</div>
|
|
<div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  }</div>
|
|
<div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  <span class="keywordflow">if</span> (clique.size() > old_size) ++num_extended;</div>
|
|
<div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  ++num_added;</div>
|
|
<div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  }</div>
|
|
<div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  </div>
|
|
<div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  <span class="keywordflow">if</span> (num_extended > 0 || num_removed > 0 || num_added > 0) {</div>
|
|
<div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Clique Extended: "</span> << num_extended</div>
|
|
<div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  << <span class="stringliteral">" Removed: "</span> << num_removed << <span class="stringliteral">" Added: "</span> << num_added</div>
|
|
<div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  << (work_done_in_mark_descendants_ > max_num_explored_nodes</div>
|
|
<div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  ? <span class="stringliteral">" (Aborted)"</span></div>
|
|
<div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  : <span class="stringliteral">""</span>);</div>
|
|
<div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  }</div>
|
|
<div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01576"></a><span class="lineno"> 1576</span> }</div>
|
|
<div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  </div>
|
|
<div class="line"><a name="l01578"></a><span class="lineno"> 1578</span> std::vector<Literal> BinaryImplicationGraph::ExpandAtMostOneWithWeight(</div>
|
|
<div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  <span class="keyword">const</span> absl::Span<const Literal> at_most_one,</div>
|
|
<div class="line"><a name="l01580"></a><span class="lineno"> 1580</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="l01581"></a><span class="lineno"> 1581</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="l01582"></a><span class="lineno"> 1582</span>  std::vector<Literal> clique(at_most_one.begin(), at_most_one.end());</div>
|
|
<div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  std::vector<LiteralIndex> intersection;</div>
|
|
<div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  <span class="keywordtype">double</span> clique_weight = 0.0;</div>
|
|
<div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> old_work = work_done_in_mark_descendants_;</div>
|
|
<div class="line"><a name="l01586"></a><span class="lineno"> 1586</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> l : clique) clique_weight += expanded_lp_values[l.Index()];</div>
|
|
<div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < clique.size(); ++i) {</div>
|
|
<div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  <span class="comment">// Do not spend too much time here.</span></div>
|
|
<div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  <span class="keywordflow">if</span> (work_done_in_mark_descendants_ - old_work > 1e8) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  </div>
|
|
<div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(LiteralIndex(implications_.size()));</div>
|
|
<div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  MarkDescendants(clique[i]);</div>
|
|
<div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  <span class="keywordflow">if</span> (i == 0) {</div>
|
|
<div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LiteralIndex <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  <span class="keywordflow">if</span> (can_be_included[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) intersection.push_back(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  }</div>
|
|
<div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : clique) is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(l.NegatedIndex());</div>
|
|
<div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  }</div>
|
|
<div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  </div>
|
|
<div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  <span class="keywordtype">double</span> intersection_weight = 0.0;</div>
|
|
<div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(clique[i].<a class="code" href="namespaceoperations__research_1_1glop.html#abec9e934a51aa2ab519684cc0f446a41">Index</a>());</div>
|
|
<div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(clique[i].NegatedIndex());</div>
|
|
<div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LiteralIndex <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : intersection) {</div>
|
|
<div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  <span class="keywordflow">if</span> (!is_marked_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  intersection[new_size++] = <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>  intersection_weight += expanded_lp_values[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  }</div>
|
|
<div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  intersection.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(new_size);</div>
|
|
<div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  <span class="keywordflow">if</span> (intersection.empty()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  </div>
|
|
<div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  <span class="comment">// We can't generate a violated cut this way. This is because intersection</span></div>
|
|
<div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  <span class="comment">// contains all the possible ways to extend the current clique.</span></div>
|
|
<div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  <span class="keywordflow">if</span> (clique_weight + intersection_weight <= 1.0) {</div>
|
|
<div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  clique.clear();</div>
|
|
<div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  <span class="keywordflow">return</span> clique;</div>
|
|
<div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  }</div>
|
|
<div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  </div>
|
|
<div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  <span class="comment">// Expand? The negation of any literal in the intersection is a valid way</span></div>
|
|
<div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  <span class="comment">// to extend the clique.</span></div>
|
|
<div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  <span class="keywordflow">if</span> (i + 1 == clique.size()) {</div>
|
|
<div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  <span class="comment">// Heuristic: use literal with largest lp value. We randomize slightly.</span></div>
|
|
<div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = -1;</div>
|
|
<div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>  <span class="keywordtype">double</span> max_lp = 0.0;</div>
|
|
<div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < intersection.size(); ++j) {</div>
|
|
<div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lp = 1.0 - expanded_lp_values[intersection[j]] +</div>
|
|
<div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  absl::Uniform<double>(*random_, 0.0, 1e-4);</div>
|
|
<div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == -1 || lp > max_lp) {</div>
|
|
<div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = j;</div>
|
|
<div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>  max_lp = lp;</div>
|
|
<div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>  }</div>
|
|
<div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  }</div>
|
|
<div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> != -1) {</div>
|
|
<div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  clique.push_back(Literal(intersection[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]).Negated());</div>
|
|
<div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  std::swap(intersection.back(), intersection[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  intersection.pop_back();</div>
|
|
<div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  clique_weight += expanded_lp_values[clique.back().Index()];</div>
|
|
<div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  }</div>
|
|
<div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  }</div>
|
|
<div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  }</div>
|
|
<div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  <span class="keywordflow">return</span> clique;</div>
|
|
<div class="line"><a name="l01642"></a><span class="lineno"> 1642</span> }</div>
|
|
<div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>  </div>
|
|
<div class="line"><a name="l01644"></a><span class="lineno"> 1644</span> <span class="keyword">const</span> std::vector<std::vector<Literal>>&</div>
|
|
<div class="line"><a name="l01645"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a547f00a3da71d429424aa6dc92c487bc"> 1645</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a547f00a3da71d429424aa6dc92c487bc">BinaryImplicationGraph::GenerateAtMostOnesWithLargeWeight</a>(</div>
|
|
<div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>  <span class="keyword">const</span> std::vector<Literal>& literals,</div>
|
|
<div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  <span class="keyword">const</span> std::vector<double>& lp_values) {</div>
|
|
<div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  <span class="comment">// We only want to generate a cut with literals from the LP, not extra ones.</span></div>
|
|
<div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_literals = implications_.size();</div>
|
|
<div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, bool></a> can_be_included(num_literals, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, double></a> expanded_lp_values(num_literals,</div>
|
|
<div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>  0.0);</div>
|
|
<div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = literals.size();</div>
|
|
<div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l = literals[i];</div>
|
|
<div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>  can_be_included[l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>  can_be_included[l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7">NegatedIndex</a>()] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  </div>
|
|
<div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = lp_values[i];</div>
|
|
<div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  expanded_lp_values[l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()] = <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>;</div>
|
|
<div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>  expanded_lp_values[l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7">NegatedIndex</a>()] = 1.0 - <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>;</div>
|
|
<div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  }</div>
|
|
<div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>  </div>
|
|
<div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  <span class="comment">// We want highest sum first.</span></div>
|
|
<div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>  <span class="keyword">struct </span>Candidate {</div>
|
|
<div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>;</div>
|
|
<div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>;</div>
|
|
<div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>  <span class="keywordtype">double</span> sum;</div>
|
|
<div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>  <span class="keywordtype">bool</span> operator<(<span class="keyword">const</span> Candidate& other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> sum > other.sum; }</div>
|
|
<div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>  };</div>
|
|
<div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>  std::vector<Candidate> candidates;</div>
|
|
<div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  </div>
|
|
<div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  <span class="comment">// First heuristic. Currently we only consider violated at most one of size 2,</span></div>
|
|
<div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  <span class="comment">// and extend them. Right now, the code is a bit slow to try too many at every</span></div>
|
|
<div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>  <span class="comment">// LP node so it is why we are defensive like this. Note also that because we</span></div>
|
|
<div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  <span class="comment">// currently still statically add the initial implications, this will only add</span></div>
|
|
<div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>  <span class="comment">// cut based on newly learned binary clause. Or the one that were not added</span></div>
|
|
<div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>  <span class="comment">// to the relaxation in the first place.</span></div>
|
|
<div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> current_literal = literals[i];</div>
|
|
<div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  <span class="keywordtype">double</span> current_value = lp_values[i];</div>
|
|
<div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>  <span class="keywordflow">if</span> (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#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(current_literal)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>  <span class="keywordflow">if</span> (is_redundant_[current_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>  </div>
|
|
<div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>  <span class="keywordflow">if</span> (current_value < 0.5) {</div>
|
|
<div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  current_literal = current_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>();</div>
|
|
<div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>  current_value = 1.0 - current_value;</div>
|
|
<div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  }</div>
|
|
<div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  </div>
|
|
<div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  <span class="comment">// We consider only one candidate for each current_literal.</span></div>
|
|
<div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>  LiteralIndex best = <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>;</div>
|
|
<div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>  <span class="keywordtype">double</span> best_value = 0.0;</div>
|
|
<div class="line"><a name="l01693"></a><span class="lineno"> 1693</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> l : implications_[current_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()]) {</div>
|
|
<div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>  <span class="keywordflow">if</span> (!can_be_included[l.Index()]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> activity =</div>
|
|
<div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>  current_value + expanded_lp_values[l.NegatedIndex()];</div>
|
|
<div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  <span class="keywordflow">if</span> (activity <= 1.01) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> v = activity + absl::Uniform<double>(*random_, 0.0, 1e-4);</div>
|
|
<div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>  <span class="keywordflow">if</span> (best == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a> || v > best_value) {</div>
|
|
<div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>  best_value = v;</div>
|
|
<div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>  best = l.NegatedIndex();</div>
|
|
<div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>  }</div>
|
|
<div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>  }</div>
|
|
<div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  <span class="keywordflow">if</span> (best != <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) {</div>
|
|
<div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> activity = current_value + expanded_lp_values[best];</div>
|
|
<div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>  candidates.<a class="code" href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>({current_literal, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(best), activity});</div>
|
|
<div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  }</div>
|
|
<div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>  }</div>
|
|
<div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>  </div>
|
|
<div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>  <span class="comment">// Do not genate too many cut at once.</span></div>
|
|
<div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kMaxNumberOfCutPerCall = 50;</div>
|
|
<div class="line"><a name="l01712"></a><span class="lineno"> 1712</span>  std::sort(candidates.begin(), candidates.end());</div>
|
|
<div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  <span class="keywordflow">if</span> (candidates.size() > kMaxNumberOfCutPerCall) {</div>
|
|
<div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  candidates.resize(kMaxNumberOfCutPerCall);</div>
|
|
<div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  }</div>
|
|
<div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  </div>
|
|
<div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>  <span class="comment">// Expand to a maximal at most one each candidates before returning them.</span></div>
|
|
<div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>  <span class="comment">// Note that we only expand using literal from the LP.</span></div>
|
|
<div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  tmp_cuts_.clear();</div>
|
|
<div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>  std::vector<Literal> at_most_one;</div>
|
|
<div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Candidate& candidate : candidates) {</div>
|
|
<div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>  at_most_one = ExpandAtMostOneWithWeight(</div>
|
|
<div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>  {candidate.a, candidate.b}, can_be_included, expanded_lp_values);</div>
|
|
<div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>  <span class="keywordflow">if</span> (!at_most_one.empty()) tmp_cuts_.push_back(at_most_one);</div>
|
|
<div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>  }</div>
|
|
<div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  <span class="keywordflow">return</span> tmp_cuts_;</div>
|
|
<div class="line"><a name="l01727"></a><span class="lineno"> 1727</span> }</div>
|
|
<div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>  </div>
|
|
<div class="line"><a name="l01729"></a><span class="lineno"> 1729</span> <span class="comment">// We use dfs_stack_ but we actually do a BFS.</span></div>
|
|
<div class="line"><a name="l01730"></a><span class="lineno"> 1730</span> <span class="keywordtype">void</span> BinaryImplicationGraph::MarkDescendants(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> root) {</div>
|
|
<div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  dfs_stack_ = {root};</div>
|
|
<div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(root.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>());</div>
|
|
<div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>  <span class="keywordflow">if</span> (is_redundant_[root.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()]) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < dfs_stack_.size(); ++j) {</div>
|
|
<div class="line"><a name="l01735"></a><span class="lineno"> 1735</span>  <span class="keyword">const</span> Literal current = dfs_stack_[j];</div>
|
|
<div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : implications_[current.Index()]) {</div>
|
|
<div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>  <span class="keywordflow">if</span> (!is_marked_[l.Index()] && !is_redundant_[l.Index()]) {</div>
|
|
<div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  dfs_stack_.push_back(l);</div>
|
|
<div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(l.Index());</div>
|
|
<div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>  }</div>
|
|
<div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>  }</div>
|
|
<div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>  </div>
|
|
<div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  <span class="keywordflow">if</span> (current.Index() >= at_most_ones_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> start : at_most_ones_[current.Index()]) {</div>
|
|
<div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = start;; ++i) {</div>
|
|
<div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  <span class="keyword">const</span> Literal l = at_most_one_buffer_[i];</div>
|
|
<div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  <span class="keywordflow">if</span> (l.Index() == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>  <span class="keywordflow">if</span> (l == current) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>  <span class="keywordflow">if</span> (!is_marked_[l.NegatedIndex()] && !is_redundant_[l.NegatedIndex()]) {</div>
|
|
<div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  dfs_stack_.push_back(l.Negated());</div>
|
|
<div class="line"><a name="l01751"></a><span class="lineno"> 1751</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(l.NegatedIndex());</div>
|
|
<div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  }</div>
|
|
<div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>  }</div>
|
|
<div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>  }</div>
|
|
<div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>  }</div>
|
|
<div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>  work_done_in_mark_descendants_ += dfs_stack_.size();</div>
|
|
<div class="line"><a name="l01757"></a><span class="lineno"> 1757</span> }</div>
|
|
<div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>  </div>
|
|
<div class="line"><a name="l01759"></a><span class="lineno"> 1759</span> std::vector<Literal> BinaryImplicationGraph::ExpandAtMostOne(</div>
|
|
<div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  <span class="keyword">const</span> absl::Span<const Literal> at_most_one) {</div>
|
|
<div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  std::vector<Literal> clique(at_most_one.begin(), at_most_one.end());</div>
|
|
<div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>  </div>
|
|
<div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>  <span class="comment">// Optim.</span></div>
|
|
<div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < clique.size(); ++i) {</div>
|
|
<div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  <span class="keywordflow">if</span> (implications_[clique[i].<a class="code" href="namespaceoperations__research_1_1glop.html#abec9e934a51aa2ab519684cc0f446a41">Index</a>()].empty() ||</div>
|
|
<div class="line"><a name="l01766"></a><span class="lineno"> 1766</span>  is_redundant_[clique[i].<a class="code" href="namespaceoperations__research_1_1glop.html#abec9e934a51aa2ab519684cc0f446a41">Index</a>()]) {</div>
|
|
<div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>  <span class="keywordflow">return</span> clique;</div>
|
|
<div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>  }</div>
|
|
<div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>  }</div>
|
|
<div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  </div>
|
|
<div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  std::vector<LiteralIndex> intersection;</div>
|
|
<div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < clique.size(); ++i) {</div>
|
|
<div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(LiteralIndex(implications_.size()));</div>
|
|
<div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>  MarkDescendants(clique[i]);</div>
|
|
<div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  <span class="keywordflow">if</span> (i == 0) {</div>
|
|
<div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>  intersection = is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>();</div>
|
|
<div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : clique) is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(l.NegatedIndex());</div>
|
|
<div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>  }</div>
|
|
<div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  </div>
|
|
<div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(clique[i].NegatedIndex()); <span class="comment">// TODO(user): explain.</span></div>
|
|
<div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LiteralIndex <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : intersection) {</div>
|
|
<div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  <span class="keywordflow">if</span> (is_marked_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) intersection[new_size++] = <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l01784"></a><span class="lineno"> 1784</span>  }</div>
|
|
<div class="line"><a name="l01785"></a><span class="lineno"> 1785</span>  intersection.resize(new_size);</div>
|
|
<div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>  <span class="keywordflow">if</span> (intersection.empty()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  </div>
|
|
<div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  <span class="comment">// Expand?</span></div>
|
|
<div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>  <span class="keywordflow">if</span> (i + 1 == clique.size()) {</div>
|
|
<div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>  clique.push_back(Literal(intersection.back()).Negated());</div>
|
|
<div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>  intersection.pop_back();</div>
|
|
<div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>  }</div>
|
|
<div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>  }</div>
|
|
<div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>  <span class="keywordflow">return</span> clique;</div>
|
|
<div class="line"><a name="l01795"></a><span class="lineno"> 1795</span> }</div>
|
|
<div class="line"><a name="l01796"></a><span class="lineno"> 1796</span>  </div>
|
|
<div class="line"><a name="l01797"></a><span class="lineno"> 1797</span> <span class="comment">// TODO(user): lazy cleanup the lists on is_removed_?</span></div>
|
|
<div class="line"><a name="l01798"></a><span class="lineno"> 1798</span> <span class="comment">// TODO(user): Mark fixed variable as is_removed_ for faster iteration?</span></div>
|
|
<div class="line"><a name="l01799"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a7eb6126b57ff4ab8246fe54f4e5550f4"> 1799</a></span> <span class="keyword">const</span> std::vector<Literal>& <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a7eb6126b57ff4ab8246fe54f4e5550f4">BinaryImplicationGraph::DirectImplications</a>(</div>
|
|
<div class="line"><a name="l01800"></a><span class="lineno"> 1800</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>) {</div>
|
|
<div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!is_removed_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()]);</div>
|
|
<div class="line"><a name="l01802"></a><span class="lineno"> 1802</span>  </div>
|
|
<div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>  <span class="comment">// Clear old state.</span></div>
|
|
<div class="line"><a name="l01804"></a><span class="lineno"> 1804</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> l : direct_implications_) {</div>
|
|
<div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>  in_direct_implications_[l.Index()] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>  }</div>
|
|
<div class="line"><a name="l01807"></a><span class="lineno"> 1807</span>  direct_implications_.<a class="code" href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">clear</a>();</div>
|
|
<div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>  </div>
|
|
<div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  <span class="comment">// Fill new state.</span></div>
|
|
<div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html">VariablesAssignment</a>& assignment = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>();</div>
|
|
<div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>));</div>
|
|
<div class="line"><a name="l01812"></a><span class="lineno"> 1812</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> l : implications_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()]) {</div>
|
|
<div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>  <span class="keywordflow">if</span> (l == <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>  <span class="keywordflow">if</span> (assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(l)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>  <span class="keywordflow">if</span> (!is_removed_[l.Index()] && !in_direct_implications_[l.Index()]) {</div>
|
|
<div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>  in_direct_implications_[l.Index()] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>  direct_implications_.<a class="code" href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(l);</div>
|
|
<div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>  }</div>
|
|
<div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>  }</div>
|
|
<div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  <span class="keywordflow">if</span> (<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index() < at_most_ones_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) {</div>
|
|
<div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>  <span class="keywordflow">if</span> (is_redundant_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()]) {</div>
|
|
<div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(at_most_ones_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()].<a class="code" href="classabsl_1_1_strong_vector.html#a644718bb2fb240de962dc3c9a1fdf0dc">empty</a>());</div>
|
|
<div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>  }</div>
|
|
<div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> start : at_most_ones_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()]) {</div>
|
|
<div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = start;; ++i) {</div>
|
|
<div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l = at_most_one_buffer_[i];</div>
|
|
<div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  <span class="keywordflow">if</span> (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">break</span>;</div>
|
|
<div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>  <span class="keywordflow">if</span> (l == <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  <span class="keywordflow">if</span> (assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(l)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>  <span class="keywordflow">if</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="l01831"></a><span class="lineno"> 1831</span>  !in_direct_implications_[l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7">NegatedIndex</a>()]) {</div>
|
|
<div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  in_direct_implications_[l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7">NegatedIndex</a>()] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  direct_implications_.<a class="code" href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(l.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>());</div>
|
|
<div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  }</div>
|
|
<div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  }</div>
|
|
<div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  }</div>
|
|
<div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>  }</div>
|
|
<div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  estimated_sizes_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()] = direct_implications_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>();</div>
|
|
<div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  <span class="keywordflow">return</span> direct_implications_;</div>
|
|
<div class="line"><a name="l01840"></a><span class="lineno"> 1840</span> }</div>
|
|
<div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  </div>
|
|
<div class="line"><a name="l01842"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abbf0624c5d966c4dcf29eece343e0592"> 1842</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abbf0624c5d966c4dcf29eece343e0592">BinaryImplicationGraph::FindFailedLiteralAroundVar</a>(BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div>
|
|
<div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  <span class="keywordtype">bool</span>* is_unsat) {</div>
|
|
<div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> saved_index = <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a>;</div>
|
|
<div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a>, trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>()); <span class="comment">// Propagation done.</span></div>
|
|
<div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>  </div>
|
|
<div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html">VariablesAssignment</a>& assignment = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>();</div>
|
|
<div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>  <span class="keywordflow">if</span> (assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  </div>
|
|
<div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>  direct_implications_of_negated_literal_ =</div>
|
|
<div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>  <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a7eb6126b57ff4ab8246fe54f4e5550f4">DirectImplications</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Negated());</div>
|
|
<div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a7eb6126b57ff4ab8246fe54f4e5550f4">DirectImplications</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>); <span class="comment">// Fill in_direct_implications_.</span></div>
|
|
<div class="line"><a name="l01854"></a><span class="lineno"> 1854</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> l : direct_implications_of_negated_literal_) {</div>
|
|
<div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>  <span class="keywordflow">if</span> (in_direct_implications_[l.Index()]) {</div>
|
|
<div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>  <span class="comment">// not(l) => literal => l.</span></div>
|
|
<div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>  <span class="keywordflow">if</span> (!FixLiteral(l)) {</div>
|
|
<div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  *is_unsat = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>  }</div>
|
|
<div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>  }</div>
|
|
<div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>  }</div>
|
|
<div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>  </div>
|
|
<div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a> > saved_index;</div>
|
|
<div class="line"><a name="l01865"></a><span class="lineno"> 1865</span> }</div>
|
|
<div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>  </div>
|
|
<div class="line"><a name="l01867"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#addf8503ac6335c8001276ed7760d7508"> 1867</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#addf8503ac6335c8001276ed7760d7508">BinaryImplicationGraph::NumImplicationOnVariableRemoval</a>(</div>
|
|
<div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> result = 0;</div>
|
|
<div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>  direct_implications_of_negated_literal_ =</div>
|
|
<div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a7eb6126b57ff4ab8246fe54f4e5550f4">DirectImplications</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Negated());</div>
|
|
<div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> s1 = <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a7eb6126b57ff4ab8246fe54f4e5550f4">DirectImplications</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>).size();</div>
|
|
<div class="line"><a name="l01874"></a><span class="lineno"> 1874</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> l : direct_implications_of_negated_literal_) {</div>
|
|
<div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>  result += s1;</div>
|
|
<div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  </div>
|
|
<div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>  <span class="comment">// We should have dealt with that in FindFailedLiteralAroundVar().</span></div>
|
|
<div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!in_direct_implications_[l.Index()]);</div>
|
|
<div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>  </div>
|
|
<div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>  <span class="comment">// l => literal => l: equivalent variable!</span></div>
|
|
<div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>  <span class="keywordflow">if</span> (in_direct_implications_[l.NegatedIndex()]) result--;</div>
|
|
<div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>  }</div>
|
|
<div class="line"><a name="l01883"></a><span class="lineno"> 1883</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l01884"></a><span class="lineno"> 1884</span> }</div>
|
|
<div class="line"><a name="l01885"></a><span class="lineno"> 1885</span>  </div>
|
|
<div class="line"><a name="l01886"></a><span class="lineno"> 1886</span> <span class="comment">// For all possible a => var => b, add a => b.</span></div>
|
|
<div class="line"><a name="l01887"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ab95a602604a2056d11cba9119e490236"> 1887</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ab95a602604a2056d11cba9119e490236">BinaryImplicationGraph::RemoveBooleanVariable</a>(</div>
|
|
<div class="line"><a name="l01888"></a><span class="lineno"> 1888</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="l01889"></a><span class="lineno"> 1889</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>  direct_implications_of_negated_literal_ =</div>
|
|
<div class="line"><a name="l01891"></a><span class="lineno"> 1891</span>  <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a7eb6126b57ff4ab8246fe54f4e5550f4">DirectImplications</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Negated());</div>
|
|
<div class="line"><a name="l01892"></a><span class="lineno"> 1892</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#a344010e26426d6a13411648d988bc9b6">b</a> : <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a7eb6126b57ff4ab8246fe54f4e5550f4">DirectImplications</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) {</div>
|
|
<div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>  estimated_sizes_[<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.NegatedIndex()]--;</div>
|
|
<div class="line"><a name="l01894"></a><span class="lineno"> 1894</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_negated : direct_implications_of_negated_literal_) {</div>
|
|
<div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>  <span class="keywordflow">if</span> (a_negated.Negated() == <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>  <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a94e79ff0c0a978e876dd1d44add9bc11">AddImplication</a>(a_negated.Negated(), <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>);</div>
|
|
<div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>  }</div>
|
|
<div class="line"><a name="l01898"></a><span class="lineno"> 1898</span>  }</div>
|
|
<div class="line"><a name="l01899"></a><span class="lineno"> 1899</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_negated : direct_implications_of_negated_literal_) {</div>
|
|
<div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>  estimated_sizes_[a_negated.NegatedIndex()]--;</div>
|
|
<div class="line"><a name="l01901"></a><span class="lineno"> 1901</span>  }</div>
|
|
<div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>  </div>
|
|
<div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>  <span class="comment">// Notify the deletion to the proof checker and the postsolve.</span></div>
|
|
<div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>  <span class="comment">// Note that we want var first in these clauses for the postsolve.</span></div>
|
|
<div class="line"><a name="l01905"></a><span class="lineno"> 1905</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#a344010e26426d6a13411648d988bc9b6">b</a> : direct_implications_) {</div>
|
|
<div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>  <span class="keywordflow">if</span> (drat_proof_handler_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a18349231154d0f5eaee94fe213f347e6">DeleteClause</a>({<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keyword">false</span>), <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>});</div>
|
|
<div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>  }</div>
|
|
<div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>  postsolve_clauses->push_back({<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keyword">false</span>), <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>});</div>
|
|
<div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>  }</div>
|
|
<div class="line"><a name="l01911"></a><span class="lineno"> 1911</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_negated : direct_implications_of_negated_literal_) {</div>
|
|
<div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>  <span class="keywordflow">if</span> (drat_proof_handler_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a18349231154d0f5eaee94fe213f347e6">DeleteClause</a>({<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keyword">true</span>), a_negated});</div>
|
|
<div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>  }</div>
|
|
<div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>  postsolve_clauses->push_back({<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keyword">true</span>), a_negated});</div>
|
|
<div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>  }</div>
|
|
<div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  </div>
|
|
<div class="line"><a name="l01918"></a><span class="lineno"> 1918</span>  <span class="comment">// We need to remove any occurrence of var in our implication lists, this will</span></div>
|
|
<div class="line"><a name="l01919"></a><span class="lineno"> 1919</span>  <span class="comment">// be delayed to the CleanupAllRemovedVariables() call.</span></div>
|
|
<div class="line"><a name="l01920"></a><span class="lineno"> 1920</span>  <span class="keywordflow">for</span> (LiteralIndex <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : {<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index(), <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.NegatedIndex()}) {</div>
|
|
<div class="line"><a name="l01921"></a><span class="lineno"> 1921</span>  is_removed_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>  <span class="keywordflow">if</span> (!is_redundant_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) {</div>
|
|
<div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>  ++num_redundant_literals_;</div>
|
|
<div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>  is_redundant_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01925"></a><span class="lineno"> 1925</span>  }</div>
|
|
<div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>  implications_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].clear();</div>
|
|
<div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>  }</div>
|
|
<div class="line"><a name="l01928"></a><span class="lineno"> 1928</span> }</div>
|
|
<div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>  </div>
|
|
<div class="line"><a name="l01930"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ab64429b401679aee0bbd618449a9152a"> 1930</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ab64429b401679aee0bbd618449a9152a">BinaryImplicationGraph::CleanupAllRemovedVariables</a>() {</div>
|
|
<div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span>& implication : implications_) {</div>
|
|
<div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a name="l01933"></a><span class="lineno"> 1933</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> l : implication) {</div>
|
|
<div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>  <span class="keywordflow">if</span> (!is_removed_[l.Index()]) implication[new_size++] = l;</div>
|
|
<div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>  }</div>
|
|
<div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>  implication.resize(new_size);</div>
|
|
<div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>  }</div>
|
|
<div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>  </div>
|
|
<div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>  <span class="comment">// Clean-up at most ones.</span></div>
|
|
<div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>  at_most_ones_.<a class="code" href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">clear</a>();</div>
|
|
<div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>  CleanUpAndAddAtMostOnes(<span class="comment">/*base_index=*/</span>0);</div>
|
|
<div class="line"><a name="l01942"></a><span class="lineno"> 1942</span> }</div>
|
|
<div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>  </div>
|
|
<div class="line"><a name="l01944"></a><span class="lineno"> 1944</span> <span class="comment">// ----- SatClause -----</span></div>
|
|
<div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>  </div>
|
|
<div class="line"><a name="l01946"></a><span class="lineno"> 1946</span> <span class="comment">// static</span></div>
|
|
<div class="line"><a name="l01947"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#ad891f84075141b619317c2634891d010"> 1947</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_sat_clause.html#ad891f84075141b619317c2634891d010">SatClause::Create</a>(absl::Span<const Literal> literals) {</div>
|
|
<div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(literals.size(), 2);</div>
|
|
<div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause = <span class="keyword">reinterpret_cast<</span><a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>*<span class="keyword">></span>(</div>
|
|
<div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>  ::operator <span class="keyword">new</span>(<span class="keyword">sizeof</span>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>) + literals.size() * <span class="keyword">sizeof</span>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>)));</div>
|
|
<div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>  clause->size_ = literals.size();</div>
|
|
<div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < literals.size(); ++i) {</div>
|
|
<div class="line"><a name="l01953"></a><span class="lineno"> 1953</span>  clause->literals_[i] = literals[i];</div>
|
|
<div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>  }</div>
|
|
<div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>  <span class="keywordflow">return</span> clause;</div>
|
|
<div class="line"><a name="l01956"></a><span class="lineno"> 1956</span> }</div>
|
|
<div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>  </div>
|
|
<div class="line"><a name="l01958"></a><span class="lineno"> 1958</span> <span class="comment">// Note that for an attached clause, removing fixed literal is okay because if</span></div>
|
|
<div class="line"><a name="l01959"></a><span class="lineno"> 1959</span> <span class="comment">// any of the watched literal is assigned, then the clause is necessarily true.</span></div>
|
|
<div class="line"><a name="l01960"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#a69422a656b68d50692a1b01e2b0d22ae"> 1960</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a69422a656b68d50692a1b01e2b0d22ae">SatClause::RemoveFixedLiteralsAndTestIfTrue</a>(</div>
|
|
<div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>  <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="l01962"></a><span class="lineno"> 1962</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#ad8932e395fe5c508700b7f95d3064aef">IsAttached</a>());</div>
|
|
<div class="line"><a name="l01963"></a><span class="lineno"> 1963</span>  <span class="keywordflow">if</span> (assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(literals_[0].<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">Variable</a>()) ||</div>
|
|
<div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>  assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(literals_[1].<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">Variable</a>())) {</div>
|
|
<div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a6095b00a4734d32844a85927b355ce32">IsSatisfied</a>(assignment));</div>
|
|
<div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>  }</div>
|
|
<div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  <span class="keywordtype">int</span> j = 2;</div>
|
|
<div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>  <span class="keywordflow">while</span> (j < size_ && !assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(literals_[j].<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">Variable</a>())) {</div>
|
|
<div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  ++j;</div>
|
|
<div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>  }</div>
|
|
<div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = j; i < size_; ++i) {</div>
|
|
<div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>  <span class="keywordflow">if</span> (assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(literals_[i].<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">Variable</a>())) {</div>
|
|
<div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>  <span class="keywordflow">if</span> (assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(literals_[i])) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>  std::swap(literals_[j], literals_[i]);</div>
|
|
<div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>  ++j;</div>
|
|
<div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>  }</div>
|
|
<div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>  }</div>
|
|
<div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>  size_ = j;</div>
|
|
<div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01982"></a><span class="lineno"> 1982</span> }</div>
|
|
<div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>  </div>
|
|
<div class="line"><a name="l01984"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#a6095b00a4734d32844a85927b355ce32"> 1984</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a6095b00a4734d32844a85927b355ce32">SatClause::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="l01985"></a><span class="lineno"> 1985</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="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : *<span class="keyword">this</span>) {</div>
|
|
<div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>  <span class="keywordflow">if</span> (assignment.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>  }</div>
|
|
<div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01989"></a><span class="lineno"> 1989</span> }</div>
|
|
<div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>  </div>
|
|
<div class="line"><a name="l01991"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_clause.html#a764be64f3029f8b8e23511061d8de355"> 1991</a></span> std::string <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html#a764be64f3029f8b8e23511061d8de355">SatClause::DebugString</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>  std::string result;</div>
|
|
<div class="line"><a name="l01993"></a><span class="lineno"> 1993</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="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : *<span class="keyword">this</span>) {</div>
|
|
<div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>  <span class="keywordflow">if</span> (!result.empty()) result.append(<span class="stringliteral">" "</span>);</div>
|
|
<div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>  result.append(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.DebugString());</div>
|
|
<div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>  }</div>
|
|
<div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l01998"></a><span class="lineno"> 1998</span> }</div>
|
|
<div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>  </div>
|
|
<div class="line"><a name="l02000"></a><span class="lineno"> 2000</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l02001"></a><span class="lineno"> 2001</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a09f7d88282cf92c9f231270ac113e5c6"><div class="ttname"><a href="base_2logging_8h.html#a09f7d88282cf92c9f231270ac113e5c6">LOG_IF</a></div><div class="ttdeci">#define LOG_IF(severity, condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00479">base/logging.h:479</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a4395e95bab44e222cb2e77251017a0e2"><div class="ttname"><a href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a></div><div class="ttdeci">#define DCHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00887">base/logging.h:887</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00697">base/logging.h:697</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00701">base/logging.h:701</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab25e01a2942b821d66371fc68d53f2eb"><div class="ttname"><a href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a></div><div class="ttdeci">#define CHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00698">base/logging.h:698</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00888">base/logging.h:888</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00420">base/logging.h:420</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00884">base/logging.h:884</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00978">base/logging.h:978</a></div></div>
|
|
<div class="ttc" id="aclass_strongly_connected_components_finder_html"><div class="ttname"><a href="class_strongly_connected_components_finder.html">StronglyConnectedComponentsFinder</a></div><div class="ttdef"><b>Definition:</b> <a href="strongly__connected__components_8h_source.html#l00103">strongly_connected_components.h:103</a></div></div>
|
|
<div class="ttc" id="aclass_strongly_connected_components_finder_html_a4db5c4e5c0437428c74f692ac4601af7"><div class="ttname"><a href="class_strongly_connected_components_finder.html#a4db5c4e5c0437428c74f692ac4601af7">StronglyConnectedComponentsFinder::NodeIsInCurrentDfsPath</a></div><div class="ttdeci">bool NodeIsInCurrentDfsPath(NodeIndex node) const</div><div class="ttdef"><b>Definition:</b> <a href="strongly__connected__components_8h_source.html#l00176">strongly_connected_components.h:176</a></div></div>
|
|
<div class="ttc" id="aclass_strongly_connected_components_finder_html_ae578e6662172f4c25bb8ad068a597ba5"><div class="ttname"><a href="class_strongly_connected_components_finder.html#ae578e6662172f4c25bb8ad068a597ba5">StronglyConnectedComponentsFinder::FindStronglyConnectedComponents</a></div><div class="ttdeci">void FindStronglyConnectedComponents(const NodeIndex num_nodes, const Graph &graph, SccOutput *components)</div><div class="ttdef"><b>Definition:</b> <a href="strongly__connected__components_8h_source.html#l00105">strongly_connected_components.h:105</a></div></div>
|
|
<div class="ttc" id="aclass_wall_timer_html"><div class="ttname"><a href="class_wall_timer.html">WallTimer</a></div><div class="ttdef"><b>Definition:</b> <a href="timer_8h_source.html#l00023">timer.h:23</a></div></div>
|
|
<div class="ttc" id="aclass_wall_timer_html_a07aaf1227e4d645f15e0a964f54ef291"><div class="ttname"><a href="class_wall_timer.html#a07aaf1227e4d645f15e0a964f54ef291">WallTimer::Start</a></div><div class="ttdeci">void Start()</div><div class="ttdef"><b>Definition:</b> <a href="timer_8h_source.html#l00031">timer.h:31</a></div></div>
|
|
<div class="ttc" id="aclass_wall_timer_html_aec56fe080959ecebec3feaed9dafde84"><div class="ttname"><a href="class_wall_timer.html#aec56fe080959ecebec3feaed9dafde84">WallTimer::Get</a></div><div class="ttdeci">double Get() const</div><div class="ttdef"><b>Definition:</b> <a href="timer_8h_source.html#l00045">timer.h:45</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_a4e3670a285a3642eaa07f66766cffa72"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">absl::StrongVector::resize</a></div><div class="ttdeci">void resize(size_type new_size)</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00150">strong_vector.h:150</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="aclassabsl_1_1_strong_vector_html_a9263000d449fdccb6cb70b303063e60b"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">absl::StrongVector::push_back</a></div><div class="ttdeci">void push_back(const value_type &x)</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00158">strong_vector.h:158</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_ac8bb3912a3ce86b15842e79d0b421204"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">absl::StrongVector::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00170">strong_vector.h:170</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< BooleanVariable ></a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_a1e5ae9fb14fd6b25919148ae8bbaf050"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">operations_research::SparseBitset::PositionsSetAtLeastOnce</a></div><div class="ttdeci">const std::vector< IntegerType > & PositionsSetAtLeastOnce() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00815">bitset.h:815</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#l00771">bitset.h:771</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_a399d93a7ffba068b02341291d703fef7"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a399d93a7ffba068b02341291d703fef7">operations_research::SparseBitset::NotifyAllClear</a></div><div class="ttdeci">void NotifyAllClear()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00825">bitset.h:825</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_a41f798a04019147982b29c576ff9d8b7"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">operations_research::SparseBitset::Set</a></div><div class="ttdeci">void Set(IntegerType index)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00805">bitset.h:805</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_aa7d76b766faf39c1652b6617eac5fe20"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#aa7d76b766faf39c1652b6617eac5fe20">operations_research::SparseBitset::ClearAll</a></div><div class="ttdeci">void ClearAll()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00776">bitset.h:776</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_ab465e925b8a535e5de8a072174ecafda"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">operations_research::SparseBitset::Clear</a></div><div class="ttdeci">void Clear(IntegerType index)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00811">bitset.h:811</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_abf34ab06e7250e92954c2b5a263e5612"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#abf34ab06e7250e92954c2b5a263e5612">operations_research::SparseBitset::Resize</a></div><div class="ttdeci">void Resize(IntegerType size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00791">bitset.h:791</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_ae09e38958e558d2c776bc555a0dc2fc7"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">operations_research::SparseBitset::ClearAndResize</a></div><div class="ttdeci">void ClearAndResize(IntegerType size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00780">bitset.h:780</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_af90cfd1fc238433fc303ee28c5914eb9"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html#af90cfd1fc238433fc303ee28c5914eb9">operations_research::TimeLimit::AdvanceDeterministicTime</a></div><div class="ttdeci">void AdvanceDeterministicTime(double deterministic_duration)</div><div class="ttdoc">Advances the deterministic time.</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00226">time_limit.h:226</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#l00456">clause.h:456</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#l00730">clause.cc:730</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#l00491">clause.cc:491</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#l01311">clause.cc:1311</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#l00754">clause.cc:754</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#l00483">clause.h:483</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#l00508">clause.cc:508</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#l01645">clause.cc:1645</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#l00742">clause.cc:742</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#l00849">clause.cc:849</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#l00561">clause.h:561</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#l01799">clause.cc:1799</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#l00488">clause.h:488</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#l00831">clause.cc:831</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#l01124">clause.cc:1124</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_ab4ed77545127809d811ea158c29e9ef7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ab4ed77545127809d811ea158c29e9ef7">operations_research::sat::BinaryImplicationGraph::TransformIntoMaxCliques</a></div><div class="ttdeci">bool TransformIntoMaxCliques(std::vector< std::vector< Literal >> *at_most_ones, int64 max_num_explored_nodes=1e8)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01500">clause.cc:1500</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#l01930">clause.cc:1930</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#l01887">clause.cc:1887</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#l01842">clause.cc:1842</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#l00962">clause.cc:962</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_addf8503ac6335c8001276ed7760d7508"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#addf8503ac6335c8001276ed7760d7508">operations_research::sat::BinaryImplicationGraph::NumImplicationOnVariableRemoval</a></div><div class="ttdeci">int64 NumImplicationOnVariableRemoval(BooleanVariable var)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01867">clause.cc:1867</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#l00531">clause.cc:531</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#l00911">clause.cc:911</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#l00477">clause.cc:477</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_proof_handler_html_a18349231154d0f5eaee94fe213f347e6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a18349231154d0f5eaee94fe213f347e6">operations_research::sat::DratProofHandler::DeleteClause</a></div><div class="ttdeci">void DeleteClause(absl::Span< const Literal > clause)</div><div class="ttdef"><b>Definition:</b> <a href="drat__proof__handler_8cc_source.html#l00082">drat_proof_handler.cc:82</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_proof_handler_html_a98bacf41c50979896b4a5f5e41fb0ccf"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a98bacf41c50979896b4a5f5e41fb0ccf">operations_research::sat::DratProofHandler::AddClause</a></div><div class="ttdeci">void AddClause(absl::Span< const Literal > clause)</div><div class="ttdef"><b>Definition:</b> <a href="drat__proof__handler_8cc_source.html#l00072">drat_proof_handler.cc:72</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00064">sat_base.h:64</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html_a239e1315c4e975a35537790ba0d913a7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7">operations_research::sat::Literal::NegatedIndex</a></div><div class="ttdeci">LiteralIndex NegatedIndex() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00085">sat_base.h:85</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#l00084">sat_base.h:84</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html_a6a5dcff82096cd7a7147bf996dbaa5a8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">operations_research::sat::Literal::Variable</a></div><div class="ttdeci">BooleanVariable Variable() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00080">sat_base.h:80</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html_a886e9c024f7209181c0a850b6e90c644"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">operations_research::sat::Literal::Negated</a></div><div class="ttdeci">Literal Negated() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00091">sat_base.h:91</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_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#l00339">clause.cc:339</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#l00053">clause.cc:53</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#l00183">clause.cc:183</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#l00358">clause.cc:358</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#l00311">clause.cc:311</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#l00322">clause.cc:322</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#l00192">clause.cc:192</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#l00212">clause.cc:212</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#l00415">clause.cc:415</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#l00274">clause.cc:274</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#l00205">clause.cc:205</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#l00197">clause.cc:197</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#l00367">clause.cc:367</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#l00294">clause.cc:294</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#l00064">clause.cc:64</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#l00454">clause.cc:454</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#l00441">clause.cc:441</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#l00301">clause.cc:301</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#l00069">clause.cc:69</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_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#l00051">clause.h:51</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#l00090">clause.h:90</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#l00075">clause.h:75</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#l01984">clause.cc:1984</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#l01960">clause.cc:1960</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#l01991">clause.cc:1991</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#l00074">clause.h:74</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#l01947">clause.cc:1947</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#l00108">clause.h:108</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#l00069">clause.h:69</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#l00065">clause.h:65</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#l00445">sat_base.h:445</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_propagator_html_a06e2c6f3432a89d0160b831d48afd8b7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">operations_research::sat::SatPropagator::propagation_trail_index_</a></div><div class="ttdeci">int propagation_trail_index_</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_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#l00506">sat_base.h:506</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scc_graph_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scc_graph.html">operations_research::sat::SccGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01016">clause.cc:1016</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scc_graph_html_a026a87568634d8f2dcdd1d61bb990b1f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scc_graph.html#a026a87568634d8f2dcdd1d61bb990b1f">operations_research::sat::SccGraph::SccGraph</a></div><div class="ttdeci">SccGraph(SccFinder *finder, Implication *graph, AtMostOne *at_most_ones, std::vector< Literal > *at_most_one_buffer)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01026">clause.cc:1026</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scc_graph_html_a229be75ad057c526a4209b079bc6c621"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scc_graph.html#a229be75ad057c526a4209b079bc6c621">operations_research::sat::SccGraph::operator[]</a></div><div class="ttdeci">const std::vector< int32 > & operator[](int32 node) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01034">clause.cc:1034</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scc_graph_html_a47d33ec3614dcb20228fc964e0886a9b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scc_graph.html#a47d33ec3614dcb20228fc964e0886a9b">operations_research::sat::SccGraph::to_fix_</a></div><div class="ttdeci">std::vector< Literal > to_fix_</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01106">clause.cc:1106</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scc_graph_html_a720d8d1dd697348d6cdc4b9752321ebc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scc_graph.html#a720d8d1dd697348d6cdc4b9752321ebc">operations_research::sat::SccGraph::work_done_</a></div><div class="ttdeci">int64 work_done_</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l01109">clause.cc:1109</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#l00233">sat_base.h:233</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#l00551">sat_base.h:551</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a12c36a7cb228d80bcad42fa38a103f92"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a12c36a7cb228d80bcad42fa38a103f92">operations_research::sat::Trail::Enqueue</a></div><div class="ttdeci">void Enqueue(Literal true_literal, int propagator_id)</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00250">sat_base.h:250</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a29be1a6b9ba823a6fffb927609d18599"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">operations_research::sat::Trail::Info</a></div><div class="ttdeci">const AssignmentInfo & Info(BooleanVariable var) 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_trail_html_a8ef12397d1682615bc3108c397734179"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">operations_research::sat::Trail::Index</a></div><div class="ttdeci">int Index() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00378">sat_base.h:378</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#l00380">sat_base.h:380</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_ad63c4461a1384629cb99413c6df8b9ca"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">operations_research::sat::Trail::CurrentDecisionLevel</a></div><div class="ttdeci">int CurrentDecisionLevel() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00355">sat_base.h:355</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_afb89e56bea39296ff292b51a84491875"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#afb89e56bea39296ff292b51a84491875">operations_research::sat::Trail::EnqueueWithUnitReason</a></div><div class="ttdeci">void EnqueueWithUnitReason(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00265">sat_base.h:265</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#l00122">sat_base.h:122</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_a142694366986039454f53b38e8378815"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a142694366986039454f53b38e8378815">operations_research::sat::VariablesAssignment::LiteralIsAssigned</a></div><div class="ttdeci">bool LiteralIsAssigned(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00153">sat_base.h:153</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_a49e751eb6f0e9babd957889bb8e7472d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">operations_research::sat::VariablesAssignment::VariableIsAssigned</a></div><div class="ttdeci">bool VariableIsAssigned(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00158">sat_base.h:158</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_a5300129913f51dcb0b1c531e3248490e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">operations_research::sat::VariablesAssignment::LiteralIsTrue</a></div><div class="ttdeci">bool LiteralIsTrue(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00150">sat_base.h:150</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_acfd1646011e643f58fd7dc66d9cc90a5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">operations_research::sat::VariablesAssignment::LiteralIsFalse</a></div><div class="ttdeci">bool LiteralIsFalse(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00147">sat_base.h:147</a></div></div>
|
|
<div class="ttc" id="aclause_8h_html"><div class="ttname"><a href="clause_8h.html">clause.h</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a344010e26426d6a13411648d988bc9b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a></div><div class="ttdeci">int64 b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00043">constraint_solver/table.cc:43</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_af730895c6c6ef6e03caaf6251192dfd2"><div class="ttname"><a href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a></div><div class="ttdeci">int64 a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00042">constraint_solver/table.cc:42</a></div></div>
|
|
<div class="ttc" id="acp__model__solver_8cc_html_ace0951799e72ee99fc07d5e509bc7cbf"><div class="ttname"><a href="cp__model__solver_8cc.html#ace0951799e72ee99fc07d5e509bc7cbf">wall_timer</a></div><div class="ttdeci">WallTimer * wall_timer</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02105">cp_model_solver.cc:2105</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a21edc7ca4cc5802c8779d68556bc09cf"><div class="ttname"><a href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a></div><div class="ttdeci">int64 value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="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#l01858">expr_array.cc:1858</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#l00272">gurobi_interface.cc:272</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a56f1a81c92849566ae864511088eb7e8"><div class="ttname"><a href="integral__types_8h.html#a56f1a81c92849566ae864511088eb7e8">int32</a></div><div class="ttdeci">int int32</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00033">integral_types.h:33</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_ab4a2cbab234914b320b7fae11b6e8cb9"><div class="ttname"><a href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a></div><div class="ttdeci">const int INFO</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00031">log_severity.h:31</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html_a7f536a3b33f9bed8f75734e035d30725"><div class="ttname"><a href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div><div class="ttdeci">const bool DEBUG_MODE</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00024">macros.h:24</a></div></div>
|
|
<div class="ttc" id="amatrix__utils_8cc_html_ad96c5e641806a06a23e5d5b9fca20e89"><div class="ttname"><a href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a></div><div class="ttdeci">int64 hash</div><div class="ttdef"><b>Definition:</b> <a href="matrix__utils_8cc_source.html#l00060">matrix_utils.cc:60</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a288a1dc92da5d3ad62d4bc4cec9e8b1d"><div class="ttname"><a href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a></div><div class="ttdeci">void STLSortAndRemoveDuplicates(T *v, const LessFunc &less_func)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00058">stl_util.h:58</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a3ea1e2b26e83387a5eea8d83d9406d34"><div class="ttname"><a href="namespacegtl.html#a3ea1e2b26e83387a5eea8d83d9406d34">gtl::InsertIfNotPresent</a></div><div class="ttdeci">bool InsertIfNotPresent(Collection *const collection, const typename Collection::value_type &value)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00103">map_util.h:103</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a4ee3db0c4acaa0f277a0d7006f5ad1e6"><div class="ttname"><a href="namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6">gtl::STLDeleteElements</a></div><div class="ttdeci">void STLDeleteElements(T *container)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00372">stl_util.h:372</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a88a7129153c63a150516ea2f617b767b"><div class="ttname"><a href="namespacegtl.html#a88a7129153c63a150516ea2f617b767b">gtl::STLDeleteContainerPointers</a></div><div class="ttdeci">void STLDeleteContainerPointers(ForwardIterator begin, ForwardIterator end)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00314">stl_util.h:314</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a92a0e7b0e74024284adc849a4499940f"><div class="ttname"><a href="namespacegtl.html#a92a0e7b0e74024284adc849a4499940f">gtl::STLClearObject</a></div><div class="ttdeci">void STLClearObject(T *obj)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00123">stl_util.h:123</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_abec9e934a51aa2ab519684cc0f446a41"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#abec9e934a51aa2ab519684cc0f446a41">operations_research::glop::Index</a></div><div class="ttdeci">int32 Index</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00037">lp_types.h:37</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">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceutil__hash_html_aa2ba7114404f5416e797636b0e1eddcd"><div class="ttname"><a href="namespaceutil__hash.html#aa2ba7114404f5416e797636b0e1eddcd">util_hash::Hash</a></div><div class="ttdeci">uint64 Hash(uint64 num, uint64 c)</div><div class="ttdef"><b>Definition:</b> <a href="hash_8h_source.html#l00150">hash.h:150</a></div></div>
|
|
<div class="ttc" id="aoptimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00084">optimization.cc:84</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00508">pack.cc:508</a></div></div>
|
|
<div class="ttc" id="apreprocessor_8cc_html_abcdbe46fb8451a69d42c17abdb920021"><div class="ttname"><a href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a></div><div class="ttdeci">ColIndex representative</div><div class="ttdef"><b>Definition:</b> <a href="preprocessor_8cc_source.html#l00430">preprocessor.cc:430</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#l00435">stats.h:435</a></div></div>
|
|
<div class="ttc" id="astats_8h_html_a9995704aaaf45fc21e08c847551a8d04"><div class="ttname"><a href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a></div><div class="ttdeci">#define SCOPED_TIME_STAT(stats)</div><div class="ttdef"><b>Definition:</b> <a href="stats_8h_source.html#l00436">stats.h:436</a></div></div>
|
|
<div class="ttc" id="astl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</a></div></div>
|
|
<div class="ttc" id="astrong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
|
|
<div class="ttc" id="astrongly__connected__components_8h_html"><div class="ttname"><a href="strongly__connected__components_8h.html">strongly_connected_components.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_trail_html"><div class="ttname"><a href="structoperations__research_1_1_trail.html">operations_research::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l00723">constraint_solver.cc:723</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_assignment_info_html_afefd28242df91e46e762af1f7eaf623f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_assignment_info.html#afefd28242df91e46e762af1f7eaf623f">operations_research::sat::AssignmentInfo::level</a></div><div class="ttdeci">uint32 level</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00199">sat_base.h:199</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#l00287">clause.h:287</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#l00307">clause.h:307</a></div></div>
|
|
<div class="ttc" id="atimer_8h_html"><div class="ttname"><a href="timer_8h.html">timer.h</a></div></div>
|
|
<div class="ttc" id="avlog__is__on_8h_html_a956152cad330225654d128f35c00efce"><div class="ttname"><a href="vlog__is__on_8h.html#a956152cad330225654d128f35c00efce">VLOG_IS_ON</a></div><div class="ttdeci">#define VLOG_IS_ON(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="vlog__is__on_8h_source.html#l00041">vlog_is_on.h:41</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_8cc.html">clause.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|