136 lines
76 KiB
HTML
136 lines
76 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: deviation.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('deviation_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">deviation.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="deviation_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 <algorithm></span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <cstdlib></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <memory></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <string></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "absl/strings/str_format.h"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</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="l00023"></a><span class="lineno"> 23</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="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="mathutil_8h.html">ortools/base/mathutil.h</a>"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="constraint__solver_8h.html">ortools/constraint_solver/constraint_solver.h</a>"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="string__array_8h.html">ortools/util/string_array.h</a>"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// Deviation Constraint, a constraint for the average absolute</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// deviation to the mean. See paper: Bound Consistent Deviation</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// Constraint, Pierre Schaus et. al., CP07</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">namespace </span>{</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">class </span>Deviation : <span class="keyword">public</span> Constraint {</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  Deviation(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  IntVar* <span class="keyword">const</span> deviation_var, int64_t total_sum)</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  : Constraint(solver),</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  size_(vars.size()),</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  deviation_var_(deviation_var),</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  total_sum_(total_sum),</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  scaled_vars_assigned_value_(new int64_t[size_]),</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  scaled_vars_min_(new int64_t[size_]),</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  scaled_vars_max_(new int64_t[size_]),</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  scaled_sum_max_(0),</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  scaled_sum_min_(0),</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  maximum_(new int64_t[size_]),</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  overlaps_sup_(new int64_t[size_]),</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  active_sum_(0),</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  active_sum_rounded_down_(0),</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  active_sum_rounded_up_(0),</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  active_sum_nearest_(0) {</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(deviation_var != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  }</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>  ~Deviation()<span class="keyword"> override </span>{}</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  Solver* <span class="keyword">const</span> s = solver();</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  Demon* <span class="keyword">const</span> demon = s->MakeConstraintInitialPropagateCallback(<span class="keyword">this</span>);</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->WhenRange(demon);</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  }</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  deviation_var_->WhenRange(demon);</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  s->AddConstraint(s->MakeSumEquality(vars_, total_sum_));</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  }</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> </div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">const</span> int64_t delta_min = BuildMinimalDeviationAssignment();</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  deviation_var_->SetMin(delta_min);</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  PropagateBounds(delta_min);</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  }</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> </div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  std::string DebugString()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"Deviation([%s], deviation_var = %s, sum = %d)"</span>,</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(vars_, <span class="stringliteral">", "</span>),</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  deviation_var_->DebugString(), total_sum_);</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  }</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="keywordtype">void</span> Accept(ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  visitor->BeginVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a1c55ff9b92db1e630507e03f5342dbe4">ModelVisitor::kDeviation</a>, <span class="keyword">this</span>);</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  visitor->VisitIntegerVariableArrayArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">ModelVisitor::kVarsArgument</a>,</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  vars_);</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  visitor->VisitIntegerExpressionArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a489f38dd601db8d045efae4d9ae7d754">ModelVisitor::kTargetArgument</a>,</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  deviation_var_);</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  visitor->VisitIntegerArgument(<a class="code" href="classoperations__research_1_1_model_visitor.html#a7899dfe8b41c6b2b13546d921114f8d2">ModelVisitor::kValueArgument</a>, total_sum_);</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  visitor->EndVisitConstraint(<a class="code" href="classoperations__research_1_1_model_visitor.html#a1c55ff9b92db1e630507e03f5342dbe4">ModelVisitor::kDeviation</a>, <span class="keyword">this</span>);</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// Builds an assignment with minimal deviation and assign it to</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// scaled_vars_assigned_value_. It returns the minimal deviation:</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// sum_i |scaled_vars_assigned_value_[i] - total_sum_|.</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  int64_t BuildMinimalDeviationAssignment() {</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  RepairGreedySum(BuildGreedySum(<span class="keyword">true</span>));</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  int64_t minimal_deviation = 0;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  minimal_deviation +=</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  std::abs(scaled_vars_assigned_value_[i] - total_sum_);</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">return</span> minimal_deviation;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> </div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// Propagates the upper and lower bounds of x[i]'s.</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// It assumes the constraint is consistent:</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// - the sum constraint is consistent</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// - min deviation smaller than max allowed deviation</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// min_delta is the minimum possible deviation</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordtype">void</span> PropagateBounds(int64_t min_delta) {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  PropagateBounds(min_delta, <span class="keyword">true</span>); <span class="comment">// Filter upper bounds.</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  PropagateBounds(min_delta, <span class="keyword">false</span>); <span class="comment">// Filter lower bounds.</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">// Prunes the upper/lower-bound of vars. We apply a mirroing of the</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// domains wrt 0 to prune the lower bounds such that we can use the</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">// same algo to prune both sides of the domains. upperBounds = true</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// to prune the upper bounds of vars, false to prune the lower</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="comment">// bounds.</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordtype">void</span> PropagateBounds(int64_t min_delta, <span class="keywordtype">bool</span> <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// Builds greedy assignment.</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">const</span> int64_t greedy_sum = BuildGreedySum(<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// Repairs assignment and store information to be used when pruning.</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  RepairSumAndComputeInfo(greedy_sum);</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// Does the actual pruning.</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  PruneVars(min_delta, <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  }</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="comment">// Cache min and max values of variables.</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordtype">void</span> ComputeData(<span class="keywordtype">bool</span> <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  scaled_sum_max_ = 0;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  scaled_sum_min_ = 0;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  scaled_vars_max_[i] =</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  size_ * (<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> ? <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max() : -<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min());</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  scaled_vars_min_[i] =</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  size_ * (<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> ? <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Min() : -<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i]->Max());</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  scaled_sum_max_ += scaled_vars_max_[i];</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  scaled_sum_min_ += scaled_vars_min_[i];</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  }</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  active_sum_ = (!<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> ? -total_sum_ : total_sum_);</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// down is <= sum.</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  active_sum_rounded_down_ =</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  size_ * MathUtil::FloorOfRatio<int64_t>(active_sum_, size_);</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// up is > sum, always.</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  active_sum_rounded_up_ = active_sum_rounded_down_ + size_;</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  active_sum_nearest_ = (active_sum_rounded_up_ - active_sum_ <=</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  active_sum_ - active_sum_rounded_down_)</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  ? active_sum_rounded_up_</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  : active_sum_rounded_down_;</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  }</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">// Builds an approximate sum in a greedy way.</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  int64_t BuildGreedySum(<span class="keywordtype">bool</span> <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// Update data structure.</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  ComputeData(<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> </div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">// Number of constraint should be consistent.</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(size_ * active_sum_, scaled_sum_min_);</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(size_ * active_sum_, scaled_sum_max_);</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> </div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  int64_t sum = 0;</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// Greedily assign variable to nearest value to average.</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  overlaps_.clear();</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">if</span> (scaled_vars_min_[i] >= active_sum_) {</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  scaled_vars_assigned_value_[i] = scaled_vars_min_[i];</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (scaled_vars_max_[i] <= active_sum_) {</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  scaled_vars_assigned_value_[i] = scaled_vars_max_[i];</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// Overlapping variable scaled_vars_min_[i] < active_sum_ <</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// scaled_vars_max_[i].</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  scaled_vars_assigned_value_[i] = active_sum_nearest_;</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">if</span> (active_sum_ % size_ != 0) {</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  overlaps_.push_back(i);</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  }</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  }</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  sum += scaled_vars_assigned_value_[i];</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  }</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, active_sum_rounded_down_ % size_);</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(active_sum_rounded_down_, active_sum_);</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(active_sum_ - active_sum_rounded_down_, size_);</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> </div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordflow">return</span> sum;</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  }</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> </div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordtype">bool</span> Overlap(<span class="keywordtype">int</span> var_index)<span class="keyword"> const </span>{</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">return</span> scaled_vars_min_[var_index] < active_sum_ &&</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  scaled_vars_max_[var_index] > active_sum_;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  }</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> </div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// Repairs the greedy sum obtained above to get the correct sum.</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordtype">void</span> RepairGreedySum(int64_t greedy_sum) {</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">// Useful constant: scaled version of the sum.</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">const</span> int64_t scaled_total_sum = size_ * active_sum_;</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="comment">// Step used to make the repair.</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keyword">const</span> int64_t <a class="code" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a> = greedy_sum > scaled_total_sum ? -size_ : size_;</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// Change overlapping variables as long as the sum is not</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// satisfied and there are overlapping vars, we use that ones to</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">// repair.</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < overlaps_.size() && greedy_sum != scaled_total_sum;</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  j++) {</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  scaled_vars_assigned_value_[overlaps_[j]] += <a class="code" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>;</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  greedy_sum += <a class="code" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>;</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  }</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// Change other variables if the sum is still not satisfied.</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_ && greedy_sum != scaled_total_sum; ++i) {</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keyword">const</span> int64_t old_scaled_vars_i = scaled_vars_assigned_value_[i];</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">if</span> (greedy_sum < scaled_total_sum) {</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="comment">// Increase scaled_vars_assigned_value_[i] as much as</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">// possible to fix the too low sum.</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  scaled_vars_assigned_value_[i] += scaled_total_sum - greedy_sum;</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  scaled_vars_assigned_value_[i] =</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(scaled_vars_assigned_value_[i], scaled_vars_max_[i]);</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">// Decrease scaled_vars_assigned_value_[i] as much as</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// possible to fix the too high sum.</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  scaled_vars_assigned_value_[i] -= (greedy_sum - scaled_total_sum);</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  scaled_vars_assigned_value_[i] =</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(scaled_vars_assigned_value_[i], scaled_vars_min_[i]);</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  }</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// Maintain the sum.</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  greedy_sum += scaled_vars_assigned_value_[i] - old_scaled_vars_i;</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> </div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="comment">// Computes the maximum values of variables in the case the repaired</span></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">// greedy sum is actually the active sum.</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordtype">void</span> ComputeMaxWhenNoRepair() {</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordtype">int</span> num_overlap_sum_rounded_up = 0;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">if</span> (active_sum_nearest_ == active_sum_rounded_up_) {</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  num_overlap_sum_rounded_up = overlaps_.size();</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>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  maximum_[i] = scaled_vars_assigned_value_[i];</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">if</span> (Overlap(i) && active_sum_nearest_ == active_sum_rounded_up_ &&</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  active_sum_ % size_ != 0) {</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  overlaps_sup_[i] = num_overlap_sum_rounded_up - 1;</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  overlaps_sup_[i] = num_overlap_sum_rounded_up;</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  }</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  }</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  }</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> </div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="comment">// Returns the number of variables overlapping the average value,</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// assigned to // the average value rounded up that we can/need to</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="comment">// move.</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordtype">int</span> ComputeNumOverlapsVariableRoundedUp() {</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">if</span> (active_sum_ % size_ == 0) {</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  }</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordtype">int</span> num_overlap_sum_rounded_up = 0;</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">if</span> (scaled_vars_assigned_value_[i] > scaled_vars_min_[i] &&</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  scaled_vars_assigned_value_[i] == active_sum_rounded_up_) {</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  num_overlap_sum_rounded_up++;</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  }</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">return</span> num_overlap_sum_rounded_up;</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> </div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">// Returns whether we can push the greedy sum across the scaled</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">// total sum in the same direction as going from the nearest rounded</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// sum to the farthest one.</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordtype">bool</span> CanPushSumAcrossMean(int64_t greedy_sum,</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  int64_t scaled_total_sum)<span class="keyword"> const </span>{</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">return</span> (greedy_sum > scaled_total_sum &&</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  active_sum_nearest_ == active_sum_rounded_up_) ||</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  (greedy_sum < scaled_total_sum &&</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  active_sum_nearest_ == active_sum_rounded_down_);</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  }</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> </div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="comment">// Repairs the sum and store intermediate information to be used</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">// during pruning.</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordtype">void</span> RepairSumAndComputeInfo(int64_t greedy_sum) {</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keyword">const</span> int64_t scaled_total_sum = size_ * active_sum_;</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">// Computation of key values for the pruning:</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// - overlaps_sup_</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="comment">// - maximum_[i]</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">if</span> (greedy_sum == scaled_total_sum) { <span class="comment">// No repair needed.</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  ComputeMaxWhenNoRepair();</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  } <span class="keywordflow">else</span> { <span class="comment">// Repair and compute maximums.</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">// Try to repair the sum greedily.</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">if</span> (CanPushSumAcrossMean(greedy_sum, scaled_total_sum)) {</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">const</span> int64_t <a class="code" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a> = greedy_sum > scaled_total_sum ? -size_ : size_;</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < overlaps_.size() && greedy_sum != scaled_total_sum;</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  ++j) {</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  scaled_vars_assigned_value_[overlaps_[j]] += <a class="code" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  greedy_sum += <a class="code" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>;</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  }</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> </div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_overlap_sum_rounded_up =</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  ComputeNumOverlapsVariableRoundedUp();</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> </div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">if</span> (greedy_sum == scaled_total_sum) {</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// Greedy sum is repaired.</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">if</span> (Overlap(i) && num_overlap_sum_rounded_up > 0) {</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  maximum_[i] = active_sum_rounded_up_;</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  overlaps_sup_[i] = num_overlap_sum_rounded_up - 1;</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  maximum_[i] = scaled_vars_assigned_value_[i];</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  overlaps_sup_[i] = num_overlap_sum_rounded_up;</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  }</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  }</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (greedy_sum > scaled_total_sum) {</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="comment">// scaled_vars_assigned_value_[i] = active_sum_rounded_down_ or</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="comment">// scaled_vars_assigned_value_[i] <= total_sum</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">// (there is no more num_overlap_sum_rounded_up).</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  maximum_[i] = scaled_vars_assigned_value_[i];</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  overlaps_sup_[i] = 0;</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  }</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  } <span class="keywordflow">else</span> { <span class="comment">// greedy_sum < scaled_total_sum.</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size_; ++i) {</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">if</span> (Overlap(i) && num_overlap_sum_rounded_up > 0) {</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  overlaps_sup_[i] = num_overlap_sum_rounded_up - 1;</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  overlaps_sup_[i] = num_overlap_sum_rounded_up;</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  }</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> </div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">if</span> (scaled_vars_assigned_value_[i] < scaled_vars_max_[i]) {</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  maximum_[i] =</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  scaled_vars_assigned_value_[i] + scaled_total_sum - greedy_sum;</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  maximum_[i] = scaled_vars_assigned_value_[i];</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  }</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  }</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  }</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  }</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  }</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> </div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="comment">// Propagates onto variables with all computed data.</span></div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordtype">void</span> PruneVars(int64_t min_delta, <span class="keywordtype">bool</span> <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="comment">// Pruning of upper bound of vars_[i] for var_index in [1..n].</span></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keyword">const</span> int64_t increase_down_up = (active_sum_rounded_up_ - active_sum_) -</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  (active_sum_ - active_sum_rounded_down_);</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> var_index = 0; var_index < size_; ++var_index) {</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">// Not bound, and a compatible new max.</span></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">if</span> (scaled_vars_max_[var_index] != scaled_vars_min_[var_index] &&</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  maximum_[var_index] < scaled_vars_max_[var_index]) {</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keyword">const</span> int64_t new_max =</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  ComputeNewMax(var_index, min_delta, increase_down_up);</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  PruneBound(var_index, new_max, <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  }</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  }</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  }</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span> </div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="comment">// Computes new max for a variable.</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  int64_t ComputeNewMax(<span class="keywordtype">int</span> var_index, int64_t min_delta,</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  int64_t increase_down_up) {</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  int64_t maximum_value = maximum_[var_index];</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  int64_t current_min_delta = min_delta;</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> </div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">if</span> (overlaps_sup_[var_index] > 0 &&</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  (current_min_delta +</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  overlaps_sup_[var_index] * (size_ - increase_down_up) >=</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  deviation_var_->Max())) {</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keyword">const</span> int64_t <a class="code" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a> = deviation_var_->Max() - current_min_delta;</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  maximum_value += (size_ * <a class="code" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>) / (size_ - increase_down_up);</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">return</span> MathUtil::FloorOfRatio<int64_t>(maximum_value, size_);</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">if</span> (maximum_value == active_sum_rounded_down_ &&</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  active_sum_rounded_down_ < active_sum_) {</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, overlaps_sup_[var_index]);</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  current_min_delta += size_ + increase_down_up;</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordflow">if</span> (current_min_delta > deviation_var_->Max()) {</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, maximum_value % size_);</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">return</span> maximum_value / size_;</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  }</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  maximum_value += size_;</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  }</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  current_min_delta +=</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  overlaps_sup_[var_index] * (size_ - increase_down_up);</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  maximum_value += size_ * overlaps_sup_[var_index];</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="comment">// Slope of 2 x n.</span></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keyword">const</span> int64_t <a class="code" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a> = deviation_var_->Max() - current_min_delta;</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  maximum_value += <a class="code" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a> / 2; <span class="comment">// n * delta / (2 * n);</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordflow">return</span> MathUtil::FloorOfRatio<int64_t>(maximum_value, size_);</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  }</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  }</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> </div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="comment">// Sets maximum on var or on its opposite.</span></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordtype">void</span> PruneBound(<span class="keywordtype">int</span> var_index, int64_t <a class="code" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a>, <span class="keywordtype">bool</span> <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">if</span> (<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[var_index]->SetMax(<a class="code" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a>);</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[var_index]->SetMin(-<a class="code" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a>);</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  }</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  }</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> </div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  std::vector<IntVar*> <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>;</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size_;</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  IntVar* <span class="keyword">const</span> deviation_var_;</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keyword">const</span> int64_t total_sum_;</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  std::unique_ptr<int64_t[]> scaled_vars_assigned_value_;</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  std::unique_ptr<int64_t[]> scaled_vars_min_;</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  std::unique_ptr<int64_t[]> scaled_vars_max_;</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  int64_t scaled_sum_max_;</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  int64_t scaled_sum_min_;</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="comment">// Stores the variables overlapping the mean value.</span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  std::vector<int> overlaps_;</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  std::unique_ptr<int64_t[]> maximum_;</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  std::unique_ptr<int64_t[]> overlaps_sup_;</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="comment">// These values are updated by ComputeData().</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  int64_t active_sum_;</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  int64_t active_sum_rounded_down_;</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  int64_t active_sum_rounded_up_;</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  int64_t active_sum_nearest_;</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> };</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> </div><div class="line"><a name="l00414"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#af48977474f3c25fbf91d2600f8924182"> 414</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#af48977474f3c25fbf91d2600f8924182">Solver::MakeDeviation</a>(<span class="keyword">const</span> std::vector<IntVar*>& vars,</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> deviation_var,</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  int64_t total_sum) {</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> Deviation(<span class="keyword">this</span>, vars, deviation_var, total_sum));</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> }</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="base_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="routing__filters_8cc_html_a4f1e8002734902ae1c65ccc3fc30c98e"><div class="ttname"><a href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a></div><div class="ttdeci">int64_t bound</div><div class="ttdef"><b>Definition:</b> <a href="routing__filters_8cc_source.html#l00969">routing_filters.cc:969</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="constraint__solver_8h_html"><div class="ttname"><a href="constraint__solver_8h.html">constraint_solver.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_constraint_html"><div class="ttname"><a href="classoperations__research_1_1_constraint.html">operations_research::Constraint</a></div><div class="ttdoc">A constraint is the main modeling object.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03626">constraint_solver.h:3626</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="mathutil_8h_html"><div class="ttname"><a href="mathutil_8h.html">mathutil.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="gscip__solver_8cc_html_a1ba5ca0f61f2fa13bd23bf0f89004f35"><div class="ttname"><a href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a></div><div class="ttdeci">double upper_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00126">gscip_solver.cc:126</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_solver_html_af48977474f3c25fbf91d2600f8924182"><div class="ttname"><a href="classoperations__research_1_1_solver.html#af48977474f3c25fbf91d2600f8924182">operations_research::Solver::MakeDeviation</a></div><div class="ttdeci">Constraint * MakeDeviation(const std::vector< IntVar * > &vars, IntVar *const deviation_var, int64_t total_sum)</div><div class="ttdoc">Deviation constraint: sum_i |n * vars[i] - total_sum| <= deviation_var and sum_i vars[i] == total_sum...</div><div class="ttdef"><b>Definition:</b> <a href="deviation_8cc_source.html#l00414">deviation.cc:414</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_int_var_html"><div class="ttname"><a href="classoperations__research_1_1_int_var.html">operations_research::IntVar</a></div><div class="ttdoc">The class IntVar is a subset of IntExpr.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04040">constraint_solver.h:4040</a></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="classoperations__research_1_1_model_visitor_html_aa9175e7f7c9d2598d26293435ecd89ce"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#aa9175e7f7c9d2598d26293435ecd89ce">operations_research::ModelVisitor::kVarsArgument</a></div><div class="ttdeci">static const char kVarsArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03535">constraint_solver.h:3535</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_a151248525a9e07eb3e6e60ea1c4995eb"><div class="ttname"><a href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a></div><div class="ttdeci">const std::vector< IntVar * > vars_</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00044">alldiff_cst.cc:44</a></div></div>
|
|
<div class="ttc" id="resource_8cc_html_af12056bc2a8e3ec563f0940d87abbd2e"><div class="ttname"><a href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a></div><div class="ttdeci">int64_t delta</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01692">resource.cc:1692</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_solver_html_ab741cb25dd32d1cbe02fbfb36337d9bb"><div class="ttname"><a href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">operations_research::Solver::RevAlloc</a></div><div class="ttdeci">T * RevAlloc(T *object)</div><div class="ttdoc">Registers the given object as being reversible.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00791">constraint_solver.h:791</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_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#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a1c55ff9b92db1e630507e03f5342dbe4"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a1c55ff9b92db1e630507e03f5342dbe4">operations_research::ModelVisitor::kDeviation</a></div><div class="ttdeci">static const char kDeviation[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03391">constraint_solver.h:3391</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="namespaceoperations__research_html_a9be76edcbd5ccb982d92c8d90421a73c"><div class="ttname"><a href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">operations_research::JoinDebugStringPtr</a></div><div class="ttdeci">std::string JoinDebugStringPtr(const std::vector< T > &v, const std::string &separator)</div><div class="ttdef"><b>Definition:</b> <a href="string__array_8h_source.html#l00045">string_array.h:45</a></div></div>
|
|
<div class="ttc" id="string__array_8h_html"><div class="ttname"><a href="string__array_8h.html">string_array.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a7899dfe8b41c6b2b13546d921114f8d2"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a7899dfe8b41c6b2b13546d921114f8d2">operations_research::ModelVisitor::kValueArgument</a></div><div class="ttdeci">static const char kValueArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03532">constraint_solver.h:3532</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_model_visitor_html_a489f38dd601db8d045efae4d9ae7d754"><div class="ttname"><a href="classoperations__research_1_1_model_visitor.html#a489f38dd601db8d045efae4d9ae7d754">operations_research::ModelVisitor::kTargetArgument</a></div><div class="ttdeci">static const char kTargetArgument[]</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03528">constraint_solver.h:3528</a></div></div>
|
|
<div class="ttc" id="base_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#l00893">base/logging.h:893</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_afbb39f66221aac28bbdefd1dca2b2b0.html">constraint_solver</a></li><li class="navelem"><a class="el" href="deviation_8cc.html">deviation.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>
|