always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
b5acca4bcbcd092ba767abc4620a2a026ab68e46
ortools-clone/docs/cpp/inclusion_8h_source.html
Mizux Seiha 3b81c981c2 Update doc
2022-03-04 00:19:15 +01:00

511 lines
86 KiB
HTML
Raw Blame History

<!-- 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.3"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OR-Tools: inclusion.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
&#160;<span id="projectnumber">9.3</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.3 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;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&amp;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&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('inclusion_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">inclusion.h</div></div>
</div><!--header-->
<div class="contents">
<a href="inclusion_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 &quot;License&quot;);</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 &quot;AS IS&quot; 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_INCLUSION_H_</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#define OR_TOOLS_SAT_INCLUSION_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 &lt;stddef.h&gt;</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include &lt;stdint.h&gt;</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 &lt;algorithm&gt;</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include &lt;functional&gt;</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include &lt;limits&gt;</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include &lt;tuple&gt;</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include &lt;utility&gt;</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> </div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include &quot;absl/types/span.h&quot;</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include &quot;<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>&quot;</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> </div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="keyword">namespace </span>sat {</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> </div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="comment">// Small utility class to store a vector&lt;vector&lt;&gt;&gt; where one can only append new</span></div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="comment">// vector and never change previously added ones.</span></div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="comment">//</span></div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="comment">// Note that we implement a really small subset of the vector&lt;vector&lt;&gt;&gt; API.</span></div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_compact_vector_vector.html"> 39</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_compact_vector_vector.html">CompactVectorVector</a> {</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// Same as push_back().</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// Returns the previous size() as this is convenient for how we use it.</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#ad6a42e792567843146d9fa4e83fd5877"> 43</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#ad6a42e792567843146d9fa4e83fd5877">Add</a>(absl::Span&lt;const T&gt; data) {</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = <a class="code hl_function" href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#a259cb5a711406a8c3e5d937eb9350cca">size</a>();</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> starts_.push_back(buffer_.size());</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> sizes_.push_back(data.size());</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> buffer_.insert(buffer_.end(), data.begin(), data.end());</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> }</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">// Warning: this is only valid until the next clear() or Add() call.</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#a3e56515332be1f5ea21e935edc46f331"> 52</a></span> absl::Span&lt;const T&gt; <a class="code hl_function" href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#a3e56515332be1f5ea21e935edc46f331">operator[]</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, 0);</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, starts_.size());</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, sizes_.size());</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#a259cb5a711406a8c3e5d937eb9350cca">size</a> = <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(sizes_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#a259cb5a711406a8c3e5d937eb9350cca">size</a> == 0) <span class="keywordflow">return</span> {};</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keywordflow">return</span> {&amp;buffer_[starts_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]], <a class="code hl_function" href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#a259cb5a711406a8c3e5d937eb9350cca">size</a>};</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> </div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#ac8bb3912a3ce86b15842e79d0b421204"> 61</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#ac8bb3912a3ce86b15842e79d0b421204">clear</a>() {</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> starts_.clear();</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> sizes_.clear();</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> buffer_.clear();</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> </div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#a259cb5a711406a8c3e5d937eb9350cca"> 67</a></span> <span class="keywordtype">size_t</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#a259cb5a711406a8c3e5d937eb9350cca">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> starts_.size(); }</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> </div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> std::vector&lt;int&gt; starts_;</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> std::vector&lt;int&gt; sizes_;</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> std::vector&lt;T&gt; buffer_;</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span>};</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> </div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment">// An helper class to process many sets of integer in [0, n] and detects all the</span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="comment">// set included in each others. This is a common operations in presolve, and</span></div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span><span class="comment">// while it can be slow the algorithm used here is pretty efficient in practice.</span></div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span><span class="comment">//</span></div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span><span class="comment">// The algorithm is based on the SAT preprocessing algorithm to detect clauses</span></div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span><span class="comment">// that subsumes others. It uses a one-watcher scheme where each subset</span></div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span><span class="comment">// candidate has only one element watched. To identify all potential subset of a</span></div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span><span class="comment">// superset, one need to inspect the watch list for all element of the superset</span></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="comment">// candidate.</span></div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span><span class="comment">//</span></div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="comment">// The number n will be detected automatically but we allocate various vector</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="comment">// of size n, so avoid having large integer values in your sets.</span></div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span><span class="comment">//</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span><span class="comment">// All set contents will be accessed via storage_[index]. And of course Storage</span></div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span><span class="comment">// can be the CompactVectorVector defined above. But it can also be something</span></div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span><span class="comment">// that return a class that support .size() and integer range iteration over the</span></div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span><span class="comment">// element in the set on the fly.</span></div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> Storage&gt;</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html"> 93</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_inclusion_detector.html">InclusionDetector</a> {</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#acc6105103da60d6f75acac0f4ea66618"> 95</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#acc6105103da60d6f75acac0f4ea66618">InclusionDetector</a>(<span class="keyword">const</span> Storage&amp; storage) : storage_(storage) {}</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> </div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// Resets the class to an empty state.</span></div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a372de693ad40b3f42839c8ec6ac845f4"> 98</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a372de693ad40b3f42839c8ec6ac845f4">Reset</a>() {</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> num_potential_subsets_ = 0;</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> num_potential_supersets_ = 0;</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> candidates_.clear();</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> </div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// Adds a candidate set to consider for the next DetectInclusions() call.</span></div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// The argument is an index that will only be used via storage_[index] to get</span></div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// the content of the candidate set.</span></div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="comment">//</span></div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// Note that set with no element are just ignored and will never be returned</span></div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// as part of an inclusion.</span></div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a3912b15351bc5c954f074a8bf4b34c8f">AddPotentialSubset</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a81357915e4f625aa86e5a826c9e4aaeb">AddPotentialSuperset</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a787789c3e20de9fc6bf506125de318a1">AddPotentialSet</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> </div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// By default we will detect all inclusions. It is possible to make sure we</span></div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="comment">// don&#39;t do more than O(work_limit) operations and eventually abort early by</span></div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="comment">// setting this. Note that we don&#39;t reset it on Reset().</span></div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="comment">//</span></div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// This is needed, because for m candidates of size n, we can have O(m ^ 2)</span></div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="comment">// inclusions, each requiring O(n) work to check.</span></div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a6a511eba5def77bf17d457ef2c50f20b"> 120</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a6a511eba5def77bf17d457ef2c50f20b">SetWorkLimit</a>(uint64_t work_limit) { work_limit_ = work_limit; }</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> </div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// Finds all subset included in a superset and call &quot;process&quot; on each of the</span></div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// detected inclusion. The std::function argument corresponds to indices</span></div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// passed to the Add*() calls.</span></div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="comment">//</span></div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// The order of detection will be by increasing superset size. For superset</span></div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="comment">// with the same size, the order will be deterministic but not specified. And</span></div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="comment">// similarly, for a given superset, the order of the included subsets is</span></div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// deterministic but not specified.</span></div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="comment">//</span></div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="comment">// Note that only the candidate marked as such can be a subset/superset.</span></div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="comment">// For the candidate than can be both and are duplicates (i.e. same set), only</span></div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="comment">// one pair will be returned. We will also never return identity inclusion and</span></div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// we always have subset != superset.</span></div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#ae4c437763c2bde9bb875434adaee2f3e">DetectInclusions</a>(</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keyword">const</span> std::function&lt;<span class="keywordtype">void</span>(<span class="keywordtype">int</span> subset, <span class="keywordtype">int</span> superset)&gt;&amp; process);</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> </div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="comment">// Function that should only be used from within &quot;process()&quot;.</span></div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// Returns the bitset corresponsing to the elements of the current superset</span></div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// passed to the process() function.</span></div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#abc3554d4474b79d9002d5620ce03e3b3"> 141</a></span> <span class="keyword">const</span> std::vector&lt;bool&gt; <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#abc3554d4474b79d9002d5620ce03e3b3">IsInSuperset</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> is_in_superset_; }</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">// Function that should only be used from within &quot;process()&quot;.</span></div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// Stop will abort the current search. The other two will cause the</span></div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// corresponding candidate set to never appear in any future inclusion.</span></div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a6fda3062d53473d2deeb080471b242b5"> 146</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a6fda3062d53473d2deeb080471b242b5">StopProcessingCurrentSubset</a>() { stop_with_current_subset_ = <span class="keyword">true</span>; }</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a9b82d7192f3f428a2c9f6f1540660e24"> 147</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a9b82d7192f3f428a2c9f6f1540660e24">StopProcessingCurrentSuperset</a>() { stop_with_current_superset_ = <span class="keyword">true</span>; }</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a17a237457e57625296e6b24feb19c60a"> 148</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a17a237457e57625296e6b24feb19c60a">Stop</a>() {</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> stop_ = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> signatures_.clear();</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> one_watcher_.clear();</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> is_in_superset_.clear();</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> }</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> </div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="comment">// The algorithm here can detect many small set included in a big set while</span></div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="comment">// only scanning the superset once. So if we do scan the superset in the</span></div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// process function, we can do a lot more work. This is here to reuse the</span></div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="comment">// deterministic limit mechanism.</span></div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#ab8eba18ef954a600c637bf21cd76361b"> 159</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#ab8eba18ef954a600c637bf21cd76361b">IncreaseWorkDone</a>(uint64_t increase) { work_done_ += increase; }</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> </div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// Stats.</span></div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a3c119d023127779c0cc751ec2a8515ad"> 162</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a3c119d023127779c0cc751ec2a8515ad">num_potential_subsets</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> num_potential_subsets_; }</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a306cde440df325b59db0e644523a5436"> 163</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a306cde440df325b59db0e644523a5436">num_potential_supersets</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> num_potential_supersets_; }</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a35048296bb47b7d824211a43db303823"> 164</a></span> uint64_t <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a35048296bb47b7d824211a43db303823">work_done</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> work_done_; }</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="keyword">private</span>:</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// Allows to access the elements of each candidates via storage_[index];</span></div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="keyword">const</span> Storage&amp; storage_;</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> </div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="comment">// List of candidates, this will be sorted.</span></div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="keyword">struct </span>Candidate {</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>; <span class="comment">// Storage index.</span></div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="keywordtype">int</span> size;</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> </div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="comment">// For identical sizes, we need this order for correctness</span></div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="comment">// 0: subset only, 1: both, 2: superset only.</span></div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="keywordtype">int</span> order = 1;</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> </div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="keywordtype">bool</span> CanBeSubset()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> order &lt;= 1; }</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="keywordtype">bool</span> CanBeSuperset()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> order &gt;= 1; }</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> </div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="comment">// We use this with stable_sort, so no need to add the index.</span></div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="keywordtype">bool</span> operator&lt;(<span class="keyword">const</span> Candidate&amp; other)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="keywordflow">return</span> std::tie(size, order) &lt; std::tie(other.size, other.order);</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> }</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> };</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> std::vector&lt;Candidate&gt; candidates_;</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> </div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="keywordtype">int</span> num_potential_subsets_ = 0;</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="keywordtype">int</span> num_potential_supersets_ = 0;</div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> uint64_t work_done_ = 0;</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> uint64_t work_limit_ = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits&lt;uint64_t&gt;::max</a>();</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> </div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="comment">// Temporary data only used by DetectInclusions().</span></div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="keywordtype">bool</span> stop_;</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="keywordtype">bool</span> stop_with_current_subset_;</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="keywordtype">bool</span> stop_with_current_superset_;</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> std::vector&lt;uint64_t&gt; signatures_;</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> std::vector&lt;std::vector&lt;int&gt;&gt; one_watcher_; <span class="comment">// Index in candidates_.</span></div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> std::vector&lt;bool&gt; is_in_superset_;</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> </div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span><span class="comment">// Deduction guide.</span></div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Storage&gt;</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ac5c32a6d4b37adef70ebfc92eabf05b4"> 205</a></span><a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ac5c32a6d4b37adef70ebfc92eabf05b4">InclusionDetector</a>(<span class="keyword">const</span> Storage&amp; storage) -&gt; <a class="code hl_class" href="classoperations__research_1_1sat_1_1_inclusion_detector.html">InclusionDetector&lt;Storage&gt;</a>;</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> </div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Storage&gt;</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a787789c3e20de9fc6bf506125de318a1"> 208</a></span><span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a787789c3e20de9fc6bf506125de318a1">InclusionDetector&lt;Storage&gt;::AddPotentialSet</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, 0);</div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, storage_.size());</div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_elements = storage_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].size();</div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="keywordflow">if</span> (num_elements == 0) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> </div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> ++num_potential_subsets_;</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> ++num_potential_supersets_;</div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> candidates_.push_back({<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, num_elements, <span class="comment">/*order=*/</span>1});</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> </div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Storage&gt;</div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a3912b15351bc5c954f074a8bf4b34c8f"> 220</a></span><span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a3912b15351bc5c954f074a8bf4b34c8f">InclusionDetector&lt;Storage&gt;::AddPotentialSubset</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, 0);</div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, storage_.size());</div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_elements = storage_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].size();</div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="keywordflow">if</span> (num_elements == 0) <span class="keywordflow">return</span>;</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> ++num_potential_subsets_;</div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> candidates_.push_back({<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, num_elements, <span class="comment">/*order=*/</span>0});</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> </div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Storage&gt;</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a81357915e4f625aa86e5a826c9e4aaeb"> 231</a></span><span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a81357915e4f625aa86e5a826c9e4aaeb">InclusionDetector&lt;Storage&gt;::AddPotentialSuperset</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, 0);</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, storage_.size());</div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_elements = storage_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].size();</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="keywordflow">if</span> (num_elements == 0) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> </div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, 0);</div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, storage_.size());</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> ++num_potential_supersets_;</div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> candidates_.push_back({<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, num_elements, <span class="comment">/*order=*/</span>2});</div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span>}</div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> </div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Storage&gt;</div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#ae4c437763c2bde9bb875434adaee2f3e"> 244</a></span><span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_inclusion_detector.html#ae4c437763c2bde9bb875434adaee2f3e">InclusionDetector&lt;Storage&gt;::DetectInclusions</a>(</div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="keyword">const</span> std::function&lt;<span class="keywordtype">void</span>(<span class="keywordtype">int</span> subset, <span class="keywordtype">int</span> superset)&gt;&amp; process) {</div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="comment">// No need to do any work in these cases.</span></div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="keywordflow">if</span> (candidates_.size() &lt;= 1) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="keywordflow">if</span> (num_potential_subsets_ == 0) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="keywordflow">if</span> (num_potential_supersets_ == 0) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> </div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="comment">// Temp data must be ready to use.</span></div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> stop_ = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_in_superset_.empty());</div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(signatures_.empty());</div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(one_watcher_.empty());</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> </div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// Main algo.</span></div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> work_done_ = 0;</div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> std::stable_sort(candidates_.begin(), candidates_.end());</div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> Candidate&amp; candidate : candidates_) {</div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <span class="keyword">const</span> <span class="keyword">auto</span>&amp; candidate_elements = storage_[candidate.index];</div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> <span class="keyword">const</span> <span class="keywordtype">int</span> candidate_index = signatures_.size();</div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> </div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> <span class="comment">// Compute the signature and also resize vector if needed. We want a</span></div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="comment">// signature that is order invariant and is compatible with inclusion.</span></div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> uint64_t signature = 0;</div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="keywordtype">int</span> max_element = 0;</div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> e : candidate_elements) {</div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(e, 0);</div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> max_element = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_element, e);</div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> signature |= (int64_t{1} &lt;&lt; (e &amp; 63));</div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> }</div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(is_in_superset_.size(), one_watcher_.size());</div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <span class="keywordflow">if</span> (max_element &gt;= is_in_superset_.size()) {</div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> is_in_superset_.resize(max_element + 1, <span class="keyword">false</span>);</div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> one_watcher_.resize(max_element + 1);</div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> }</div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> signatures_.push_back(signature);</div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> </div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> stop_with_current_superset_ = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> <span class="keywordflow">if</span> (candidate.CanBeSuperset()) {</div>
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="keyword">const</span> Candidate&amp; superset = candidate;</div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="keyword">const</span> <span class="keyword">auto</span>&amp; superset_elements = candidate_elements;</div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> </div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="comment">// Bitset should be cleared.</span></div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::all_of(is_in_superset_.begin(), is_in_superset_.end(),</div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> [](<span class="keywordtype">bool</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) { return !b; }));</div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> </div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="comment">// Find any subset included in current superset.</span></div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> work_done_ += 2 * superset.size;</div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="keywordflow">if</span> (work_done_ &gt; work_limit_) <span class="keywordflow">return</span> Stop();</div>
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> e : superset_elements) {</div>
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> is_in_superset_[e] = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> }</div>
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> </div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> <span class="keyword">const</span> uint64_t superset_signature = signatures_.back();</div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> superset_e : superset_elements) {</div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; one_watcher_[superset_e].size(); ++i) {</div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="keyword">const</span> <span class="keywordtype">int</span> c_index = one_watcher_[superset_e][i];</div>
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <span class="keyword">const</span> Candidate&amp; subset = candidates_[c_index];</div>
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(subset.size, superset.size);</div>
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> </div>
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> <span class="comment">// Quick check with signature.</span></div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> <span class="keywordflow">if</span> ((signatures_[c_index] &amp; ~superset_signature) != 0) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> </div>
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> <span class="comment">// Long check with bitset.</span></div>
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <span class="keywordtype">bool</span> is_included = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> work_done_ += subset.size;</div>
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="keywordflow">if</span> (work_done_ &gt; work_limit_) <span class="keywordflow">return</span> Stop();</div>
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> subset_e : storage_[subset.index]) {</div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="keywordflow">if</span> (!is_in_superset_[subset_e]) {</div>
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> is_included = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> }</div>
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> }</div>
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> <span class="keywordflow">if</span> (!is_included) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> </div>
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> stop_with_current_subset_ = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> process(subset.index, superset.index);</div>
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> </div>
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> <span class="keywordflow">if</span> (stop_) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> <span class="keywordflow">if</span> (work_done_ &gt; work_limit_) <span class="keywordflow">return</span> Stop();</div>
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> </div>
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> <span class="keywordflow">if</span> (stop_with_current_subset_) {</div>
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> <span class="comment">// Remove from the watcher list.</span></div>
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(one_watcher_[superset_e][i],</div>
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> one_watcher_[superset_e].back());</div>
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> one_watcher_[superset_e].pop_back();</div>
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> --i;</div>
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> }</div>
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> <span class="keywordflow">if</span> (stop_with_current_superset_) <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> }</div>
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> <span class="keywordflow">if</span> (stop_with_current_superset_) <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> }</div>
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> </div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> <span class="comment">// Cleanup.</span></div>
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> e : superset_elements) {</div>
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> is_in_superset_[e] = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> }</div>
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> }</div>
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> </div>
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> <span class="comment">// Add new subset candidate to the watchers.</span></div>
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <span class="comment">//</span></div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> <span class="comment">// Tricky: If this was also a superset and has been removed, we don&#39;t want</span></div>
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> <span class="comment">// to watch it!</span></div>
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <span class="keywordflow">if</span> (candidate.CanBeSubset() &amp;&amp; !stop_with_current_superset_) {</div>
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <span class="comment">// Choose to watch the one with smallest list.</span></div>
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <span class="keywordtype">int</span> best_choice = -1;</div>
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> work_done_ += candidate.size;</div>
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> <span class="keywordflow">if</span> (work_done_ &gt; work_limit_) <span class="keywordflow">return</span> Stop();</div>
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> e : candidate_elements) {</div>
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(e, 0);</div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(e, one_watcher_.size());</div>
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> <span class="keywordflow">if</span> (best_choice == -1 ||</div>
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> one_watcher_[e].size() &lt; one_watcher_[best_choice].size()) {</div>
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> best_choice = e;</div>
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> }</div>
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> }</div>
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(best_choice, -1);</div>
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> one_watcher_[best_choice].push_back(candidate_index);</div>
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> }</div>
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> }</div>
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> </div>
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> <span class="comment">// Stop also performs some cleanup.</span></div>
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> Stop();</div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span>}</div>
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> </div>
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span>} <span class="comment">// namespace sat</span></div>
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span>} <span class="comment">// namespace operations_research</span></div>
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> </div>
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_SAT_INCLUSION_H_</span></div>
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
<div class="ttc" id="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#l00893">base/logging.h:893</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00892">base/logging.h:892</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#l00895">base/logging.h:895</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#l00894">base/logging.h:894</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#l00890">base/logging.h:890</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00891">base/logging.h:891</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_compact_vector_vector_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_compact_vector_vector.html">operations_research::sat::CompactVectorVector</a></div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00039">inclusion.h:39</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_compact_vector_vector_html_a259cb5a711406a8c3e5d937eb9350cca"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#a259cb5a711406a8c3e5d937eb9350cca">operations_research::sat::CompactVectorVector::size</a></div><div class="ttdeci">size_t size() const</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00067">inclusion.h:67</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_compact_vector_vector_html_a3e56515332be1f5ea21e935edc46f331"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#a3e56515332be1f5ea21e935edc46f331">operations_research::sat::CompactVectorVector::operator[]</a></div><div class="ttdeci">absl::Span&lt; const T &gt; operator[](int index) const</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00052">inclusion.h:52</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_compact_vector_vector_html_ac8bb3912a3ce86b15842e79d0b421204"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#ac8bb3912a3ce86b15842e79d0b421204">operations_research::sat::CompactVectorVector::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00061">inclusion.h:61</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_compact_vector_vector_html_ad6a42e792567843146d9fa4e83fd5877"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_compact_vector_vector.html#ad6a42e792567843146d9fa4e83fd5877">operations_research::sat::CompactVectorVector::Add</a></div><div class="ttdeci">int Add(absl::Span&lt; const T &gt; data)</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00043">inclusion.h:43</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html">operations_research::sat::InclusionDetector</a></div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00093">inclusion.h:93</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_a17a237457e57625296e6b24feb19c60a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a17a237457e57625296e6b24feb19c60a">operations_research::sat::InclusionDetector::Stop</a></div><div class="ttdeci">void Stop()</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00148">inclusion.h:148</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_a306cde440df325b59db0e644523a5436"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a306cde440df325b59db0e644523a5436">operations_research::sat::InclusionDetector::num_potential_supersets</a></div><div class="ttdeci">int num_potential_supersets() const</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00163">inclusion.h:163</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_a35048296bb47b7d824211a43db303823"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a35048296bb47b7d824211a43db303823">operations_research::sat::InclusionDetector::work_done</a></div><div class="ttdeci">uint64_t work_done() const</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00164">inclusion.h:164</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_a372de693ad40b3f42839c8ec6ac845f4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a372de693ad40b3f42839c8ec6ac845f4">operations_research::sat::InclusionDetector::Reset</a></div><div class="ttdeci">void Reset()</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00098">inclusion.h:98</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_a3912b15351bc5c954f074a8bf4b34c8f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a3912b15351bc5c954f074a8bf4b34c8f">operations_research::sat::InclusionDetector::AddPotentialSubset</a></div><div class="ttdeci">void AddPotentialSubset(int index)</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00220">inclusion.h:220</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_a3c119d023127779c0cc751ec2a8515ad"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a3c119d023127779c0cc751ec2a8515ad">operations_research::sat::InclusionDetector::num_potential_subsets</a></div><div class="ttdeci">int num_potential_subsets() const</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00162">inclusion.h:162</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_a6a511eba5def77bf17d457ef2c50f20b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a6a511eba5def77bf17d457ef2c50f20b">operations_research::sat::InclusionDetector::SetWorkLimit</a></div><div class="ttdeci">void SetWorkLimit(uint64_t work_limit)</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00120">inclusion.h:120</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_a6fda3062d53473d2deeb080471b242b5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a6fda3062d53473d2deeb080471b242b5">operations_research::sat::InclusionDetector::StopProcessingCurrentSubset</a></div><div class="ttdeci">void StopProcessingCurrentSubset()</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00146">inclusion.h:146</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_a787789c3e20de9fc6bf506125de318a1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a787789c3e20de9fc6bf506125de318a1">operations_research::sat::InclusionDetector::AddPotentialSet</a></div><div class="ttdeci">void AddPotentialSet(int index)</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00208">inclusion.h:208</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_a81357915e4f625aa86e5a826c9e4aaeb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a81357915e4f625aa86e5a826c9e4aaeb">operations_research::sat::InclusionDetector::AddPotentialSuperset</a></div><div class="ttdeci">void AddPotentialSuperset(int index)</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00231">inclusion.h:231</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_a9b82d7192f3f428a2c9f6f1540660e24"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#a9b82d7192f3f428a2c9f6f1540660e24">operations_research::sat::InclusionDetector::StopProcessingCurrentSuperset</a></div><div class="ttdeci">void StopProcessingCurrentSuperset()</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00147">inclusion.h:147</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_ab8eba18ef954a600c637bf21cd76361b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#ab8eba18ef954a600c637bf21cd76361b">operations_research::sat::InclusionDetector::IncreaseWorkDone</a></div><div class="ttdeci">void IncreaseWorkDone(uint64_t increase)</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00159">inclusion.h:159</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_abc3554d4474b79d9002d5620ce03e3b3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#abc3554d4474b79d9002d5620ce03e3b3">operations_research::sat::InclusionDetector::IsInSuperset</a></div><div class="ttdeci">const std::vector&lt; bool &gt; IsInSuperset() const</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00141">inclusion.h:141</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_acc6105103da60d6f75acac0f4ea66618"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#acc6105103da60d6f75acac0f4ea66618">operations_research::sat::InclusionDetector::InclusionDetector</a></div><div class="ttdeci">InclusionDetector(const Storage &amp;storage)</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00095">inclusion.h:95</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_inclusion_detector_html_ae4c437763c2bde9bb875434adaee2f3e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inclusion_detector.html#ae4c437763c2bde9bb875434adaee2f3e">operations_research::sat::InclusionDetector::DetectInclusions</a></div><div class="ttdeci">void DetectInclusions(const std::function&lt; void(int subset, int superset)&gt; &amp;process)</div><div class="ttdef"><b>Definition:</b> <a href="inclusion_8h_source.html#l00244">inclusion.h:244</a></div></div>
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</a></div></div>
<div class="ttc" id="alocal__search_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l02750">local_search.cc:2750</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap&lt; K, V &gt; &amp;a, IdMap&lt; K, V &gt; &amp;b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00262">id_map.h:262</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ac5c32a6d4b37adef70ebfc92eabf05b4"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac5c32a6d4b37adef70ebfc92eabf05b4">operations_research::sat::InclusionDetector</a></div><div class="ttdeci">InclusionDetector(const Storage &amp;storage) -&gt; InclusionDetector&lt; Storage &gt;</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><!-- 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="inclusion_8h.html">inclusion.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.3 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink