564 lines
95 KiB
HTML
564 lines
95 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.3"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: util.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">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&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_2util_8cc_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">sat/util.cc</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="sat_2util_8cc.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">#include "<a class="code" href="sat_2util_8h.html">ortools/sat/util.h</a>"</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cmath></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <cstdlib></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <deque></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <numeric></span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> </div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</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="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#if !defined(__PORTABLE_PLATFORM__)</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "google/protobuf/descriptor.h"</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#endif </span><span class="comment">// __PORTABLE_PLATFORM__</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include "absl/container/btree_set.h"</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="preprocessor">#include "absl/numeric/int128.h"</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="preprocessor">#include "absl/random/bit_gen_ref.h"</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="preprocessor">#include "absl/random/distributions.h"</span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="preprocessor">#include "absl/types/span.h"</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="preprocessor">#include "<a class="code" href="mathutil_8h.html">ortools/base/mathutil.h</a>"</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="preprocessor">#include "<a class="code" href="stl__util_8h.html">ortools/base/stl_util.h</a>"</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</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="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="preprocessor">#include "ortools/sat/sat_parameters.pb.h"</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="preprocessor">#include "<a class="code" href="strong__integers_8h.html">ortools/util/strong_integers.h</a>"</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> </div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="comment">// This will be optimized into one division. I tested that in other places:</span></div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="comment">// Note that I am not 100% sure we need the indirection for the optimization</span></div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="comment">// to kick in though, but this seemed safer given our weird r[i ^ 1] inputs.</span></div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="keywordtype">void</span> QuotientAndRemainder(int64_t <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, int64_t <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, int64_t& q, int64_t& r) {</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> q = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> / <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>;</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> r = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> % <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>;</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span>}</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> </div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a0441e1a54fe203c0707131e587de8fae"> 59</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0441e1a54fe203c0707131e587de8fae">RandomizeDecisionHeuristic</a>(absl::BitGenRef random,</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> SatParameters* <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>) {</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span><span class="preprocessor">#if !defined(__PORTABLE_PLATFORM__)</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// Random preferred variable order.</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keyword">const</span> google::protobuf::EnumDescriptor* order_d =</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> SatParameters::VariableOrder_descriptor();</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>->set_preferred_variable_order(</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keyword">static_cast<</span>SatParameters::VariableOrder<span class="keyword">></span>(</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> order_d->value(absl::Uniform(random, 0, order_d->value_count()))</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> ->number()));</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">// Random polarity initial value.</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keyword">const</span> google::protobuf::EnumDescriptor* polarity_d =</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> SatParameters::Polarity_descriptor();</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>->set_initial_polarity(<span class="keyword">static_cast<</span>SatParameters::Polarity<span class="keyword">></span>(</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> polarity_d->value(absl::Uniform(random, 0, polarity_d->value_count()))</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> ->number()));</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="preprocessor">#endif </span><span class="comment">// __PORTABLE_PLATFORM__</span></div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// Other random parameters.</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>->set_use_phase_saving(absl::Bernoulli(random, 0.5));</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>->set_random_polarity_ratio(absl::Bernoulli(random, 0.5) ? 0.01</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> : 0.0);</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>->set_random_branches_ratio(absl::Bernoulli(random, 0.5) ? 0.01</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> : 0.0);</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> </div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="comment">// Using the extended Euclidian algo, we find a and b such that a x + b m = gcd.</span></div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="comment">// https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm</span></div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#abbbb4c91f9a3d6eb290709745f5b661c"> 87</a></span>int64_t <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#abbbb4c91f9a3d6eb290709745f5b661c">ModularInverse</a>(int64_t x, int64_t m) {</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(x, 0);</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(x, m);</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> </div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> int64_t r[2] = {m, x};</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> int64_t t[2] = {0, 1};</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> int64_t q;</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> </div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// We only keep the last two terms of the sequences with the "^1" trick:</span></div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// q = r[i-2] / r[i-1]</span></div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="comment">// r[i] = r[i-2] % r[i-1]</span></div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// t[i] = t[i-2] - t[i-1] * q</span></div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// We always have:</span></div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// - gcd(r[i], r[i - 1]) = gcd(r[i - 1], r[i - 2])</span></div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// - x * t[i] + m * t[i - 1] = r[i]</span></div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordtype">int</span> i = 0;</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keywordflow">for</span> (; r[i ^ 1] != 0; i ^= 1) {</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> QuotientAndRemainder(r[i], r[i ^ 1], q, r[i]);</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> t[i] -= t[i ^ 1] * q;</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> }</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">// If the gcd is not one, there is no inverse, we returns 0.</span></div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="keywordflow">if</span> (r[i] != 1) <span class="keywordflow">return</span> 0;</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">// Correct the result so that it is in [0, m). Note that abs(t[i]) is known to</span></div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// be less than or equal to x / 2, and we have thorough unit-tests.</span></div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="keywordflow">if</span> (t[i] < 0) t[i] += m;</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="keywordflow">return</span> t[i];</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span>}</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> </div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a629c989df2521428c30722f175874774"> 120</a></span>int64_t <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a629c989df2521428c30722f175874774">PositiveMod</a>(int64_t x, int64_t m) {</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keyword">const</span> int64_t r = x % m;</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordflow">return</span> r < 0 ? r + m : r;</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> </div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ac015d81b88379719f680eadc2aad1508"> 125</a></span>int64_t <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ac015d81b88379719f680eadc2aad1508">ProductWithModularInverse</a>(int64_t <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, int64_t mod, int64_t rhs) {</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, 0);</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(mod, 0);</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> </div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> mod = std::abs(mod);</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="keywordflow">if</span> (rhs == 0 || mod == 1) <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(std::gcd(std::abs(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>), mod), 1);</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">// Make both in [0, mod).</span></div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a629c989df2521428c30722f175874774">PositiveMod</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, mod);</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> rhs = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a629c989df2521428c30722f175874774">PositiveMod</a>(rhs, mod);</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> </div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="comment">// From X * coeff % mod = rhs</span></div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="comment">// We deduce that X % mod = rhs * inverse % mod</span></div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="keyword">const</span> int64_t inverse = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#abbbb4c91f9a3d6eb290709745f5b661c">ModularInverse</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, mod);</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <a class="code hl_define" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(inverse, 0);</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> </div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// We make the operation in 128 bits to be sure not to have any overflow here.</span></div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="keyword">const</span> absl::int128 p = absl::int128{inverse} * absl::int128{rhs};</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(p % absl::int128{mod});</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span>}</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> </div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a852a51b53f6217d6bfd1aef455f53f8c"> 147</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a852a51b53f6217d6bfd1aef455f53f8c">SolveDiophantineEquationOfSizeTwo</a>(int64_t& <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, int64_t& <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, int64_t& cte,</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> int64_t& x0, int64_t& y0) {</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <a class="code hl_define" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, 0);</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <a class="code hl_define" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, 0);</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <a class="code hl_define" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>());</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <a class="code hl_define" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>());</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> <span class="keyword">const</span> int64_t gcd = std::gcd(std::abs(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>), std::abs(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>));</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="keywordflow">if</span> (cte % gcd != 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> /= gcd;</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> /= gcd;</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> cte /= gcd;</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> </div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="comment">// The simple case where (0, 0) is a solution.</span></div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keywordflow">if</span> (cte == 0) {</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> x0 = y0 = 0;</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> }</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">// We solve a * X + b * Y = cte</span></div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// We take a valid x0 in [0, b) by considering the equation mod b.</span></div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> x0 = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ac015d81b88379719f680eadc2aad1508">ProductWithModularInverse</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, cte);</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">// We choose x0 of the same sign as cte.</span></div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="keywordflow">if</span> (cte < 0 && x0 != 0) x0 -= std::abs(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> </div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="comment">// By plugging X = x0 + b * Z</span></div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="comment">// We have a * (x0 + b * Z) + b * Y = cte</span></div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="comment">// so a * b * Z + b * Y = cte - a * x0;</span></div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="comment">// and y0 = (cte - a * x0) / b (with an exact division by construction).</span></div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="keyword">const</span> absl::int128 t = absl::int128{cte} - absl::int128{<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>} * absl::int128{x0};</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(t % absl::int128{<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>}, absl::int128{0});</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> </div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="comment">// Overflow-wise, there is two cases for cte > 0:</span></div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="comment">// - a * x0 <= cte, in this case y0 will not overflow (<= cte).</span></div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="comment">// - a * x0 > cte, in this case y0 will be in (-a, 0].</span></div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="keyword">const</span> absl::int128 r = t / absl::int128{<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>};</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(r, absl::int128{<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()});</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(r, absl::int128{<a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>()});</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> y0 = <span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(r);</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span>}</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">// TODO(user): Find better implementation? In pratice passing via double is</span></div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span><span class="comment">// almost always correct, but the CapProd() might be a bit slow. However this</span></div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span><span class="comment">// is only called when we do propagate something.</span></div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#aa7497b495a7fbfddaea40d45861680c5"> 194</a></span>int64_t <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aa7497b495a7fbfddaea40d45861680c5">FloorSquareRoot</a>(int64_t <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>) {</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> int64_t result =</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(std::floor(std::sqrt(<span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>))));</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="keywordflow">while</span> (<a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(result, result) > <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>) --result;</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="keywordflow">while</span> (<a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(result + 1, result + 1) <= <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>) ++result;</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span>}</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">// TODO(user): Find better implementation?</span></div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a72e9fb9c1d4b0649782f8696e85cbbaa"> 203</a></span>int64_t <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a72e9fb9c1d4b0649782f8696e85cbbaa">CeilSquareRoot</a>(int64_t <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>) {</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> int64_t result =</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(std::ceil(std::sqrt(<span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>))));</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="keywordflow">while</span> (<a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(result, result) < <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>) ++result;</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="keywordflow">while</span> ((result - 1) * (result - 1) >= <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>) --result;</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span>}</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> </div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a2269a7a6f3b17cbd10a8d8a3914d8b51"> 211</a></span>int64_t <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2269a7a6f3b17cbd10a8d8a3914d8b51">ClosestMultiple</a>(int64_t <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, int64_t base) {</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> < 0) <span class="keywordflow">return</span> -<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2269a7a6f3b17cbd10a8d8a3914d8b51">ClosestMultiple</a>(-<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, base);</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> int64_t result = <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> / base * base;</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - result > base / 2) result += base;</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span>}</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"><a class="line" href="namespaceoperations__research_1_1sat.html#af20de3e143682d110b863c2e9435f050"> 218</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#af20de3e143682d110b863c2e9435f050">LinearInequalityCanBeReducedWithClosestMultiple</a>(</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> int64_t base, <span class="keyword">const</span> std::vector<int64_t>& coeffs,</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="keyword">const</span> std::vector<int64_t>& lbs, <span class="keyword">const</span> std::vector<int64_t>& ubs,</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> int64_t rhs, int64_t* new_rhs) {</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="comment">// Precompute some bounds for the equation base * X + error <= rhs.</span></div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> int64_t max_activity = 0;</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> int64_t max_x = 0;</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> int64_t min_error = 0;</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_terms = coeffs.size();</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="keywordflow">if</span> (num_terms == 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_terms; ++i) {</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = coeffs[i];</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <a class="code hl_define" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, 0);</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="keyword">const</span> int64_t closest = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2269a7a6f3b17cbd10a8d8a3914d8b51">ClosestMultiple</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, base);</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> max_activity += <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> * ubs[i];</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> max_x += closest / base * ubs[i];</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> <span class="keyword">const</span> int64_t error = <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> - closest;</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <span class="keywordflow">if</span> (error >= 0) {</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> min_error += error * lbs[i];</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> min_error += error * ubs[i];</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> }</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="keywordflow">if</span> (max_activity <= rhs) {</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="comment">// The constraint is trivially true.</span></div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> *new_rhs = max_x;</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> }</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> </div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="comment">// This is the max error assuming that activity > rhs.</span></div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> int64_t max_error_if_invalid = 0;</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="keyword">const</span> int64_t slack = max_activity - rhs - 1;</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_terms; ++i) {</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = coeffs[i];</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <span class="keyword">const</span> int64_t closest = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2269a7a6f3b17cbd10a8d8a3914d8b51">ClosestMultiple</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, base);</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <span class="keyword">const</span> int64_t error = <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> - closest;</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <span class="keywordflow">if</span> (error >= 0) {</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> max_error_if_invalid += error * ubs[i];</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <span class="keyword">const</span> int64_t lb = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(lbs[i], ubs[i] - slack / <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>);</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> max_error_if_invalid += error * lb;</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> }</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> }</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">// We have old solution valid =></span></div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="comment">// base * X + error <= rhs</span></div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <span class="comment">// base * X <= rhs - error</span></div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="comment">// base * X <= rhs - min_error</span></div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="comment">// X <= new_rhs</span></div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> *new_rhs = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(max_x, <a class="code hl_function" href="classoperations__research_1_1_math_util.html#a9e5c13b72c36481ed098c05031d1f850">MathUtil::FloorOfRatio</a>(rhs - min_error, base));</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> </div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="comment">// And we have old solution invalid =></span></div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="comment">// base * X + error >= rhs + 1</span></div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <span class="comment">// base * X >= rhs + 1 - max_error_if_invalid</span></div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <span class="comment">// X >= infeasibility_bound</span></div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="keyword">const</span> int64_t infeasibility_bound =</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <a class="code hl_function" href="classoperations__research_1_1_math_util.html#a0cfaf8b139304c54e3403d4ffbd60157">MathUtil::CeilOfRatio</a>(rhs + 1 - max_error_if_invalid, base);</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> <span class="comment">// If the two bounds can be separated, we have an equivalence !</span></div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="keywordflow">return</span> *new_rhs < infeasibility_bound;</div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span>}</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> </div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ae1ffd76bca69ccb2e7b65dfe2cf76f2e"> 282</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ae1ffd76bca69ccb2e7b65dfe2cf76f2e">MoveOneUnprocessedLiteralLast</a>(</div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="keyword">const</span> absl::btree_set<LiteralIndex>& processed, <span class="keywordtype">int</span> relevant_prefix_size,</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> std::vector<Literal>* literals) {</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="keywordflow">if</span> (literals->empty()) <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(processed, literals->back().Index())) {</div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="keywordflow">return</span> std::min<int>(relevant_prefix_size, literals->size());</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> </div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> <span class="comment">// To get O(n log n) size of suffixes, we will first process the last n/2</span></div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="comment">// literals, we then move all of them first and process the n/2 literals left.</span></div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="comment">// We use the same algorithm recursively. The sum of the suffixes' size S(n)</span></div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <span class="comment">// is thus S(n/2) + n + S(n/2). That gives us the correct complexity. The code</span></div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="comment">// below simulates one step of this algorithm and is made to be "robust" when</span></div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <span class="comment">// from one call to the next, some literals have been removed (but the order</span></div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> <span class="comment">// of literals is preserved).</span></div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="keywordtype">int</span> num_processed = 0;</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="keywordtype">int</span> num_not_processed = 0;</div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="keywordtype">int</span> target_prefix_size = literals->size() - 1;</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = literals->size() - 1; i >= 0; i--) {</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(processed, (*literals)[i].<a class="code hl_typedef" href="namespaceoperations__research_1_1glop.html#ac89c7b45754e9a6bdabc08bea586fc4e">Index</a>())) {</div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> ++num_processed;</div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> ++num_not_processed;</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> target_prefix_size = i;</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> }</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <span class="keywordflow">if</span> (num_not_processed >= num_processed) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> }</div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="keywordflow">if</span> (num_not_processed == 0) <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> target_prefix_size = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(target_prefix_size, relevant_prefix_size);</div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> </div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="comment">// Once a prefix size has been decided, it is always better to</span></div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> <span class="comment">// enqueue the literal already processed first.</span></div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> std::stable_partition(literals->begin() + target_prefix_size, literals->end(),</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> [&processed](<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l) {</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> return gtl::ContainsKey(processed, l.Index());</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> <span class="keywordflow">return</span> target_prefix_size;</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span>}</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"><a class="line" href="classoperations__research_1_1sat_1_1_incremental_average.html#adf01dcbe31fa99f0a8f9d91ba9f85b8b"> 321</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_incremental_average.html#adf01dcbe31fa99f0a8f9d91ba9f85b8b">IncrementalAverage::Reset</a>(<span class="keywordtype">double</span> reset_value) {</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> num_records_ = 0;</div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> average_ = reset_value;</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span>}</div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> </div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_incremental_average.html#a198870bbc0f9b8d197a4c80f766ddf49"> 326</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_incremental_average.html#a198870bbc0f9b8d197a4c80f766ddf49">IncrementalAverage::AddData</a>(<span class="keywordtype">double</span> new_record) {</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> num_records_++;</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> average_ += (new_record - average_) / num_records_;</div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span>}</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"><a class="line" href="classoperations__research_1_1sat_1_1_exponential_moving_average.html#a198870bbc0f9b8d197a4c80f766ddf49"> 331</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_exponential_moving_average.html#a198870bbc0f9b8d197a4c80f766ddf49">ExponentialMovingAverage::AddData</a>(<span class="keywordtype">double</span> new_record) {</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> num_records_++;</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> average_ = (num_records_ == 1)</div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> ? new_record</div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> : (new_record + decaying_factor_ * (average_ - new_record));</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span>}</div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> </div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_percentile.html#adfcf2b433605c03210cbd06e28ce9d97"> 338</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_percentile.html#adfcf2b433605c03210cbd06e28ce9d97">Percentile::AddRecord</a>(<span class="keywordtype">double</span> record) {</div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> records_.push_front(record);</div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> <span class="keywordflow">if</span> (records_.size() > record_limit_) {</div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> records_.pop_back();</div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> }</div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span>}</div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> </div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_percentile.html#a006c3e4f212cee5414d510a9ded6eedb"> 345</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_percentile.html#a006c3e4f212cee5414d510a9ded6eedb">Percentile::GetPercentile</a>(<span class="keywordtype">double</span> percent) {</div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <a class="code hl_define" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(records_.size(), 0);</div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <a class="code hl_define" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(percent, 100.0);</div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(percent, 0.0);</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> std::vector<double> sorted_records(records_.begin(), records_.end());</div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> std::sort(sorted_records.begin(), sorted_records.end());</div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_records = sorted_records.size();</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> </div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> <span class="keyword">const</span> <span class="keywordtype">double</span> percentile_rank =</div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> <span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(num_records) * percent / 100.0 - 0.5;</div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <span class="keywordflow">if</span> (percentile_rank <= 0) {</div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> <span class="keywordflow">return</span> sorted_records.front();</div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (percentile_rank >= num_records - 1) {</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <span class="keywordflow">return</span> sorted_records.back();</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> }</div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> <span class="comment">// Interpolate.</span></div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(num_records, 2);</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(percentile_rank, num_records - 1);</div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> <span class="keyword">const</span> <span class="keywordtype">int</span> lower_rank = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(std::floor(percentile_rank));</div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(lower_rank, num_records - 1);</div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> <span class="keywordflow">return</span> sorted_records[lower_rank] +</div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> (percentile_rank - lower_rank) *</div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> (sorted_records[lower_rank + 1] - sorted_records[lower_rank]);</div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span>}</div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> </div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a3e5f39b52251ad02e571592493b4d39f"> 370</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a3e5f39b52251ad02e571592493b4d39f">CompressTuples</a>(absl::Span<const int64_t> domain_sizes, int64_t any_value,</div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> std::vector<std::vector<int64_t>>* tuples) {</div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> <span class="keywordflow">if</span> (tuples->empty()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> </div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> <span class="comment">// Remove duplicates if any.</span></div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> <a class="code hl_function" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(tuples);</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> </div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = (*tuples)[0].size();</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> </div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> std::vector<int> to_remove;</div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> std::vector<int64_t> tuple_minus_var_i(num_vars - 1);</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; ++i) {</div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> <span class="keyword">const</span> <span class="keywordtype">int</span> domain_size = domain_sizes[i];</div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> <span class="keywordflow">if</span> (domain_size == 1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> absl::flat_hash_map<const std::vector<int64_t>, std::vector<int>></div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> masked_tuples_to_indices;</div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < tuples->size(); ++t) {</div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> <span class="keywordtype">int</span> out = 0;</div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < num_vars; ++j) {</div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> <span class="keywordflow">if</span> (i == j) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> tuple_minus_var_i[out++] = (*tuples)[t][j];</div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> }</div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> masked_tuples_to_indices[tuple_minus_var_i].push_back(t);</div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> }</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> to_remove.clear();</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& it : masked_tuples_to_indices) {</div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> <span class="keywordflow">if</span> (it.second.size() != domain_size) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> (*tuples)[it.second.front()][i] = any_value;</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> to_remove.insert(to_remove.end(), it.second.begin() + 1, it.second.end());</div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> }</div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> std::sort(to_remove.begin(), to_remove.end(), std::greater<int>());</div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> t : to_remove) {</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> (*tuples)[t] = tuples->back();</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> tuples->pop_back();</div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> }</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> }</div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span>}</div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> </div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span>} <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span>} <span class="comment">// namespace operations_research</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="aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</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_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00707">base/logging.h:707</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00708">base/logging.h:708</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_ab25e01a2942b821d66371fc68d53f2eb"><div class="ttname"><a href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a></div><div class="ttdeci">#define CHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00704">base/logging.h:704</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_ae4db23f10f5d4aad6d735f5a74cd6f8c"><div class="ttname"><a href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a></div><div class="ttdeci">#define CHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00705">base/logging.h:705</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_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_1_math_util_html_a0cfaf8b139304c54e3403d4ffbd60157"><div class="ttname"><a href="classoperations__research_1_1_math_util.html#a0cfaf8b139304c54e3403d4ffbd60157">operations_research::MathUtil::CeilOfRatio</a></div><div class="ttdeci">static IntegralType CeilOfRatio(IntegralType numerator, IntegralType denominator)</div><div class="ttdef"><b>Definition:</b> <a href="mathutil_8h_source.html#l00039">mathutil.h:39</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_math_util_html_a9e5c13b72c36481ed098c05031d1f850"><div class="ttname"><a href="classoperations__research_1_1_math_util.html#a9e5c13b72c36481ed098c05031d1f850">operations_research::MathUtil::FloorOfRatio</a></div><div class="ttdeci">static IntegralType FloorOfRatio(IntegralType numerator, IntegralType denominator)</div><div class="ttdef"><b>Definition:</b> <a href="mathutil_8h_source.html#l00053">mathutil.h:53</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_exponential_moving_average_html_a198870bbc0f9b8d197a4c80f766ddf49"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_exponential_moving_average.html#a198870bbc0f9b8d197a4c80f766ddf49">operations_research::sat::ExponentialMovingAverage::AddData</a></div><div class="ttdeci">void AddData(double new_record)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00331">sat/util.cc:331</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_incremental_average_html_a198870bbc0f9b8d197a4c80f766ddf49"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_incremental_average.html#a198870bbc0f9b8d197a4c80f766ddf49">operations_research::sat::IncrementalAverage::AddData</a></div><div class="ttdeci">void AddData(double new_record)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00326">sat/util.cc:326</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_incremental_average_html_adf01dcbe31fa99f0a8f9d91ba9f85b8b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_incremental_average.html#adf01dcbe31fa99f0a8f9d91ba9f85b8b">operations_research::sat::IncrementalAverage::Reset</a></div><div class="ttdeci">void Reset(double reset_value)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00321">sat/util.cc:321</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#l00067">sat_base.h:67</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_percentile_html_a006c3e4f212cee5414d510a9ded6eedb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_percentile.html#a006c3e4f212cee5414d510a9ded6eedb">operations_research::sat::Percentile::GetPercentile</a></div><div class="ttdeci">double GetPercentile(double percent)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00345">sat/util.cc:345</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_percentile_html_adfcf2b433605c03210cbd06e28ce9d97"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_percentile.html#adfcf2b433605c03210cbd06e28ce9d97">operations_research::sat::Percentile::AddRecord</a></div><div class="ttdeci">void AddRecord(double record)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00338">sat/util.cc:338</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_acb18315d548212835cd8ed4287e6c0b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a></div><div class="ttdeci">int64_t a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00046">constraint_solver/table.cc:46</a></div></div>
|
|
<div class="ttc" id="acp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00119">cp_model_fz_solver.cc:119</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</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="amap__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="amathutil_8h_html"><div class="ttname"><a href="mathutil_8h.html">mathutil.h</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a288a1dc92da5d3ad62d4bc4cec9e8b1d"><div class="ttname"><a href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a></div><div class="ttdeci">void STLSortAndRemoveDuplicates(T *v, const LessFunc &less_func)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00058">stl_util.h:58</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_aae28e97bd1fa93cb0032642550da7455"><div class="ttname"><a href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a></div><div class="ttdeci">bool ContainsKey(const Collection &collection, const Key &key)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00200">map_util.h:200</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_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_1sat_html_a0441e1a54fe203c0707131e587de8fae"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0441e1a54fe203c0707131e587de8fae">operations_research::sat::RandomizeDecisionHeuristic</a></div><div class="ttdeci">void RandomizeDecisionHeuristic(absl::BitGenRef random, SatParameters *parameters)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00059">sat/util.cc:59</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a2269a7a6f3b17cbd10a8d8a3914d8b51"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2269a7a6f3b17cbd10a8d8a3914d8b51">operations_research::sat::ClosestMultiple</a></div><div class="ttdeci">int64_t ClosestMultiple(int64_t value, int64_t base)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00211">sat/util.cc:211</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3e5f39b52251ad02e571592493b4d39f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3e5f39b52251ad02e571592493b4d39f">operations_research::sat::CompressTuples</a></div><div class="ttdeci">void CompressTuples(absl::Span< const int64_t > domain_sizes, int64_t any_value, std::vector< std::vector< int64_t > > *tuples)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00370">sat/util.cc:370</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a629c989df2521428c30722f175874774"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a629c989df2521428c30722f175874774">operations_research::sat::PositiveMod</a></div><div class="ttdeci">int64_t PositiveMod(int64_t x, int64_t m)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00120">sat/util.cc:120</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a72e9fb9c1d4b0649782f8696e85cbbaa"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a72e9fb9c1d4b0649782f8696e85cbbaa">operations_research::sat::CeilSquareRoot</a></div><div class="ttdeci">int64_t CeilSquareRoot(int64_t a)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00203">sat/util.cc:203</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a852a51b53f6217d6bfd1aef455f53f8c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a852a51b53f6217d6bfd1aef455f53f8c">operations_research::sat::SolveDiophantineEquationOfSizeTwo</a></div><div class="ttdeci">bool SolveDiophantineEquationOfSizeTwo(int64_t &a, int64_t &b, int64_t &cte, int64_t &x0, int64_t &y0)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00147">sat/util.cc:147</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aa7497b495a7fbfddaea40d45861680c5"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa7497b495a7fbfddaea40d45861680c5">operations_research::sat::FloorSquareRoot</a></div><div class="ttdeci">int64_t FloorSquareRoot(int64_t a)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00194">sat/util.cc:194</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_abbbb4c91f9a3d6eb290709745f5b661c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#abbbb4c91f9a3d6eb290709745f5b661c">operations_research::sat::ModularInverse</a></div><div class="ttdeci">int64_t ModularInverse(int64_t x, int64_t m)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00087">sat/util.cc:87</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ac015d81b88379719f680eadc2aad1508"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac015d81b88379719f680eadc2aad1508">operations_research::sat::ProductWithModularInverse</a></div><div class="ttdeci">int64_t ProductWithModularInverse(int64_t coeff, int64_t mod, int64_t rhs)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00125">sat/util.cc:125</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ae1ffd76bca69ccb2e7b65dfe2cf76f2e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae1ffd76bca69ccb2e7b65dfe2cf76f2e">operations_research::sat::MoveOneUnprocessedLiteralLast</a></div><div class="ttdeci">int MoveOneUnprocessedLiteralLast(const absl::btree_set< LiteralIndex > &processed, int relevant_prefix_size, std::vector< Literal > *literals)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00282">sat/util.cc:282</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_af20de3e143682d110b863c2e9435f050"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#af20de3e143682d110b863c2e9435f050">operations_research::sat::LinearInequalityCanBeReducedWithClosestMultiple</a></div><div class="ttdeci">bool LinearInequalityCanBeReducedWithClosestMultiple(int64_t base, const std::vector< int64_t > &coeffs, const std::vector< int64_t > &lbs, const std::vector< int64_t > &ubs, int64_t rhs, int64_t *new_rhs)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00218">sat/util.cc:218</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="anamespaceoperations__research_html_aa64bf49d041052c7cb3f40f7496d7534"><div class="ttname"><a href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">operations_research::CapProd</a></div><div class="ttdeci">int64_t CapProd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00235">saturated_arithmetic.h:235</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="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
<div class="ttc" id="astl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</a></div></div>
|
|
<div class="ttc" id="astrong__integers_8h_html"><div class="ttname"><a href="strong__integers_8h.html">strong_integers.h</a></div></div>
|
|
<div class="ttc" id="avariable__and__expressions_8cc_html_a2091cd7d80fdd31762020bce86138587"><div class="ttname"><a href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a></div><div class="ttdeci">const double coeff</div><div class="ttdef"><b>Definition:</b> <a href="variable__and__expressions_8cc_source.html#l00105">variable_and_expressions.cc:105</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_2util_8cc.html">util.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|