278 lines
37 KiB
HTML
278 lines
37 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.2"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: 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.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.2 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('sat_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> </div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</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="l00021" name="l00021"></a><span class="lineno"> 21</span> </div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> </div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a2ef3eb1f5fe6506a5e24115f10d724fc"> 25</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2ef3eb1f5fe6506a5e24115f10d724fc">MoveOneUnprocessedLiteralLast</a>(<span class="keyword">const</span> std::set<LiteralIndex>& processed,</div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> <span class="keywordtype">int</span> relevant_prefix_size,</div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> std::vector<Literal>* literals) {</div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> <span class="keywordflow">if</span> (literals->empty()) <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</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="l00030" name="l00030"></a><span class="lineno"> 30</span> <span class="keywordflow">return</span> std::min<int>(relevant_prefix_size, literals->size());</div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> }</div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> </div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// To get O(n log n) size of suffixes, we will first process the last n/2</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</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="l00035" name="l00035"></a><span class="lineno"> 35</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="l00036" name="l00036"></a><span class="lineno"> 36</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="l00037" name="l00037"></a><span class="lineno"> 37</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="l00038" name="l00038"></a><span class="lineno"> 38</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="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// of literals is preserved).</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keywordtype">int</span> num_processed = 0;</div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keywordtype">int</span> num_not_processed = 0;</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keywordtype">int</span> target_prefix_size = literals->size() - 1;</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = literals->size() - 1; i >= 0; i--) {</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</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="l00045" name="l00045"></a><span class="lineno"> 45</span> ++num_processed;</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> ++num_not_processed;</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> target_prefix_size = i;</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> }</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordflow">if</span> (num_not_processed >= num_processed) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> }</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keywordflow">if</span> (num_not_processed == 0) <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</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="l00054" name="l00054"></a><span class="lineno"> 54</span> </div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// Once a prefix size has been decided, it is always better to</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// enqueue the literal already processed first.</span></div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> std::stable_partition(literals->begin() + target_prefix_size, literals->end(),</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</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="l00059" name="l00059"></a><span class="lineno"> 59</span> return gtl::ContainsKey(processed, l.Index());</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> });</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keywordflow">return</span> target_prefix_size;</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span>}</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> </div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_incremental_average.html#adf01dcbe31fa99f0a8f9d91ba9f85b8b"> 64</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="l00065" name="l00065"></a><span class="lineno"> 65</span> num_records_ = 0;</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> average_ = reset_value;</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span>}</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> </div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_incremental_average.html#a198870bbc0f9b8d197a4c80f766ddf49"> 69</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="l00070" name="l00070"></a><span class="lineno"> 70</span> num_records_++;</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> average_ += (new_record - average_) / num_records_;</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span>}</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> </div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_exponential_moving_average.html#a198870bbc0f9b8d197a4c80f766ddf49"> 74</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="l00075" name="l00075"></a><span class="lineno"> 75</span> num_records_++;</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> average_ = (num_records_ == 1)</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> ? new_record</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> : (new_record + decaying_factor_ * (average_ - new_record));</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span>}</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> </div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_percentile.html#adfcf2b433605c03210cbd06e28ce9d97"> 81</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="l00082" name="l00082"></a><span class="lineno"> 82</span> records_.push_front(record);</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordflow">if</span> (records_.size() > record_limit_) {</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> records_.pop_back();</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> }</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span>}</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> </div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_percentile.html#a006c3e4f212cee5414d510a9ded6eedb"> 88</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="l00089" name="l00089"></a><span class="lineno"> 89</span> <a class="code hl_define" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(records_.size(), 0);</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <a class="code hl_define" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(percent, 100.0);</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(percent, 0.0);</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> std::vector<double> sorted_records(records_.begin(), records_.end());</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> std::sort(sorted_records.begin(), sorted_records.end());</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_records = sorted_records.size();</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> </div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keyword">const</span> <span class="keywordtype">double</span> percentile_rank =</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</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="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keywordflow">if</span> (percentile_rank <= 0) {</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">return</span> sorted_records.front();</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (percentile_rank >= num_records - 1) {</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keywordflow">return</span> sorted_records.back();</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> }</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// Interpolate.</span></div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(num_records, 2);</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</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="l00106" name="l00106"></a><span class="lineno"> 106</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="l00107" name="l00107"></a><span class="lineno"> 107</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="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordflow">return</span> sorted_records[lower_rank] +</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> (percentile_rank - lower_rank) *</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> (sorted_records[lower_rank + 1] - sorted_records[lower_rank]);</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span>}</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"><a class="line" href="namespaceoperations__research_1_1sat.html#a3e5f39b52251ad02e571592493b4d39f"> 113</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="l00114" name="l00114"></a><span class="lineno"> 114</span> std::vector<std::vector<int64_t>>* tuples) {</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="keywordflow">if</span> (tuples->empty()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> </div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// Remove duplicates if any.</span></div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <a class="code hl_function" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(tuples);</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"> 120</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = (*tuples)[0].size();</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> </div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> std::vector<int> to_remove;</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> std::vector<int64_t> tuple_minus_var_i(num_vars - 1);</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; ++i) {</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keyword">const</span> <span class="keywordtype">int</span> domain_size = domain_sizes[i];</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordflow">if</span> (domain_size == 1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> absl::flat_hash_map<const std::vector<int64_t>, std::vector<int>></div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> masked_tuples_to_indices;</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < tuples->size(); ++t) {</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="keywordtype">int</span> out = 0;</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < num_vars; ++j) {</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="keywordflow">if</span> (i == j) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> tuple_minus_var_i[out++] = (*tuples)[t][j];</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> }</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> masked_tuples_to_indices[tuple_minus_var_i].push_back(t);</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> to_remove.clear();</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</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="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="keywordflow">if</span> (it.second.size() != domain_size) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> (*tuples)[it.second.front()][i] = any_value;</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> to_remove.insert(to_remove.end(), it.second.begin() + 1, it.second.end());</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> }</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> std::sort(to_remove.begin(), to_remove.end(), std::greater<int>());</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</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="l00145" name="l00145"></a><span class="lineno"> 145</span> (*tuples)[t] = tuples->back();</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> tuples->pop_back();</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> }</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> }</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span>}</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> </div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span>} <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span>} <span class="comment">// namespace operations_research</span></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_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#l00702">base/logging.h:702</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#l00703">base/logging.h:703</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#l00890">base/logging.h:890</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#l00889">base/logging.h:889</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#l00700">base/logging.h:700</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#l00074">sat/util.cc:74</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#l00069">sat/util.cc:69</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#l00064">sat/util.cc:64</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00065">sat_base.h:65</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_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#l00088">sat/util.cc:88</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#l00081">sat/util.cc:81</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_a2ef3eb1f5fe6506a5e24115f10d724fc"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2ef3eb1f5fe6506a5e24115f10d724fc">operations_research::sat::MoveOneUnprocessedLiteralLast</a></div><div class="ttdeci">int MoveOneUnprocessedLiteralLast(const std::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#l00025">sat/util.cc:25</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#l00113">sat/util.cc:113</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="asat_2util_8h_html"><div class="ttname"><a href="sat_2util_8h.html">util.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><!-- 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.2 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|