170 lines
128 KiB
HTML
170 lines
128 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: indexed_model.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('indexed__model_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">indexed_model.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="indexed__model_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="indexed__model_8h.html">ortools/math_opt/core/indexed_model.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 <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 <utility></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</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 "absl/container/flat_hash_map.h"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "absl/memory/memory.h"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "absl/strings/string_view.h"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "absl/synchronization/mutex.h"</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "absl/types/optional.h"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "absl/types/span.h"</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="int__type_8h.html">ortools/base/int_type.h</a>"</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</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="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include "<a class="code" href="sparse__vector__view_8h.html">ortools/math_opt/core/sparse_vector_view.h</a>"</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "ortools/math_opt/model.pb.h"</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include "ortools/math_opt/model_update.pb.h"</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include "ortools/math_opt/result.pb.h"</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include "ortools/math_opt/solution.pb.h"</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include "ortools/math_opt/sparse_containers.pb.h"</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> </div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00041"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html"> 41</a></span> <span class="keyword">namespace </span>math_opt {</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> </div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="keyword">namespace </span>{</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="keyword">template</span> <<span class="keyword">typename</span> K, <span class="keyword">typename</span> V></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> std::vector<K> MapKeys(<span class="keyword">const</span> absl::flat_hash_map<K, V>& in_map) {</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  std::vector<K> keys;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  keys.reserve(in_map.size());</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& key_pair : in_map) {</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  keys.push_back(key_pair.first);</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  }</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">return</span> keys;</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</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> <span class="keyword">template</span> <<span class="keyword">typename</span> K, <span class="keyword">typename</span> V></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> std::vector<K> SortedMapKeys(<span class="keyword">const</span> absl::flat_hash_map<K, V>& in_map) {</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  std::vector<K> keys = MapKeys(in_map);</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  std::sort(keys.begin(), keys.end());</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">return</span> keys;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> }</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> std::vector<T> SortedSetKeys(<span class="keyword">const</span> absl::flat_hash_set<T>& in_set) {</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  std::vector<T> keys;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  keys.reserve(in_set.size());</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& key : in_set) {</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  keys.push_back(key);</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  std::sort(keys.begin(), keys.end());</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">return</span> keys;</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> </div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// ids should be sorted.</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="keyword">template</span> <<span class="keyword">typename</span> IdType></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="keywordtype">void</span> AppendFromMapOrDefault(<span class="keyword">const</span> absl::Span<const IdType> ids,</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">const</span> absl::flat_hash_map<IdType, double>& values,</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  SparseDoubleVectorProto& sparse_vector) {</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IdType <span class="keywordtype">id</span> : ids) {</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  sparse_vector.add_ids(<span class="keywordtype">id</span>.<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>());</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  sparse_vector.add_values(<a class="code" href="namespacegtl.html#abc18f60961e36340e64e428827c0e38e">gtl::FindWithDefault</a>(values, <span class="keywordtype">id</span>));</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  }</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> }</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> </div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment">// ids should be sorted.</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="keyword">template</span> <<span class="keyword">typename</span> IdType, <span class="keyword">typename</span> IdIterable></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="keywordtype">void</span> AppendFromMapIfPresent(<span class="keyword">const</span> IdIterable& ids,</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">const</span> absl::flat_hash_map<IdType, double>& values,</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  SparseDoubleVectorProto& sparse_vector) {</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IdType <span class="keywordtype">id</span> : ids) {</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">const</span> <span class="keywordtype">double</span>* <span class="keyword">const</span> double_value = <a class="code" href="namespacegtl.html#ab9e05694d7776f2eef357feca8b9d647">gtl::FindOrNull</a>(values, <span class="keywordtype">id</span>);</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">if</span> (double_value != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  sparse_vector.add_ids(<span class="keywordtype">id</span>.<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>());</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  sparse_vector.add_values(*double_value);</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  }</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> }</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="keyword">template</span> <<span class="keyword">typename</span> IdType, <span class="keyword">typename</span> DataType></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="keywordtype">void</span> AppendFromMap(<span class="keyword">const</span> absl::flat_hash_set<IdType>& dirty_keys,</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">const</span> absl::flat_hash_map<IdType, DataType>& values,</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordtype">double</span> DataType::*field,</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  SparseDoubleVectorProto& sparse_vector) {</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IdType <span class="keywordtype">id</span> : SortedSetKeys(dirty_keys)) {</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  sparse_vector.add_ids(<span class="keywordtype">id</span>.<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>());</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  sparse_vector.add_values(values.at(<span class="keywordtype">id</span>).*field);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> }</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> absl::flat_hash_map<T, BasisStatus> SparseBasisVectorToMap(</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">const</span> SparseBasisStatusVector& sparse_vector) {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  absl::flat_hash_map<T, BasisStatus> result;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(sparse_vector.ids_size(), sparse_vector.values_size());</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  result.reserve(sparse_vector.ids_size());</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> [<span class="keywordtype">id</span>, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>] : <a class="code" href="namespaceoperations__research_1_1math__opt.html#ac17be684f3a6337b38f287c0a1e8c691">MakeView</a>(sparse_vector)) {</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <a class="code" href="namespacegtl.html#a5c0d4dea208db4deaa285c06b78d8181">gtl::InsertOrDie</a>(&result, T(<span class="keywordtype">id</span>), static_cast<BasisStatus>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>));</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  }</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">return</span> result;</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> </div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a04bd5ab6d5358dd7ed572dcab871569e"> 123</a></span> VariableId <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a7f61878db357c5e54364c258b84bd60f">IndexedModel::AddVariable</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>,</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>,</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_integer,</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">const</span> absl::string_view <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>) {</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">const</span> VariableId result = next_variable_id_++;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  VariableData& var_data = variables_[result];</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  var_data.lower_bound = <a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  var_data.upper_bound = <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  var_data.is_integer = is_integer;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  var_data.name = <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#ad8227ba86a01f26e4f173cd5e219d5d1">name</a>;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">if</span> (!lazy_matrix_columns_.empty()) {</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <a class="code" href="namespacegtl.html#a5c0d4dea208db4deaa285c06b78d8181">gtl::InsertOrDie</a>(&lazy_matrix_columns_, result, {});</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> }</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a21466ff77e82c4002423e4dda189b780"> 139</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a21466ff77e82c4002423e4dda189b780">IndexedModel::DeleteVariable</a>(<span class="keyword">const</span> VariableId <span class="keywordtype">id</span>) {</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(variables_.contains(<span class="keywordtype">id</span>));</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  EnsureLazyMatrixColumns();</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  EnsureLazyMatrixRows();</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  linear_objective_.erase(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  variables_.erase(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">if</span> (<span class="keywordtype">id</span> < variables_checkpoint_) {</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  dirty_variable_deletes_.insert(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  dirty_variable_lower_bounds_.erase(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  dirty_variable_upper_bounds_.erase(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  dirty_variable_is_integer_.erase(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  dirty_linear_objective_coefficients_.erase(<span class="keywordtype">id</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="keywordflow">for</span> (<span class="keyword">const</span> LinearConstraintId related_constraint :</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  lazy_matrix_columns_.at(<span class="keywordtype">id</span>)) {</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(lazy_matrix_rows_.at(related_constraint).erase(<span class="keywordtype">id</span>), 0);</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(linear_constraint_matrix_.erase({related_constraint, id}), 0);</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (<span class="keywordtype">id</span> < variables_checkpoint_ &&</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  related_constraint < linear_constraints_checkpoint_) {</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  dirty_linear_constraint_matrix_keys_.erase({related_constraint, <span class="keywordtype">id</span>});</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  }</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>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(lazy_matrix_columns_.erase(<span class="keywordtype">id</span>), 0);</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> }</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div><div class="line"><a name="l00164"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a5f3a8a03f482c425defc0907feb6ec03"> 164</a></span> std::vector<VariableId> <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a5f3a8a03f482c425defc0907feb6ec03">IndexedModel::variables</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">return</span> MapKeys(variables_);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> }</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> </div><div class="line"><a name="l00168"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a17bfc36741359bc1a6313ab7beb2a616"> 168</a></span> std::vector<VariableId> <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a17bfc36741359bc1a6313ab7beb2a616">IndexedModel::SortedVariables</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">return</span> SortedMapKeys(variables_);</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> </div><div class="line"><a name="l00172"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a7f75ea97788827cedf03b0025c8c4dc8"> 172</a></span> LinearConstraintId <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#aef798fd853e39de45ca855559f0df129">IndexedModel::AddLinearConstraint</a>(</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>,</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">const</span> absl::string_view <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>) {</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keyword">const</span> LinearConstraintId result = next_linear_constraint_id_++;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  LinearConstraintData& lin_con_data = linear_constraints_[result];</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  lin_con_data.lower_bound = <a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  lin_con_data.upper_bound = <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>;</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  lin_con_data.name = <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#ad8227ba86a01f26e4f173cd5e219d5d1">name</a>;</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">if</span> (!lazy_matrix_rows_.empty()) {</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <a class="code" href="namespacegtl.html#a5c0d4dea208db4deaa285c06b78d8181">gtl::InsertOrDie</a>(&lazy_matrix_rows_, result, {});</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> result;</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"><a class="line" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a40f5d96de187737d854c193cb24b77d2"> 186</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a40f5d96de187737d854c193cb24b77d2">IndexedModel::DeleteLinearConstraint</a>(<span class="keyword">const</span> LinearConstraintId <span class="keywordtype">id</span>) {</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(linear_constraints_.contains(<span class="keywordtype">id</span>));</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  EnsureLazyMatrixColumns();</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  EnsureLazyMatrixRows();</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  linear_constraints_.erase(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">if</span> (<span class="keywordtype">id</span> < linear_constraints_checkpoint_) {</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  dirty_linear_constraint_deletes_.insert(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  dirty_linear_constraint_lower_bounds_.erase(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  dirty_linear_constraint_upper_bounds_.erase(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  }</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> VariableId related_variable : lazy_matrix_rows_.at(<span class="keywordtype">id</span>)) {</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(lazy_matrix_columns_.at(related_variable).erase(<span class="keywordtype">id</span>), 0);</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(linear_constraint_matrix_.erase({id, related_variable}), 0);</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">if</span> (<span class="keywordtype">id</span> < linear_constraints_checkpoint_ &&</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  related_variable < variables_checkpoint_) {</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  dirty_linear_constraint_matrix_keys_.erase({id, related_variable});</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  }</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(lazy_matrix_rows_.erase(<span class="keywordtype">id</span>), 0);</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> </div><div class="line"><a name="l00207"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a13a035185d02f47ea72b737b293516b1"> 207</a></span> std::vector<LinearConstraintId> <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a13a035185d02f47ea72b737b293516b1">IndexedModel::linear_constraints</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">return</span> MapKeys(linear_constraints_);</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> }</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> </div><div class="line"><a name="l00211"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#af6af3777993dc125c5d4a46b5eee7575"> 211</a></span> std::vector<LinearConstraintId> <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#af6af3777993dc125c5d4a46b5eee7575">IndexedModel::SortedLinearConstraints</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">return</span> SortedMapKeys(linear_constraints_);</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> }</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> </div><div class="line"><a name="l00215"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a312154deac76051cb49fca9381fae41f"> 215</a></span> std::vector<VariableId> <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a312154deac76051cb49fca9381fae41f">IndexedModel::SortedLinearObjectiveNonzeroVariables</a>()<span class="keyword"></span></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="keyword"> const </span>{</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">return</span> SortedMapKeys(linear_objective_);</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> }</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> </div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="keywordtype">void</span> IndexedModel::AppendVariable(<span class="keyword">const</span> VariableId <span class="keywordtype">id</span>,</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  VariablesProto& variables_proto)<span class="keyword"> const </span>{</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keyword">const</span> VariableData& var_data = variables_.at(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  variables_proto.add_ids(<span class="keywordtype">id</span>.<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>());</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  variables_proto.add_lower_bounds(var_data.lower_bound);</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  variables_proto.add_upper_bounds(var_data.upper_bound);</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  variables_proto.add_integers(var_data.is_integer);</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  variables_proto.add_names(var_data.name);</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> }</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> </div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="keywordtype">void</span> IndexedModel::AppendLinearConstraint(</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keyword">const</span> LinearConstraintId <span class="keywordtype">id</span>,</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  LinearConstraintsProto& linear_constraints_proto)<span class="keyword"> const </span>{</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keyword">const</span> LinearConstraintData& con_impl = linear_constraints_.at(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  linear_constraints_proto.add_ids(<span class="keywordtype">id</span>.<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>());</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  linear_constraints_proto.add_lower_bounds(con_impl.lower_bound);</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  linear_constraints_proto.add_upper_bounds(con_impl.upper_bound);</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  linear_constraints_proto.add_names(con_impl.name);</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> }</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="keywordtype">void</span> IndexedModel::ExportLinearConstraintMatrix(</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keyword">const</span> absl::Span<<span class="keyword">const</span> std::pair<LinearConstraintId, VariableId>> entries,</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  SparseDoubleMatrixProto& matrix)<span class="keyword"> const </span>{</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  matrix.mutable_row_ids()->Reserve(entries.size());</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  matrix.mutable_column_ids()->Reserve(entries.size());</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  matrix.mutable_coefficients()->Reserve(entries.size());</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> [constraint_id, variable_id] : entries) {</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  matrix.add_row_ids(constraint_id.value());</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  matrix.add_column_ids(variable_id.value());</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  matrix.add_coefficients(<a class="code" href="namespacegtl.html#abc18f60961e36340e64e428827c0e38e">gtl::FindWithDefault</a>(linear_constraint_matrix_,</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  {constraint_id, variable_id}));</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> }</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> </div><div class="line"><a name="l00254"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#aa850c403983019f6676dda010d9ac3a5"> 254</a></span> ModelProto <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#aa850c403983019f6676dda010d9ac3a5">IndexedModel::ExportModel</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  ModelProto result;</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  result.set_name(name_);</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">// Export the variables.</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> VariableId variable : SortedMapKeys(variables_)) {</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  AppendVariable(variable, *result.mutable_variables());</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">// Pull out the objective.</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  result.mutable_objective()->set_maximize(is_maximize_);</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  result.mutable_objective()->set_offset(objective_offset_);</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  AppendFromMapOrDefault<VariableId>(</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  SortedMapKeys(linear_objective_), linear_objective_,</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  *result.mutable_objective()->mutable_linear_coefficients());</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> </div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="comment">// Pull out the linear constraints.</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LinearConstraintId con : SortedMapKeys(linear_constraints_)) {</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  AppendLinearConstraint(con, *result.mutable_linear_constraints());</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> </div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">// Pull out the constraint matrix.</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  ExportLinearConstraintMatrix(SortedMapKeys(linear_constraint_matrix_),</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  *result.mutable_linear_constraint_matrix());</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> }</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> </div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> absl::optional<ModelUpdateProto> IndexedModel::ExportSharedModelUpdate() {</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="comment">// We must detect the empty case to prevent unneeded copies and merging in</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="comment">// UpdateTracker::ExportModelUpdate().</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">if</span> (variables_checkpoint_ == next_variable_id_ &&</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  linear_constraints_checkpoint_ == next_linear_constraint_id_ &&</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  !dirty_objective_direction_ && !dirty_objective_offset_ &&</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  dirty_variable_deletes_.empty() && dirty_variable_lower_bounds_.empty() &&</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  dirty_variable_upper_bounds_.empty() &&</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  dirty_variable_is_integer_.empty() &&</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  dirty_linear_objective_coefficients_.empty() &&</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  dirty_linear_constraint_deletes_.empty() &&</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  dirty_linear_constraint_lower_bounds_.empty() &&</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  dirty_linear_constraint_upper_bounds_.empty() &&</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  dirty_linear_constraint_matrix_keys_.empty()) {</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">return</span> absl::nullopt;</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> </div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// TODO(user): these are used to efficiently extract the constraint matrix</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">// update, but it would be good to avoid calling these because they result in</span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// a large allocation.</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  EnsureLazyMatrixRows();</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  EnsureLazyMatrixColumns();</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> </div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  ModelUpdateProto result;</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> </div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="comment">// Variable/constraint deletions.</span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> VariableId del_var : SortedSetKeys(dirty_variable_deletes_)) {</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  result.add_deleted_variable_ids(del_var.value());</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  }</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LinearConstraintId del_lin_con :</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  SortedSetKeys(dirty_linear_constraint_deletes_)) {</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  result.add_deleted_linear_constraint_ids(del_lin_con.value());</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  }</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> </div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="comment">// Update the variables.</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keyword">auto</span> var_updates = result.mutable_variable_updates();</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  AppendFromMap(dirty_variable_lower_bounds_, variables_,</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  &<a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">VariableData::lower_bound</a>,</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  *var_updates->mutable_lower_bounds());</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  AppendFromMap(dirty_variable_upper_bounds_, variables_,</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  &<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">VariableData::upper_bound</a>,</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  *var_updates->mutable_upper_bounds());</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">for</span> (<span class="keyword">const</span> VariableId integer_var :</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  SortedSetKeys(dirty_variable_is_integer_)) {</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  var_updates->mutable_integers()->add_ids(integer_var.value());</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  var_updates->mutable_integers()->add_values(</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  variables_.at(integer_var).is_integer);</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>  <span class="keywordflow">for</span> (VariableId new_id = variables_checkpoint_; new_id < next_variable_id_;</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  ++new_id) {</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">if</span> (variables_.contains(new_id)) {</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  AppendVariable(new_id, *result.mutable_new_variables());</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>  }</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> </div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="comment">// Update the objective</span></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keyword">auto</span> obj_updates = result.mutable_objective_updates();</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">if</span> (dirty_objective_direction_) {</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  obj_updates->set_direction_update(is_maximize_);</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  }</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">if</span> (dirty_objective_offset_) {</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  obj_updates->set_offset_update(objective_offset_);</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  }</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  AppendFromMapOrDefault<VariableId>(</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  SortedSetKeys(dirty_linear_objective_coefficients_), linear_objective_,</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  *obj_updates->mutable_linear_coefficients());</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="comment">// TODO(b/182567749): Once StrongInt is in absl, use</span></div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="comment">// AppendFromMapIfPresent<VariableId>(</span></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment">// MakeStrongIntRange(variables_checkpoint_, next_variable_id_),</span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="comment">// linear_objective_, *obj_updates->mutable_linear_coefficients());</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keywordflow">for</span> (VariableId var_id = variables_checkpoint_; var_id < next_variable_id_;</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  ++var_id) {</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keyword">const</span> <span class="keywordtype">double</span>* <span class="keyword">const</span> double_value =</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <a class="code" href="namespacegtl.html#ab9e05694d7776f2eef357feca8b9d647">gtl::FindOrNull</a>(linear_objective_, var_id);</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">if</span> (double_value != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  obj_updates->mutable_linear_coefficients()->add_ids(var_id.value());</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  obj_updates->mutable_linear_coefficients()->add_values(*double_value);</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  }</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  }</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> </div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="comment">// Update the linear constraints</span></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keyword">auto</span> lin_con_updates = result.mutable_linear_constraint_updates();</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  AppendFromMap(dirty_linear_constraint_lower_bounds_, linear_constraints_,</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  &<a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">LinearConstraintData::lower_bound</a>,</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  *lin_con_updates->mutable_lower_bounds());</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  AppendFromMap(dirty_linear_constraint_upper_bounds_, linear_constraints_,</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  &<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">LinearConstraintData::upper_bound</a>,</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  *lin_con_updates->mutable_upper_bounds());</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> </div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">for</span> (LinearConstraintId new_id = linear_constraints_checkpoint_;</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  new_id < next_linear_constraint_id_; ++new_id) {</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordflow">if</span> (linear_constraints_.contains(new_id)) {</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  AppendLinearConstraint(new_id, *result.mutable_new_linear_constraints());</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  }</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  }</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> </div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="comment">// Extract changes to the matrix of linear constraint coefficients</span></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  std::vector<std::pair<LinearConstraintId, VariableId>></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  constraint_matrix_updates(dirty_linear_constraint_matrix_keys_.begin(),</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  dirty_linear_constraint_matrix_keys_.end());</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordflow">for</span> (VariableId new_var = variables_checkpoint_; new_var < next_variable_id_;</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  ++new_var) {</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">if</span> (variables_.contains(new_var)) {</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LinearConstraintId lin_con :</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  lazy_matrix_columns_.at(new_var)) {</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  constraint_matrix_updates.emplace_back(lin_con, new_var);</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  }</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  }</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  }</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">for</span> (LinearConstraintId new_lin_con = linear_constraints_checkpoint_;</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  new_lin_con < next_linear_constraint_id_; ++new_lin_con) {</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordflow">if</span> (linear_constraints_.contains(new_lin_con)) {</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> VariableId <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : lazy_matrix_rows_.at(new_lin_con)) {</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="comment">// NOTE(user): we will do at most twice as much as needed here.</span></div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> < variables_checkpoint_) {</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  constraint_matrix_updates.emplace_back(new_lin_con, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  }</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  }</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  }</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  }</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  std::sort(constraint_matrix_updates.begin(), constraint_matrix_updates.end());</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  ExportLinearConstraintMatrix(</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  constraint_matrix_updates,</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  *result.mutable_linear_constraint_matrix_updates());</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> </div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="comment">// Named returned value optimization (NRVO) does not apply here since the</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="comment">// return type if not the same type as `result`. To make things clear, we</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="comment">// explicitly call the constructor here.</span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">return</span> {std::move(result)};</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> }</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="keywordtype">void</span> IndexedModel::EnsureLazyMatrixColumns() {</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordflow">if</span> (lazy_matrix_columns_.empty()) {</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& var_pair : variables_) {</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  lazy_matrix_columns_.insert({var_pair.first, {}});</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  }</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& mat_entry : linear_constraint_matrix_) {</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  lazy_matrix_columns_.at(mat_entry.first.second)</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  .insert(mat_entry.first.first);</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  }</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  }</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> }</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> </div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="keywordtype">void</span> IndexedModel::EnsureLazyMatrixRows() {</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">if</span> (lazy_matrix_rows_.empty()) {</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& lin_con_pair : linear_constraints_) {</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  lazy_matrix_rows_.insert({lin_con_pair.first, {}});</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  }</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& mat_entry : linear_constraint_matrix_) {</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  lazy_matrix_rows_.at(mat_entry.first.first)</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  .insert(mat_entry.first.second);</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  }</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  }</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> }</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> </div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="keywordtype">void</span> IndexedModel::SharedCheckpoint() {</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  variables_checkpoint_ = next_variable_id_;</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  linear_constraints_checkpoint_ = next_linear_constraint_id_;</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  dirty_objective_direction_ = <span class="keyword">false</span>;</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  dirty_objective_offset_ = <span class="keyword">false</span>;</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> </div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  dirty_variable_deletes_.clear();</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  dirty_variable_lower_bounds_.clear();</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  dirty_variable_upper_bounds_.clear();</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  dirty_variable_is_integer_.clear();</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> </div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  dirty_linear_objective_coefficients_.clear();</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span> </div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  dirty_linear_constraint_deletes_.clear();</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  dirty_linear_constraint_lower_bounds_.clear();</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  dirty_linear_constraint_upper_bounds_.clear();</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  dirty_linear_constraint_matrix_keys_.clear();</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> }</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> </div><div class="line"><a name="l00455"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#af002beeeedcb854981c62d4c5ad2ade6"> 455</a></span> <a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_solutions.html">IndexedSolutions</a> <a class="code" href="namespaceoperations__research_1_1math__opt.html#af002beeeedcb854981c62d4c5ad2ade6">IndexedSolutionsFromProto</a>(</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keyword">const</span> SolveResultProto& solve_result) {</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_solutions.html">IndexedSolutions</a> solutions;</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> PrimalSolutionProto& primal_solution :</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  solve_result.primal_solutions()) {</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_primal_solution.html">IndexedPrimalSolution</a> p;</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  p.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_primal_solution.html#a0b6e5ca9443f7b80d00945d7a1846d5e">variable_values</a> =</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#ac17be684f3a6337b38f287c0a1e8c691">MakeView</a>(primal_solution.variable_values()).as_map<VariableId>();</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  p.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_primal_solution.html#a69703b8569462134ad4e22ab0133e418">objective_value</a> = primal_solution.objective_value();</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  solutions.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_solutions.html#a5df73a04e49101233a5fbc1cad54beb0">primal_solutions</a>.push_back(std::move(p));</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  }</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> PrimalRayProto& primal_ray : solve_result.primal_rays()) {</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_primal_ray.html">IndexedPrimalRay</a> pr;</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  pr.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_primal_ray.html#a0b6e5ca9443f7b80d00945d7a1846d5e">variable_values</a> =</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#ac17be684f3a6337b38f287c0a1e8c691">MakeView</a>(primal_ray.variable_values()).as_map<VariableId>();</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  solutions.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_solutions.html#a8e3c4b125f4ff56f9d456091e5ba2e53">primal_rays</a>.push_back(std::move(pr));</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  }</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> DualSolutionProto& dual_solution : solve_result.dual_solutions()) {</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_dual_solution.html">IndexedDualSolution</a> d;</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  d.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_dual_solution.html#a297497ff6b18b2ba7164a2152a8349dd">reduced_costs</a> =</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#ac17be684f3a6337b38f287c0a1e8c691">MakeView</a>(dual_solution.reduced_costs()).as_map<VariableId>();</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  d.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_dual_solution.html#aeadb7c4134d66923e3cfa1d48f5b4e8f">dual_values</a> =</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#ac17be684f3a6337b38f287c0a1e8c691">MakeView</a>(dual_solution.dual_values()).as_map<LinearConstraintId>();</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  d.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_dual_solution.html#a69703b8569462134ad4e22ab0133e418">objective_value</a> = dual_solution.objective_value();</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  solutions.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_solutions.html#a0c16ef549b2b4ae1c919befe358db529">dual_solutions</a>.push_back(std::move(d));</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  }</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> DualRayProto& dual_ray : solve_result.dual_rays()) {</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_dual_ray.html">IndexedDualRay</a> dr;</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  dr.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_dual_ray.html#a297497ff6b18b2ba7164a2152a8349dd">reduced_costs</a> = <a class="code" href="namespaceoperations__research_1_1math__opt.html#ac17be684f3a6337b38f287c0a1e8c691">MakeView</a>(dual_ray.reduced_costs()).as_map<VariableId>();</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  dr.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_dual_ray.html#aeadb7c4134d66923e3cfa1d48f5b4e8f">dual_values</a> =</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#ac17be684f3a6337b38f287c0a1e8c691">MakeView</a>(dual_ray.dual_values()).as_map<LinearConstraintId>();</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  solutions.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_solutions.html#abcc13b24b3d5ff188d37fb4af2ef94e3">dual_rays</a>.push_back(std::move(dr));</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  }</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> BasisProto& basis : solve_result.basis()) {</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_basis.html">IndexedBasis</a> indexed_basis;</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  indexed_basis.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_basis.html#a71ef6bd1ff70ba245d1d64648a207886">constraint_status</a> =</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  SparseBasisVectorToMap<LinearConstraintId>(basis.constraint_status());</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  indexed_basis.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_basis.html#a265be1b5bb98c8688eaabee9c97f0733">variable_status</a> =</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  SparseBasisVectorToMap<VariableId>(basis.variable_status());</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  solutions.<a class="code" href="structoperations__research_1_1math__opt_1_1_indexed_solutions.html#aa6fec8367be4573de5f0c143cf8005a1">basis</a>.push_back(std::move(indexed_basis));</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  }</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">return</span> solutions;</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span> }</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span> </div><div class="line"><a name="l00499"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#affdd1f6f772003700c4ed2a36269efa7"> 499</a></span> std::unique_ptr<IndexedModel::UpdateTracker> <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model.html#affdd1f6f772003700c4ed2a36269efa7">IndexedModel::NewUpdateTracker</a>() {</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="comment">// UpdateTracker constructor will call UpdateTracker::Checkpoint() that</span></div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">// flushes the current update to all other trackers and updates the checkpoint</span></div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="comment">// of this model to the current state of the model as returned by</span></div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="comment">// ExportModel().</span></div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keywordflow">return</span> absl::WrapUnique(<span class="keyword">new</span> <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker.html">UpdateTracker</a>(*<span class="keyword">this</span>));</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span> }</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span> </div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> IndexedModel::UpdateTracker::UpdateTracker(<a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model.html">IndexedModel</a>& indexed_model)</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  : indexed_model_(indexed_model) {</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  absl::MutexLock lock(&indexed_model_.update_trackers_lock_);</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(indexed_model_.update_trackers_.insert(<span class="keyword">this</span>).second);</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  CheckpointLocked();</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span> }</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span> </div><div class="line"><a name="l00514"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker.html#a4757d290de11ba9c741dbb2731ec9ed8"> 514</a></span> <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker.html#a4757d290de11ba9c741dbb2731ec9ed8">IndexedModel::UpdateTracker::~UpdateTracker</a>() {</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  absl::MutexLock lock(&indexed_model_.update_trackers_lock_);</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(indexed_model_.update_trackers_.erase(<span class="keyword">this</span>));</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span> }</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span> </div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> absl::optional<ModelUpdateProto></div><div class="line"><a name="l00520"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker.html#ac4bca7e095c64253ee7df05641f6f250"> 520</a></span> <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker.html#ac4bca7e095c64253ee7df05641f6f250">IndexedModel::UpdateTracker::ExportModelUpdate</a>() {</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  absl::MutexLock lock(&indexed_model_.update_trackers_lock_);</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span> </div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="comment">// No updates have been pushed, the checkpoint of this tracker is in sync with</span></div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="comment">// the shared checkpoint of IndexedModel. We can return the IndexedModel</span></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="comment">// shared update without merging.</span></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordflow">if</span> (updates_.empty()) {</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">return</span> indexed_model_.ExportSharedModelUpdate();</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  }</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> </div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="comment">// Find all trackers with the same checkpoint. By construction, all trackers</span></div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="comment">// that have the same first update also share all next updates.</span></div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  std::vector<UpdateTracker*> all_trackers_at_checkpoint;</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordtype">bool</span> found_this = <span class="keyword">false</span>;</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker.html">UpdateTracker</a>* <span class="keyword">const</span> tracker : indexed_model_.update_trackers_) {</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="keywordflow">if</span> (!tracker->updates_.empty() &&</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  tracker->updates_.front() == updates_.front()) {</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="comment">// Note that we set `found_this` inside the if branch to make sure we also</span></div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="comment">// detect a bug in this code that would not include `this` in the list of</span></div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="comment">// trackers.</span></div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keywordflow">if</span> (tracker == <span class="keyword">this</span>) {</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  found_this = <span class="keyword">true</span>;</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  }</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  all_trackers_at_checkpoint.push_back(tracker);</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> </div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="comment">// Validate that we have the same updates in debug mode only. In optimized</span></div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="comment">// mode, only test the size of the updates_ vectors.</span></div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(updates_.size(), tracker->updates_.size());</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < updates_.size(); ++i) {</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(updates_[i], tracker->updates_[i])</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  << <span class="stringliteral">"Two trackers have the same checkpoint but different updates."</span>;</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  }</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  }</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  }</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  }</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(found_this);</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span> </div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="comment">// Possible optimizations here:</span></div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="comment">//</span></div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="comment">// * Maybe optimize the case where the first update is singly used by `this`</span></div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="comment">// and use it as starting point instead of making a copy. This may be more</span></div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="comment">// complicated if it is shared with multiple trackers since in that case we</span></div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="comment">// must make sure to only update the shared instance if and only if only</span></div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="comment">// trackers have a pointer to it, not external code (i.e. its use count is</span></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="comment">// the same as the number of trackers).</span></div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="comment">//</span></div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="comment">// * Use n-way merge here if the performances justify it.</span></div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keyword">const</span> <span class="keyword">auto</span> merge = std::make_shared<ModelUpdateProto>();</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& update : updates_) {</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a7d985a3b070ce01cf116dddc485ba38f">MergeIntoUpdate</a>(<span class="comment">/*from=*/</span>*update, <span class="comment">/*into=*/</span>*merge);</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  }</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> </div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="comment">// Push the merge to all trackers that have the same checkpoint (including</span></div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">// this tracker).</span></div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker.html">UpdateTracker</a>* <span class="keyword">const</span> tracker : all_trackers_at_checkpoint) {</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  tracker->updates_.clear();</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  tracker->updates_.push_back(merge);</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  }</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> </div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  ModelUpdateProto update = *merge;</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keyword">const</span> absl::optional<ModelUpdateProto> pending_update =</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  indexed_model_.ExportSharedModelUpdate();</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">if</span> (pending_update) {</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a7d985a3b070ce01cf116dddc485ba38f">MergeIntoUpdate</a>(<span class="comment">/*from=*/</span>*pending_update, <span class="comment">/*into=*/</span>update);</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  }</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> </div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="comment">// Named returned value optimization (NRVO) does not apply here since the</span></div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="comment">// return type if not the same type as `result`. To make things clear, we</span></div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="comment">// explicitly call the constructor here.</span></div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordflow">return</span> {std::move(update)};</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span> }</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span> </div><div class="line"><a name="l00593"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker.html#a7ab6e456ef150951bb67e3cf1ebe3056"> 593</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker.html#a7ab6e456ef150951bb67e3cf1ebe3056">IndexedModel::UpdateTracker::Checkpoint</a>() {</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  absl::MutexLock lock(&indexed_model_.update_trackers_lock_);</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span> </div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  CheckpointLocked();</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span> }</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span> </div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span> <span class="keywordtype">void</span> IndexedModel::UpdateTracker::CheckpointLocked() {</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="comment">// Optimize the case where we have a single tracker and we don't want to</span></div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="comment">// update it. In that case we don't need to update trackers since we would</span></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="comment">// only update this one and clear it immediately.</span></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordflow">if</span> (indexed_model_.update_trackers_.size() == 1) {</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(*indexed_model_.update_trackers_.begin() == <span class="keyword">this</span>);</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  absl::optional<ModelUpdateProto> update =</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  indexed_model_.ExportSharedModelUpdate();</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="keywordflow">if</span> (update) {</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keyword">const</span> <span class="keyword">auto</span> shared_update =</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  std::make_shared<ModelUpdateProto>(*std::move(update));</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span> </div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="keywordtype">bool</span> found_this = <span class="keyword">false</span>;</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keywordflow">for</span> (UpdateTracker* <span class="keyword">const</span> tracker : indexed_model_.update_trackers_) {</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keywordflow">if</span> (tracker == <span class="keyword">this</span>) {</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  found_this = <span class="keyword">true</span>;</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  }</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  tracker->updates_.push_back(shared_update);</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  }</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(found_this);</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  }</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  }</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  indexed_model_.SharedCheckpoint();</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  updates_.clear();</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span> }</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span> </div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span> } <span class="comment">// namespace math_opt</span></div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_solutions_html_a5df73a04e49101233a5fbc1cad54beb0"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_solutions.html#a5df73a04e49101233a5fbc1cad54beb0">operations_research::math_opt::IndexedSolutions::primal_solutions</a></div><div class="ttdeci">std::vector< IndexedPrimalSolution > primal_solutions</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00665">indexed_model.h:665</a></div></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#l00491">base/logging.h:491</a></div></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="classoperations__research_1_1math__opt_1_1_indexed_model_html_a5f3a8a03f482c425defc0907feb6ec03"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a5f3a8a03f482c425defc0907feb6ec03">operations_research::math_opt::IndexedModel::variables</a></div><div class="ttdeci">std::vector< VariableId > variables() const</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8cc_source.html#l00164">indexed_model.cc:164</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_indexed_model_html_aef798fd853e39de45ca855559f0df129"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model.html#aef798fd853e39de45ca855559f0df129">operations_research::math_opt::IndexedModel::AddLinearConstraint</a></div><div class="ttdeci">LinearConstraintId AddLinearConstraint(absl::string_view name="")</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00757">indexed_model.h:757</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1math__opt_html_ac17be684f3a6337b38f287c0a1e8c691"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ac17be684f3a6337b38f287c0a1e8c691">operations_research::math_opt::MakeView</a></div><div class="ttdeci">SparseVectorView< T > MakeView(absl::Span< const int64_t > ids, const Collection &values)</div><div class="ttdef"><b>Definition:</b> <a href="sparse__vector__view_8h_source.html#l00140">sparse_vector_view.h:140</a></div></div>
|
|
<div class="ttc" id="macros_8h_html_a7f536a3b33f9bed8f75734e035d30725"><div class="ttname"><a href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div><div class="ttdeci">const bool DEBUG_MODE</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00024">macros.h:24</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_dual_ray_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_dual_ray.html">operations_research::math_opt::IndexedDualRay</a></div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00645">indexed_model.h:645</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker_html_a4757d290de11ba9c741dbb2731ec9ed8"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker.html#a4757d290de11ba9c741dbb2731ec9ed8">operations_research::math_opt::IndexedModel::UpdateTracker::~UpdateTracker</a></div><div class="ttdeci">~UpdateTracker() ABSL_LOCKS_EXCLUDED(indexed_model_.update_trackers_lock_)</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8cc_source.html#l00514">indexed_model.cc:514</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_basis_html_a265be1b5bb98c8688eaabee9c97f0733"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_basis.html#a265be1b5bb98c8688eaabee9c97f0733">operations_research::math_opt::IndexedBasis::variable_status</a></div><div class="ttdeci">absl::flat_hash_map< VariableId, BasisStatus > variable_status</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00658">indexed_model.h:658</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_dual_solution_html_a297497ff6b18b2ba7164a2152a8349dd"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_dual_solution.html#a297497ff6b18b2ba7164a2152a8349dd">operations_research::math_opt::IndexedDualSolution::reduced_costs</a></div><div class="ttdeci">absl::flat_hash_map< VariableId, double > reduced_costs</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00630">indexed_model.h:630</a></div></div>
|
|
<div class="ttc" id="int__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</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="classoperations__research_1_1math__opt_1_1_indexed_model_html_a7f61878db357c5e54364c258b84bd60f"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a7f61878db357c5e54364c258b84bd60f">operations_research::math_opt::IndexedModel::AddVariable</a></div><div class="ttdeci">VariableId AddVariable(absl::string_view name="")</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00685">indexed_model.h:685</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_solutions_html_abcc13b24b3d5ff188d37fb4af2ef94e3"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_solutions.html#abcc13b24b3d5ff188d37fb4af2ef94e3">operations_research::math_opt::IndexedSolutions::dual_rays</a></div><div class="ttdeci">std::vector< IndexedDualRay > dual_rays</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00668">indexed_model.h:668</a></div></div>
|
|
<div class="ttc" id="default__search_8cc_html_ac673bc430bdc3fdaa09f7becf98ef267"><div class="ttname"><a href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a></div><div class="ttdeci">const std::string name</div><div class="ttdef"><b>Definition:</b> <a href="default__search_8cc_source.html#l00813">default_search.cc:813</a></div></div>
|
|
<div class="ttc" id="namespacegtl_html_a5c0d4dea208db4deaa285c06b78d8181"><div class="ttname"><a href="namespacegtl.html#a5c0d4dea208db4deaa285c06b78d8181">gtl::InsertOrDie</a></div><div class="ttdeci">void InsertOrDie(Collection *const collection, const typename Collection::value_type &value)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00154">map_util.h:154</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_dual_ray_html_a297497ff6b18b2ba7164a2152a8349dd"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_dual_ray.html#a297497ff6b18b2ba7164a2152a8349dd">operations_research::math_opt::IndexedDualRay::reduced_costs</a></div><div class="ttdeci">absl::flat_hash_map< VariableId, double > reduced_costs</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00647">indexed_model.h:647</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_basis_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_basis.html">operations_research::math_opt::IndexedBasis</a></div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00656">indexed_model.h:656</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_primal_solution_html_a0b6e5ca9443f7b80d00945d7a1846d5e"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_primal_solution.html#a0b6e5ca9443f7b80d00945d7a1846d5e">operations_research::math_opt::IndexedPrimalSolution::variable_values</a></div><div class="ttdeci">absl::flat_hash_map< VariableId, double > variable_values</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00598">indexed_model.h:598</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_solutions_html_a0c16ef549b2b4ae1c919befe358db529"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_solutions.html#a0c16ef549b2b4ae1c919befe358db529">operations_research::math_opt::IndexedSolutions::dual_solutions</a></div><div class="ttdeci">std::vector< IndexedDualSolution > dual_solutions</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00667">indexed_model.h:667</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_indexed_model_html"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model.html">operations_research::math_opt::IndexedModel</a></div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00161">indexed_model.h:161</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_indexed_model_html_af6af3777993dc125c5d4a46b5eee7575"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model.html#af6af3777993dc125c5d4a46b5eee7575">operations_research::math_opt::IndexedModel::SortedLinearConstraints</a></div><div class="ttdeci">std::vector< LinearConstraintId > SortedLinearConstraints() const</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8cc_source.html#l00211">indexed_model.cc:211</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="classoperations__research_1_1math__opt_1_1_indexed_model_html_affdd1f6f772003700c4ed2a36269efa7"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model.html#affdd1f6f772003700c4ed2a36269efa7">operations_research::math_opt::IndexedModel::NewUpdateTracker</a></div><div class="ttdeci">std::unique_ptr< UpdateTracker > NewUpdateTracker()</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8cc_source.html#l00499">indexed_model.cc:499</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker_html"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker.html">operations_research::math_opt::IndexedModel::UpdateTracker</a></div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00212">indexed_model.h:212</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="map__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_solutions_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_solutions.html">operations_research::math_opt::IndexedSolutions</a></div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00664">indexed_model.h:664</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker_html_ac4bca7e095c64253ee7df05641f6f250"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker.html#ac4bca7e095c64253ee7df05641f6f250">operations_research::math_opt::IndexedModel::UpdateTracker::ExportModelUpdate</a></div><div class="ttdeci">absl::optional< ModelUpdateProto > ExportModelUpdate() ABSL_LOCKS_EXCLUDED(indexed_model_.update_trackers_lock_)</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8cc_source.html#l00520">indexed_model.cc:520</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_primal_solution_html_a69703b8569462134ad4e22ab0133e418"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_primal_solution.html#a69703b8569462134ad4e22ab0133e418">operations_research::math_opt::IndexedPrimalSolution::objective_value</a></div><div class="ttdeci">double objective_value</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00599">indexed_model.h:599</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_dual_solution_html_aeadb7c4134d66923e3cfa1d48f5b4e8f"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_dual_solution.html#aeadb7c4134d66923e3cfa1d48f5b4e8f">operations_research::math_opt::IndexedDualSolution::dual_values</a></div><div class="ttdeci">absl::flat_hash_map< LinearConstraintId, double > dual_values</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00629">indexed_model.h:629</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_dual_solution_html_a69703b8569462134ad4e22ab0133e418"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_dual_solution.html#a69703b8569462134ad4e22ab0133e418">operations_research::math_opt::IndexedDualSolution::objective_value</a></div><div class="ttdeci">double objective_value</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00631">indexed_model.h:631</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_indexed_model_html_a17bfc36741359bc1a6313ab7beb2a616"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a17bfc36741359bc1a6313ab7beb2a616">operations_research::math_opt::IndexedModel::SortedVariables</a></div><div class="ttdeci">std::vector< VariableId > SortedVariables() const</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8cc_source.html#l00168">indexed_model.cc:168</a></div></div>
|
|
<div class="ttc" id="gscip__solver_8cc_html_a1e2f9a2352c1d9a6cada9544898fceec"><div class="ttname"><a href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a></div><div class="ttdeci">double lower_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00125">gscip_solver.cc:125</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_indexed_model_html_ad8227ba86a01f26e4f173cd5e219d5d1"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model.html#ad8227ba86a01f26e4f173cd5e219d5d1">operations_research::math_opt::IndexedModel::name</a></div><div class="ttdeci">const std::string & name() const</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00256">indexed_model.h:256</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_dual_solution_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_dual_solution.html">operations_research::math_opt::IndexedDualSolution</a></div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00628">indexed_model.h:628</a></div></div>
|
|
<div class="ttc" id="indexed__model_8h_html"><div class="ttname"><a href="indexed__model_8h.html">indexed_model.h</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_basis_html_a71ef6bd1ff70ba245d1d64648a207886"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_basis.html#a71ef6bd1ff70ba245d1d64648a207886">operations_research::math_opt::IndexedBasis::constraint_status</a></div><div class="ttdeci">absl::flat_hash_map< LinearConstraintId, BasisStatus > constraint_status</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00657">indexed_model.h:657</a></div></div>
|
|
<div class="ttc" id="sparse__vector__view_8h_html"><div class="ttname"><a href="sparse__vector__view_8h.html">sparse_vector_view.h</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00698">base/logging.h:698</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker_html_a7ab6e456ef150951bb67e3cf1ebe3056"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model_1_1_update_tracker.html#a7ab6e456ef150951bb67e3cf1ebe3056">operations_research::math_opt::IndexedModel::UpdateTracker::Checkpoint</a></div><div class="ttdeci">void Checkpoint() ABSL_LOCKS_EXCLUDED(indexed_model_.update_trackers_lock_)</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8cc_source.html#l00593">indexed_model.cc:593</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_indexed_model_html_a40f5d96de187737d854c193cb24b77d2"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a40f5d96de187737d854c193cb24b77d2">operations_research::math_opt::IndexedModel::DeleteLinearConstraint</a></div><div class="ttdeci">void DeleteLinearConstraint(LinearConstraintId id)</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8cc_source.html#l00186">indexed_model.cc:186</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="namespaceoperations__research_1_1math__opt_html_af002beeeedcb854981c62d4c5ad2ade6"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#af002beeeedcb854981c62d4c5ad2ade6">operations_research::math_opt::IndexedSolutionsFromProto</a></div><div class="ttdeci">IndexedSolutions IndexedSolutionsFromProto(const SolveResultProto &solve_result)</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8cc_source.html#l00455">indexed_model.cc:455</a></div></div>
|
|
<div class="ttc" id="namespacegtl_html_abc18f60961e36340e64e428827c0e38e"><div class="ttname"><a href="namespacegtl.html#abc18f60961e36340e64e428827c0e38e">gtl::FindWithDefault</a></div><div class="ttdeci">const Collection::value_type::second_type & FindWithDefault(const Collection &collection, const typename Collection::value_type::first_type &key, const typename Collection::value_type::second_type &value)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00029">map_util.h:29</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_dual_ray_html_aeadb7c4134d66923e3cfa1d48f5b4e8f"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_dual_ray.html#aeadb7c4134d66923e3cfa1d48f5b4e8f">operations_research::math_opt::IndexedDualRay::dual_values</a></div><div class="ttdeci">absl::flat_hash_map< LinearConstraintId, double > dual_values</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00646">indexed_model.h:646</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_indexed_model_html_a13a035185d02f47ea72b737b293516b1"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a13a035185d02f47ea72b737b293516b1">operations_research::math_opt::IndexedModel::linear_constraints</a></div><div class="ttdeci">std::vector< LinearConstraintId > linear_constraints() const</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8cc_source.html#l00207">indexed_model.cc:207</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_primal_solution_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_primal_solution.html">operations_research::math_opt::IndexedPrimalSolution</a></div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00597">indexed_model.h:597</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_primal_ray_html_a0b6e5ca9443f7b80d00945d7a1846d5e"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_primal_ray.html#a0b6e5ca9443f7b80d00945d7a1846d5e">operations_research::math_opt::IndexedPrimalRay::variable_values</a></div><div class="ttdeci">absl::flat_hash_map< VariableId, double > variable_values</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00619">indexed_model.h:619</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="structoperations__research_1_1math__opt_1_1_indexed_solutions_html_aa6fec8367be4573de5f0c143cf8005a1"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_solutions.html#aa6fec8367be4573de5f0c143cf8005a1">operations_research::math_opt::IndexedSolutions::basis</a></div><div class="ttdeci">std::vector< IndexedBasis > basis</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00669">indexed_model.h:669</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_primal_ray_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_primal_ray.html">operations_research::math_opt::IndexedPrimalRay</a></div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00618">indexed_model.h:618</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_indexed_model_html_a312154deac76051cb49fca9381fae41f"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a312154deac76051cb49fca9381fae41f">operations_research::math_opt::IndexedModel::SortedLinearObjectiveNonzeroVariables</a></div><div class="ttdeci">std::vector< VariableId > SortedLinearObjectiveNonzeroVariables() const</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8cc_source.html#l00215">indexed_model.cc:215</a></div></div>
|
|
<div class="ttc" id="namespacegtl_html_ab9e05694d7776f2eef357feca8b9d647"><div class="ttname"><a href="namespacegtl.html#ab9e05694d7776f2eef357feca8b9d647">gtl::FindOrNull</a></div><div class="ttdeci">const Collection::value_type::second_type * FindOrNull(const Collection &collection, const typename Collection::value_type::first_type &key)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00060">map_util.h:60</a></div></div>
|
|
<div class="ttc" id="expr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1math__opt_1_1_indexed_solutions_html_a8e3c4b125f4ff56f9d456091e5ba2e53"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_solutions.html#a8e3c4b125f4ff56f9d456091e5ba2e53">operations_research::math_opt::IndexedSolutions::primal_rays</a></div><div class="ttdeci">std::vector< IndexedPrimalRay > primal_rays</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00666">indexed_model.h:666</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_indexed_model_html_a21466ff77e82c4002423e4dda189b780"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model.html#a21466ff77e82c4002423e4dda189b780">operations_research::math_opt::IndexedModel::DeleteVariable</a></div><div class="ttdeci">void DeleteVariable(VariableId id)</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8cc_source.html#l00139">indexed_model.cc:139</a></div></div>
|
|
<div class="ttc" id="demon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1math__opt_1_1_indexed_model_html_aa850c403983019f6676dda010d9ac3a5"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model.html#aa850c403983019f6676dda010d9ac3a5">operations_research::math_opt::IndexedModel::ExportModel</a></div><div class="ttdeci">ModelProto ExportModel() const</div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8cc_source.html#l00254">indexed_model.cc:254</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="indexed__model_8cc.html">indexed_model.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>
|