573 lines
99 KiB
HTML
573 lines
99 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.20"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: tuple_set.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
|
|
 <span id="projectnumber">8.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.20 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('tuple__set_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">tuple_set.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="tuple__set_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> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// Set of integer tuples (fixed-size arrays, all of the same size) with</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// a basic API.</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// It supports several types of integer arrays transparently, with an</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// inherent storage based on int64 arrays.</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">// The key feature is the "lazy" copy:</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// - Copying an IntTupleSet won't actually copy the data right away; we</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// will just have several IntTupleSet pointing at the same data.</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// - Modifying an IntTupleSet which shares his data with others</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// will create a new, modified instance of the data payload, and make</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// the IntTupleSet point to that new data.</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// - Modifying an IntTupleSet that doesn't share its data with any other</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">// IntTupleSet will modify the data directly.</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// Therefore, you don't need to use const IntTupleSet& in methods. Just do:</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// void MyMethod(IntTupleSet tuple_set) { ... }</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// This class is thread hostile as the copy and reference counter are</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// not protected by a mutex.</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  </div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#ifndef OR_TOOLS_UTIL_TUPLE_SET_H_</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#define OR_TOOLS_UTIL_TUPLE_SET_H_</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  </div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  </div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#include "<a class="code" href="hash_8h.html">ortools/base/hash.h</a>"</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  </div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// ----- Main IntTupleSet class -----</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html"> 49</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_int_tuple_set.html">IntTupleSet</a> {</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// Creates an empty tuple set with a fixed length for all tuples.</span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a33d30bcfc841eb1820f138c1cc2b9f45">IntTupleSet</a>(<span class="keywordtype">int</span> arity);</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="comment">// Copy constructor (it actually does a lazy copy, see toplevel comment).</span></div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a33d30bcfc841eb1820f138c1cc2b9f45">IntTupleSet</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html">IntTupleSet</a>& set); <span class="comment">// NOLINT</span></div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a8440b97adb8cd19bd665eeb9bbf14978">~IntTupleSet</a>();</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  </div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// Clears data.</span></div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  </div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// Inserts the tuple to the set. It does nothing if the tuple is</span></div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// already in the set. The size of the tuple must be equal to the</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// arity of the set. It returns the index at which the tuple was</span></div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="comment">// inserted (-1 if it was already present).</span></div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a7d983605d7f35cf7c0b37fdebb44c13b">Insert</a>(<span class="keyword">const</span> std::vector<int>& tuple);</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a7d983605d7f35cf7c0b37fdebb44c13b">Insert</a>(<span class="keyword">const</span> std::vector<int64>& tuple);</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="comment">// Arity fixed version of Insert removing the need for a vector for the user.</span></div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a0b164b52168792fe126b6fc2764687d0">Insert2</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v0, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v1);</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a6045ba0cbb30054555d3d5d2ce40687b">Insert3</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v0, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v1, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v2);</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a150bdd5bdde0771513f313642493a104">Insert4</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v0, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v1, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v2, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v3);</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">// Inserts the tuples.</span></div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a17c83b499401197f69d219831dcdb044">InsertAll</a>(<span class="keyword">const</span> std::vector<std::vector<int64> >& tuples);</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a17c83b499401197f69d219831dcdb044">InsertAll</a>(<span class="keyword">const</span> std::vector<std::vector<int> >& tuples);</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  </div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// Checks if the tuple is in the set.</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a761f192ad8f3e729c4861ec01e332f95">Contains</a>(<span class="keyword">const</span> std::vector<int>& tuple) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a761f192ad8f3e729c4861ec01e332f95">Contains</a>(<span class="keyword">const</span> std::vector<int64>& tuple) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  </div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// Returns the number of tuples.</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#ac2a5be9e740d5b60e848ee87eccf3a48">NumTuples</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// Get the given tuple's value at the given position. The indices</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// of the tuples correspond to the order in which they were</span></div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// inserted.</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#aa120ad0f418276ac4da0292eafe5d026">Value</a>(<span class="keywordtype">int</span> tuple_index, <span class="keywordtype">int</span> pos_in_tuple) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// Returns the arity of the set.</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a0037cd346fd3bf29bcb354ba294db7fa">Arity</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// Access the raw data, see IntTupleSet::Data::flat_tuples_.</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* <a class="code" href="classoperations__research_1_1_int_tuple_set.html#ae21d49458adfba7d7e764c030b245957">RawData</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// Returns the number of different values in the given column.</span></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a95b0ea26a35433cf144dba82a781772a">NumDifferentValuesInColumn</a>(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// Return a copy of the set, sorted by the "col"-th value of each</span></div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// tuples. The sort is stable.</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <a class="code" href="classoperations__research_1_1_int_tuple_set.html">IntTupleSet</a> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a2ba8243c4dc29215b26a47feb7a455d6">SortedByColumn</a>(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// Returns a copy of the tuple set lexicographically sorted.</span></div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <a class="code" href="classoperations__research_1_1_int_tuple_set.html">IntTupleSet</a> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a1c9ccd2ce434f0080fc68a3fdb8780d3">SortedLexicographically</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  </div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// Class that holds the actual data of an IntTupleSet. It handles</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// the reference counters, etc.</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">class </span>Data {</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">explicit</span> Data(<span class="keywordtype">int</span> arity);</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  Data(<span class="keyword">const</span> Data& data);</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  ~Data();</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordtype">void</span> AddSharedOwner();</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordtype">bool</span> RemovedSharedOwner();</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  Data* CopyIfShared();</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a7d983605d7f35cf7c0b37fdebb44c13b">Insert</a>(<span class="keyword">const</span> std::vector<T>& tuple);</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a761f192ad8f3e729c4861ec01e332f95">Contains</a>(<span class="keyword">const</span> std::vector<T>& candidate) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> Fingerprint(<span class="keyword">const</span> std::vector<T>& tuple) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#ac2a5be9e740d5b60e848ee87eccf3a48">NumTuples</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#aa120ad0f418276ac4da0292eafe5d026">Value</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">int</span> pos) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a0037cd346fd3bf29bcb354ba294db7fa">Arity</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* <a class="code" href="classoperations__research_1_1_int_tuple_set.html#ae21d49458adfba7d7e764c030b245957">RawData</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  </div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>;</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordtype">int</span> num_owners_;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// Concatenation of all tuples ever added.</span></div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  std::vector<int64> flat_tuples_;</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// Maps a tuple's fingerprint to the list of tuples with this</span></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// fingerprint, represented by their start index in the</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// flat_tuples_ vector.</span></div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  absl::flat_hash_map<int64, std::vector<int> > tuple_fprint_to_index_;</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  };</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  </div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="comment">// Used to represent a light representation of a tuple.</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">struct </span>IndexData {</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  IntTupleSet::Data* data;</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  IndexData(<span class="keywordtype">int</span> i, IntTupleSet::Data* <span class="keyword">const</span> d) : <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>(i), data(d) {}</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span> Compare(<span class="keyword">const</span> IndexData& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <span class="keyword">const</span> IndexData& <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>);</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  };</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  </div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keyword">struct </span>IndexValue {</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>;</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  IndexValue(<span class="keywordtype">int</span> i, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v) : <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>(i), <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>(v) {}</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span> Compare(<span class="keyword">const</span> IndexValue& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <span class="keyword">const</span> IndexValue& <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>);</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  };</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  </div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keyword">mutable</span> Data* data_;</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> };</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  </div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// ----- Data -----</span></div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="keyword">inline</span> IntTupleSet::Data::Data(<span class="keywordtype">int</span> arity) : <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>(arity), num_owners_(0) {}</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  </div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="keyword">inline</span> IntTupleSet::Data::Data(<span class="keyword">const</span> Data& data)</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  : <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>(data.<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>),</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  num_owners_(0),</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  flat_tuples_(data.flat_tuples_),</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  tuple_fprint_to_index_(data.tuple_fprint_to_index_) {}</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  </div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="keyword">inline</span> IntTupleSet::Data::~Data() {}</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  </div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> IntTupleSet::Data::AddSharedOwner() { num_owners_++; }</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  </div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> IntTupleSet::Data::RemovedSharedOwner() {</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">return</span> (--num_owners_ == 0);</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> }</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  </div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="keyword">inline</span> IntTupleSet::Data* IntTupleSet::Data::CopyIfShared() {</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordflow">if</span> (num_owners_ > 1) { <span class="comment">// Copy on write.</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  Data* <span class="keyword">const</span> new_data = <span class="keyword">new</span> Data(*<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  RemovedSharedOwner();</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  new_data->AddSharedOwner();</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">return</span> new_data;</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">return</span> <span class="keyword">this</span>;</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> }</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  </div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="keywordtype">int</span> IntTupleSet::Data::Insert(<span class="keyword">const</span> std::vector<T>& tuple) {</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a> == 0 || flat_tuples_.size() % <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a> == 0);</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>, tuple.size());</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(1, num_owners_);</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">if</span> (!Contains(tuple)) {</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = NumTuples();</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> offset = flat_tuples_.size();</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  flat_tuples_.resize(offset + <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>);</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">// On mac os X, using this instead of push_back gives a 10x speedup!</span></div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++i) {</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  flat_tuples_[offset + i] = tuple[i];</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  }</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> fingerprint = Fingerprint(tuple);</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  tuple_fprint_to_index_[fingerprint].push_back(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">return</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span> }</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  </div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="keywordtype">bool</span> IntTupleSet::Data::Contains(<span class="keyword">const</span> std::vector<T>& candidate)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">if</span> (candidate.size() != <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>) {</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> fingerprint = Fingerprint(candidate);</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">if</span> (<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(tuple_fprint_to_index_, fingerprint)) {</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">const</span> std::vector<int>& indices =</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="code" href="namespacegtl.html#abce27d097bc5680207b294bdad75f59f">gtl::FindOrDie</a>(tuple_fprint_to_index_, fingerprint);</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < indices.size(); ++i) {</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> tuple_index = indices[i];</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; ++j) {</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">if</span> (candidate[j] != flat_tuples_[tuple_index * <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a> + j]) {</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  }</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  }</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  }</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  }</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span> }</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  </div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> IntTupleSet::Data::Fingerprint(<span class="keyword">const</span> std::vector<T>& tuple)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">switch</span> (<a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>) {</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">case</span> 0:</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">case</span> 1:</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">return</span> tuple[0];</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">case</span> 2: {</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> x = tuple[0];</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> y = <a class="code" href="integral__types_8h.html#a786084546298ed4128cd0742d10e280c">GG_ULONGLONG</a>(0xe08c1d668b756f82);</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> z = tuple[1];</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <a class="code" href="namespaceoperations__research.html#ae3eb78859f8162620f6fffe8cac690af">mix</a>(x, y, z);</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">return</span> z;</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  }</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">default</span>: {</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> x = tuple[0];</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> y = <a class="code" href="integral__types_8h.html#a786084546298ed4128cd0742d10e280c">GG_ULONGLONG</a>(0xe08c1d668b756f82);</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < tuple.size(); ++i) {</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> z = tuple[i];</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <a class="code" href="namespaceoperations__research.html#ae3eb78859f8162620f6fffe8cac690af">mix</a>(x, y, z);</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  x = z;</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">return</span> x;</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  }</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  }</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span> }</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  </div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> IntTupleSet::Data::NumTuples()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">return</span> tuple_fprint_to_index_.size();</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span> }</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  </div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="keyword">inline</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">IntTupleSet::Data::Value</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">int</span> pos)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, 0);</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, flat_tuples_.size() / <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>);</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(pos, 0);</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(pos, <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>);</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">return</span> flat_tuples_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> * <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a> + pos];</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span> }</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  </div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> IntTupleSet::Data::Arity()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a>; }</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  </div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* IntTupleSet::Data::RawData()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">return</span> flat_tuples_.data();</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span> }</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  </div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> IntTupleSet::Data::Clear() {</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  flat_tuples_.clear();</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  tuple_fprint_to_index_.clear();</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span> }</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  </div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a33d30bcfc841eb1820f138c1cc2b9f45"> 268</a></span> <span class="keyword">inline</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a33d30bcfc841eb1820f138c1cc2b9f45">IntTupleSet::IntTupleSet</a>(<span class="keywordtype">int</span> arity) : data_(new Data(arity)) {</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(arity, 0);</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  data_->AddSharedOwner();</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span> }</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  </div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a83c58448e6892a7b6bce681d3687ecd9"> 273</a></span> <span class="keyword">inline</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a33d30bcfc841eb1820f138c1cc2b9f45">IntTupleSet::IntTupleSet</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html">IntTupleSet</a>& set) : data_(set.data_) {</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  data_->AddSharedOwner();</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span> }</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  </div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a8440b97adb8cd19bd665eeb9bbf14978"> 277</a></span> <span class="keyword">inline</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a8440b97adb8cd19bd665eeb9bbf14978">IntTupleSet::~IntTupleSet</a>() {</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(data_ != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">if</span> (data_->RemovedSharedOwner()) {</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keyword">delete</span> data_;</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span> }</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  </div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#aa71d36872f416feaa853788a7a7a7ef8"> 284</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#aa71d36872f416feaa853788a7a7a7ef8">IntTupleSet::Clear</a>() {</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  data_ = data_->CopyIfShared();</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  data_->Clear();</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span> }</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  </div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a7d983605d7f35cf7c0b37fdebb44c13b"> 289</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a7d983605d7f35cf7c0b37fdebb44c13b">IntTupleSet::Insert</a>(<span class="keyword">const</span> std::vector<int>& tuple) {</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  data_ = data_->CopyIfShared();</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordflow">return</span> data_->Insert(tuple);</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span> }</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  </div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a62b52dc41f81aa7913980ee6767b66e3"> 294</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a7d983605d7f35cf7c0b37fdebb44c13b">IntTupleSet::Insert</a>(<span class="keyword">const</span> std::vector<int64>& tuple) {</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  data_ = data_->CopyIfShared();</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">return</span> data_->Insert(tuple);</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span> }</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  </div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a0b164b52168792fe126b6fc2764687d0"> 299</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a0b164b52168792fe126b6fc2764687d0">IntTupleSet::Insert2</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v0, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v1) {</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  std::vector<int64> tuple(2);</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  tuple[0] = v0;</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  tuple[1] = v1;</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a7d983605d7f35cf7c0b37fdebb44c13b">Insert</a>(tuple);</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span> }</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  </div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a6045ba0cbb30054555d3d5d2ce40687b"> 306</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a6045ba0cbb30054555d3d5d2ce40687b">IntTupleSet::Insert3</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v0, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v1, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v2) {</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  std::vector<int64> tuple(3);</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  tuple[0] = v0;</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  tuple[1] = v1;</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  tuple[2] = v2;</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a7d983605d7f35cf7c0b37fdebb44c13b">Insert</a>(tuple);</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span> }</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  </div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a150bdd5bdde0771513f313642493a104"> 314</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a150bdd5bdde0771513f313642493a104">IntTupleSet::Insert4</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v0, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v1, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v2, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> v3) {</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  std::vector<int64> tuple(4);</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  tuple[0] = v0;</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  tuple[1] = v1;</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  tuple[2] = v2;</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  tuple[3] = v3;</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a7d983605d7f35cf7c0b37fdebb44c13b">Insert</a>(tuple);</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span> }</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  </div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a761f192ad8f3e729c4861ec01e332f95"> 323</a></span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a761f192ad8f3e729c4861ec01e332f95">IntTupleSet::Contains</a>(<span class="keyword">const</span> std::vector<int>& tuple)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordflow">return</span> data_->Contains(tuple);</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span> }</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  </div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#aa817847f718e0390c0f9bc11a09a19fc"> 327</a></span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a761f192ad8f3e729c4861ec01e332f95">IntTupleSet::Contains</a>(<span class="keyword">const</span> std::vector<int64>& tuple)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">return</span> data_->Contains(tuple);</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span> }</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  </div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a592de0650fbb71c96873bfac96bb6321"> 331</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a17c83b499401197f69d219831dcdb044">IntTupleSet::InsertAll</a>(</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keyword">const</span> std::vector<std::vector<int> >& tuples) {</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  data_ = data_->CopyIfShared();</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < tuples.size(); ++i) {</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a7d983605d7f35cf7c0b37fdebb44c13b">Insert</a>(tuples[i]);</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  }</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span> }</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  </div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a17c83b499401197f69d219831dcdb044"> 339</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a17c83b499401197f69d219831dcdb044">IntTupleSet::InsertAll</a>(</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keyword">const</span> std::vector<std::vector<int64> >& tuples) {</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  data_ = data_->CopyIfShared();</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < tuples.size(); ++i) {</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a7d983605d7f35cf7c0b37fdebb44c13b">Insert</a>(tuples[i]);</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  }</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span> }</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  </div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#ac2a5be9e740d5b60e848ee87eccf3a48"> 347</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#ac2a5be9e740d5b60e848ee87eccf3a48">IntTupleSet::NumTuples</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> data_->NumTuples(); }</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  </div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#aa120ad0f418276ac4da0292eafe5d026"> 349</a></span> <span class="keyword">inline</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#aa120ad0f418276ac4da0292eafe5d026">IntTupleSet::Value</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">int</span> pos)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keywordflow">return</span> data_->Value(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, pos);</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span> }</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  </div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a0037cd346fd3bf29bcb354ba294db7fa"> 353</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a0037cd346fd3bf29bcb354ba294db7fa">IntTupleSet::Arity</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> data_->Arity(); }</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  </div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#ae21d49458adfba7d7e764c030b245957"> 355</a></span> <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* <a class="code" href="classoperations__research_1_1_int_tuple_set.html#ae21d49458adfba7d7e764c030b245957">IntTupleSet::RawData</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> data_->RawData(); }</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  </div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a95b0ea26a35433cf144dba82a781772a"> 357</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a95b0ea26a35433cf144dba82a781772a">IntTupleSet::NumDifferentValuesInColumn</a>(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">if</span> (col < 0 || col >= data_->Arity()) {</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  }</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  absl::flat_hash_set<int64> values;</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < data_->NumTuples(); ++i) {</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  values.insert(data_->Value(i, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>));</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  }</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">return</span> values.size();</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span> }</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  </div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> IntTupleSet::IndexValue::Compare(<span class="keyword">const</span> IndexValue& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>,</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keyword">const</span> IndexValue& <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">return</span> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.value < <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.value || (<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.value == <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.value && <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.index < <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.index);</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span> }</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  </div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a2ba8243c4dc29215b26a47feb7a455d6"> 373</a></span> <span class="keyword">inline</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html">IntTupleSet</a> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a2ba8243c4dc29215b26a47feb7a455d6">IntTupleSet::SortedByColumn</a>(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  std::vector<IndexValue> keys;</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  keys.reserve(data_->NumTuples());</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < data_->NumTuples(); ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  keys.push_back(IndexValue(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, data_->Value(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)));</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  }</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  std::sort(keys.begin(), keys.end(), IntTupleSet::IndexValue::Compare);</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> arity = data_->Arity();</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <a class="code" href="classoperations__research_1_1_int_tuple_set.html">IntTupleSet</a> sorted(arity);</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < keys.size(); ++i) {</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* tuple_ptr = data_->RawData() + keys[i].index * arity;</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  sorted.<a class="code" href="classoperations__research_1_1_int_tuple_set.html#a7d983605d7f35cf7c0b37fdebb44c13b">Insert</a>(std::vector<int64>(tuple_ptr, tuple_ptr + arity));</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  }</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">return</span> sorted;</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span> }</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  </div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> IntTupleSet::IndexData::Compare(<span class="keyword">const</span> IndexData& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>,</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keyword">const</span> IndexData& <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keyword">const</span> IntTupleSet::Data* <span class="keyword">const</span> data = <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.data;</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> arity = data->Arity();</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < arity; ++i) {</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> value1 = data->Value(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.index, i);</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> value2 = data->Value(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.index, i);</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keywordflow">if</span> (value1 < value2) {</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  }</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordflow">if</span> (value1 > value2) {</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  }</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  }</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span> }</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  </div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_tuple_set.html#a1c9ccd2ce434f0080fc68a3fdb8780d3"> 406</a></span> <span class="keyword">inline</span> <a class="code" href="classoperations__research_1_1_int_tuple_set.html">IntTupleSet</a> <a class="code" href="classoperations__research_1_1_int_tuple_set.html#a1c9ccd2ce434f0080fc68a3fdb8780d3">IntTupleSet::SortedLexicographically</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  std::vector<IndexData> keys;</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  keys.reserve(data_->NumTuples());</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < data_->NumTuples(); ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  keys.push_back(IndexData(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, data_));</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  }</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  std::sort(keys.begin(), keys.end(), IntTupleSet::IndexData::Compare);</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> arity = data_->Arity();</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <a class="code" href="classoperations__research_1_1_int_tuple_set.html">IntTupleSet</a> sorted(arity);</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < keys.size(); ++i) {</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  std::vector<int64> tuple(arity);</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* tuple_ptr = data_->RawData() + keys[i].index * arity;</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  sorted.<a class="code" href="classoperations__research_1_1_int_tuple_set.html#a7d983605d7f35cf7c0b37fdebb44c13b">Insert</a>(std::vector<int64>(tuple_ptr, tuple_ptr + arity));</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  }</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">return</span> sorted;</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span> }</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  </div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="preprocessor">#endif // OR_TOOLS_UTIL_TUPLE_SET_H_</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_a17c83b499401197f69d219831dcdb044"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#a17c83b499401197f69d219831dcdb044">operations_research::IntTupleSet::InsertAll</a></div><div class="ttdeci">void InsertAll(const std::vector< std::vector< int64 > > &tuples)</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00339">tuple_set.h:339</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="abase_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00888">base/logging.h:888</a></div></div>
|
|
<div class="ttc" id="amap__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_ac2a5be9e740d5b60e848ee87eccf3a48"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#ac2a5be9e740d5b60e848ee87eccf3a48">operations_research::IntTupleSet::NumTuples</a></div><div class="ttdeci">int NumTuples() const</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00347">tuple_set.h:347</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_a0b164b52168792fe126b6fc2764687d0"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#a0b164b52168792fe126b6fc2764687d0">operations_research::IntTupleSet::Insert2</a></div><div class="ttdeci">int Insert2(int64 v0, int64 v1)</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00299">tuple_set.h:299</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#l00701">base/logging.h:701</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a786084546298ed4128cd0742d10e280c"><div class="ttname"><a href="integral__types_8h.html#a786084546298ed4128cd0742d10e280c">GG_ULONGLONG</a></div><div class="ttdeci">#define GG_ULONGLONG(x)</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00047">integral_types.h:47</a></div></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="ademon__profiler_8cc_html_a21edc7ca4cc5802c8779d68556bc09cf"><div class="ttname"><a href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a></div><div class="ttdeci">int64 value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_ae21d49458adfba7d7e764c030b245957"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#ae21d49458adfba7d7e764c030b245957">operations_research::IntTupleSet::RawData</a></div><div class="ttdeci">const int64 * RawData() const</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00355">tuple_set.h:355</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</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">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</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="anamespaceoperations__research_html_ae3eb78859f8162620f6fffe8cac690af"><div class="ttname"><a href="namespaceoperations__research.html#ae3eb78859f8162620f6fffe8cac690af">operations_research::mix</a></div><div class="ttdeci">static void mix(uint32 &a, uint32 &b, uint32 &c)</div><div class="ttdef"><b>Definition:</b> <a href="hash_8h_source.html#l00028">hash.h:28</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00508">pack.cc:508</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_abce27d097bc5680207b294bdad75f59f"><div class="ttname"><a href="namespacegtl.html#abce27d097bc5680207b294bdad75f59f">gtl::FindOrDie</a></div><div class="ttdeci">const Collection::value_type::second_type & FindOrDie(const Collection &collection, const typename Collection::value_type::first_type &key)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00176">map_util.h:176</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_a150bdd5bdde0771513f313642493a104"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#a150bdd5bdde0771513f313642493a104">operations_research::IntTupleSet::Insert4</a></div><div class="ttdeci">int Insert4(int64 v0, int64 v1, int64 v2, int64 v3)</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00314">tuple_set.h:314</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_af730895c6c6ef6e03caaf6251192dfd2"><div class="ttname"><a href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a></div><div class="ttdeci">int64 a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00042">constraint_solver/table.cc:42</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_a95b0ea26a35433cf144dba82a781772a"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#a95b0ea26a35433cf144dba82a781772a">operations_research::IntTupleSet::NumDifferentValuesInColumn</a></div><div class="ttdeci">int NumDifferentValuesInColumn(int col) const</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00357">tuple_set.h:357</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_a8440b97adb8cd19bd665eeb9bbf14978"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#a8440b97adb8cd19bd665eeb9bbf14978">operations_research::IntTupleSet::~IntTupleSet</a></div><div class="ttdeci">~IntTupleSet()</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00277">tuple_set.h:277</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00697">base/logging.h:697</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_a6045ba0cbb30054555d3d5d2ce40687b"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#a6045ba0cbb30054555d3d5d2ce40687b">operations_research::IntTupleSet::Insert3</a></div><div class="ttdeci">int Insert3(int64 v0, int64 v1, int64 v2)</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00306">tuple_set.h:306</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::IntTupleSet::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00284">tuple_set.h:284</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_abc0f5bc07737e498f287334775dff2b6"><div class="ttname"><a href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a></div><div class="ttdeci">uint64_t uint64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00039">integral_types.h:39</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3f1a1b8a7a1a488e263a2e74f45d2a59"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">operations_research::sat::Value</a></div><div class="ttdeci">std::function< int64(const Model &)> Value(IntegerVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01480">integer.h:1480</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00884">base/logging.h:884</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a5889398aa7aa6ccf7b24b80bdd95e9c3"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a5889398aa7aa6ccf7b24b80bdd95e9c3">arity_</a></div><div class="ttdeci">const int arity_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00222">constraint_solver/table.cc:222</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_a761f192ad8f3e729c4861ec01e332f95"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#a761f192ad8f3e729c4861ec01e332f95">operations_research::IntTupleSet::Contains</a></div><div class="ttdeci">bool Contains(const std::vector< int > &tuple) const</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00323">tuple_set.h:323</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_a7d983605d7f35cf7c0b37fdebb44c13b"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#a7d983605d7f35cf7c0b37fdebb44c13b">operations_research::IntTupleSet::Insert</a></div><div class="ttdeci">int Insert(const std::vector< int > &tuple)</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00289">tuple_set.h:289</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_a0037cd346fd3bf29bcb354ba294db7fa"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#a0037cd346fd3bf29bcb354ba294db7fa">operations_research::IntTupleSet::Arity</a></div><div class="ttdeci">int Arity() const</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00353">tuple_set.h:353</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</a></div></div>
|
|
<div class="ttc" id="amarkowitz_8cc_html_aa9d6c98fdf8d89b0e2321fda02adc82c"><div class="ttname"><a href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a></div><div class="ttdeci">ColIndex col</div><div class="ttdef"><b>Definition:</b> <a href="markowitz_8cc_source.html#l00176">markowitz.cc:176</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="ahash_8h_html"><div class="ttname"><a href="hash_8h.html">hash.h</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a344010e26426d6a13411648d988bc9b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a></div><div class="ttdeci">int64 b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00043">constraint_solver/table.cc:43</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html">operations_research::IntTupleSet</a></div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00049">tuple_set.h:49</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_a2ba8243c4dc29215b26a47feb7a455d6"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#a2ba8243c4dc29215b26a47feb7a455d6">operations_research::IntTupleSet::SortedByColumn</a></div><div class="ttdeci">IntTupleSet SortedByColumn(int col) const</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00373">tuple_set.h:373</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_a33d30bcfc841eb1820f138c1cc2b9f45"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#a33d30bcfc841eb1820f138c1cc2b9f45">operations_research::IntTupleSet::IntTupleSet</a></div><div class="ttdeci">IntTupleSet(int arity)</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00268">tuple_set.h:268</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_aa120ad0f418276ac4da0292eafe5d026"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#aa120ad0f418276ac4da0292eafe5d026">operations_research::IntTupleSet::Value</a></div><div class="ttdeci">int64 Value(int tuple_index, int pos_in_tuple) const</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00349">tuple_set.h:349</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_tuple_set_html_a1c9ccd2ce434f0080fc68a3fdb8780d3"><div class="ttname"><a href="classoperations__research_1_1_int_tuple_set.html#a1c9ccd2ce434f0080fc68a3fdb8780d3">operations_research::IntTupleSet::SortedLexicographically</a></div><div class="ttdeci">IntTupleSet SortedLexicographically() const</div><div class="ttdef"><b>Definition:</b> <a href="tuple__set_8h_source.html#l00406">tuple_set.h:406</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_aae28e97bd1fa93cb0032642550da7455"><div class="ttname"><a href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a></div><div class="ttdeci">bool ContainsKey(const Collection &collection, const Key &key)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00170">map_util.h:170</a></div></div>
|
|
<!-- 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_a3328a0ea67a2aaa160c2783ffbaa5dc.html">util</a></li><li class="navelem"><a class="el" href="tuple__set_8h.html">tuple_set.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.8.20 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|