121 lines
37 KiB
HTML
121 lines
37 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.15"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: model_update_merge.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.1</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('model__update__merge_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">model_update_merge.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="model__update__merge_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="model__update__merge_8h.html">ortools/math_opt/core/model_update_merge.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 <algorithm></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <iterator></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <utility></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 "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</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="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "ortools/math_opt/model.pb.h"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "ortools/math_opt/model_update.pb.h"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "ortools/math_opt/sparse_containers.pb.h"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span>math_opt {</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#a7d985a3b070ce01cf116dddc485ba38f"> 30</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1math__opt.html#a7d985a3b070ce01cf116dddc485ba38f">MergeIntoUpdate</a>(<span class="keyword">const</span> ModelUpdateProto& from, ModelUpdateProto& into) {</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <a class="code" href="namespaceoperations__research_1_1math__opt_1_1internal.html#affe1b0ec468733f8ea63444b8daf16a0">internal::MergeIntoSortedIds</a>(from.deleted_variable_ids(),</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  *into.mutable_deleted_variable_ids());</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <a class="code" href="namespaceoperations__research_1_1math__opt_1_1internal.html#affe1b0ec468733f8ea63444b8daf16a0">internal::MergeIntoSortedIds</a>(from.deleted_linear_constraint_ids(),</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  *into.mutable_deleted_linear_constraint_ids());</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <a class="code" href="namespaceoperations__research_1_1math__opt_1_1internal.html#ab18c9cf185877b1db6b14f1838a35b0c">internal::MergeIntoSparseVector</a>(</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  from.variable_updates().lower_bounds(),</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  *into.mutable_variable_updates()->mutable_lower_bounds());</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <a class="code" href="namespaceoperations__research_1_1math__opt_1_1internal.html#ab18c9cf185877b1db6b14f1838a35b0c">internal::MergeIntoSparseVector</a>(</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  from.variable_updates().upper_bounds(),</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  *into.mutable_variable_updates()->mutable_upper_bounds());</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <a class="code" href="namespaceoperations__research_1_1math__opt_1_1internal.html#ab18c9cf185877b1db6b14f1838a35b0c">internal::MergeIntoSparseVector</a>(</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  from.variable_updates().integers(),</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  *into.mutable_variable_updates()->mutable_integers());</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> </div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <a class="code" href="namespaceoperations__research_1_1math__opt_1_1internal.html#ab18c9cf185877b1db6b14f1838a35b0c">internal::MergeIntoSparseVector</a>(</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  from.linear_constraint_updates().lower_bounds(),</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  *into.mutable_linear_constraint_updates()->mutable_lower_bounds());</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <a class="code" href="namespaceoperations__research_1_1math__opt_1_1internal.html#ab18c9cf185877b1db6b14f1838a35b0c">internal::MergeIntoSparseVector</a>(</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  from.linear_constraint_updates().upper_bounds(),</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  *into.mutable_linear_constraint_updates()->mutable_upper_bounds());</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">if</span> (!from.new_variables().ids().empty() &&</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  !into.new_variables().ids().empty()) {</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(*from.new_variables().ids().begin(),</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  *into.new_variables().ids().rbegin());</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>  into.mutable_new_variables()->MergeFrom(from.new_variables());</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">if</span> (!from.new_linear_constraints().ids().empty() &&</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  !into.new_linear_constraints().ids().empty()) {</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(*from.new_linear_constraints().ids().begin(),</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  *into.new_linear_constraints().ids().rbegin());</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  }</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  into.mutable_new_linear_constraints()->MergeFrom(</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  from.new_linear_constraints());</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="keywordflow">if</span> (from.objective_updates().has_direction_update()) {</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  into.mutable_objective_updates()->set_direction_update(</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  from.objective_updates().direction_update());</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="keywordflow">if</span> (from.objective_updates().has_offset_update()) {</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  into.mutable_objective_updates()->set_offset_update(</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  from.objective_updates().offset_update());</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  }</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <a class="code" href="namespaceoperations__research_1_1math__opt_1_1internal.html#ab18c9cf185877b1db6b14f1838a35b0c">internal::MergeIntoSparseVector</a>(</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  from.objective_updates().linear_coefficients(),</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  *into.mutable_objective_updates()->mutable_linear_coefficients());</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>  <a class="code" href="namespaceoperations__research_1_1math__opt_1_1internal.html#af9a48803f960f4e5f6218270c82abae3">internal::MergeIntoSparseDoubleMatrix</a>(</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  from.linear_constraint_matrix_updates(),</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  *into.mutable_linear_constraint_matrix_updates());</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> }</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> </div><div class="line"><a name="l00085"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt_1_1internal.html"> 85</a></span> <span class="keyword">namespace </span><a class="code" href="namespaceinternal.html">internal</a> {</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> </div><div class="line"><a name="l00087"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt_1_1internal.html#affe1b0ec468733f8ea63444b8daf16a0"> 87</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1math__opt_1_1internal.html#affe1b0ec468733f8ea63444b8daf16a0">MergeIntoSortedIds</a>(<span class="keyword">const</span> google::protobuf::RepeatedField<int64_t>& from,</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  google::protobuf::RepeatedField<int64_t>& into) {</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  google::protobuf::RepeatedField<int64_t> result;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> </div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// We don't reserve the sum of the sizes of both repeated fields since they</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// can contain overlapping ids. But we know that we will have at least the max</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// length of either repeated field.</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  result.Reserve(<a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(from.size(), into.size()));</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> </div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordtype">int</span> from_i = 0;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordtype">int</span> into_i = 0;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">while</span> (from_i < from.size() && into_i < into.size()) {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> (from[from_i] < into[into_i]) {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  result.Add(from[from_i]);</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  ++from_i;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (from[from_i] > into[into_i]) {</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  result.Add(into[into_i]);</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  ++into_i;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  } <span class="keywordflow">else</span> { <span class="comment">// from[from_i] == into[into_i]</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  result.Add(from[from_i]);</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  ++from_i;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  ++into_i;</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</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">// At this point either from_i == from.size() or to_i == to.size() or</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">// both. And the one that is not empty, if it exists, has elements greater</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">// than all other elements already inserted.</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  result.Reserve(result.size() +</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(from.size() - from_i, into.size() - into_i));</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">for</span> (; from_i < from.size(); ++from_i) {</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  result.Add(from[from_i]);</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  }</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">for</span> (; into_i < into.size(); ++into_i) {</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  result.Add(into[into_i]);</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  }</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> </div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  into.Swap(&result);</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> }</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div><div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt_1_1internal.html#af9a48803f960f4e5f6218270c82abae3"> 127</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1math__opt_1_1internal.html#af9a48803f960f4e5f6218270c82abae3">MergeIntoSparseDoubleMatrix</a>(<span class="keyword">const</span> SparseDoubleMatrixProto& from,</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  SparseDoubleMatrixProto& into) {</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  SparseDoubleMatrixProto result;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keyword">auto</span>& result_row_ids = *result.mutable_row_ids();</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">auto</span>& result_column_ids = *result.mutable_column_ids();</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">auto</span>& result_coefficients = *result.mutable_coefficients();</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">// We don't reserve the sum of the sizes of both sparse matrices since they</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="comment">// can contain overlapping tuples. But we know that we will have at least the</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="comment">// max length of either matrix.</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> max_size = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(from.row_ids_size(), into.row_ids_size());</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  result_row_ids.Reserve(max_size);</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  result_column_ids.Reserve(max_size);</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  result_coefficients.Reserve(max_size);</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> </div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordtype">int</span> from_i = 0;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordtype">int</span> into_i = 0;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">while</span> (from_i < from.row_ids_size() && into_i < into.row_ids_size()) {</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="comment">// Matrices are in row-major order and std::pair comparison is</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// lexicographical, thus matrices are sorted in the natural order of pairs</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// of coordinates (row, col).</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keyword">const</span> <span class="keyword">auto</span> from_coordinates =</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  std::make_pair(from.row_ids(from_i), from.column_ids(from_i));</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keyword">const</span> <span class="keyword">auto</span> into_coordinates =</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  std::make_pair(into.row_ids(into_i), into.column_ids(into_i));</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">if</span> (from_coordinates < into_coordinates) {</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  result_row_ids.Add(from_coordinates.first);</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  result_column_ids.Add(from_coordinates.second);</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  result_coefficients.Add(from.coefficients(from_i));</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  ++from_i;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (from_coordinates > into_coordinates) {</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  result_row_ids.Add(into_coordinates.first);</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  result_column_ids.Add(into_coordinates.second);</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  result_coefficients.Add(into.coefficients(into_i));</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  ++into_i;</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  } <span class="keywordflow">else</span> { <span class="comment">// from_coordinates == into_coordinates</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  result_row_ids.Add(from_coordinates.first);</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  result_column_ids.Add(from_coordinates.second);</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  result_coefficients.Add(from.coefficients(from_i));</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  ++from_i;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  ++into_i;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</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"> 170</span> </div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// At this point either from_i == from.row_ids_size() or</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// to_i == to.row_ids_size() (or both). And the one that is not empty, if it</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// exists, has elements greater than all other elements already inserted.</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> remaining_size =</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(from.row_ids_size() - from_i, into.row_ids_size() - into_i);</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  result_row_ids.Reserve(result_row_ids.size() + remaining_size);</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  result_column_ids.Reserve(result_column_ids.size() + remaining_size);</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  result_coefficients.Reserve(result_coefficients.size() + remaining_size);</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordflow">for</span> (; from_i < from.row_ids_size(); ++from_i) {</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  result_row_ids.Add(from.row_ids(from_i));</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  result_column_ids.Add(from.column_ids(from_i));</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  result_coefficients.Add(from.coefficients(from_i));</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  }</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">for</span> (; into_i < into.row_ids_size(); ++into_i) {</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  result_row_ids.Add(into.row_ids(into_i));</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  result_column_ids.Add(into.column_ids(into_i));</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  result_coefficients.Add(into.coefficients(into_i));</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</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>  into.Swap(&result);</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> }</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> </div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> } <span class="comment">// namespace internal</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> } <span class="comment">// namespace math_opt</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="model__update__merge_8h_html"><div class="ttname"><a href="model__update__merge_8h.html">model_update_merge.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1math__opt_1_1internal_html_affe1b0ec468733f8ea63444b8daf16a0"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt_1_1internal.html#affe1b0ec468733f8ea63444b8daf16a0">operations_research::math_opt::internal::MergeIntoSortedIds</a></div><div class="ttdeci">void MergeIntoSortedIds(const google::protobuf::RepeatedField< int64_t > &from, google::protobuf::RepeatedField< int64_t > &into)</div><div class="ttdef"><b>Definition:</b> <a href="model__update__merge_8cc_source.html#l00087">model_update_merge.cc:87</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00703">base/logging.h:703</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1math__opt_1_1internal_html_ab18c9cf185877b1db6b14f1838a35b0c"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt_1_1internal.html#ab18c9cf185877b1db6b14f1838a35b0c">operations_research::math_opt::internal::MergeIntoSparseVector</a></div><div class="ttdeci">void MergeIntoSparseVector(const SparseVector &from, SparseVector &into)</div><div class="ttdef"><b>Definition:</b> <a href="model__update__merge_8h_source.html#l00072">model_update_merge.h:72</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1math__opt_html_a7d985a3b070ce01cf116dddc485ba38f"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a7d985a3b070ce01cf116dddc485ba38f">operations_research::math_opt::MergeIntoUpdate</a></div><div class="ttdeci">void MergeIntoUpdate(const ModelUpdateProto &from, ModelUpdateProto &into)</div><div class="ttdef"><b>Definition:</b> <a href="model__update__merge_8cc_source.html#l00030">model_update_merge.cc:30</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="base_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="namespaceinternal_html"><div class="ttname"><a href="namespaceinternal.html">internal</a></div><div class="ttdef"><b>Definition:</b> <a href="bop__parameters_8pb_8h_source.html#l00039">bop_parameters.pb.h:39</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_1_1math__opt_1_1internal_html_af9a48803f960f4e5f6218270c82abae3"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt_1_1internal.html#af9a48803f960f4e5f6218270c82abae3">operations_research::math_opt::internal::MergeIntoSparseDoubleMatrix</a></div><div class="ttdeci">void MergeIntoSparseDoubleMatrix(const SparseDoubleMatrixProto &from, SparseDoubleMatrixProto &into)</div><div class="ttdef"><b>Definition:</b> <a href="model__update__merge_8cc_source.html#l00127">model_update_merge.cc:127</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_1defc00030ff81d309105e053121082f.html">math_opt</a></li><li class="navelem"><a class="el" href="dir_d5b95ec3710e8b09bb3a6564ed5074d8.html">core</a></li><li class="navelem"><a class="el" href="model__update__merge_8cc.html">model_update_merge.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>
|