396 lines
60 KiB
HTML
396 lines
60 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.9.2"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: ids_validator.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>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.2 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('ids__validator_8cc_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">ids_validator.cc</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="ids__validator_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" 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 id="l00003" 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 id="l00004" 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 id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" 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 id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" 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 id="l00009" 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 id="l00010" 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 id="l00011" 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 id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include "<a class="code" href="ids__validator_8h.html">ortools/math_opt/validators/ids_validator.h</a>"</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <stddef.h></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span> </div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <iterator></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span> </div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include "absl/status/status.h"</span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include "absl/strings/str_cat.h"</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "absl/strings/string_view.h"</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "absl/types/span.h"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "<a class="code" href="model__summary_8h.html">ortools/math_opt/core/model_summary.h</a>"</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include "<a class="code" href="status__macros_8h.html">ortools/base/status_macros.h</a>"</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> </div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="keyword">namespace </span>math_opt {</div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> </div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#ad9f50c9313b35cc1e8887057dc4d9645"> 35</a></span><span class="keyword">constexpr</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="namespaceoperations__research_1_1math__opt.html#ad9f50c9313b35cc1e8887057dc4d9645">kInf</a> = std::numeric_limits<double>::infinity();</div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> </div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span>absl::Status CheckSortedIdsSubsetWithIndexOffset(</div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keyword">const</span> absl::Span<const int64_t> ids,</div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keyword">const</span> absl::Span<const int64_t> universe, <span class="keyword">const</span> int64_t offset) {</div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keywordtype">int</span> id_index = 0;</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keywordtype">int</span> universe_index = 0;</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// NOTE(user): in the common case where ids and/or universe is consecutive,</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// we can avoid iterating though the list and do interval based checks.</span></div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordflow">while</span> (id_index < ids.size() && universe_index < universe.size()) {</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordflow">if</span> (universe[universe_index] < ids[id_index]) {</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> ++universe_index;</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (universe[universe_index] == ids[id_index]) {</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> ++id_index;</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> }</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> }</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="keywordflow">if</span> (id_index < ids.size()) {</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">return</span> absl::InvalidArgumentError(</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> absl::StrCat(<span class="stringliteral">"Bad id: "</span>, ids[id_index],</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="stringliteral">" (at index: "</span>, id_index + offset, <span class="stringliteral">") found"</span>));</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> }</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordflow">return</span> absl::OkStatus();</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span>}</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> </div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span><span class="comment">// Given a sorted, strictly increasing set of ids, provides `contains()` to</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span><span class="comment">// check if another id is in the set in O(1) time.</span></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span><span class="comment">// Implementation note: when ids are consecutive, they are stored as a single</span></div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span><span class="comment">// interval [lb, ub), otherwise they are stored as a hash table of integers.</span></div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span><span class="keyword">class </span>FastIdCheck {</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// ids must be sorted with unique strictly increasing entries.</span></div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keyword">explicit</span> FastIdCheck(<span class="keyword">const</span> absl::Span<const int64_t> ids) {</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordflow">if</span> (ids.empty()) {</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> interval_mode_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ids.size() == ids.back() + 1 - ids.front()) {</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> interval_mode_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> interval_lb_ = ids.front();</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> interval_ub_ = ids.back() + 1;</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> ids_ = absl::flat_hash_set<int64_t>(ids.begin(), ids.end());</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> }</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordtype">bool</span> contains(int64_t <span class="keywordtype">id</span>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">if</span> (interval_mode_) {</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordflow">return</span> <span class="keywordtype">id</span> >= interval_lb_ && <span class="keywordtype">id</span> < interval_ub_;</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">return</span> ids_.contains(<span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> }</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> }</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> </div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="keywordtype">bool</span> interval_mode_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> int64_t interval_lb_ = 0;</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> int64_t interval_ub_ = 0;</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> absl::flat_hash_set<int64_t> ids_;</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span>};</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> </div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span><span class="comment">// Checks that the elements of ids and bad_list have no overlap.</span></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span><span class="comment">// Assumed: ids and bad_list are sorted in increasing order, repeats allowed.</span></div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span>absl::Status CheckSortedIdsNotBad(<span class="keyword">const</span> absl::Span<const int64_t> ids,</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keyword">const</span> absl::Span<const int64_t> bad_list) {</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keywordtype">int</span> id_index = 0;</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordtype">int</span> bad_index = 0;</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="keywordflow">while</span> (id_index < ids.size() && bad_index < bad_list.size()) {</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordflow">if</span> (bad_list[bad_index] < ids[id_index]) {</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> ++bad_index;</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (bad_list[bad_index] > ids[id_index]) {</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> ++id_index;</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keywordflow">return</span> absl::InvalidArgumentError(absl::StrCat(</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="stringliteral">"Bad id: "</span>, ids[id_index], <span class="stringliteral">" (at index: "</span>, id_index, <span class="stringliteral">") found."</span>));</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> }</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> }</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keywordflow">return</span> absl::OkStatus();</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span>}</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> </div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#a6f7cf38d6c86eb1da6a4e3b8d53aefeb"> 117</a></span>absl::Status <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a6f7cf38d6c86eb1da6a4e3b8d53aefeb">CheckIdsNonnegativeAndStrictlyIncreasing</a>(</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> absl::Span<const int64_t> ids) {</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> int64_t previous{-1};</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ids.size(); ++i) {</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keywordflow">if</span> (ids[i] <= previous) {</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> std::string error_base = absl::StrCat(</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="stringliteral">"Expected ids to be nonnegative and strictly increasing, but at "</span></div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="stringliteral">"index "</span>,</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> i, <span class="stringliteral">", found id: "</span>, ids[i]);</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordflow">if</span> (i == 0) {</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keywordflow">return</span> absl::InvalidArgumentError(</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> absl::StrCat(error_base, <span class="stringliteral">" (a negative id)"</span>));</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="keywordflow">return</span> absl::InvalidArgumentError(absl::StrCat(</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> error_base, <span class="stringliteral">" and at index "</span>, i - 1, <span class="stringliteral">" found id: "</span>, ids[i - 1]));</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> }</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> }</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> previous = ids[i];</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> }</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keywordflow">return</span> absl::OkStatus();</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span>}</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> </div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#a958eb4bf489f47b772795a26f98d6330"> 139</a></span>absl::Status <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a958eb4bf489f47b772795a26f98d6330">CheckSortedIdsSubset</a>(<span class="keyword">const</span> absl::Span<const int64_t> ids,</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keyword">const</span> absl::Span<const int64_t> universe) {</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <a class="code hl_define" href="status__macros_8h.html#acdc223d8c59d5c591dc6b4e88257627b">RETURN_IF_ERROR</a>(CheckSortedIdsSubsetWithIndexOffset(ids, universe, 0));</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keywordflow">return</span> absl::OkStatus();</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span>}</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> </div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#a171bca8410e8a81b91523dbf444eb7ab"> 145</a></span>absl::Status <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a171bca8410e8a81b91523dbf444eb7ab">CheckUnsortedIdsSubset</a>(<span class="keyword">const</span> absl::Span<const int64_t> ids,</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="keyword">const</span> absl::Span<const int64_t> universe) {</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keywordflow">if</span> (ids.empty()) {</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="keywordflow">return</span> absl::OkStatus();</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> }</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="keyword">const</span> FastIdCheck id_check(universe);</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ids.size(); ++i) {</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <span class="keywordflow">if</span> (!id_check.contains(ids[i])) {</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keywordflow">return</span> absl::InvalidArgumentError(</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> absl::StrCat(<span class="stringliteral">"Bad id: "</span>, ids[i], <span class="stringliteral">" (at index: "</span>, i, <span class="stringliteral">") not found."</span>));</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> }</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> }</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="keywordflow">return</span> absl::OkStatus();</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span>}</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> </div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_id_update_validator.html#afa3cf6e1db522252509ec15039658ec4"> 160</a></span>absl::Status <a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_update_validator.html#afa3cf6e1db522252509ec15039658ec4">IdUpdateValidator::IsValid</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < deleted_ids_.size(); ++i) {</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="keyword">const</span> int64_t deleted_id = deleted_ids_[i];</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keywordflow">if</span> (!old_ids_.<a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html#a3d7966ee882774b7bf3daee9f309b3d2">HasId</a>(deleted_id)) {</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="keywordflow">return</span> absl::InvalidArgumentError(</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> absl::StrCat(<span class="stringliteral">"Tried to delete id: "</span>, deleted_id, <span class="stringliteral">" (at index: "</span>, i,</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="stringliteral">") but it was not present."</span>));</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> }</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> }</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keywordflow">if</span> (old_ids_.<a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html#abcfbdba215d3b15fbb4b682969943a6e">Empty</a>() || new_ids_.empty()) {</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="keywordflow">return</span> absl::OkStatus();</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> }</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keywordflow">if</span> (old_ids_.<a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html#a50f2155e05090df8be4452cc121b8e4a">LargestId</a>() >= new_ids_.front()) {</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="keywordflow">return</span> absl::InvalidArgumentError(absl::StrCat(</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="stringliteral">"All old ids should be less than all new ids, but final old id was: "</span>,</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> old_ids_.<a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html#a50f2155e05090df8be4452cc121b8e4a">LargestId</a>(), <span class="stringliteral">" and first new id was: "</span>, new_ids_.front()));</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> }</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="keywordflow">return</span> absl::OkStatus();</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span>}</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> </div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_id_update_validator.html#af7cd701529db2a55f51ef17f99b1798e"> 180</a></span>absl::Status <a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_update_validator.html#af7cd701529db2a55f51ef17f99b1798e">IdUpdateValidator::CheckSortedIdsSubsetOfNotDeleted</a>(</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="keyword">const</span> absl::Span<const int64_t> ids)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <a class="code hl_define" href="status__macros_8h.html#acdc223d8c59d5c591dc6b4e88257627b">RETURN_IF_ERROR</a>(CheckSortedIdsNotBad(ids, deleted_ids_)) << <span class="stringliteral">" was deleted"</span>;</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ids.size(); ++i) {</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="keywordflow">if</span> (!old_ids_.<a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html#a3d7966ee882774b7bf3daee9f309b3d2">HasId</a>(ids[i])) {</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="keywordflow">return</span> absl::InvalidArgumentError(</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> absl::StrCat(<span class="stringliteral">"Bad id: "</span>, ids[i], <span class="stringliteral">" (at index: "</span>, i, <span class="stringliteral">") not found."</span>));</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> }</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> }</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="keywordflow">return</span> absl::OkStatus();</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span>}</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> </div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_id_update_validator.html#a24d1f83533097bcf0ce26471e325f7af"> 192</a></span>absl::Status <a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_update_validator.html#a24d1f83533097bcf0ce26471e325f7af">IdUpdateValidator::CheckSortedIdsSubsetOfFinal</a>(</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="keyword">const</span> absl::Span<const int64_t> ids)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="comment">// Implementation:</span></div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="comment">// * Partition ids into "old" and "new"</span></div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="comment">// * Check that the old ids are in old_ids_ but not deleted_ids_.</span></div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="comment">// * Check that the new ids are in new_ids_.</span></div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="keywordtype">size_t</span> split_point = ids.size();</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="keywordflow">if</span> (!new_ids_.empty()) {</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> split_point = <a class="code hl_variable" href="routing__search_8cc.html#a79b8e036dca6911e3295a47d99f21f43">std::distance</a>(</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> ids.begin(), <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">std::lower_bound</a>(ids.begin(), ids.end(), new_ids_[0]));</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> }</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <a class="code hl_define" href="status__macros_8h.html#acdc223d8c59d5c591dc6b4e88257627b">RETURN_IF_ERROR</a>(</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_update_validator.html#af7cd701529db2a55f51ef17f99b1798e">CheckSortedIdsSubsetOfNotDeleted</a>(ids.subspan(0, split_point)));</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <a class="code hl_define" href="status__macros_8h.html#acdc223d8c59d5c591dc6b4e88257627b">RETURN_IF_ERROR</a>(CheckSortedIdsSubsetWithIndexOffset(ids.subspan(split_point),</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> new_ids_, split_point));</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="keywordflow">return</span> absl::OkStatus();</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span>}</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> </div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span><span class="comment">// Checks that ids is a subset of FINAL = old_ids_ - deleted_ids_ + new_ids_.</span></div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span><span class="comment">// If ids is sorted, prefer CheckSortedIdsSubsetOfFinal.</span></div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"><a class="line" href="classoperations__research_1_1math__opt_1_1_id_update_validator.html#a38fd085ad7a4460b5c0ba746f2d2b869"> 213</a></span>absl::Status <a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_update_validator.html#a38fd085ad7a4460b5c0ba746f2d2b869">IdUpdateValidator::CheckIdsSubsetOfFinal</a>(</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="keyword">const</span> absl::Span<const int64_t> ids)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="keywordflow">if</span> (ids.empty()) {</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="keywordflow">return</span> absl::OkStatus();</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> }</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="keyword">const</span> FastIdCheck deleted_fast(deleted_ids_);</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="keyword">const</span> FastIdCheck new_fast(new_ids_);</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ids.size(); ++i) {</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <span class="keyword">const</span> int64_t <span class="keywordtype">id</span> = ids[i];</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="keywordflow">if</span> (<span class="keywordtype">id</span> <= old_ids_.<a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html#a50f2155e05090df8be4452cc121b8e4a">LargestId</a>()) {</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="keywordflow">if</span> (!old_ids_.<a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html#a3d7966ee882774b7bf3daee9f309b3d2">HasId</a>(<span class="keywordtype">id</span>)) {</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="keywordflow">return</span> absl::InvalidArgumentError(</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> absl::StrCat(<span class="stringliteral">"Bad id: "</span>, <span class="keywordtype">id</span>, <span class="stringliteral">" (at index: "</span>, i, <span class="stringliteral">") not found."</span>));</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (deleted_fast.contains(<span class="keywordtype">id</span>)) {</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="keywordflow">return</span> absl::InvalidArgumentError(</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> absl::StrCat(<span class="stringliteral">"Bad id: "</span>, <span class="keywordtype">id</span>, <span class="stringliteral">" (at index: "</span>, i, <span class="stringliteral">") was deleted."</span>));</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> }</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!new_fast.contains(<span class="keywordtype">id</span>)) {</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="keywordflow">return</span> absl::InvalidArgumentError(</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> absl::StrCat(<span class="stringliteral">"Bad id: "</span>, <span class="keywordtype">id</span>, <span class="stringliteral">" (at index: "</span>, i, <span class="stringliteral">") not found."</span>));</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> }</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> }</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="keywordflow">return</span> absl::OkStatus();</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span>}</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> </div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#aa680631976be354abbcd28e2ec941ca7"> 238</a></span>absl::Status <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#aa680631976be354abbcd28e2ec941ca7">CheckIdsSubset</a>(absl::Span<const int64_t> ids,</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html">IdNameBiMap</a>& universe,</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> absl::string_view ids_description,</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> absl::string_view universe_description) {</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ids.size(); ++i) {</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="keyword">const</span> int64_t <span class="keywordtype">id</span> = ids[i];</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="keywordflow">if</span> (!universe.<a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html#a3d7966ee882774b7bf3daee9f309b3d2">HasId</a>(<span class="keywordtype">id</span>)) {</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="keywordflow">return</span> absl::InvalidArgumentError(</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> absl::StrCat(<span class="stringliteral">"Id: "</span>, <span class="keywordtype">id</span>, <span class="stringliteral">" (at index: "</span>, i, <span class="stringliteral">") in "</span>, ids_description,</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="stringliteral">" is missing from "</span>, universe_description, <span class="stringliteral">"."</span>));</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> }</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> }</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="keywordflow">return</span> absl::OkStatus();</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span>}</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> </div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#afecf2131c4ddbd801120447bc2d4f02d"> 253</a></span>absl::Status <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#afecf2131c4ddbd801120447bc2d4f02d">CheckIdsIdentical</a>(absl::Span<const int64_t> first_ids,</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html">IdNameBiMap</a>& second_ids,</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> absl::string_view first_description,</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> absl::string_view second_description) {</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="keywordflow">if</span> (first_ids.size() != second_ids.<a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html#a24926108b770033792d015cb86aeffb3">Size</a>()) {</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <span class="keywordflow">return</span> absl::InvalidArgumentError(absl::StrCat(</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> first_description, <span class="stringliteral">" has size "</span>, first_ids.size(), <span class="stringliteral">", but "</span>,</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> second_description, <span class="stringliteral">" has size "</span>, second_ids.<a class="code hl_function" href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html#a24926108b770033792d015cb86aeffb3">Size</a>(), <span class="stringliteral">"."</span>));</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> }</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> <a class="code hl_define" href="status__macros_8h.html#acdc223d8c59d5c591dc6b4e88257627b">RETURN_IF_ERROR</a>(<a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#aa680631976be354abbcd28e2ec941ca7">CheckIdsSubset</a>(first_ids, second_ids, first_description,</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> second_description));</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> <span class="keywordflow">return</span> absl::OkStatus();</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span>}</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> </div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span>} <span class="comment">// namespace math_opt</span></div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_id_name_bi_map_html"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html">operations_research::math_opt::IdNameBiMap</a></div><div class="ttdef"><b>Definition:</b> <a href="model__summary_8h_source.html#l00038">model_summary.h:38</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_id_name_bi_map_html_a24926108b770033792d015cb86aeffb3"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html#a24926108b770033792d015cb86aeffb3">operations_research::math_opt::IdNameBiMap::Size</a></div><div class="ttdeci">int Size() const</div><div class="ttdef"><b>Definition:</b> <a href="model__summary_8h_source.html#l00117">model_summary.h:117</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_id_name_bi_map_html_a3d7966ee882774b7bf3daee9f309b3d2"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html#a3d7966ee882774b7bf3daee9f309b3d2">operations_research::math_opt::IdNameBiMap::HasId</a></div><div class="ttdeci">bool HasId(int64_t id) const</div><div class="ttdef"><b>Definition:</b> <a href="model__summary_8h_source.html#l00107">model_summary.h:107</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_id_name_bi_map_html_a50f2155e05090df8be4452cc121b8e4a"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html#a50f2155e05090df8be4452cc121b8e4a">operations_research::math_opt::IdNameBiMap::LargestId</a></div><div class="ttdeci">int64_t LargestId() const</div><div class="ttdef"><b>Definition:</b> <a href="model__summary_8h_source.html#l00119">model_summary.h:119</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_id_name_bi_map_html_abcfbdba215d3b15fbb4b682969943a6e"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_id_name_bi_map.html#abcfbdba215d3b15fbb4b682969943a6e">operations_research::math_opt::IdNameBiMap::Empty</a></div><div class="ttdeci">bool Empty() const</div><div class="ttdef"><b>Definition:</b> <a href="model__summary_8h_source.html#l00115">model_summary.h:115</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_id_update_validator_html_a24d1f83533097bcf0ce26471e325f7af"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_id_update_validator.html#a24d1f83533097bcf0ce26471e325f7af">operations_research::math_opt::IdUpdateValidator::CheckSortedIdsSubsetOfFinal</a></div><div class="ttdeci">absl::Status CheckSortedIdsSubsetOfFinal(const absl::Span< const int64_t > ids) const</div><div class="ttdef"><b>Definition:</b> <a href="ids__validator_8cc_source.html#l00192">ids_validator.cc:192</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_id_update_validator_html_a38fd085ad7a4460b5c0ba746f2d2b869"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_id_update_validator.html#a38fd085ad7a4460b5c0ba746f2d2b869">operations_research::math_opt::IdUpdateValidator::CheckIdsSubsetOfFinal</a></div><div class="ttdeci">absl::Status CheckIdsSubsetOfFinal(const absl::Span< const int64_t > ids) const</div><div class="ttdef"><b>Definition:</b> <a href="ids__validator_8cc_source.html#l00213">ids_validator.cc:213</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_id_update_validator_html_af7cd701529db2a55f51ef17f99b1798e"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_id_update_validator.html#af7cd701529db2a55f51ef17f99b1798e">operations_research::math_opt::IdUpdateValidator::CheckSortedIdsSubsetOfNotDeleted</a></div><div class="ttdeci">absl::Status CheckSortedIdsSubsetOfNotDeleted(const absl::Span< const int64_t > ids) const</div><div class="ttdef"><b>Definition:</b> <a href="ids__validator_8cc_source.html#l00180">ids_validator.cc:180</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_id_update_validator_html_afa3cf6e1db522252509ec15039658ec4"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_id_update_validator.html#afa3cf6e1db522252509ec15039658ec4">operations_research::math_opt::IdUpdateValidator::IsValid</a></div><div class="ttdeci">absl::Status IsValid() const</div><div class="ttdef"><b>Definition:</b> <a href="ids__validator_8cc_source.html#l00160">ids_validator.cc:160</a></div></div>
|
|
<div class="ttc" id="agscip__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="aids__validator_8h_html"><div class="ttname"><a href="ids__validator_8h.html">ids_validator.h</a></div></div>
|
|
<div class="ttc" id="amodel__summary_8h_html"><div class="ttname"><a href="model__summary_8h.html">model_summary.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a171bca8410e8a81b91523dbf444eb7ab"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a171bca8410e8a81b91523dbf444eb7ab">operations_research::math_opt::CheckUnsortedIdsSubset</a></div><div class="ttdeci">absl::Status CheckUnsortedIdsSubset(const absl::Span< const int64_t > ids, const absl::Span< const int64_t > universe)</div><div class="ttdef"><b>Definition:</b> <a href="ids__validator_8cc_source.html#l00145">ids_validator.cc:145</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a6f7cf38d6c86eb1da6a4e3b8d53aefeb"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a6f7cf38d6c86eb1da6a4e3b8d53aefeb">operations_research::math_opt::CheckIdsNonnegativeAndStrictlyIncreasing</a></div><div class="ttdeci">absl::Status CheckIdsNonnegativeAndStrictlyIncreasing(absl::Span< const int64_t > ids)</div><div class="ttdef"><b>Definition:</b> <a href="ids__validator_8cc_source.html#l00117">ids_validator.cc:117</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a958eb4bf489f47b772795a26f98d6330"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a958eb4bf489f47b772795a26f98d6330">operations_research::math_opt::CheckSortedIdsSubset</a></div><div class="ttdeci">absl::Status CheckSortedIdsSubset(const absl::Span< const int64_t > ids, const absl::Span< const int64_t > universe)</div><div class="ttdef"><b>Definition:</b> <a href="ids__validator_8cc_source.html#l00139">ids_validator.cc:139</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_aa680631976be354abbcd28e2ec941ca7"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#aa680631976be354abbcd28e2ec941ca7">operations_research::math_opt::CheckIdsSubset</a></div><div class="ttdeci">absl::Status CheckIdsSubset(absl::Span< const int64_t > ids, const IdNameBiMap &universe, absl::string_view ids_description, absl::string_view universe_description)</div><div class="ttdef"><b>Definition:</b> <a href="ids__validator_8cc_source.html#l00238">ids_validator.cc:238</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ad9f50c9313b35cc1e8887057dc4d9645"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ad9f50c9313b35cc1e8887057dc4d9645">operations_research::math_opt::kInf</a></div><div class="ttdeci">constexpr double kInf</div><div class="ttdef"><b>Definition:</b> <a href="ids__validator_8cc_source.html#l00035">ids_validator.cc:35</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_afecf2131c4ddbd801120447bc2d4f02d"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#afecf2131c4ddbd801120447bc2d4f02d">operations_research::math_opt::CheckIdsIdentical</a></div><div class="ttdeci">absl::Status CheckIdsIdentical(absl::Span< const int64_t > first_ids, const IdNameBiMap &second_ids, absl::string_view first_description, absl::string_view second_description)</div><div class="ttdef"><b>Definition:</b> <a href="ids__validator_8cc_source.html#l00253">ids_validator.cc:253</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 class="ttc" id="arouting__search_8cc_html_a79b8e036dca6911e3295a47d99f21f43"><div class="ttname"><a href="routing__search_8cc.html#a79b8e036dca6911e3295a47d99f21f43">distance</a></div><div class="ttdeci">double distance</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03610">routing_search.cc:3610</a></div></div>
|
|
<div class="ttc" id="astatus__macros_8h_html"><div class="ttname"><a href="status__macros_8h.html">status_macros.h</a></div></div>
|
|
<div class="ttc" id="astatus__macros_8h_html_acdc223d8c59d5c591dc6b4e88257627b"><div class="ttname"><a href="status__macros_8h.html#acdc223d8c59d5c591dc6b4e88257627b">RETURN_IF_ERROR</a></div><div class="ttdeci">#define RETURN_IF_ERROR(expr)</div><div class="ttdef"><b>Definition:</b> <a href="status__macros_8h_source.html#l00029">status_macros.h:29</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_2298c6cf5b60fbeba088c3582d3d0ae0.html">validators</a></li><li class="navelem"><a class="el" href="ids__validator_8cc.html">ids_validator.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.9.2 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|