382 lines
59 KiB
HTML
382 lines
59 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.2"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: sat_decision.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.2 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('sat__decision_8h_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">sat_decision.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="sat__decision_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#ifndef OR_TOOLS_SAT_SAT_DECISION_H_</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#define OR_TOOLS_SAT_SAT_DECISION_H_</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span> </div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span> </div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</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 id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include "<a class="code" href="sat_2model_8h.html">ortools/sat/model.h</a>"</span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include "<a class="code" href="pb__constraint_8h.html">ortools/sat/pb_constraint.h</a>"</span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include "<a class="code" href="sat__parameters_8pb_8h.html">ortools/sat/sat_parameters.pb.h</a>"</span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include "<a class="code" href="sat_2util_8h.html">ortools/sat/util.h</a>"</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "<a class="code" href="bitset_8h.html">ortools/util/bitset.h</a>"</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "<a class="code" href="integer__pq_8h.html">ortools/util/integer_pq.h</a>"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> </div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> </div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="comment">// Implement the SAT branching policy responsible for deciding the next Boolean</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="comment">// variable to branch on, and its polarity (true or false).</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html"> 35</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html">SatDecisionPolicy</a> {</div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#af3bcc41cd4c20ff0a694cbfd18cb0e1e">SatDecisionPolicy</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> </div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// Notifies that more variables are now present. Note that currently this may</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// change the current variable order because the priority queue need to be</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// reconstructed.</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a19614231a107b165113595bf8edf60bf">IncreaseNumVariables</a>(<span class="keywordtype">int</span> num_variables);</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> </div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// Reinitializes the decision heuristics (which variables to choose with which</span></div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// polarity) according to the current parameters. Note that this also resets</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// the activity of the variables to 0. Note that this function is lazy, and</span></div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// the work will only happen on the first NextBranch() to cover the cases when</span></div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// this policy is not used at all.</span></div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a1dc177ee88f0a7ce2e46a032e5c3cf02">ResetDecisionHeuristic</a>();</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> </div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// Returns next decision to branch upon. This shouldn't be called if all the</span></div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// variables are assigned.</span></div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#acf014a334d9412c245c083ce69aa8716">NextBranch</a>();</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> </div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// Updates statistics about literal occurences in constraints.</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// Input is a canonical linear constraint of the form (terms <= rhs).</span></div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#acf5ac4ce7b95b26c0eadcd6b8cbffe74">UpdateWeightedSign</a>(<span class="keyword">const</span> std::vector<LiteralWithCoeff>& terms,</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> rhs);</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> </div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// Bumps the activity of all variables appearing in the conflict. All literals</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// must be currently assigned. See VSIDS decision heuristic: Chaff:</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// Engineering an Efficient SAT Solver. M.W. Moskewicz et al. ANNUAL ACM IEEE</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// DESIGN AUTOMATION CONFERENCE 2001.</span></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#aab615de1a3b2016b0a8b8cdf05e9cf0b">BumpVariableActivities</a>(<span class="keyword">const</span> std::vector<Literal>& literals);</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> </div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// Updates the increment used for activity bumps. This is basically the same</span></div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// as decaying all the variable activities, but it is a lot more efficient.</span></div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a8bc0829ef9f6099106cab480e71ab847">UpdateVariableActivityIncrement</a>();</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> </div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// Called on Untrail() so that we can update the set of possible decisions.</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#aa62b9215667a0b7dc6af8251dbaba486">Untrail</a>(<span class="keywordtype">int</span> target_trail_index);</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> </div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// Called on a new conflict before Untrail(). The trail before the given index</span></div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// is used in the phase saving heuristic as a partial assignment.</span></div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#abe906f3b347e87b5e91e7ab5609b0f36">BeforeConflict</a>(<span class="keywordtype">int</span> trail_index);</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> </div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// By default, we alternate between a stable phase (better suited for finding</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// SAT solution) and a more restart heavy phase more suited for proving UNSAT.</span></div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// This changes a bit the polarity heuristics and is controlled from within</span></div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="comment">// SatRestartPolicy.</span></div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a9004867224c2af27a8b06fc439c8a7a4"> 81</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a9004867224c2af27a8b06fc439c8a7a4">SetStablePhase</a>(<span class="keywordtype">bool</span> is_stable) { in_stable_phase_ = is_stable; }</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#af5ad6d7123be1d7615358fb819299484"> 82</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#af5ad6d7123be1d7615358fb819299484">InStablePhase</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> in_stable_phase_; }</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> </div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="comment">// This is used to temporarily disable phase_saving when we do some probing</span></div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// during search for instance.</span></div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a9db2d9ca018c68d3f84ee946e3603886"> 86</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a9db2d9ca018c68d3f84ee946e3603886">MaybeEnablePhaseSaving</a>(<span class="keywordtype">bool</span> save_phase) {</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> maybe_enable_phase_saving_ = save_phase;</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> </div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// Gives a hint so the solver tries to find a solution with the given literal</span></div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="comment">// set to true. Currently this take precedence over the phase saving heuristic</span></div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="comment">// and a variable with a preference will always be branched on according to</span></div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// this preference.</span></div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// The weight is used as a tie-breaker between variable with the same</span></div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// activities. Larger weight will be selected first. A weight of zero is the</span></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// default value for the other variables.</span></div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// Note(user): Having a lot of different weights may slow down the priority</span></div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="comment">// queue operations if there is millions of variables.</span></div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a955786dcbe82b7c4dc9924a5473ac1e8">SetAssignmentPreference</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>, <span class="keywordtype">double</span> <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a>);</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> </div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// Returns the vector of the current assignment preferences.</span></div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> std::vector<std::pair<Literal, double>> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a0b5d7f31620ad7b364e7415c47ee5e0d">AllPreferences</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> </div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="comment">// Computes an initial variable ordering.</span></div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordtype">void</span> InitializeVariableOrdering();</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> </div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// Rescales activity value of all variables when one of them reached the max.</span></div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="keywordtype">void</span> RescaleVariableActivities(<span class="keywordtype">double</span> scaling_factor);</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> </div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// Reinitializes the inital polarity of all the variables with an index</span></div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// greater than or equal to the given one.</span></div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="keywordtype">void</span> ResetInitialPolarity(<span class="keywordtype">int</span> from, <span class="keywordtype">bool</span> inverted = <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> </div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// Code used for resetting the initial polarity at the beginning of each</span></div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// phase.</span></div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="keywordtype">void</span> RephaseIfNeeded();</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="keywordtype">void</span> UseLongestAssignmentAsInitialPolarity();</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keywordtype">void</span> FlipCurrentPolarity();</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordtype">void</span> RandomizeCurrentPolarity();</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> </div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// Adds the given variable to var_ordering_ or updates its priority if it is</span></div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="comment">// already present.</span></div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordtype">void</span> PqInsertOrUpdate(BooleanVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> </div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="comment">// Singleton model objects.</span></div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>& parameters_;</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail_;</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model_random_generator.html">ModelRandomGenerator</a>* random_;</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> </div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="comment">// Variable ordering (priority will be adjusted dynamically). queue_elements_</span></div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// holds the elements used by var_ordering_ (it uses pointers).</span></div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="comment">// Note that we recover the variable that a WeightedVarQueueElement refers to</span></div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="comment">// by its position in the queue_elements_ vector, and we can recover the later</span></div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="comment">// using (pointer - &queue_elements_[0]).</span></div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="keyword">struct </span>WeightedVarQueueElement {</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// Interface for the IntegerPriorityQueue.</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keywordtype">int</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1glop.html#ac89c7b45754e9a6bdabc08bea586fc4e">Index</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>.value(); }</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> </div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="comment">// Priority order. The IntegerPriorityQueue returns the largest element</span></div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// first.</span></div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// Note(user): We used to also break ties using the variable index, however</span></div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// this has two drawbacks:</span></div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// - On problem with many variables, this slow down quite a lot the priority</span></div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// queue operations (which do as little work as possible and hence benefit</span></div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// from having the majority of elements with a priority of 0).</span></div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// - It seems to be a bad heuristics. One reason could be that the priority</span></div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <span class="comment">// queue will automatically diversify the choice of the top variables</span></div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// amongst the ones with the same priority.</span></div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="comment">// Note(user): For the same reason as explained above, it is probably a good</span></div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="comment">// idea not to have too many different values for the tie_breaker field. I</span></div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// am not even sure we should have such a field...</span></div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="keywordtype">bool</span> operator<(<span class="keyword">const</span> WeightedVarQueueElement& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a> < other.weight ||</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> (<a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a> == other.weight && (tie_breaker < other.tie_breaker));</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> }</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> </div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> BooleanVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>;</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="keywordtype">float</span> tie_breaker;</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> </div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="comment">// TODO(user): Experiment with float. In the rest of the code, we use</span></div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// double, but maybe we don't need that much precision. Using float here may</span></div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="comment">// save memory and make the PQ operations faster.</span></div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a>;</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> };</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="keyword">static_assert</span>(<span class="keyword">sizeof</span>(WeightedVarQueueElement) == 16,</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="stringliteral">"ERROR_WeightedVarQueueElement_is_not_well_compacted"</span>);</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> </div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keywordtype">bool</span> var_ordering_is_initialized_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> IntegerPriorityQueue<WeightedVarQueueElement> var_ordering_;</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> </div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="comment">// This is used for the branching heuristic described in "Learning Rate Based</span></div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="comment">// Branching Heuristic for SAT solvers", J.H.Liang, V. Ganesh, P. Poupart,</span></div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">// K.Czarnecki, SAT 2016.</span></div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="comment">// The entries are sorted by trail index, and one can get the number of</span></div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="comment">// conflicts during which a variable at a given trail index i was assigned by</span></div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="comment">// summing the entry.count for all entries with a trail index greater than i.</span></div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="keyword">struct </span>NumConflictsStackEntry {</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="keywordtype">int</span> trail_index;</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> int64_t count;</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> };</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> int64_t num_conflicts_ = 0;</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> std::vector<NumConflictsStackEntry> num_conflicts_stack_;</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> </div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="comment">// Whether the priority of the given variable needs to be updated in</span></div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <span class="comment">// var_ordering_. Note that this is only accessed for assigned variables and</span></div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="comment">// that for efficiency it is indexed by trail indices. If</span></div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="comment">// pq_need_update_for_var_at_trail_index_[trail_->Info(var).trail_index] is</span></div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="comment">// true when we untrail var, then either var need to be inserted in the queue,</span></div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="comment">// or we need to notify that its priority has changed.</span></div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> BitQueue64 pq_need_update_for_var_at_trail_index_;</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> </div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="comment">// Increment used to bump the variable activities.</span></div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="keywordtype">double</span> variable_activity_increment_ = 1.0;</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> </div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="comment">// Stores variable activity and the number of time each variable was "bumped".</span></div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="comment">// The later is only used with the ERWA heuristic.</span></div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<BooleanVariable, double></a> activities_;</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<BooleanVariable, double></a> tie_breakers_;</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<BooleanVariable, int64_t></a> num_bumps_;</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> </div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="comment">// If the polarity if forced (externally) we alway use this first.</span></div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<BooleanVariable, bool></a> has_forced_polarity_;</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<BooleanVariable, bool></a> forced_polarity_;</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> </div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="comment">// If we are in a stable phase, we follow the current target.</span></div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="keywordtype">bool</span> in_stable_phase_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="keywordtype">int</span> target_length_ = 0;</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<BooleanVariable, bool></a> has_target_polarity_;</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<BooleanVariable, bool></a> target_polarity_;</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> </div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="comment">// Otherwise we follow var_polarity_ which is reset at the beginning of</span></div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="comment">// each new polarity phase. This is also overwritten by phase saving.</span></div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="comment">// Each phase last for an arithmetically increasing number of conflicts.</span></div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<BooleanVariable, bool></a> var_polarity_;</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="keywordtype">bool</span> maybe_enable_phase_saving_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> int64_t polarity_phase_ = 0;</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> int64_t num_conflicts_until_rephase_ = 1000;</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> </div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="comment">// The longest partial assignment since the last reset.</span></div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> std::vector<Literal> best_partial_assignment_;</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> </div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="comment">// Used in initial polarity computation.</span></div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<BooleanVariable, double></a> weighted_sign_;</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> </div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="comment">// Used in InitializeVariableOrdering().</span></div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> std::vector<BooleanVariable> tmp_variables_;</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span>};</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> </div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span>} <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> </div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_SAT_SAT_DECISION_H_</span></div>
|
|
<div class="ttc" id="abitset_8h_html"><div class="ttname"><a href="bitset_8h.html">bitset.h</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector</a></div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00076">strong_vector.h:76</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00065">sat_base.h:65</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_random_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model_random_generator.html">operations_research::sat::ModelRandomGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8h_source.html#l00041">sat/util.h:41</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html">operations_research::sat::SatDecisionPolicy</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8h_source.html#l00035">sat_decision.h:35</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_a0b5d7f31620ad7b364e7415c47ee5e0d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a0b5d7f31620ad7b364e7415c47ee5e0d">operations_research::sat::SatDecisionPolicy::AllPreferences</a></div><div class="ttdeci">std::vector< std::pair< Literal, double > > AllPreferences() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00265">sat_decision.cc:265</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_a19614231a107b165113595bf8edf60bf"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a19614231a107b165113595bf8edf60bf">operations_research::sat::SatDecisionPolicy::IncreaseNumVariables</a></div><div class="ttdeci">void IncreaseNumVariables(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00028">sat_decision.cc:28</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_a1dc177ee88f0a7ce2e46a032e5c3cf02"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a1dc177ee88f0a7ce2e46a032e5c3cf02">operations_research::sat::SatDecisionPolicy::ResetDecisionHeuristic</a></div><div class="ttdeci">void ResetDecisionHeuristic()</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00128">sat_decision.cc:128</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_a8bc0829ef9f6099106cab480e71ab847"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a8bc0829ef9f6099106cab480e71ab847">operations_research::sat::SatDecisionPolicy::UpdateVariableActivityIncrement</a></div><div class="ttdeci">void UpdateVariableActivityIncrement()</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00334">sat_decision.cc:334</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_a9004867224c2af27a8b06fc439c8a7a4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a9004867224c2af27a8b06fc439c8a7a4">operations_research::sat::SatDecisionPolicy::SetStablePhase</a></div><div class="ttdeci">void SetStablePhase(bool is_stable)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8h_source.html#l00081">sat_decision.h:81</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_a955786dcbe82b7c4dc9924a5473ac1e8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a955786dcbe82b7c4dc9924a5473ac1e8">operations_research::sat::SatDecisionPolicy::SetAssignmentPreference</a></div><div class="ttdeci">void SetAssignmentPreference(Literal literal, double weight)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00250">sat_decision.cc:250</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_a9db2d9ca018c68d3f84ee946e3603886"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a9db2d9ca018c68d3f84ee946e3603886">operations_research::sat::SatDecisionPolicy::MaybeEnablePhaseSaving</a></div><div class="ttdeci">void MaybeEnablePhaseSaving(bool save_phase)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8h_source.html#l00086">sat_decision.h:86</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_aa62b9215667a0b7dc6af8251dbaba486"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#aa62b9215667a0b7dc6af8251dbaba486">operations_research::sat::SatDecisionPolicy::Untrail</a></div><div class="ttdeci">void Untrail(int target_trail_index)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00397">sat_decision.cc:397</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_aab615de1a3b2016b0a8b8cdf05e9cf0b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#aab615de1a3b2016b0a8b8cdf05e9cf0b">operations_research::sat::SatDecisionPolicy::BumpVariableActivities</a></div><div class="ttdeci">void BumpVariableActivities(const std::vector< Literal > &literals)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00289">sat_decision.cc:289</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_abe906f3b347e87b5e91e7ab5609b0f36"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#abe906f3b347e87b5e91e7ab5609b0f36">operations_research::sat::SatDecisionPolicy::BeforeConflict</a></div><div class="ttdeci">void BeforeConflict(int trail_index)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00057">sat_decision.cc:57</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_acf014a334d9412c245c083ce69aa8716"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#acf014a334d9412c245c083ce69aa8716">operations_research::sat::SatDecisionPolicy::NextBranch</a></div><div class="ttdeci">Literal NextBranch()</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00338">sat_decision.cc:338</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_acf5ac4ce7b95b26c0eadcd6b8cbffe74"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#acf5ac4ce7b95b26c0eadcd6b8cbffe74">operations_research::sat::SatDecisionPolicy::UpdateWeightedSign</a></div><div class="ttdeci">void UpdateWeightedSign(const std::vector< LiteralWithCoeff > &terms, Coefficient rhs)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00279">sat_decision.cc:279</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_af3bcc41cd4c20ff0a694cbfd18cb0e1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#af3bcc41cd4c20ff0a694cbfd18cb0e1e">operations_research::sat::SatDecisionPolicy::SatDecisionPolicy</a></div><div class="ttdeci">SatDecisionPolicy(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00023">sat_decision.cc:23</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_af5ad6d7123be1d7615358fb819299484"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#af5ad6d7123be1d7615358fb819299484">operations_research::sat::SatDecisionPolicy::InStablePhase</a></div><div class="ttdeci">bool InStablePhase() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8h_source.html#l00082">sat_decision.h:82</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html">operations_research::sat::SatParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00347">sat_parameters.pb.h:348</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html">operations_research::sat::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00234">sat_base.h:234</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00273">gurobi_interface.cc:273</a></div></div>
|
|
<div class="ttc" id="ainteger__pq_8h_html"><div class="ttname"><a href="integer__pq_8h.html">integer_pq.h</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_ac89c7b45754e9a6bdabc08bea586fc4e"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ac89c7b45754e9a6bdabc08bea586fc4e">operations_research::glop::Index</a></div><div class="ttdeci">int32_t Index</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00038">lp_types.h:38</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ab61209db5b13f0d424da009e414298fc"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">operations_research::math_opt::Coefficient</a></div><div class="ttdeci">std::tuple< int64_t, int64_t, const double > Coefficient</div><div class="ttdef"><b>Definition:</b> <a href="sparse__collection__matchers_8h_source.html#l00061">sparse_collection_matchers.h:61</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="aoptimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00085">optimization.cc:85</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a4255f714cea26cdd64f6a0ee72d34a8c"><div class="ttname"><a href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a></div><div class="ttdeci">int64_t weight</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00510">pack.cc:510</a></div></div>
|
|
<div class="ttc" id="apb__constraint_8h_html"><div class="ttname"><a href="pb__constraint_8h.html">pb_constraint.h</a></div></div>
|
|
<div class="ttc" id="asat_2model_8h_html"><div class="ttname"><a href="sat_2model_8h.html">model.h</a></div></div>
|
|
<div class="ttc" id="asat_2util_8h_html"><div class="ttname"><a href="sat_2util_8h.html">util.h</a></div></div>
|
|
<div class="ttc" id="asat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
|
<div class="ttc" id="asat__parameters_8pb_8h_html"><div class="ttname"><a href="sat__parameters_8pb_8h.html">sat_parameters.pb.h</a></div></div>
|
|
<div class="ttc" id="astrong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="sat__decision_8h.html">sat_decision.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.2 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|