always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
efd16c78daefdfd2c1295fb0580cf2acdcfce268
ortools-clone/docs/cpp/math__opt__proto__utils_8h_source.html

256 lines
32 KiB
HTML
Raw Normal View History

Update Reference documentation
2021-04-27 23:00:03 +02:00
<!-- HTML header for doxygen 1.8.18-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OR-Tools: math_opt_proto_utils.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">OR-Tools
&#160;<span id="projectnumber">9.0</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;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&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('math__opt__proto__utils_8h_source.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">math_opt_proto_utils.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="math__opt__proto__utils_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="comment">// Copyright 2010-2021 Google LLC</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">// Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<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>&#160;<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>&#160;<span class="comment">//</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<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>&#160;<span class="comment">//</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<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>&#160;<span class="comment">// distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<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>&#160;<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>&#160;<span class="comment">// limitations under the License.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160; </div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="preprocessor">#ifndef OR_TOOLS_MATH_OPT_MATH_OPT_PROTO_UTILS_H_</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="preprocessor">#define OR_TOOLS_MATH_OPT_MATH_OPT_PROTO_UTILS_H_</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160; </div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="preprocessor">#include &lt;cstdint&gt;</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160; </div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="preprocessor">#include &quot;absl/container/flat_hash_set.h&quot;</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>&quot;</span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>&quot;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="preprocessor">#include &quot;ortools/math_opt/callback.pb.h&quot;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;<span class="preprocessor">#include &quot;ortools/math_opt/model.pb.h&quot;</span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="preprocessor">#include &quot;ortools/math_opt/sparse_containers.pb.h&quot;</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; </div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160;<span class="keyword">namespace </span>math_opt {</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160; </div>
<div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#a3055f8b845cde39af2c3bed9007d4a06"> 29</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research_1_1math__opt.html#a3055f8b845cde39af2c3bed9007d4a06">NumVariables</a>(<span class="keyword">const</span> VariablesProto&amp; variables) {</div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160; <span class="keywordflow">return</span> variables.ids_size();</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160;}</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; </div>
<div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#a98600a28f0f805ae0cbe04802b0dcbc4"> 33</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research_1_1math__opt.html#a98600a28f0f805ae0cbe04802b0dcbc4">NumConstraints</a>(<span class="keyword">const</span> LinearConstraintsProto&amp; linear_constraints) {</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; <span class="keywordflow">return</span> linear_constraints.ids_size();</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160;}</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; </div>
<div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#a1c3bab427ac8280d7b32019b88ec59b4"> 37</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research_1_1math__opt.html#a1c3bab427ac8280d7b32019b88ec59b4">NumMatrixNonzeros</a>(<span class="keyword">const</span> SparseDoubleMatrixProto&amp; matrix) {</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; <span class="keywordflow">return</span> matrix.row_ids_size();</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160;}</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; </div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160;<span class="comment">// Removes the items in the sparse double vector for all indices whose value is</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160;<span class="comment">// exactly 0.0.</span></div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160;<span class="comment">//</span></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160;<span class="comment">// NaN values are kept in place.</span></div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160;<span class="comment">//</span></div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160;<span class="comment">// The function asserts that input is a valid sparse vector, i.e. that the</span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160;<span class="comment">// number of values and ids match.</span></div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160;<span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1math__opt.html#af649365c28596912460bb9375e377b63">RemoveSparseDoubleVectorZeros</a>(SparseDoubleVectorProto&amp; sparse_vector);</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; </div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160;<span class="comment">// A utility class that tests if a pair (id, value) should be filtered based on</span></div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160;<span class="comment">// an input SparseVectorFilterProto.</span></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160;<span class="comment">//</span></div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160;<span class="comment">// This predicate expects the input is sorted by ids. In non-optimized builds,</span></div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160;<span class="comment">// it will check that this is the case.</span></div>
<div class="line"><a name="l00055"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate.html"> 55</a></span>&#160;<span class="keyword">class </span><a class="code" href="classoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate.html">SparseVectorFilterPredicate</a> {</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <span class="keyword">public</span>:</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="comment">// Builds a predicate based on the input filter. A reference to this filter is</span></div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="comment">// kept so the caller must make sure this filter outlives the predicate.</span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="comment">//</span></div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="comment">// The filter.filtered_ids is expected to be sorted and not contain</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <span class="comment">// duplicates. In non-optimized builds, it will be CHECKed.</span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate.html#a4b629c158cb9a96810d39b72b3a2a587">SparseVectorFilterPredicate</a>(<span class="keyword">const</span> SparseVectorFilterProto&amp; filter);</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; </div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <span class="comment">// Returns true if the input value should be kept, false if it should be</span></div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="comment">// ignored since it is not selected by the filter.</span></div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; <span class="comment">//</span></div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; <span class="comment">// This function is expected to be called with strictly increasing ids. In</span></div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; <span class="comment">// non-optimized builds it will CHECK that this is the case. It updates an</span></div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; <span class="comment">// internal counter when filtering by ids.</span></div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Value&gt;</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate.html#ac85e9cc171a845c8fe097f9306544181">AcceptsAndUpdate</a>(<span class="keyword">const</span> int64_t <span class="keywordtype">id</span>, <span class="keyword">const</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a3bd2b0a66b0f1c16476487ad3ddc72ea">Value</a>&amp; <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; </div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; <span class="keyword">private</span>:</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <span class="keyword">const</span> SparseVectorFilterProto&amp; filter_;</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; </div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; <span class="comment">// Index of the next element to consider in filter_.filtered_ids().</span></div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; <span class="keywordtype">int</span> next_filtered_id_index_ = 0;</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; </div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160;<span class="preprocessor">#ifndef NDEBUG</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; <span class="comment">// Invariant: next input id must be &gt;= next_input_id_lower_bound_.</span></div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <span class="comment">//</span></div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <span class="comment">// The initial value is 0 since all ids are expected to be non-negative.</span></div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; <span class="keywordtype">int</span> next_input_id_lower_bound_ = 0;</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// NDEBUG</span></div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160;};</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; </div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160;<span class="comment">// Returns the callback_registration.request_registration as a set of enums.</span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160;absl::flat_hash_set&lt;CallbackEventProto&gt; <a class="code" href="namespaceoperations__research_1_1math__opt.html#af457f60ebac293554106c3ee3898607e">EventSet</a>(</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; <span class="keyword">const</span> CallbackRegistrationProto&amp; callback_registration);</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; </div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160;<span class="comment">// Inline functions implementations.</span></div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> Value&gt;</div>
<div class="line"><a name="l00096"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate.html#ac85e9cc171a845c8fe097f9306544181"> 96</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate.html#ac85e9cc171a845c8fe097f9306544181">SparseVectorFilterPredicate::AcceptsAndUpdate</a>(<span class="keyword">const</span> int64_t <span class="keywordtype">id</span>,</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; <span class="keyword">const</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a3bd2b0a66b0f1c16476487ad3ddc72ea">Value</a>&amp; <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160;<span class="preprocessor">#ifndef NDEBUG</span></div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(<span class="keywordtype">id</span>, next_input_id_lower_bound_)</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; &lt;&lt; <span class="stringliteral">&quot;This function must be called with strictly increasing ids.&quot;</span>;</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; </div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; <span class="comment">// Update the range of the next expected id. We expect input to be strictly</span></div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; <span class="comment">// increasing.</span></div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; next_input_id_lower_bound_ = <span class="keywordtype">id</span> + 1;</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// NDEBUG</span></div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; </div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; <span class="comment">// For this predicate we use `0` as the zero to test with since as of today we</span></div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; <span class="comment">// only have SparseDoubleVectorProto and SparseBoolVectorProto. The `bool`</span></div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; <span class="comment">// type is an integral type so the comparison with 0 will indeed be equivalent</span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; <span class="comment">// to keeping only `true` values.</span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <span class="keywordflow">if</span> (filter_.skip_zero_values() &amp;&amp; <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == 0) {</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; }</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; </div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <span class="keywordflow">if</span> (!filter_.filter_by_ids()) {</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; }</div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; </div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; <span class="comment">// Skip all filtered_ids that are smaller than the input id.</span></div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; <span class="keywordflow">while</span> (next_filtered_id_index_ &lt; filter_.filtered_ids_size() &amp;&amp;</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; filter_.filtered_ids(next_filtered_id_index_) &lt; <span class="keywordtype">id</span>) {</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; ++next_filtered_id_index_;</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; }</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; </div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; <span class="keywordflow">if</span> (next_filtered_id_index_ == filter_.filtered_ids_size()) {</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; <span class="comment">// We filter by ids and there are no more ids that should pass.</span></div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; }</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; </div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; <span class="comment">// The previous loop ensured that the element at next_filtered_id_index_ is</span></div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160; <span class="comment">// the first element greater or equal to id.</span></div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; <span class="keywordflow">return</span> <span class="keywordtype">id</span> == filter_.filtered_ids(next_filtered_id_index_);</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160;}</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; </div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160;} <span class="comment">// namespace math_opt</span></div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160;} <span class="comment">// namespace operations_research</span></div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; </div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_MATH_OPT_MATH_OPT_PROTO_UTILS_H_</span></div>
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00709">base/logging.h:709</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate_html"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate.html">operations_research::math_opt::SparseVectorFilterPredicate</a></div><div class="ttdef"><b>Definition:</b> <a href="math__opt__proto__utils_8h_source.html#l00055">math_opt_proto_utils.h:55</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate_html_a4b629c158cb9a96810d39b72b3a2a587"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate.html#a4b629c158cb9a96810d39b72b3a2a587">operations_research::math_opt::SparseVectorFilterPredicate::SparseVectorFilterPredicate</a></div><div class="ttdeci">SparseVectorFilterPredicate(const SparseVectorFilterProto &amp;filter)</div><div class="ttdef"><b>Definition:</b> <a href="math__opt__proto__utils_8cc_source.html#l00052">math_opt_proto_utils.cc:52</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate_html_ac85e9cc171a845c8fe097f9306544181"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_sparse_vector_filter_predicate.html#ac85e9cc171a845c8fe097f9306544181">operations_research::math_opt::SparseVectorFilterPredicate::AcceptsAndUpdate</a></div><div class="ttdeci">bool AcceptsAndUpdate(const int64_t id, const Value &amp;value)</div><div class="ttdef"><b>Definition:</b> <a href="math__opt__proto__utils_8h_source.html#l00096">math_opt_proto_utils.h:96</a></div></div>
<div class="ttc" id="ademon__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="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a1c3bab427ac8280d7b32019b88ec59b4"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a1c3bab427ac8280d7b32019b88ec59b4">operations_research::math_opt::NumMatrixNonzeros</a></div><div class="ttdeci">int NumMatrixNonzeros(const SparseDoubleMatrixProto &amp;matrix)</div><div class="ttdef"><b>Definition:</b> <a href="math__opt__proto__utils_8h_source.html#l00037">math_opt_proto_utils.h:37</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a3055f8b845cde39af2c3bed9007d4a06"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a3055f8b845cde39af2c3bed9007d4a06">operations_research::math_opt::NumVariables</a></div><div class="ttdeci">int NumVariables(const VariablesProto &amp;variables)</div><div class="ttdef"><b>Definition:</b> <a href="math__opt__proto__utils_8h_source.html#l00029">math_opt_proto_utils.h:29</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a98600a28f0f805ae0cbe04802b0dcbc4"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a98600a28f0f805ae0cbe04802b0dcbc4">operations_research::math_opt::NumConstraints</a></div><div class="ttdeci">int NumConstraints(const LinearConstraintsProto &amp;linear_constraints)</div><div class="ttdef"><b>Definition:</b> <a href="math__opt__proto__utils_8h_source.html#l00033">math_opt_proto_utils.h:33</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_af457f60ebac293554106c3ee3898607e"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#af457f60ebac293554106c3ee3898607e">operations_research::math_opt::EventSet</a></div><div class="ttdeci">absl::flat_hash_set&lt; CallbackEventProto &gt; EventSet(const CallbackRegistrationProto &amp;callback_registration)</div><div class="ttdef"><b>Definition:</b> <a href="math__opt__proto__utils_8cc_source.html#l00067">math_opt_proto_utils.cc:67</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_af649365c28596912460bb9375e377b63"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#af649365c28596912460bb9375e377b63">operations_research::math_opt::RemoveSparseDoubleVectorZeros</a></div><div class="ttdeci">void RemoveSparseDoubleVectorZeros(SparseDoubleVectorProto &amp;sparse_vector)</div><div class="ttdef"><b>Definition:</b> <a href="math__opt__proto__utils_8cc_source.html#l00032">math_opt_proto_utils.cc:32</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3bd2b0a66b0f1c16476487ad3ddc72ea"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3bd2b0a66b0f1c16476487ad3ddc72ea">operations_research::sat::Value</a></div><div class="ttdeci">std::function&lt; int64_t(const Model &amp;)&gt; Value(IntegerVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01492">integer.h:1492</a></div></div>
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
</div><!-- 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="math__opt__proto__utils_8h.html">math_opt_proto_utils.h</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue Copy Permalink