131 lines
54 KiB
HTML
131 lines
54 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.8.15"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: fp_utils.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>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</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.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('fp__utils_8cc_source.html','');});
|
|
/* @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">fp_utils.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="fp__utils_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="fp__utils_8h.html">ortools/util/fp_utils.h</a>"</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <limits.h></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <stdint.h></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <cmath></span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <limits></span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <utility></span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "absl/base/casts.h"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "absl/base/internal/endian.h"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</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 name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="bitset_8h.html">ortools/util/bitset.h</a>"</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">namespace </span>{</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="keywordtype">void</span> ReorderAndCapTerms(<span class="keywordtype">double</span>* <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a>, <span class="keywordtype">double</span>* <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a>) {</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">if</span> (*<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a> > *<a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a>) <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(*<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a>, *<a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a>);</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keywordflow">if</span> (*<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a> > 0.0) *<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a> = 0.0;</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keywordflow">if</span> (*<a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a> < 0.0) *<a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a> = 0.0;</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> }</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> use_bounds></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#a46f21c3da23685e58b31d880b2144458">ComputeScalingErrors</a>(<span class="keyword">const</span> std::vector<double>& <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>,</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">const</span> std::vector<double>& lb,</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keyword">const</span> std::vector<double>& ub, <span class="keywordtype">double</span> scaling_factor,</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keywordtype">double</span>* <a class="code" href="sat_2lp__utils_8cc.html#a2a1a02478d02cd8e42a1afece079d4a2">max_relative_coeff_error</a>,</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordtype">double</span>* max_scaled_sum_error) {</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordtype">double</span> max_error = 0.0;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordtype">double</span> min_error = 0.0;</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  *<a class="code" href="sat_2lp__utils_8cc.html#a2a1a02478d02cd8e42a1afece079d4a2">max_relative_coeff_error</a> = 0.0;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>.size();</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> x = <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>[i];</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">if</span> (x == 0.0) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> scaled = x * scaling_factor;</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">if</span> (scaled == 0.0) {</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  *<a class="code" href="sat_2lp__utils_8cc.html#a2a1a02478d02cd8e42a1afece079d4a2">max_relative_coeff_error</a> = std::numeric_limits<double>::infinity();</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  *<a class="code" href="sat_2lp__utils_8cc.html#a2a1a02478d02cd8e42a1afece079d4a2">max_relative_coeff_error</a> = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  *<a class="code" href="sat_2lp__utils_8cc.html#a2a1a02478d02cd8e42a1afece079d4a2">max_relative_coeff_error</a>, std::abs(std::round(scaled) / scaled - 1));</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  }</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> error = std::round(scaled) - scaled;</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> error_lb = (use_bounds ? error * lb[i] : -error);</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> error_ub = (use_bounds ? error * ub[i] : error);</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  max_error += <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(error_lb, error_ub);</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  min_error += <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(error_lb, error_ub);</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  *max_scaled_sum_error = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(std::abs(max_error), std::abs(min_error));</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> }</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> use_bounds></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#aae3359f1c2367d44e5cf9be5d5abc89f">GetBestScalingOfDoublesToInt64</a>(<span class="keyword">const</span> std::vector<double>& <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>,</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keyword">const</span> std::vector<double>& lb,</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">const</span> std::vector<double>& ub,</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  int64_t max_absolute_sum,</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordtype">double</span>* scaling_factor) {</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">kInfinity</a> = std::numeric_limits<double>::infinity();</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// We start by initializing the returns value to the "error" state.</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  *scaling_factor = 0;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> </div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// Abort in the "error" state if max_absolute_sum doesn't make sense.</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">if</span> (max_absolute_sum < 0) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// Our scaling scaling_factor will be 2^factor_exponent.</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">//</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// TODO(user): Consider using a non-power of two factor if the error can't be</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">// zero? Note however that using power of two has the extra advantage that</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// subsequent int64_t -> double -> scaled back to int64_t will loose no extra</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// information.</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordtype">int</span> factor_exponent = 0;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  uint64_t sum_min = 0; <span class="comment">// negated.</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  uint64_t sum_max = 0;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordtype">bool</span> recompute_sum = <span class="keyword">false</span>;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordtype">bool</span> is_first_value = <span class="keyword">true</span>;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> msb = <a class="code" href="namespaceoperations__research.html#afa6ef9aef70f95b9d5bcee2c10937bc8">MostSignificantBitPosition64</a>(max_absolute_sum);</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>.size();</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> x = <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>[i];</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordtype">double</span> min_term = use_bounds ? x * lb[i] : -x;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordtype">double</span> max_term = use_bounds ? x * ub[i] : x;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  ReorderAndCapTerms(&min_term, &max_term);</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> </div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// If min_term or max_term is not finite, then abort in the "error" state.</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">if</span> (!(min_term > -<a class="code" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">kInfinity</a> && max_term < <a class="code" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">kInfinity</a>)) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> </div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// A value of zero can just be skipped (and needs to because the code below</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// doesn't handle it correctly).</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">if</span> (min_term == 0.0 && max_term == 0.0) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// Compute the greatest candidate such that</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">// round(fabs(c).2^candidate) <= max_absolute_sum.</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(-min_term, max_term);</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordtype">int</span> candidate = msb - ilogb(c);</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">if</span> (std::round(ldexp(std::abs(c), candidate)) > max_absolute_sum) {</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  --candidate;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(std::abs(static_cast<int64_t>(round(ldexp(c, candidate)))),</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  max_absolute_sum);</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// Update factor_exponent which is the min of all the candidates.</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">if</span> (is_first_value || candidate < factor_exponent) {</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  is_first_value = <span class="keyword">false</span>;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  factor_exponent = candidate;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  recompute_sum = <span class="keyword">true</span>;</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="comment">// Update the sum of absolute values of the numbers seen so far.</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  sum_min -=</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  static_cast<int64_t>(std::round(ldexp(min_term, factor_exponent)));</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  sum_max +=</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  static_cast<int64_t>(std::round(ldexp(max_term, factor_exponent)));</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">if</span> (sum_min > max_absolute_sum || sum_max > max_absolute_sum) {</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  factor_exponent--;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  recompute_sum = <span class="keyword">true</span>;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  }</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// TODO(user): This is not super efficient, but note that in practice we</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// will only scan the vector of values about log(size) times. It is possible</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// to maintain an upper bound on the abs_sum in linear time instead, but the</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="comment">// code and corner cases are a lot more involved. Also, we currently only</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// use this code in situations where its run-time is negligeable compared to</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// the rest.</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">while</span> (recompute_sum) {</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  sum_min = 0;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  sum_max = 0;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j <= i; ++j) {</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> x = <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>[j];</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordtype">double</span> min_term = use_bounds ? x * lb[j] : -x;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordtype">double</span> max_term = use_bounds ? x * ub[j] : x;</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  ReorderAndCapTerms(&min_term, &max_term);</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  sum_min -=</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  static_cast<int64_t>(std::round(ldexp(min_term, factor_exponent)));</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  sum_max +=</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  static_cast<int64_t>(std::round(ldexp(max_term, factor_exponent)));</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">if</span> (sum_min > max_absolute_sum || sum_max > max_absolute_sum) {</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  factor_exponent--;</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  recompute_sum = <span class="keyword">false</span>;</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  }</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  *scaling_factor = ldexp(1.0, factor_exponent);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> }</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> </div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00170"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a46f21c3da23685e58b31d880b2144458"> 170</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#a46f21c3da23685e58b31d880b2144458">ComputeScalingErrors</a>(<span class="keyword">const</span> std::vector<double>& <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>,</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keyword">const</span> std::vector<double>& lb,</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keyword">const</span> std::vector<double>& ub, <span class="keywordtype">double</span> scaling_factor,</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordtype">double</span>* <a class="code" href="sat_2lp__utils_8cc.html#a2a1a02478d02cd8e42a1afece079d4a2">max_relative_coeff_error</a>,</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordtype">double</span>* max_scaled_sum_error) {</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  ComputeScalingErrors<true>(<a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>, lb, ub, scaling_factor,</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <a class="code" href="sat_2lp__utils_8cc.html#a2a1a02478d02cd8e42a1afece079d4a2">max_relative_coeff_error</a>, max_scaled_sum_error);</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> }</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#aae3359f1c2367d44e5cf9be5d5abc89f"> 179</a></span> <span class="keywordtype">double</span> <a class="code" href="namespaceoperations__research.html#aae3359f1c2367d44e5cf9be5d5abc89f">GetBestScalingOfDoublesToInt64</a>(<span class="keyword">const</span> std::vector<double>& <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>,</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keyword">const</span> std::vector<double>& lb,</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keyword">const</span> std::vector<double>& ub,</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  int64_t max_absolute_sum) {</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordtype">double</span> scaling_factor;</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  GetBestScalingOfDoublesToInt64<true>(<a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>, lb, ub, max_absolute_sum,</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  &scaling_factor);</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">return</span> scaling_factor;</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> }</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> </div><div class="line"><a name="l00189"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a7cc8b704d0f858f38ad0851bc1b9d478"> 189</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#aae3359f1c2367d44e5cf9be5d5abc89f">GetBestScalingOfDoublesToInt64</a>(<span class="keyword">const</span> std::vector<double>& <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>,</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  int64_t max_absolute_sum,</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordtype">double</span>* scaling_factor,</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordtype">double</span>* <a class="code" href="sat_2lp__utils_8cc.html#a2a1a02478d02cd8e42a1afece079d4a2">max_relative_coeff_error</a>) {</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordtype">double</span> max_scaled_sum_error;</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  GetBestScalingOfDoublesToInt64<false>(<a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>, {}, {}, max_absolute_sum,</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  scaling_factor);</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  ComputeScalingErrors<false>(<a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>, {}, {}, *scaling_factor,</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <a class="code" href="sat_2lp__utils_8cc.html#a2a1a02478d02cd8e42a1afece079d4a2">max_relative_coeff_error</a>, &max_scaled_sum_error);</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> }</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div><div class="line"><a name="l00200"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#aae2e6ed909e0cd5f240b885800f55c87"> 200</a></span> int64_t <a class="code" href="namespaceoperations__research.html#aae2e6ed909e0cd5f240b885800f55c87">ComputeGcdOfRoundedDoubles</a>(<span class="keyword">const</span> std::vector<double>& x,</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordtype">double</span> scaling_factor) {</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  int64_t gcd = 0;</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < x.size() && gcd != 1; ++i) {</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = std::abs(std::round(x[i] * scaling_factor));</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, 0);</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == 0) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">if</span> (gcd == 0) {</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  gcd = <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  }</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">// GCD(gcd, value) = GCD(value, gcd % value);</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">while</span> (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> != 0) {</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">const</span> int64_t r = gcd % <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  gcd = <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = r;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  }</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  }</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(gcd, 0);</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">return</span> gcd > 0 ? gcd : 1;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> }</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> </div><div class="line"><a name="l00222"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a01cc8a711d189115758c50170038904f"> 222</a></span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research.html#a01cc8a711d189115758c50170038904f">fast_ilogb</a>(<span class="keywordtype">double</span> <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  static_assert(CHAR_BIT == 8);</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  static_assert(<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>) == 8);</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="comment">// Get little-endian bit-representation of the floating point value.</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keyword">const</span> uint64_t bit_rep =</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  absl::little_endian::FromHost64(absl::bit_cast<uint64_t>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>));</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">return</span> static_cast<int>((bit_rep >> 52) & 0x7FF) - 1023;</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> }</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> </div><div class="line"><a name="l00231"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a5c5a3f603ad3ee0c6e6d6c70fcd54219"> 231</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#a5c5a3f603ad3ee0c6e6d6c70fcd54219">fast_scalbn_inplace</a>(<span class="keywordtype">double</span>& mutable_value, <span class="keywordtype">int</span> exponent) {</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  mutable_value = <a class="code" href="namespaceoperations__research.html#a5550c9e9dfe6d29df888acafa85c790e">fast_scalbn</a>(mutable_value, exponent);</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> }</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div><div class="line"><a name="l00235"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a5550c9e9dfe6d29df888acafa85c790e"> 235</a></span> <span class="keywordtype">double</span> <a class="code" href="namespaceoperations__research.html#a5550c9e9dfe6d29df888acafa85c790e">fast_scalbn</a>(<span class="keywordtype">double</span> <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, <span class="keywordtype">int</span> exponent) {</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == 0.0) <span class="keywordflow">return</span> 0.0;</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  uint64_t bit_rep =</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  absl::little_endian::FromHost64(absl::bit_cast<uint64_t>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>));</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">// Binary representation is: (sign-bit)(11 exponent bits)(52 mantissa bits)</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  constexpr uint64_t kExponentMask(0x7FF0000000000000);</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">// This addition relies on the fact that signed numbers are written in</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">// two-s complement, and is correct as long as the sum does not</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="comment">// overflow/underflow the result.</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">const</span> uint64_t value_exponent =</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  (bit_rep + (static_cast<uint64_t>(exponent) << 52)) & kExponentMask;</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  bit_rep &= ~kExponentMask;</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  bit_rep |= value_exponent;</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">return</span> absl::bit_cast<double>(absl::little_endian::ToHost64(bit_rep));</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> }</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> </div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="namespaceoperations__research_html_a5c5a3f603ad3ee0c6e6d6c70fcd54219"><div class="ttname"><a href="namespaceoperations__research.html#a5c5a3f603ad3ee0c6e6d6c70fcd54219">operations_research::fast_scalbn_inplace</a></div><div class="ttdeci">void fast_scalbn_inplace(double &mutable_value, int exponent)</div><div class="ttdef"><b>Definition:</b> <a href="fp__utils_8cc_source.html#l00231">fp_utils.cc:231</a></div></div>
|
|
<div class="ttc" id="alldiff__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="namespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap< K, V > &a, IdMap< K, V > &b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00263">id_map.h:263</a></div></div>
|
|
<div class="ttc" id="fp__utils_8h_html"><div class="ttname"><a href="fp__utils_8h.html">fp_utils.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a46f21c3da23685e58b31d880b2144458"><div class="ttname"><a href="namespaceoperations__research.html#a46f21c3da23685e58b31d880b2144458">operations_research::ComputeScalingErrors</a></div><div class="ttdeci">void ComputeScalingErrors(const std::vector< double > &input, const std::vector< double > &lb, const std::vector< double > &ub, double scaling_factor, double *max_relative_coeff_error, double *max_scaled_sum_error)</div><div class="ttdef"><b>Definition:</b> <a href="fp__utils_8cc_source.html#l00170">fp_utils.cc:170</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_aae3359f1c2367d44e5cf9be5d5abc89f"><div class="ttname"><a href="namespaceoperations__research.html#aae3359f1c2367d44e5cf9be5d5abc89f">operations_research::GetBestScalingOfDoublesToInt64</a></div><div class="ttdeci">double GetBestScalingOfDoublesToInt64(const std::vector< double > &input, const std::vector< double > &lb, const std::vector< double > &ub, int64_t max_absolute_sum)</div><div class="ttdef"><b>Definition:</b> <a href="fp__utils_8cc_source.html#l00179">fp_utils.cc:179</a></div></div>
|
|
<div class="ttc" id="sat_2lp__utils_8cc_html_a2a1a02478d02cd8e42a1afece079d4a2"><div class="ttname"><a href="sat_2lp__utils_8cc.html#a2a1a02478d02cd8e42a1afece079d4a2">max_relative_coeff_error</a></div><div class="ttdeci">double max_relative_coeff_error</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l00593">sat/lp_utils.cc:593</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a5550c9e9dfe6d29df888acafa85c790e"><div class="ttname"><a href="namespaceoperations__research.html#a5550c9e9dfe6d29df888acafa85c790e">operations_research::fast_scalbn</a></div><div class="ttdeci">double fast_scalbn(double value, int exponent)</div><div class="ttdef"><b>Definition:</b> <a href="fp__utils_8cc_source.html#l00235">fp_utils.cc:235</a></div></div>
|
|
<div class="ttc" id="integral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="alldiff__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="namespaceoperations__research_html_afa6ef9aef70f95b9d5bcee2c10937bc8"><div class="ttname"><a href="namespaceoperations__research.html#afa6ef9aef70f95b9d5bcee2c10937bc8">operations_research::MostSignificantBitPosition64</a></div><div class="ttdeci">int MostSignificantBitPosition64(uint64_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00231">bitset.h:231</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_aae2e6ed909e0cd5f240b885800f55c87"><div class="ttname"><a href="namespaceoperations__research.html#aae2e6ed909e0cd5f240b885800f55c87">operations_research::ComputeGcdOfRoundedDoubles</a></div><div class="ttdeci">int64_t ComputeGcdOfRoundedDoubles(const std::vector< double > &x, double scaling_factor)</div><div class="ttdef"><b>Definition:</b> <a href="fp__utils_8cc_source.html#l00200">fp_utils.cc:200</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1glop_html_af9a790b7e8c5b0c6d55b336177378e78"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">operations_research::glop::kInfinity</a></div><div class="ttdeci">const double kInfinity</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00084">lp_types.h:84</a></div></div>
|
|
<div class="ttc" id="parser_8yy_8cc_html_a5a634cf4429798b1c921a81de8250051"><div class="ttname"><a href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a></div><div class="ttdeci">static int input(yyscan_t yyscanner)</div></div>
|
|
<div class="ttc" id="base_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#l00894">base/logging.h:894</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="base_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#l00892">base/logging.h:892</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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="bitset_8h_html"><div class="ttname"><a href="bitset_8h.html">bitset.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a01cc8a711d189115758c50170038904f"><div class="ttname"><a href="namespaceoperations__research.html#a01cc8a711d189115758c50170038904f">operations_research::fast_ilogb</a></div><div class="ttdeci">int fast_ilogb(double value)</div><div class="ttdef"><b>Definition:</b> <a href="fp__utils_8cc_source.html#l00222">fp_utils.cc:222</a></div></div>
|
|
<div class="ttc" id="demon__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><!-- 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_a3328a0ea67a2aaa160c2783ffbaa5dc.html">util</a></li><li class="navelem"><a class="el" href="fp__utils_8cc.html">fp_utils.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.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|