235 lines
206 KiB
HTML
235 lines
206 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.15"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: bitset.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>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('bitset_8h_source.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">bitset.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="bitset_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-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// Various utility functions on bitsets.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#ifndef OR_TOOLS_UTIL_BITSET_H_</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#define OR_TOOLS_UTIL_BITSET_H_</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <string.h></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> </div><div class="line"><a name="l00024"></a><span class="lineno"> 24</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="l00025"></a><span class="lineno"> 25</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="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// Basic bit operations</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// Useful constants: word and double word will all bits set.</span></div><div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a0e884eebd1c1e380a6c87a245df85d9a"> 33</a></span> <span class="keyword">static</span> <span class="keyword">const</span> uint64_t <a class="code" href="namespaceoperations__research.html#a0e884eebd1c1e380a6c87a245df85d9a">kAllBits64</a> = uint64_t{0xFFFFFFFFFFFFFFFF};</div><div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a74bf4c5f3b2b625258f9b5f7c4e1ab11"> 34</a></span> <span class="keyword">static</span> <span class="keyword">const</span> uint64_t <a class="code" href="namespaceoperations__research.html#a74bf4c5f3b2b625258f9b5f7c4e1ab11">kAllBitsButLsb64</a> = uint64_t{0xFFFFFFFFFFFFFFFE};</div><div class="line"><a name="l00035"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#af789197eaf23a66b25a390f00c04ddd4"> 35</a></span> <span class="keyword">static</span> <span class="keyword">const</span> uint32_t <a class="code" href="namespaceoperations__research.html#af789197eaf23a66b25a390f00c04ddd4">kAllBits32</a> = 0xFFFFFFFFU;</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// Returns a word with only bit pos set.</span></div><div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71"> 38</a></span> <span class="keyword">inline</span> uint64_t <a class="code" href="namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71">OneBit64</a>(<span class="keywordtype">int</span> pos) { <span class="keywordflow">return</span> uint64_t{1} << pos; }</div><div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#aa400cb586d3da8079abd2dfe15434c26"> 39</a></span> <span class="keyword">inline</span> uint32_t <a class="code" href="namespaceoperations__research.html#aa400cb586d3da8079abd2dfe15434c26">OneBit32</a>(<span class="keywordtype">int</span> pos) { <span class="keywordflow">return</span> 1U << pos; }</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// Returns the number of bits set in n.</span></div><div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#abc979832d72da1ae793ba6d28ae46672"> 42</a></span> <span class="keyword">inline</span> uint64_t <a class="code" href="namespaceoperations__research.html#abc979832d72da1ae793ba6d28ae46672">BitCount64</a>(uint64_t n) {</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">const</span> uint64_t m1 = uint64_t{0x5555555555555555};</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keyword">const</span> uint64_t m2 = uint64_t{0x3333333333333333};</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keyword">const</span> uint64_t m4 = uint64_t{0x0F0F0F0F0F0F0F0F};</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">const</span> uint64_t h01 = uint64_t{0x0101010101010101};</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  n -= (n >> 1) & m1;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  n = (n & m2) + ((n >> 2) & m2);</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  n = (n + (n >> 4)) & m4;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  n = (n * h01) >> 56;</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">return</span> n;</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> }</div><div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a4841d3c6b072a22ba2b2fe43d6c03298"> 53</a></span> <span class="keyword">inline</span> uint32_t <a class="code" href="namespaceoperations__research.html#a4841d3c6b072a22ba2b2fe43d6c03298">BitCount32</a>(uint32_t n) {</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  n -= (n >> 1) & 0x55555555UL;</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  n = (n & 0x33333333) + ((n >> 2) & 0x33333333UL);</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  n = (n + (n >> 4)) & 0x0F0F0F0FUL;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  n = n + (n >> 8);</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  n = n + (n >> 16);</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">return</span> n & 0x0000003FUL;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> }</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// Returns a word with only the least significant bit of n set.</span></div><div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#aee01d67a7a666bd54a183ac162e34238"> 63</a></span> <span class="keyword">inline</span> uint64_t <a class="code" href="namespaceoperations__research.html#aee01d67a7a666bd54a183ac162e34238">LeastSignificantBitWord64</a>(uint64_t n) { <span class="keywordflow">return</span> n & ~(n - 1); }</div><div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a7f40cd0560f4962b81e8b99333ea6e2b"> 64</a></span> <span class="keyword">inline</span> uint32_t <a class="code" href="namespaceoperations__research.html#a7f40cd0560f4962b81e8b99333ea6e2b">LeastSignificantBitWord32</a>(uint32_t n) { <span class="keywordflow">return</span> n & ~(n - 1); }</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// Returns the least significant bit position in n.</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// Discussion around lsb computation:</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// De Bruijn is almost as fast as the bsr/bsf-instruction-based intrinsics.</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// Both are always much faster than the Default algorithm.</span></div><div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="bitset_8h.html#ae5a53e66fb1e93cdfc78edc0aa603d81"> 70</a></span> <span class="preprocessor">#define USE_DEBRUIJN true // if true, use de Bruijn bit forward scanner.</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="preprocessor">#if defined(__GNUC__) || defined(__llvm__)</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="preprocessor">#define USE_FAST_LEAST_SIGNIFICANT_BIT true // if true, use fast lsb.</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> </div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="preprocessor">#if defined(USE_FAST_LEAST_SIGNIFICANT_BIT)</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> LeastSignificantBitPosition64Fast(uint64_t n) {</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">return</span> n == 0 ? 0 : __builtin_ctzll(n);</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> }</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a588a37fe4aa71e468b26ca5388732ea0"> 81</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research.html#a588a37fe4aa71e468b26ca5388732ea0">LeastSignificantBitPosition64DeBruijn</a>(uint64_t n) {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">static</span> <span class="keyword">const</span> uint64_t kSeq = uint64_t{0x0218a392dd5fb34f};</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kTab[64] = {</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// initialized by 'kTab[(kSeq << i) >> 58] = i</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  0, 1, 2, 7, 3, 13, 8, 19, 4, 25, 14, 28, 9, 52, 20, 58,</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  5, 17, 26, 56, 15, 38, 29, 40, 10, 49, 53, 31, 21, 34, 59, 42,</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  63, 6, 12, 18, 24, 27, 51, 57, 16, 55, 37, 39, 48, 30, 33, 41,</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  62, 11, 23, 50, 54, 36, 47, 32, 61, 22, 35, 46, 60, 45, 44, 43,</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  };</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">return</span> kTab[((n & (~n + 1)) * kSeq) >> 58];</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> }</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> </div><div class="line"><a name="l00093"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a6a4eefefc8c7cf8ee2f381b692e370a6"> 93</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research.html#a6a4eefefc8c7cf8ee2f381b692e370a6">LeastSignificantBitPosition64Default</a>(uint64_t n) {</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">if</span> (n == 0) <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordtype">int</span> pos = 63;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span> (n & 0x00000000FFFFFFFFLL) {</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  pos -= 32;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  n >>= 32;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">if</span> (n & 0x000000000000FFFFLL) {</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  pos -= 16;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  n >>= 16;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">if</span> (n & 0x00000000000000FFLL) {</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  pos -= 8;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  n >>= 8;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  }</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">if</span> (n & 0x000000000000000FLL) {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  pos -= 4;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  n >>= 4;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  }</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">if</span> (n & 0x0000000000000003LL) {</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  pos -= 2;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  n >>= 2;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">if</span> (n & 0x0000000000000001LL) {</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  pos -= 1;</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  }</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">return</span> pos;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> }</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div><div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ae13fcb4162a4180395806f43237c44b2"> 127</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research.html#ae13fcb4162a4180395806f43237c44b2">LeastSignificantBitPosition64</a>(uint64_t n) {</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(n, 0);</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="preprocessor">#ifdef USE_FAST_LEAST_SIGNIFICANT_BIT</span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">return</span> LeastSignificantBitPosition64Fast(n);</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="preprocessor">#elif defined(USE_DEBRUIJN)</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a588a37fe4aa71e468b26ca5388732ea0">LeastSignificantBitPosition64DeBruijn</a>(n);</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a6a4eefefc8c7cf8ee2f381b692e370a6">LeastSignificantBitPosition64Default</a>(n);</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="preprocessor">#endif</span></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="preprocessor">#if defined(USE_FAST_LEAST_SIGNIFICANT_BIT)</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> LeastSignificantBitPosition32Fast(uint32_t n) {</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">return</span> n == 0 ? 0 : __builtin_ctzl(n);</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> }</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> </div><div class="line"><a name="l00144"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a9ae0f5d6a36d2ac42ff62911ceff551e"> 144</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research.html#a9ae0f5d6a36d2ac42ff62911ceff551e">LeastSignificantBitPosition32DeBruijn</a>(uint32_t n) {</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keyword">static</span> <span class="keyword">const</span> uint32_t kSeq = 0x077CB531U; <span class="comment">// de Bruijn sequence</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kTab[32] = {<span class="comment">// initialized by 'kTab[(kSeq << i) >> 27] = i</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20,</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  15, 25, 17, 4, 8, 31, 27, 13, 23, 21, 19,</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  16, 7, 26, 12, 18, 6, 11, 5, 10, 9};</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">return</span> kTab[((n & (~n + 1)) * kSeq) >> 27];</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> }</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div><div class="line"><a name="l00153"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a1c691865bdad3f6ee0525a77368a87c9"> 153</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research.html#a1c691865bdad3f6ee0525a77368a87c9">LeastSignificantBitPosition32Default</a>(uint32_t n) {</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">if</span> (n == 0) <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordtype">int</span> pos = 31;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (n & 0x0000FFFFL) {</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  pos -= 16;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  n >>= 16;</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="keywordflow">if</span> (n & 0x000000FFL) {</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  pos -= 8;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  n >>= 8;</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  }</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordflow">if</span> (n & 0x0000000FL) {</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  pos -= 4;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  n >>= 4;</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  }</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">if</span> (n & 0x00000003L) {</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  pos -= 2;</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  n >>= 2;</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  }</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">if</span> (n & 0x00000001L) {</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  pos -= 1;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  }</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordflow">return</span> pos;</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> }</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> </div><div class="line"><a name="l00182"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#aeaca21c840bf285f12127938231369b9"> 182</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research.html#aeaca21c840bf285f12127938231369b9">LeastSignificantBitPosition32</a>(uint32_t n) {</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(n, 0);</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="preprocessor">#ifdef USE_FAST_LEAST_SIGNIFICANT_BIT</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">return</span> LeastSignificantBitPosition32Fast(n);</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="preprocessor">#elif defined(USE_DEBRUIJN)</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a9ae0f5d6a36d2ac42ff62911ceff551e">LeastSignificantBitPosition32DeBruijn</a>(n);</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a1c691865bdad3f6ee0525a77368a87c9">LeastSignificantBitPosition32Default</a>(n);</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> }</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> </div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment">// Returns the most significant bit position in n.</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="preprocessor">#if USE_FAST_LEAST_SIGNIFICANT_BIT</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> MostSignificantBitPosition64Fast(uint64_t n) {</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="comment">// __builtin_clzll(1) should always return 63. There is no penalty in</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">// using offset, and the code looks more like its uint32_t counterpart.</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> offset = __builtin_clzll(1);</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">return</span> n == 0 ? 0 : (offset - __builtin_clzll(n));</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="preprocessor">#endif</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> </div><div class="line"><a name="l00203"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ae5948f76a02af5bf9638b3c29038cb96"> 203</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research.html#ae5948f76a02af5bf9638b3c29038cb96">MostSignificantBitPosition64Default</a>(uint64_t n) {</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = 0;</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">if</span> (0 != (n & (<a class="code" href="namespaceoperations__research.html#a0e884eebd1c1e380a6c87a245df85d9a">kAllBits64</a> << (1 << 5)))) {</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> |= (1 << 5);</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  n >>= (1 << 5);</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  }</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">if</span> (0 != (n & (<a class="code" href="namespaceoperations__research.html#a0e884eebd1c1e380a6c87a245df85d9a">kAllBits64</a> << (1 << 4)))) {</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> |= (1 << 4);</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  n >>= (1 << 4);</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  }</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">if</span> (0 != (n & (<a class="code" href="namespaceoperations__research.html#a0e884eebd1c1e380a6c87a245df85d9a">kAllBits64</a> << (1 << 3)))) {</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> |= (1 << 3);</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  n >>= (1 << 3);</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>  <span class="keywordflow">if</span> (0 != (n & (<a class="code" href="namespaceoperations__research.html#a0e884eebd1c1e380a6c87a245df85d9a">kAllBits64</a> << (1 << 2)))) {</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> |= (1 << 2);</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  n >>= (1 << 2);</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  }</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">if</span> (0 != (n & (<a class="code" href="namespaceoperations__research.html#a0e884eebd1c1e380a6c87a245df85d9a">kAllBits64</a> << (1 << 1)))) {</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> |= (1 << 1);</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  n >>= (1 << 1);</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">if</span> (0 != (n & (<a class="code" href="namespaceoperations__research.html#a0e884eebd1c1e380a6c87a245df85d9a">kAllBits64</a> << (1 << 0)))) {</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> |= (1 << 0);</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  }</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">return</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>;</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> }</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> </div><div class="line"><a name="l00231"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#afa6ef9aef70f95b9d5bcee2c10937bc8"> 231</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research.html#afa6ef9aef70f95b9d5bcee2c10937bc8">MostSignificantBitPosition64</a>(uint64_t n) {</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="preprocessor">#ifdef USE_FAST_LEAST_SIGNIFICANT_BIT</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">return</span> MostSignificantBitPosition64Fast(n);</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#ae5948f76a02af5bf9638b3c29038cb96">MostSignificantBitPosition64Default</a>(n);</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> }</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> </div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="preprocessor">#if USE_FAST_LEAST_SIGNIFICANT_BIT</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> MostSignificantBitPosition32Fast(uint32_t n) {</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">// The constant here depends on whether we are on a 32-bit or 64-bit machine.</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">// __builtin_clzl(1) returns 63 on a 64-bit machine and 31 on a 32-bit</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="comment">// machine.</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> offset = __builtin_clzl(1);</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">return</span> n == 0 ? 0 : (offset - __builtin_clzl(n));</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> }</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="preprocessor">#endif</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"><a class="line" href="namespaceoperations__research.html#a65e6bc7c97b45054afeb652becdd6e14"> 249</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research.html#a65e6bc7c97b45054afeb652becdd6e14">MostSignificantBitPosition32Default</a>(uint32_t n) {</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = 0;</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">if</span> (0 != (n & (<a class="code" href="namespaceoperations__research.html#af789197eaf23a66b25a390f00c04ddd4">kAllBits32</a> << (1 << 4)))) {</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> |= (1 << 4);</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  n >>= (1 << 4);</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  }</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">if</span> (0 != (n & (<a class="code" href="namespaceoperations__research.html#af789197eaf23a66b25a390f00c04ddd4">kAllBits32</a> << (1 << 3)))) {</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> |= (1 << 3);</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  n >>= (1 << 3);</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="keywordflow">if</span> (0 != (n & (<a class="code" href="namespaceoperations__research.html#af789197eaf23a66b25a390f00c04ddd4">kAllBits32</a> << (1 << 2)))) {</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> |= (1 << 2);</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  n >>= (1 << 2);</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="keywordflow">if</span> (0 != (n & (<a class="code" href="namespaceoperations__research.html#af789197eaf23a66b25a390f00c04ddd4">kAllBits32</a> << (1 << 1)))) {</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> |= (1 << 1);</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  n >>= (1 << 1);</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>  <span class="keywordflow">if</span> (0 != (n & (<a class="code" href="namespaceoperations__research.html#af789197eaf23a66b25a390f00c04ddd4">kAllBits32</a> << (1 << 0)))) {</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> |= (1 << 0);</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  }</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">return</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>;</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="namespaceoperations__research.html#ac2dd49087312b4acbda94f5c6cb668f7"> 273</a></span> <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research.html#ac2dd49087312b4acbda94f5c6cb668f7">MostSignificantBitPosition32</a>(uint32_t n) {</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="preprocessor">#ifdef USE_FAST_LEAST_SIGNIFICANT_BIT</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">return</span> MostSignificantBitPosition32Fast(n);</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a65e6bc7c97b45054afeb652becdd6e14">MostSignificantBitPosition32Default</a>(n);</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> }</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> </div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="preprocessor">#undef USE_DEBRUIJN</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> <span class="preprocessor">#undef USE_FAST_LEAST_SIGNIFICANT_BIT</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"> 284</span> <span class="comment">// Returns a word with bits from s to e set.</span></div><div class="line"><a name="l00285"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ab353dd864864f142c9c677ff07eb13ff"> 285</a></span> <span class="keyword">inline</span> uint64_t <a class="code" href="namespaceoperations__research.html#ab353dd864864f142c9c677ff07eb13ff">OneRange64</a>(uint64_t s, uint64_t e) {</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(s, 63);</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(e, 63);</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(s, e);</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">return</span> (<a class="code" href="namespaceoperations__research.html#a0e884eebd1c1e380a6c87a245df85d9a">kAllBits64</a> << s) ^ ((<a class="code" href="namespaceoperations__research.html#a0e884eebd1c1e380a6c87a245df85d9a">kAllBits64</a> - 1) << e);</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span> }</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> </div><div class="line"><a name="l00292"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ad3b1b38c2438246bcebce4884b498840"> 292</a></span> <span class="keyword">inline</span> uint32_t <a class="code" href="namespaceoperations__research.html#ad3b1b38c2438246bcebce4884b498840">OneRange32</a>(uint32_t s, uint32_t e) {</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(s, 31);</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(e, 31);</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(s, e);</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">return</span> (<a class="code" href="namespaceoperations__research.html#af789197eaf23a66b25a390f00c04ddd4">kAllBits32</a> << s) ^ ((<a class="code" href="namespaceoperations__research.html#af789197eaf23a66b25a390f00c04ddd4">kAllBits32</a> - 1) << e);</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"> 299</span> <span class="comment">// Returns a word with s least significant bits unset.</span></div><div class="line"><a name="l00300"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#afcbecff7e7071fc3d98bb8fcd0fc87bc"> 300</a></span> <span class="keyword">inline</span> uint64_t <a class="code" href="namespaceoperations__research.html#afcbecff7e7071fc3d98bb8fcd0fc87bc">IntervalUp64</a>(uint64_t s) {</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(s, 63);</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a0e884eebd1c1e380a6c87a245df85d9a">kAllBits64</a> << s;</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> }</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> </div><div class="line"><a name="l00305"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a89d32183c356382fe71d7d0e2f302d01"> 305</a></span> <span class="keyword">inline</span> uint32_t <a class="code" href="namespaceoperations__research.html#a89d32183c356382fe71d7d0e2f302d01">IntervalUp32</a>(uint32_t s) {</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(s, 31);</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#af789197eaf23a66b25a390f00c04ddd4">kAllBits32</a> << s;</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> }</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> </div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="comment">// Returns a word with the s most significant bits unset.</span></div><div class="line"><a name="l00311"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a85487a7c672731d0a3f9167dba536aa0"> 311</a></span> <span class="keyword">inline</span> uint64_t <a class="code" href="namespaceoperations__research.html#a85487a7c672731d0a3f9167dba536aa0">IntervalDown64</a>(uint64_t s) {</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(s, 63);</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a0e884eebd1c1e380a6c87a245df85d9a">kAllBits64</a> >> (63 - s);</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> }</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> </div><div class="line"><a name="l00316"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a047ebf0fb931b969191be4945aae05b1"> 316</a></span> <span class="keyword">inline</span> uint32_t <a class="code" href="namespaceoperations__research.html#a047ebf0fb931b969191be4945aae05b1">IntervalDown32</a>(uint32_t s) {</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(s, 31);</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#af789197eaf23a66b25a390f00c04ddd4">kAllBits32</a> >> (31 - s);</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> }</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> </div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="comment">// ----- Bitset operators -----</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="comment">// Bitset: array of uint32_t/uint64_t words</span></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> </div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> <span class="comment">// Bit operators used to manipulates bitsets.</span></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> <span class="comment">// Returns the bit number in the word computed by BitOffsetXX,</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="comment">// corresponding to the bit at position pos in the bitset.</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="comment">// Note: '& 63' is faster than '% 64'</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="comment">// TODO(user): rename BitPos and BitOffset to something more understandable.</span></div><div class="line"><a name="l00330"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ab7253ffd8b7aba4b7cb5f981c7627526"> 330</a></span> <span class="keyword">inline</span> uint32_t <a class="code" href="namespaceoperations__research.html#ab7253ffd8b7aba4b7cb5f981c7627526">BitPos64</a>(uint64_t pos) { <span class="keywordflow">return</span> (pos & 63); }</div><div class="line"><a name="l00331"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a6d993f34b75362f07534b07238775649"> 331</a></span> <span class="keyword">inline</span> uint32_t <a class="code" href="namespaceoperations__research.html#a6d993f34b75362f07534b07238775649">BitPos32</a>(uint32_t pos) { <span class="keywordflow">return</span> (pos & 31); }</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> </div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="comment">// Returns the word number corresponding to bit number pos.</span></div><div class="line"><a name="l00334"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9"> 334</a></span> <span class="keyword">inline</span> uint64_t <a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(uint64_t pos) { <span class="keywordflow">return</span> (pos >> 6); }</div><div class="line"><a name="l00335"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a7f107c8c2a3eee649a88e53c94d83862"> 335</a></span> <span class="keyword">inline</span> uint32_t <a class="code" href="namespaceoperations__research.html#a7f107c8c2a3eee649a88e53c94d83862">BitOffset32</a>(uint32_t pos) { <span class="keywordflow">return</span> (pos >> 5); }</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> <span class="comment">// Returns the number of words needed to store size bits.</span></div><div class="line"><a name="l00338"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ade9a654d04b140bd2c2fbfb502c3999c"> 338</a></span> <span class="keyword">inline</span> uint64_t <a class="code" href="namespaceoperations__research.html#ade9a654d04b140bd2c2fbfb502c3999c">BitLength64</a>(uint64_t size) { <span class="keywordflow">return</span> ((size + 63) >> 6); }</div><div class="line"><a name="l00339"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a40588aa35bce80461bffb17bca643f1e"> 339</a></span> <span class="keyword">inline</span> uint32_t <a class="code" href="namespaceoperations__research.html#a40588aa35bce80461bffb17bca643f1e">BitLength32</a>(uint32_t size) { <span class="keywordflow">return</span> ((size + 31) >> 5); }</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="comment">// Returns the bit number in the bitset of the first bit of word number v.</span></div><div class="line"><a name="l00342"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a733c48e1e28605703382a59671337579"> 342</a></span> <span class="keyword">inline</span> uint64_t <a class="code" href="namespaceoperations__research.html#a733c48e1e28605703382a59671337579">BitShift64</a>(uint64_t v) { <span class="keywordflow">return</span> v << 6; }</div><div class="line"><a name="l00343"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ab429273292c72a71dda179a235e809f3"> 343</a></span> <span class="keyword">inline</span> uint32_t <a class="code" href="namespaceoperations__research.html#ab429273292c72a71dda179a235e809f3">BitShift32</a>(uint32_t v) { <span class="keywordflow">return</span> v << 5; }</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> <span class="comment">// Returns true if the bit pos is set in bitset.</span></div><div class="line"><a name="l00346"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#accd480b0f48f07182d45f247efdc8dee"> 346</a></span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research.html#accd480b0f48f07182d45f247efdc8dee">IsBitSet64</a>(<span class="keyword">const</span> uint64_t* <span class="keyword">const</span> bitset, uint64_t pos) {</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">return</span> (bitset[<a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(pos)] & <a class="code" href="namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71">OneBit64</a>(<a class="code" href="namespaceoperations__research.html#ab7253ffd8b7aba4b7cb5f981c7627526">BitPos64</a>(pos)));</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="namespaceoperations__research.html#a6a7ae719107659f62df69935619c4503"> 349</a></span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research.html#a6a7ae719107659f62df69935619c4503">IsBitSet32</a>(<span class="keyword">const</span> uint32_t* <span class="keyword">const</span> bitset, uint32_t pos) {</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keywordflow">return</span> (bitset[<a class="code" href="namespaceoperations__research.html#a7f107c8c2a3eee649a88e53c94d83862">BitOffset32</a>(pos)] & <a class="code" href="namespaceoperations__research.html#aa400cb586d3da8079abd2dfe15434c26">OneBit32</a>(<a class="code" href="namespaceoperations__research.html#a6d993f34b75362f07534b07238775649">BitPos32</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"> 353</span> <span class="comment">// Sets the bit pos to true in bitset.</span></div><div class="line"><a name="l00354"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#aeb19de8c81811a72d9f39aeec6dd60ef"> 354</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#aeb19de8c81811a72d9f39aeec6dd60ef">SetBit64</a>(uint64_t* <span class="keyword">const</span> bitset, uint64_t pos) {</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  bitset[<a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(pos)] |= <a class="code" href="namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71">OneBit64</a>(<a class="code" href="namespaceoperations__research.html#ab7253ffd8b7aba4b7cb5f981c7627526">BitPos64</a>(pos));</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="namespaceoperations__research.html#a367d6439b7ae4f256311937e31cf2830"> 357</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#a367d6439b7ae4f256311937e31cf2830">SetBit32</a>(uint32_t* <span class="keyword">const</span> bitset, uint32_t pos) {</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  bitset[<a class="code" href="namespaceoperations__research.html#a7f107c8c2a3eee649a88e53c94d83862">BitOffset32</a>(pos)] |= <a class="code" href="namespaceoperations__research.html#aa400cb586d3da8079abd2dfe15434c26">OneBit32</a>(<a class="code" href="namespaceoperations__research.html#a6d993f34b75362f07534b07238775649">BitPos32</a>(pos));</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span> }</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> </div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="comment">// Sets the bit pos to false in bitset.</span></div><div class="line"><a name="l00362"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#aa3ccf94731c1d1958861df895c730330"> 362</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#aa3ccf94731c1d1958861df895c730330">ClearBit64</a>(uint64_t* <span class="keyword">const</span> bitset, uint64_t pos) {</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  bitset[<a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(pos)] &= ~<a class="code" href="namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71">OneBit64</a>(<a class="code" href="namespaceoperations__research.html#ab7253ffd8b7aba4b7cb5f981c7627526">BitPos64</a>(pos));</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> }</div><div class="line"><a name="l00365"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a89eec2448f44df7b9e39695c03cd4f9e"> 365</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#a89eec2448f44df7b9e39695c03cd4f9e">ClearBit32</a>(uint32_t* <span class="keyword">const</span> bitset, uint32_t pos) {</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  bitset[<a class="code" href="namespaceoperations__research.html#a7f107c8c2a3eee649a88e53c94d83862">BitOffset32</a>(pos)] &= ~<a class="code" href="namespaceoperations__research.html#aa400cb586d3da8079abd2dfe15434c26">OneBit32</a>(<a class="code" href="namespaceoperations__research.html#a6d993f34b75362f07534b07238775649">BitPos32</a>(pos));</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> </div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="comment">// Returns the number of bits set in bitset between positions start and end.</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> uint64_t <a class="code" href="namespaceoperations__research.html#a5e5dec4e90b44b09c72ed21ef01fbceb">BitCountRange64</a>(<span class="keyword">const</span> uint64_t* <span class="keyword">const</span> bitset, uint64_t start,</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  uint64_t end);</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> uint32_t <a class="code" href="namespaceoperations__research.html#a366001057877498a0e8d930ae78b1a81">BitCountRange32</a>(<span class="keyword">const</span> uint32_t* <span class="keyword">const</span> bitset, uint32_t start,</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  uint32_t end);</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> </div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span> <span class="comment">// Returns true if no bits are set in bitset between start and end.</span></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research.html#ab805aeb27f36d4e358e29a27f4751dbb">IsEmptyRange64</a>(<span class="keyword">const</span> uint64_t* <span class="keyword">const</span> bitset, uint64_t start, uint64_t end);</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research.html#a122300e3a1def4c191aed1f0e59ef64d">IsEmptyRange32</a>(<span class="keyword">const</span> uint32_t* <span class="keyword">const</span> bitset, uint32_t start, uint32_t end);</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> <span class="comment">// Returns the first bit set in bitset between start and max_bit.</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> int64_t <a class="code" href="namespaceoperations__research.html#ae13fcb4162a4180395806f43237c44b2">LeastSignificantBitPosition64</a>(<span class="keyword">const</span> uint64_t* <span class="keyword">const</span> bitset,</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  uint64_t start, uint64_t end);</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research.html#aeaca21c840bf285f12127938231369b9">LeastSignificantBitPosition32</a>(<span class="keyword">const</span> uint32_t* <span class="keyword">const</span> bitset, uint32_t start,</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  uint32_t end);</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> </div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> <span class="comment">// Returns the last bit set in bitset between min_bit and start.</span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> int64_t <a class="code" href="namespaceoperations__research.html#afa6ef9aef70f95b9d5bcee2c10937bc8">MostSignificantBitPosition64</a>(<span class="keyword">const</span> uint64_t* <span class="keyword">const</span> bitset,</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  uint64_t start, uint64_t end);</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research.html#ac2dd49087312b4acbda94f5c6cb668f7">MostSignificantBitPosition32</a>(<span class="keyword">const</span> uint32_t* <span class="keyword">const</span> bitset, uint32_t start,</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  uint32_t end);</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> </div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="comment">// Unsafe versions of the functions above where respectively end and start</span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="comment">// are supposed to be set.</span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> int64_t <a class="code" href="namespaceoperations__research.html#a8aeec08b3e9a77df56d1bddd70a09a3f">UnsafeLeastSignificantBitPosition64</a>(<span class="keyword">const</span> uint64_t* <span class="keyword">const</span> bitset,</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  uint64_t start, uint64_t end);</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> int32_t <a class="code" href="namespaceoperations__research.html#a7576b31962bb7a61a8a2f84643a1aed4">UnsafeLeastSignificantBitPosition32</a>(<span class="keyword">const</span> uint32_t* <span class="keyword">const</span> bitset,</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  uint32_t start, uint32_t end);</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span> </div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> int64_t <a class="code" href="namespaceoperations__research.html#a5738162a4e0a0fc7616ca18bbfabea9b">UnsafeMostSignificantBitPosition64</a>(<span class="keyword">const</span> uint64_t* <span class="keyword">const</span> bitset,</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  uint64_t start, uint64_t end);</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> int32_t <a class="code" href="namespaceoperations__research.html#af14b24d728f7299c1c009d7f38b17d24">UnsafeMostSignificantBitPosition32</a>(<span class="keyword">const</span> uint32_t* <span class="keyword">const</span> bitset,</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  uint32_t start, uint32_t end);</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="comment">// Returns a mask with the bits pos % 64 and (pos ^ 1) % 64 sets.</span></div><div class="line"><a name="l00404"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#af5ce326c59180c51d01daaa7db6604aa"> 404</a></span> <span class="keyword">inline</span> uint64_t <a class="code" href="namespaceoperations__research.html#af5ce326c59180c51d01daaa7db6604aa">TwoBitsFromPos64</a>(uint64_t pos) {</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">return</span> uint64_t{3} << (pos & 62);</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> }</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> </div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="comment">// This class is like an ITIVector<IndexType, bool> except that it provides a</span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="comment">// more efficient way to iterate over the positions set to true. It achieves</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="comment">// this by caching the current uint64_t bucket in the Iterator and using</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="comment">// LeastSignificantBitPosition64() to iterate over the positions at 1 in this</span></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> <span class="comment">// bucket.</span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> <span class="keyword">template</span> <<span class="keyword">typename</span> IndexType = <span class="keywordtype">int</span>64_t></div><div class="line"><a name="l00414"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html"> 414</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64</a> {</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00416"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#ab445cb42bc06b03f5e164f99055645d7"> 416</a></span>  <a class="code" href="classoperations__research_1_1_bitset64.html#ab445cb42bc06b03f5e164f99055645d7">Bitset64</a>() : size_(), data_(), end_(*this, <span class="comment">/*at_end=*/</span>true) {}</div><div class="line"><a name="l00417"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a4c9691a24d8ee96e1665c2548b31fe4b"> 417</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_bitset64.html#a4c9691a24d8ee96e1665c2548b31fe4b">Bitset64</a>(IndexType <a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a>)</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  : size_(Value(<a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a>) > 0 ? <a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a> : IndexType(0)),</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  data_(<a class="code" href="namespaceoperations__research.html#ade9a654d04b140bd2c2fbfb502c3999c">BitLength64</a>(Value(size_))),</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  end_(*this, <span class="comment">/*at_end=*/</span>true) {}</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">// Returns how many bits this Bitset64 can hold.</span></div><div class="line"><a name="l00423"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b"> 423</a></span>  IndexType <a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> size_; }</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> </div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="comment">// Appends value at the end of the bitset.</span></div><div class="line"><a name="l00426"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#afc1edb584c61b63496ced749e1a92634"> 426</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64.html#afc1edb584c61b63496ced749e1a92634">PushBack</a>(<span class="keywordtype">bool</span> <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  ++size_;</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  data_.resize(<a class="code" href="namespaceoperations__research.html#ade9a654d04b140bd2c2fbfb502c3999c">BitLength64</a>(Value(size_)), 0);</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <a class="code" href="classoperations__research_1_1_bitset64.html#a76e58f3dd327215d28ea8c48f8c86009">Set</a>(size_ - 1, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  }</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> </div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="comment">// Resizes the Bitset64 to the given number of bits. New bits are sets to 0.</span></div><div class="line"><a name="l00433"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a95a7b1824d872a78f5b53153c8436f36"> 433</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64.html#a95a7b1824d872a78f5b53153c8436f36">Resize</a>(IndexType <a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a>) {</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(Value(<a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a>), 0);</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  size_ = Value(<a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a>) > 0 ? <a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a> : IndexType(0);</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  data_.resize(<a class="code" href="namespaceoperations__research.html#ade9a654d04b140bd2c2fbfb502c3999c">BitLength64</a>(Value(size_)), 0);</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  }</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> </div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="comment">// Changes the number of bits the Bitset64 can hold and set all of them to 0.</span></div><div class="line"><a name="l00440"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a039b0192ce008be5451bc87ca5eea65c"> 440</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64.html#a039b0192ce008be5451bc87ca5eea65c">ClearAndResize</a>(IndexType <a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a>) {</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(Value(<a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a>), 0);</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  size_ = Value(<a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a>) > 0 ? <a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a> : IndexType(0);</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> </div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="comment">// Memset is 4x faster than data_.assign() as of 19/03/2014.</span></div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="comment">// TODO(user): Ideally if a realloc happens, we don't need to copy the old</span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="comment">// data...</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> bit_length = static_cast<size_t>(<a class="code" href="namespaceoperations__research.html#ade9a654d04b140bd2c2fbfb502c3999c">BitLength64</a>(Value(size_)));</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> to_clear = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(data_.size(), bit_length);</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  data_.resize(bit_length, 0);</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  memset(data_.data(), 0, to_clear * <span class="keyword">sizeof</span>(int64_t));</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  }</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span> </div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="comment">// Sets all bits to 0.</span></div><div class="line"><a name="l00454"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#aa7d76b766faf39c1652b6617eac5fe20"> 454</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64.html#aa7d76b766faf39c1652b6617eac5fe20">ClearAll</a>() { memset(data_.data(), 0, data_.size() * <span class="keyword">sizeof</span>(int64_t)); }</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> </div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="comment">// Sets the bit at position i to 0.</span></div><div class="line"><a name="l00457"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a61e6f65595ec1afb4b7955f370c67c08"> 457</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64.html#a61e6f65595ec1afb4b7955f370c67c08">Clear</a>(IndexType i) {</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(Value(i), 0);</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(Value(i), Value(size_));</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  data_[<a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(Value(i))] &= ~<a class="code" href="namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71">OneBit64</a>(<a class="code" href="namespaceoperations__research.html#ab7253ffd8b7aba4b7cb5f981c7627526">BitPos64</a>(Value(i)));</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  }</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> </div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">// Sets bucket containing bit i to 0.</span></div><div class="line"><a name="l00464"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a0aef51c92ff3f3b715286a88256b915b"> 464</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64.html#a0aef51c92ff3f3b715286a88256b915b">ClearBucket</a>(IndexType i) {</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(Value(i), 0);</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(Value(i), Value(size_));</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  data_[<a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(Value(i))] = 0;</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  }</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span> </div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="comment">// Clears the bits at position i and i ^ 1.</span></div><div class="line"><a name="l00471"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#ab37281d042575e18ebc25cb0b970e93d"> 471</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64.html#ab37281d042575e18ebc25cb0b970e93d">ClearTwoBits</a>(IndexType i) {</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(Value(i), 0);</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(Value(i), Value(size_));</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  data_[<a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(Value(i))] &= ~<a class="code" href="namespaceoperations__research.html#af5ce326c59180c51d01daaa7db6604aa">TwoBitsFromPos64</a>(Value(i));</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  }</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> </div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="comment">// Returns true if the bit at position i or the one at position i ^ 1 is set.</span></div><div class="line"><a name="l00478"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#af8ee09b89dbde91655b7aa7537da21fb"> 478</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_bitset64.html#af8ee09b89dbde91655b7aa7537da21fb">AreOneOfTwoBitsSet</a>(IndexType i)<span class="keyword"> const </span>{</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(Value(i), 0);</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(Value(i), Value(size_));</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">return</span> data_[<a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(Value(i))] & <a class="code" href="namespaceoperations__research.html#af5ce326c59180c51d01daaa7db6604aa">TwoBitsFromPos64</a>(Value(i));</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  }</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> </div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="comment">// Returns true if the bit at position i is set.</span></div><div class="line"><a name="l00485"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#aa454a4099ee887726b8f5b4a8ed1a81d"> 485</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_bitset64.html#aa454a4099ee887726b8f5b4a8ed1a81d">IsSet</a>(IndexType i)<span class="keyword"> const </span>{</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(Value(i), 0);</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(Value(i), Value(size_));</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordflow">return</span> data_[<a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(Value(i))] & <a class="code" href="namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71">OneBit64</a>(<a class="code" href="namespaceoperations__research.html#ab7253ffd8b7aba4b7cb5f981c7627526">BitPos64</a>(Value(i)));</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  }</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span> </div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="comment">// Same as IsSet().</span></div><div class="line"><a name="l00492"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#ad197f61c44fe8fd4d2ef58278be45215"> 492</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_bitset64.html#ad197f61c44fe8fd4d2ef58278be45215">operator[]</a>(IndexType i)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_bitset64.html#aa454a4099ee887726b8f5b4a8ed1a81d">IsSet</a>(i); }</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> </div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">// Sets the bit at position i to 1.</span></div><div class="line"><a name="l00495"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a76e58f3dd327215d28ea8c48f8c86009"> 495</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64.html#a76e58f3dd327215d28ea8c48f8c86009">Set</a>(IndexType i) {</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(Value(i), 0);</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(Value(i), size_);</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  data_[<a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(Value(i))] |= <a class="code" href="namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71">OneBit64</a>(<a class="code" href="namespaceoperations__research.html#ab7253ffd8b7aba4b7cb5f981c7627526">BitPos64</a>(Value(i)));</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  }</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span> </div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">// If value is true, sets the bit at position i to 1, sets it to 0 otherwise.</span></div><div class="line"><a name="l00502"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a126df5082d4a2c00039417583ab8f0bd"> 502</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64.html#a126df5082d4a2c00039417583ab8f0bd">Set</a>(IndexType i, <span class="keywordtype">bool</span> <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <a class="code" href="classoperations__research_1_1_bitset64.html#a76e58f3dd327215d28ea8c48f8c86009">Set</a>(i);</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <a class="code" href="classoperations__research_1_1_bitset64.html#a61e6f65595ec1afb4b7955f370c67c08">Clear</a>(i);</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  }</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  }</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span> </div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="comment">// Copies bucket containing bit i from "other" to "this".</span></div><div class="line"><a name="l00511"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#ac455173bbee06de96840b6980cb20dff"> 511</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64.html#ac455173bbee06de96840b6980cb20dff">CopyBucket</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64<IndexType></a>& other, IndexType i) {</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keyword">const</span> uint64_t offset = <a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(Value(i));</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  data_[offset] = other.data_[offset];</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  }</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span> </div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="comment">// Copies "other" to "this". The bitsets do not have to be of the same size.</span></div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="comment">// If "other" is smaller, high order bits are not changed. If "other" is</span></div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="comment">// larger, its high order bits are ignored. In any case "this" is not resized.</span></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> OtherIndexType></div><div class="line"><a name="l00520"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a83a9e2ac64c481c6772ea2204fbd3ebb"> 520</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64.html#a83a9e2ac64c481c6772ea2204fbd3ebb">SetContentFromBitset</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64<OtherIndexType></a>& other) {</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="keyword">const</span> int64_t min_size = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(data_.size(), other.data_.size());</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordflow">if</span> (min_size == 0) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keyword">const</span> uint64_t last_common_bucket = data_[min_size - 1];</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  memcpy(data_.data(), other.data_.data(), min_size * <span class="keyword">sizeof</span>(uint64_t));</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keywordflow">if</span> (data_.size() >= other.data_.size()) {</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keyword">const</span> uint64_t bitmask = <a class="code" href="namespaceoperations__research.html#a74bf4c5f3b2b625258f9b5f7c4e1ab11">kAllBitsButLsb64</a></div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  << <a class="code" href="namespaceoperations__research.html#ab7253ffd8b7aba4b7cb5f981c7627526">BitPos64</a>(other.Value(other.<a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a>() - 1));</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  data_[min_size - 1] &= ~bitmask;</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  data_[min_size - 1] |= (bitmask & last_common_bucket);</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  }</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  }</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span> </div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="comment">// Same as SetContentFromBitset where "this" and "other" have the same size.</span></div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> OtherIndexType></div><div class="line"><a name="l00535"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a1e8761187def0ec75ce81cb07cb7bb62"> 535</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64.html#a1e8761187def0ec75ce81cb07cb7bb62">SetContentFromBitsetOfSameSize</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64<OtherIndexType></a>& other) {</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(Value(<a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a>()), other.Value(other.<a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a>()));</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  memcpy(data_.data(), other.data_.data(), data_.size() * <span class="keyword">sizeof</span>(uint64_t));</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  }</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> </div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="comment">// Sets "this" to be the intersection of "this" and "other". The</span></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="comment">// bitsets do not have to be the same size. If other is smaller, all</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="comment">// the higher order bits are assumed to be 0.</span></div><div class="line"><a name="l00543"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a85894bdc427b871f2140cc0fb1967aa5"> 543</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64.html#a85894bdc427b871f2140cc0fb1967aa5">Intersection</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64<IndexType></a>& other) {</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> min_size = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(data_.size(), other.data_.size());</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < min_size; ++i) {</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  data_[i] &= other.data_[i];</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  }</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = min_size; i < data_.size(); ++i) {</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  data_[i] = 0;</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  }</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  }</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span> </div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="comment">// Sets "this" to be the union of "this" and "other". The</span></div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="comment">// bitsets do not have to be the same size. If other is smaller, all</span></div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="comment">// the higher order bits are assumed to be 0.</span></div><div class="line"><a name="l00556"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a6c28e2e61b6d0fddca6ec153bbb574c2"> 556</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64.html#a6c28e2e61b6d0fddca6ec153bbb574c2">Union</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64<IndexType></a>& other) {</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> min_size = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(data_.size(), other.data_.size());</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < min_size; ++i) {</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  data_[i] |= other.data_[i];</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  }</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  }</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span> </div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="comment">// Class to iterate over the bit positions at 1 of a Bitset64.</span></div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="comment">//</span></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="comment">// IMPORTANT: Because the iterator "caches" the current uint64_t bucket, this</span></div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="comment">// will probably not do what you want if Bitset64 is modified while iterating.</span></div><div class="line"><a name="l00567"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64_1_1_iterator.html"> 567</a></span>  <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html">Iterator</a> {</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00569"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a33dafef83130614fa669c9fbaab049fe"> 569</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a33dafef83130614fa669c9fbaab049fe">Iterator</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64</a>& data_)</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  : bitset_(data_), index_(0), base_index_(0), current_(0) {</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="keywordflow">if</span> (bitset_.data_.empty()) {</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  index_ = -1;</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  current_ = bitset_.data_[0];</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a659a293dd51073a1b9560bb80f687705">Next</a>();</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  }</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  }</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span> </div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="comment">// Returns true if the Iterator is at a valid position.</span></div><div class="line"><a name="l00580"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64_1_1_iterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347"> 580</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">Ok</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_ != -1; }</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> </div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// Returns the current position of the iterator.</span></div><div class="line"><a name="l00583"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a3e4914cef04a611939ddac260e031063"> 583</a></span>  IndexType <a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a3e4914cef04a611939ddac260e031063">Index</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">Ok</a>());</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keywordflow">return</span> IndexType(index_);</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  }</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span> </div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="comment">// Moves the iterator the the next position at 1 of the Bitset64.</span></div><div class="line"><a name="l00589"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a659a293dd51073a1b9560bb80f687705"> 589</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a659a293dd51073a1b9560bb80f687705">Next</a>() {</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">Ok</a>());</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">if</span> (current_ == 0) {</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordtype">int</span> bucket = <a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(base_index_);</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a> = bitset_.data_.size();</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordflow">do</span> {</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  bucket++;</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  } <span class="keywordflow">while</span> (bucket < <a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a> && bitset_.data_[bucket] == 0);</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">if</span> (bucket == <a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a>) {</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  index_ = -1;</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  }</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  current_ = bitset_.data_[bucket];</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  base_index_ = <a class="code" href="namespaceoperations__research.html#a733c48e1e28605703382a59671337579">BitShift64</a>(bucket);</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  }</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span> </div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="comment">// Computes the index and clear the least significant bit of current_.</span></div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  index_ = base_index_ + <a class="code" href="namespaceoperations__research.html#ae13fcb4162a4180395806f43237c44b2">LeastSignificantBitPosition64</a>(current_);</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  current_ &= current_ - 1;</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  }</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span> </div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">// STL version of the functions above to support range-based "for" loop.</span></div><div class="line"><a name="l00611"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a6ea2fbb7e4e35b36c5e11d2b2d4ea095"> 611</a></span>  <a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a6ea2fbb7e4e35b36c5e11d2b2d4ea095">Iterator</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64</a>& data_, <span class="keywordtype">bool</span> at_end)</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  : bitset_(data_), index_(0), base_index_(0), current_(0) {</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keywordflow">if</span> (at_end || bitset_.data_.empty()) {</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  index_ = -1;</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  current_ = bitset_.data_[0];</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a659a293dd51073a1b9560bb80f687705">Next</a>();</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  }</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  }</div><div class="line"><a name="l00620"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a710b1a5c9f835b20b87a76ce12e4f305"> 620</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a710b1a5c9f835b20b87a76ce12e4f305">operator!=</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html">Iterator</a>& other)<span class="keyword"> const </span>{</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="keywordflow">return</span> index_ != other.index_;</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  }</div><div class="line"><a name="l00623"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64_1_1_iterator.html#abd251c4d76eb905c982f3eadb6dd7425"> 623</a></span>  IndexType <a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html#abd251c4d76eb905c982f3eadb6dd7425">operator*</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> IndexType(index_); }</div><div class="line"><a name="l00624"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a00f008b80917746917b874d00abd02a9"> 624</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a00f008b80917746917b874d00abd02a9">operator++</a>() { <a class="code" href="classoperations__research_1_1_bitset64_1_1_iterator.html#a659a293dd51073a1b9560bb80f687705">Next</a>(); }</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span> </div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64</a>& bitset_;</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keywordtype">int</span> index_;</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keywordtype">int</span> base_index_;</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  uint64_t current_;</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  };</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span> </div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="comment">// Allows range-based "for" loop on the non-zero positions:</span></div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="comment">// for (const IndexType index : bitset) {}</span></div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="comment">// instead of:</span></div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="comment">// for (Bitset64<IndexType>::Iterator it(bitset); it.Ok(); it.Next()) {</span></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="comment">// const IndexType index = it.Index();</span></div><div class="line"><a name="l00638"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a09dd208593b9721a30a83ed978ede577"> 638</a></span>  Iterator <a class="code" href="classoperations__research_1_1_bitset64.html#a09dd208593b9721a30a83ed978ede577">begin</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> Iterator(*<span class="keyword">this</span>); }</div><div class="line"><a name="l00639"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a62469461ed7c932afba3808f4da0fe3d"> 639</a></span>  Iterator <a class="code" href="classoperations__research_1_1_bitset64.html#a62469461ed7c932afba3808f4da0fe3d">end</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> end_; }</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span> </div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="comment">// Cryptic function! This is just an optimized version of a given piece of</span></div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="comment">// code and has probably little general use.</span></div><div class="line"><a name="l00643"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#af3f6c35f8d82633642cc87510743fdd6"> 643</a></span>  <span class="keyword">static</span> uint64_t <a class="code" href="classoperations__research_1_1_bitset64.html#af3f6c35f8d82633642cc87510743fdd6">ConditionalXorOfTwoBits</a>(IndexType i, uint64_t use1,</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64<IndexType></a>& set1,</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  uint64_t use2,</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64<IndexType></a>& set2) {</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(set1.data_.size(), set1.data_.size());</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(use1 == 0 || use1 == 1);</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(use2 == 0 || use2 == 1);</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> bucket = <a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(Value(i));</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> pos = <a class="code" href="namespaceoperations__research.html#ab7253ffd8b7aba4b7cb5f981c7627526">BitPos64</a>(Value(i));</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keywordflow">return</span> ((use1 << pos) & set1.data_[bucket]) ^</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  ((use2 << pos) & set2.data_[bucket]);</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  }</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span> </div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="comment">// Returns a 0/1 string representing the bitset.</span></div><div class="line"><a name="l00657"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#a764be64f3029f8b8e23511061d8de355"> 657</a></span>  std::string <a class="code" href="classoperations__research_1_1_bitset64.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  std::string output;</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="keywordflow">for</span> (IndexType i(0); i < <a class="code" href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">size</a>(); ++i) {</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  output += <a class="code" href="classoperations__research_1_1_bitset64.html#aa454a4099ee887726b8f5b4a8ed1a81d">IsSet</a>(i) ? <span class="stringliteral">"1"</span> : <span class="stringliteral">"0"</span>;</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  }</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordflow">return</span> output;</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  }</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span> </div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="comment">// Returns the value of the index type.</span></div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="comment">// This function is specialized below to work with IntType and int64_t.</span></div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keyword">static</span> int64_t Value(IndexType <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>);</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span> </div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  IndexType size_;</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  std::vector<uint64_t> data_;</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span> </div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="comment">// It is faster to store the end() Iterator than to recompute it every time.</span></div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="comment">// Note that we cannot do the same for begin().</span></div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keyword">const</span> Iterator end_;</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span> </div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="keyword">template</span> <<span class="keyword">class</span> OtherIndexType></div><div class="line"><a name="l00678"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bitset64.html#ad1c91a5364329325587f1529b3f705b2"> 678</a></span>  <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64</a>;</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <a class="code" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(<a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64</a>);</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span> };</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span> </div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span> <span class="comment">// Specialized version of Bitset64 that allows to query the last bit set more</span></div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span> <span class="comment">// efficiently.</span></div><div class="line"><a name="l00684"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bit_queue64.html"> 684</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_bit_queue64.html">BitQueue64</a> {</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00686"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bit_queue64.html#ac01b390267b78853abef94d232f19dcb"> 686</a></span>  <a class="code" href="classoperations__research_1_1_bit_queue64.html#ac01b390267b78853abef94d232f19dcb">BitQueue64</a>() : size_(), top_(-1), data_() {}</div><div class="line"><a name="l00687"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bit_queue64.html#a62790f23bf54156ad1ad3981c1206b67"> 687</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_bit_queue64.html#a62790f23bf54156ad1ad3981c1206b67">BitQueue64</a>(<span class="keywordtype">int</span> size)</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  : size_(size), top_(-1), data_(<a class="code" href="namespaceoperations__research.html#ade9a654d04b140bd2c2fbfb502c3999c">BitLength64</a>(size), 0) {}</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span> </div><div class="line"><a name="l00690"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bit_queue64.html#a2c9e03b5ffa844d119c926de4689ce59"> 690</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bit_queue64.html#a2c9e03b5ffa844d119c926de4689ce59">IncreaseSize</a>(<span class="keywordtype">int</span> size) {</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(size, size_);</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  size_ = size;</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  data_.resize(<a class="code" href="namespaceoperations__research.html#ade9a654d04b140bd2c2fbfb502c3999c">BitLength64</a>(size), 0);</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  }</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span> </div><div class="line"><a name="l00696"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bit_queue64.html#ab2fc4510692e040b62507dce522e0e31"> 696</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bit_queue64.html#ab2fc4510692e040b62507dce522e0e31">ClearAndResize</a>(<span class="keywordtype">int</span> size) {</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  top_ = -1;</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  size_ = size;</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  data_.assign(<a class="code" href="namespaceoperations__research.html#ade9a654d04b140bd2c2fbfb502c3999c">BitLength64</a>(size), 0);</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  }</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span> </div><div class="line"><a name="l00702"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bit_queue64.html#a74d1ef67d47fb7f8418e53ec28a14fb3"> 702</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bit_queue64.html#a74d1ef67d47fb7f8418e53ec28a14fb3">Set</a>(<span class="keywordtype">int</span> i) {</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(i, 0);</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(i, size_);</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  top_ = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(top_, i);</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  data_[<a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(i)] |= <a class="code" href="namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71">OneBit64</a>(<a class="code" href="namespaceoperations__research.html#ab7253ffd8b7aba4b7cb5f981c7627526">BitPos64</a>(i));</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  }</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span> </div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="comment">// Sets all the bits from 0 up to i-1 to 1.</span></div><div class="line"><a name="l00710"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bit_queue64.html#ad169bc2e89d7b366bfe0ee5d80083c11"> 710</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bit_queue64.html#ad169bc2e89d7b366bfe0ee5d80083c11">SetAllBefore</a>(<span class="keywordtype">int</span> i) {</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(i, 0);</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(i, size_);</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  top_ = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(top_, i - 1);</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordtype">int</span> bucket_index = static_cast<int>(<a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(i));</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  data_[bucket_index] |= <a class="code" href="namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71">OneBit64</a>(<a class="code" href="namespaceoperations__research.html#ab7253ffd8b7aba4b7cb5f981c7627526">BitPos64</a>(i)) - 1;</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keywordflow">for</span> (--bucket_index; bucket_index >= 0; --bucket_index) {</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  data_[bucket_index] = <a class="code" href="namespaceoperations__research.html#a0e884eebd1c1e380a6c87a245df85d9a">kAllBits64</a>;</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  }</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  }</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> </div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="comment">// Returns the position of the highest bit set in O(1) or -1 if no bit is set.</span></div><div class="line"><a name="l00722"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bit_queue64.html#a2edc7a62aaf90213f6c5f765242d6488"> 722</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_bit_queue64.html#a2edc7a62aaf90213f6c5f765242d6488">Top</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> top_; }</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span> </div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="comment">// Clears the Top() bit and recomputes the position of the next Top().</span></div><div class="line"><a name="l00725"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_bit_queue64.html#a704ec3ccc1510e90b041a92a0e04b71c"> 725</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_bit_queue64.html#a704ec3ccc1510e90b041a92a0e04b71c">ClearTop</a>() {</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(top_, -1);</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="keywordtype">int</span> bucket_index = static_cast<int>(<a class="code" href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">BitOffset64</a>(top_));</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  uint64_t bucket = data_[bucket_index] &= ~<a class="code" href="namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71">OneBit64</a>(<a class="code" href="namespaceoperations__research.html#ab7253ffd8b7aba4b7cb5f981c7627526">BitPos64</a>(top_));</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordflow">while</span> (!bucket) {</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="keywordflow">if</span> (bucket_index == 0) {</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  top_ = -1;</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  }</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  bucket = data_[--bucket_index];</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  }</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span> </div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="comment">// Note(user): I experimented with reversing the bit order in a bucket to</span></div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="comment">// use LeastSignificantBitPosition64() and it is only slightly faster at the</span></div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="comment">// cost of a lower Set() speed. So I preferred this version.</span></div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  top_ = static_cast<int>(<a class="code" href="namespaceoperations__research.html#a733c48e1e28605703382a59671337579">BitShift64</a>(bucket_index) +</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <a class="code" href="namespaceoperations__research.html#afa6ef9aef70f95b9d5bcee2c10937bc8">MostSignificantBitPosition64</a>(bucket));</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  }</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span> </div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="keywordtype">int</span> size_;</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="keywordtype">int</span> top_;</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  std::vector<uint64_t> data_;</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1_bit_queue64.html">BitQueue64</a>);</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span> };</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span> </div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span> <span class="comment">// The specialization of Value() for IntType and int64_t.</span></div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span> <span class="keyword">template</span> <<span class="keyword">typename</span> IntType></div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span> <span class="keyword">inline</span> int64_t Bitset64<IntType>::Value(IntType <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>) {</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>.value(), 0);</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keywordflow">return</span> <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>.value();</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span> }</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span> <span class="keyword">template</span> <></div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span> <span class="keyword">inline</span> int64_t Bitset64<int64_t>::Value(int64_t <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>) {</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>, 0);</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="keywordflow">return</span> <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>;</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span> }</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span> </div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span> <span class="comment">// A simple utility class to set/unset integer in a range [0, size).</span></div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span> <span class="comment">// This is optimized for sparsity.</span></div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span> <span class="keyword">template</span> <<span class="keyword">typename</span> IntegerType = <span class="keywordtype">int</span>64_t></div><div class="line"><a name="l00766"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_bitset.html"> 766</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_sparse_bitset.html">SparseBitset</a> {</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00768"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_bitset.html#ae4353022b96af47f05598cf4475f591f"> 768</a></span>  <a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae4353022b96af47f05598cf4475f591f">SparseBitset</a>() {}</div><div class="line"><a name="l00769"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_bitset.html#a19532e9c7a3ea6ea3cb15c4fdd2fc8bc"> 769</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_sparse_bitset.html#a19532e9c7a3ea6ea3cb15c4fdd2fc8bc">SparseBitset</a>(IntegerType size) : bitset_(size) {}</div><div class="line"><a name="l00770"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_bitset.html#a2fa637a68bc1b88e3d5da4f97932411a"> 770</a></span>  IntegerType <a class="code" href="classoperations__research_1_1_sparse_bitset.html#a2fa637a68bc1b88e3d5da4f97932411a">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> bitset_.size(); }</div><div class="line"><a name="l00771"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_bitset.html#ab4bc8236a9bfe59526e353800a0f0470"> 771</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab4bc8236a9bfe59526e353800a0f0470">SparseClearAll</a>() {</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerType i : to_clear_) bitset_.ClearBucket(i);</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  to_clear_.clear();</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  }</div><div class="line"><a name="l00775"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_bitset.html#aa7d76b766faf39c1652b6617eac5fe20"> 775</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_sparse_bitset.html#aa7d76b766faf39c1652b6617eac5fe20">ClearAll</a>() {</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  bitset_.ClearAll();</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  to_clear_.clear();</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  }</div><div class="line"><a name="l00779"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7"> 779</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(IntegerType size) {</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="comment">// As of 19/03/2014, experiments show that this is a reasonable threshold.</span></div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kSparseThreshold = 300;</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="keywordflow">if</span> (to_clear_.size() * kSparseThreshold < size) {</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  SparseClearAll();</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  bitset_.Resize(size);</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  bitset_.ClearAndResize(size);</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  to_clear_.clear();</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  }</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  }</div><div class="line"><a name="l00790"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_bitset.html#abf34ab06e7250e92954c2b5a263e5612"> 790</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_sparse_bitset.html#abf34ab06e7250e92954c2b5a263e5612">Resize</a>(IntegerType size) {</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="keywordflow">if</span> (size < bitset_.size()) {</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keywordtype">int</span> new_index = 0;</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keywordflow">for</span> (IntegerType <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : to_clear_) {</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < size) {</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  to_clear_[new_index] = <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  ++new_index;</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  }</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  }</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  to_clear_.resize(new_index);</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  }</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  bitset_.Resize(size);</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  }</div><div class="line"><a name="l00803"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_bitset.html#ac434cc72f8d4407fef6f5775266f60f5"> 803</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_sparse_bitset.html#ac434cc72f8d4407fef6f5775266f60f5">operator[]</a>(IntegerType <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> bitset_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]; }</div><div class="line"><a name="l00804"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7"> 804</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(IntegerType <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="keywordflow">if</span> (!bitset_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) {</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  bitset_.Set(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  to_clear_.push_back(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  }</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  }</div><div class="line"><a name="l00810"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda"> 810</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(IntegerType <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) { bitset_.Clear(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>); }</div><div class="line"><a name="l00811"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_bitset.html#a838e4744903ec12e6ebcf2999f4a90df"> 811</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_sparse_bitset.html#a838e4744903ec12e6ebcf2999f4a90df">NumberOfSetCallsWithDifferentArguments</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keywordflow">return</span> to_clear_.size();</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  }</div><div class="line"><a name="l00814"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050"> 814</a></span>  <span class="keyword">const</span> std::vector<IntegerType>& <a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <span class="keywordflow">return</span> to_clear_;</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  }</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span> </div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="comment">// Tells the class that all its bits are cleared, so it can reset to_clear_</span></div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="comment">// to the empty vector. Note that this call is "unsafe" since the fact that</span></div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="comment">// the class is actually all cleared is only checked in debug mode.</span></div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="comment">//</span></div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  <span class="comment">// This is useful to iterate on the "set" positions while clearing them for</span></div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="comment">// instance. This way, after the loop, a client can call this for efficiency.</span></div><div class="line"><a name="l00824"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_bitset.html#a399d93a7ffba068b02341291d703fef7"> 824</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_sparse_bitset.html#a399d93a7ffba068b02341291d703fef7">NotifyAllClear</a>() {</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="keywordflow">for</span> (IntegerType <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : to_clear_) <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!bitset_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  }</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  to_clear_.clear();</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  }</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span> </div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64<IntegerType></a> bitset_;</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  std::vector<IntegerType> to_clear_;</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <a class="code" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(<a class="code" href="classoperations__research_1_1_sparse_bitset.html">SparseBitset</a>);</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span> };</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span> </div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span> } <span class="comment">// namespace operations_research</span></div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span> </div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span> <span class="preprocessor">#endif // OR_TOOLS_UTIL_BITSET_H_</span></div><div class="ttc" id="base_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00491">base/logging.h:491</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a8aeec08b3e9a77df56d1bddd70a09a3f"><div class="ttname"><a href="namespaceoperations__research.html#a8aeec08b3e9a77df56d1bddd70a09a3f">operations_research::UnsafeLeastSignificantBitPosition64</a></div><div class="ttdeci">int64_t UnsafeLeastSignificantBitPosition64(const uint64_t *const bitset, uint64_t start, uint64_t end)</div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a1e8761187def0ec75ce81cb07cb7bb62"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a1e8761187def0ec75ce81cb07cb7bb62">operations_research::Bitset64::SetContentFromBitsetOfSameSize</a></div><div class="ttdeci">void SetContentFromBitsetOfSameSize(const Bitset64< OtherIndexType > &other)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00535">bitset.h:535</a></div></div>
|
|
<div class="ttc" id="macros_8h_html_a7f536a3b33f9bed8f75734e035d30725"><div class="ttname"><a href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div><div class="ttdeci">const bool DEBUG_MODE</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00024">macros.h:24</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html_a41f798a04019147982b29c576ff9d8b7"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">operations_research::SparseBitset::Set</a></div><div class="ttdeci">void Set(IntegerType index)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00804">bitset.h:804</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_af14b24d728f7299c1c009d7f38b17d24"><div class="ttname"><a href="namespaceoperations__research.html#af14b24d728f7299c1c009d7f38b17d24">operations_research::UnsafeMostSignificantBitPosition32</a></div><div class="ttdeci">int32_t UnsafeMostSignificantBitPosition32(const uint32_t *const bitset, uint32_t start, uint32_t end)</div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a65e6bc7c97b45054afeb652becdd6e14"><div class="ttname"><a href="namespaceoperations__research.html#a65e6bc7c97b45054afeb652becdd6e14">operations_research::MostSignificantBitPosition32Default</a></div><div class="ttdeci">int MostSignificantBitPosition32Default(uint32_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00249">bitset.h:249</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_1_1_iterator_html_abd251c4d76eb905c982f3eadb6dd7425"><div class="ttname"><a href="classoperations__research_1_1_bitset64_1_1_iterator.html#abd251c4d76eb905c982f3eadb6dd7425">operations_research::Bitset64::Iterator::operator *</a></div><div class="ttdeci">IndexType operator *() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00623">bitset.h:623</a></div></div>
|
|
<div class="ttc" id="base_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#l00702">base/logging.h:702</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ade9a654d04b140bd2c2fbfb502c3999c"><div class="ttname"><a href="namespaceoperations__research.html#ade9a654d04b140bd2c2fbfb502c3999c">operations_research::BitLength64</a></div><div class="ttdeci">uint64_t BitLength64(uint64_t size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00338">bitset.h:338</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a733c48e1e28605703382a59671337579"><div class="ttname"><a href="namespaceoperations__research.html#a733c48e1e28605703382a59671337579">operations_research::BitShift64</a></div><div class="ttdeci">uint64_t BitShift64(uint64_t v)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00342">bitset.h:342</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a122300e3a1def4c191aed1f0e59ef64d"><div class="ttname"><a href="namespaceoperations__research.html#a122300e3a1def4c191aed1f0e59ef64d">operations_research::IsEmptyRange32</a></div><div class="ttdeci">bool IsEmptyRange32(const uint32_t *const bitset, uint32_t start, uint32_t end)</div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ab429273292c72a71dda179a235e809f3"><div class="ttname"><a href="namespaceoperations__research.html#ab429273292c72a71dda179a235e809f3">operations_research::BitShift32</a></div><div class="ttdeci">uint32_t BitShift32(uint32_t v)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00343">bitset.h:343</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a7f40cd0560f4962b81e8b99333ea6e2b"><div class="ttname"><a href="namespaceoperations__research.html#a7f40cd0560f4962b81e8b99333ea6e2b">operations_research::LeastSignificantBitWord32</a></div><div class="ttdeci">uint32_t LeastSignificantBitWord32(uint32_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00064">bitset.h:64</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a0e884eebd1c1e380a6c87a245df85d9a"><div class="ttname"><a href="namespaceoperations__research.html#a0e884eebd1c1e380a6c87a245df85d9a">operations_research::kAllBits64</a></div><div class="ttdeci">static const uint64_t kAllBits64</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00033">bitset.h:33</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a85894bdc427b871f2140cc0fb1967aa5"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a85894bdc427b871f2140cc0fb1967aa5">operations_research::Bitset64::Intersection</a></div><div class="ttdeci">void Intersection(const Bitset64< IndexType > &other)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00543">bitset.h:543</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a89eec2448f44df7b9e39695c03cd4f9e"><div class="ttname"><a href="namespaceoperations__research.html#a89eec2448f44df7b9e39695c03cd4f9e">operations_research::ClearBit32</a></div><div class="ttdeci">void ClearBit32(uint32_t *const bitset, uint32_t pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00365">bitset.h:365</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a89d32183c356382fe71d7d0e2f302d01"><div class="ttname"><a href="namespaceoperations__research.html#a89d32183c356382fe71d7d0e2f302d01">operations_research::IntervalUp32</a></div><div class="ttdeci">uint32_t IntervalUp32(uint32_t s)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00305">bitset.h:305</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a4c9691a24d8ee96e1665c2548b31fe4b"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a4c9691a24d8ee96e1665c2548b31fe4b">operations_research::Bitset64::Bitset64</a></div><div class="ttdeci">Bitset64(IndexType size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00417">bitset.h:417</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_af3f6c35f8d82633642cc87510743fdd6"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#af3f6c35f8d82633642cc87510743fdd6">operations_research::Bitset64::ConditionalXorOfTwoBits</a></div><div class="ttdeci">static uint64_t ConditionalXorOfTwoBits(IndexType i, uint64_t use1, const Bitset64< IndexType > &set1, uint64_t use2, const Bitset64< IndexType > &set2)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00643">bitset.h:643</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html_a2fa637a68bc1b88e3d5da4f97932411a"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a2fa637a68bc1b88e3d5da4f97932411a">operations_research::SparseBitset::size</a></div><div class="ttdeci">IntegerType size() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00770">bitset.h:770</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bit_queue64_html_a74d1ef67d47fb7f8418e53ec28a14fb3"><div class="ttname"><a href="classoperations__research_1_1_bit_queue64.html#a74d1ef67d47fb7f8418e53ec28a14fb3">operations_research::BitQueue64::Set</a></div><div class="ttdeci">void Set(int i)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00702">bitset.h:702</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_aee01d67a7a666bd54a183ac162e34238"><div class="ttname"><a href="namespaceoperations__research.html#aee01d67a7a666bd54a183ac162e34238">operations_research::LeastSignificantBitWord64</a></div><div class="ttdeci">uint64_t LeastSignificantBitWord64(uint64_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00063">bitset.h:63</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a1c691865bdad3f6ee0525a77368a87c9"><div class="ttname"><a href="namespaceoperations__research.html#a1c691865bdad3f6ee0525a77368a87c9">operations_research::LeastSignificantBitPosition32Default</a></div><div class="ttdeci">int LeastSignificantBitPosition32Default(uint32_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00153">bitset.h:153</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_1_1_iterator_html_a659a293dd51073a1b9560bb80f687705"><div class="ttname"><a href="classoperations__research_1_1_bitset64_1_1_iterator.html#a659a293dd51073a1b9560bb80f687705">operations_research::Bitset64::Iterator::Next</a></div><div class="ttdeci">void Next()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00589">bitset.h:589</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html">operations_research::SparseBitset</a></div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00766">bitset.h:766</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html_abf34ab06e7250e92954c2b5a263e5612"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#abf34ab06e7250e92954c2b5a263e5612">operations_research::SparseBitset::Resize</a></div><div class="ttdeci">void Resize(IntegerType size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00790">bitset.h:790</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html_ab465e925b8a535e5de8a072174ecafda"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">operations_research::SparseBitset::Clear</a></div><div class="ttdeci">void Clear(IntegerType index)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00810">bitset.h:810</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_1_1_iterator_html_a3e4914cef04a611939ddac260e031063"><div class="ttname"><a href="classoperations__research_1_1_bitset64_1_1_iterator.html#a3e4914cef04a611939ddac260e031063">operations_research::Bitset64::Iterator::Index</a></div><div class="ttdeci">IndexType Index() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00583">bitset.h:583</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bit_queue64_html_ac01b390267b78853abef94d232f19dcb"><div class="ttname"><a href="classoperations__research_1_1_bit_queue64.html#ac01b390267b78853abef94d232f19dcb">operations_research::BitQueue64::BitQueue64</a></div><div class="ttdeci">BitQueue64()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00686">bitset.h:686</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a7f107c8c2a3eee649a88e53c94d83862"><div class="ttname"><a href="namespaceoperations__research.html#a7f107c8c2a3eee649a88e53c94d83862">operations_research::BitOffset32</a></div><div class="ttdeci">uint32_t BitOffset32(uint32_t pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00335">bitset.h:335</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ab353dd864864f142c9c677ff07eb13ff"><div class="ttname"><a href="namespaceoperations__research.html#ab353dd864864f142c9c677ff07eb13ff">operations_research::OneRange64</a></div><div class="ttdeci">uint64_t OneRange64(uint64_t s, uint64_t e)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00285">bitset.h:285</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a6d993f34b75362f07534b07238775649"><div class="ttname"><a href="namespaceoperations__research.html#a6d993f34b75362f07534b07238775649">operations_research::BitPos32</a></div><div class="ttdeci">uint32_t BitPos32(uint32_t pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00331">bitset.h:331</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a367d6439b7ae4f256311937e31cf2830"><div class="ttname"><a href="namespaceoperations__research.html#a367d6439b7ae4f256311937e31cf2830">operations_research::SetBit32</a></div><div class="ttdeci">void SetBit32(uint32_t *const bitset, uint32_t pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00357">bitset.h:357</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_aa400cb586d3da8079abd2dfe15434c26"><div class="ttname"><a href="namespaceoperations__research.html#aa400cb586d3da8079abd2dfe15434c26">operations_research::OneBit32</a></div><div class="ttdeci">uint32_t OneBit32(int pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00039">bitset.h:39</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html">operations_research::Bitset64</a></div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00414">bitset.h:414</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a5738162a4e0a0fc7616ca18bbfabea9b"><div class="ttname"><a href="namespaceoperations__research.html#a5738162a4e0a0fc7616ca18bbfabea9b">operations_research::UnsafeMostSignificantBitPosition64</a></div><div class="ttdeci">int64_t UnsafeMostSignificantBitPosition64(const uint64_t *const bitset, uint64_t start, uint64_t end)</div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a6a7ae719107659f62df69935619c4503"><div class="ttname"><a href="namespaceoperations__research.html#a6a7ae719107659f62df69935619c4503">operations_research::IsBitSet32</a></div><div class="ttdeci">bool IsBitSet32(const uint32_t *const bitset, uint32_t pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00349">bitset.h:349</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a40588aa35bce80461bffb17bca643f1e"><div class="ttname"><a href="namespaceoperations__research.html#a40588aa35bce80461bffb17bca643f1e">operations_research::BitLength32</a></div><div class="ttdeci">uint32_t BitLength32(uint32_t size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00339">bitset.h:339</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bit_queue64_html_ab2fc4510692e040b62507dce522e0e31"><div class="ttname"><a href="classoperations__research_1_1_bit_queue64.html#ab2fc4510692e040b62507dce522e0e31">operations_research::BitQueue64::ClearAndResize</a></div><div class="ttdeci">void ClearAndResize(int size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00696">bitset.h:696</a></div></div>
|
|
<div class="ttc" id="constraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a09dd208593b9721a30a83ed978ede577"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a09dd208593b9721a30a83ed978ede577">operations_research::Bitset64::begin</a></div><div class="ttdeci">Iterator begin() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00638">bitset.h:638</a></div></div>
|
|
<div class="ttc" id="integral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a4841d3c6b072a22ba2b2fe43d6c03298"><div class="ttname"><a href="namespaceoperations__research.html#a4841d3c6b072a22ba2b2fe43d6c03298">operations_research::BitCount32</a></div><div class="ttdeci">uint32_t BitCount32(uint32_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00053">bitset.h:53</a></div></div>
|
|
<div class="ttc" id="macros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a126df5082d4a2c00039417583ab8f0bd"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a126df5082d4a2c00039417583ab8f0bd">operations_research::Bitset64::Set</a></div><div class="ttdeci">void Set(IndexType i, bool value)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00502">bitset.h:502</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a764be64f3029f8b8e23511061d8de355">operations_research::Bitset64::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00657">bitset.h:657</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_aa3ccf94731c1d1958861df895c730330"><div class="ttname"><a href="namespaceoperations__research.html#aa3ccf94731c1d1958861df895c730330">operations_research::ClearBit64</a></div><div class="ttdeci">void ClearBit64(uint64_t *const bitset, uint64_t pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00362">bitset.h:362</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ac2dd49087312b4acbda94f5c6cb668f7"><div class="ttname"><a href="namespaceoperations__research.html#ac2dd49087312b4acbda94f5c6cb668f7">operations_research::MostSignificantBitPosition32</a></div><div class="ttdeci">int MostSignificantBitPosition32(uint32_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00273">bitset.h:273</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a039b0192ce008be5451bc87ca5eea65c"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a039b0192ce008be5451bc87ca5eea65c">operations_research::Bitset64::ClearAndResize</a></div><div class="ttdeci">void ClearAndResize(IndexType size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00440">bitset.h:440</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_ab37281d042575e18ebc25cb0b970e93d"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#ab37281d042575e18ebc25cb0b970e93d">operations_research::Bitset64::ClearTwoBits</a></div><div class="ttdeci">void ClearTwoBits(IndexType i)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00471">bitset.h:471</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_afa6ef9aef70f95b9d5bcee2c10937bc8"><div class="ttname"><a href="namespaceoperations__research.html#afa6ef9aef70f95b9d5bcee2c10937bc8">operations_research::MostSignificantBitPosition64</a></div><div class="ttdeci">int MostSignificantBitPosition64(uint64_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00231">bitset.h:231</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_1_1_iterator_html_aa7e07ffe21ad6b4c71a0d22c65f30347"><div class="ttname"><a href="classoperations__research_1_1_bitset64_1_1_iterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">operations_research::Bitset64::Iterator::Ok</a></div><div class="ttdeci">bool Ok() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00580">bitset.h:580</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_ac455173bbee06de96840b6980cb20dff"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#ac455173bbee06de96840b6980cb20dff">operations_research::Bitset64::CopyBucket</a></div><div class="ttdeci">void CopyBucket(const Bitset64< IndexType > &other, IndexType i)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00511">bitset.h:511</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html_ab4bc8236a9bfe59526e353800a0f0470"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#ab4bc8236a9bfe59526e353800a0f0470">operations_research::SparseBitset::SparseClearAll</a></div><div class="ttdeci">void SparseClearAll()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00771">bitset.h:771</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_afcbecff7e7071fc3d98bb8fcd0fc87bc"><div class="ttname"><a href="namespaceoperations__research.html#afcbecff7e7071fc3d98bb8fcd0fc87bc">operations_research::IntervalUp64</a></div><div class="ttdeci">uint64_t IntervalUp64(uint64_t s)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00300">bitset.h:300</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_af5ce326c59180c51d01daaa7db6604aa"><div class="ttname"><a href="namespaceoperations__research.html#af5ce326c59180c51d01daaa7db6604aa">operations_research::TwoBitsFromPos64</a></div><div class="ttdeci">uint64_t TwoBitsFromPos64(uint64_t pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00404">bitset.h:404</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00887">base/logging.h:887</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a047ebf0fb931b969191be4945aae05b1"><div class="ttname"><a href="namespaceoperations__research.html#a047ebf0fb931b969191be4945aae05b1">operations_research::IntervalDown32</a></div><div class="ttdeci">uint32_t IntervalDown32(uint32_t s)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00316">bitset.h:316</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a9ae0f5d6a36d2ac42ff62911ceff551e"><div class="ttname"><a href="namespaceoperations__research.html#a9ae0f5d6a36d2ac42ff62911ceff551e">operations_research::LeastSignificantBitPosition32DeBruijn</a></div><div class="ttdeci">int LeastSignificantBitPosition32DeBruijn(uint32_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00144">bitset.h:144</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bit_queue64_html_a2edc7a62aaf90213f6c5f765242d6488"><div class="ttname"><a href="classoperations__research_1_1_bit_queue64.html#a2edc7a62aaf90213f6c5f765242d6488">operations_research::BitQueue64::Top</a></div><div class="ttdeci">int Top() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00722">bitset.h:722</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ad9bf98eac7dfdc7934ee5aa5fc04f5b9"><div class="ttname"><a href="namespaceoperations__research.html#ad9bf98eac7dfdc7934ee5aa5fc04f5b9">operations_research::BitOffset64</a></div><div class="ttdeci">uint64_t BitOffset64(uint64_t pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00334">bitset.h:334</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_1_1_iterator_html_a6ea2fbb7e4e35b36c5e11d2b2d4ea095"><div class="ttname"><a href="classoperations__research_1_1_bitset64_1_1_iterator.html#a6ea2fbb7e4e35b36c5e11d2b2d4ea095">operations_research::Bitset64::Iterator::Iterator</a></div><div class="ttdeci">Iterator(const Bitset64 &data_, bool at_end)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00611">bitset.h:611</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bit_queue64_html_ad169bc2e89d7b366bfe0ee5d80083c11"><div class="ttname"><a href="classoperations__research_1_1_bit_queue64.html#ad169bc2e89d7b366bfe0ee5d80083c11">operations_research::BitQueue64::SetAllBefore</a></div><div class="ttdeci">void SetAllBefore(int i)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00710">bitset.h:710</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bit_queue64_html"><div class="ttname"><a href="classoperations__research_1_1_bit_queue64.html">operations_research::BitQueue64</a></div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00684">bitset.h:684</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bit_queue64_html_a62790f23bf54156ad1ad3981c1206b67"><div class="ttname"><a href="classoperations__research_1_1_bit_queue64.html#a62790f23bf54156ad1ad3981c1206b67">operations_research::BitQueue64::BitQueue64</a></div><div class="ttdeci">BitQueue64(int size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00687">bitset.h:687</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_1_1_iterator_html_a00f008b80917746917b874d00abd02a9"><div class="ttname"><a href="classoperations__research_1_1_bitset64_1_1_iterator.html#a00f008b80917746917b874d00abd02a9">operations_research::Bitset64::Iterator::operator++</a></div><div class="ttdeci">void operator++()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00624">bitset.h:624</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a366001057877498a0e8d930ae78b1a81"><div class="ttname"><a href="namespaceoperations__research.html#a366001057877498a0e8d930ae78b1a81">operations_research::BitCountRange32</a></div><div class="ttdeci">uint32_t BitCountRange32(const uint32_t *const bitset, uint32_t start, uint32_t end)</div></div>
|
|
<div class="ttc" id="parser_8yy_8cc_html_a5a634cf4429798b1c921a81de8250051"><div class="ttname"><a href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a></div><div class="ttdeci">static int input(yyscan_t yyscanner)</div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a85487a7c672731d0a3f9167dba536aa0"><div class="ttname"><a href="namespaceoperations__research.html#a85487a7c672731d0a3f9167dba536aa0">operations_research::IntervalDown64</a></div><div class="ttdeci">uint64_t IntervalDown64(uint64_t s)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00311">bitset.h:311</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a0aef51c92ff3f3b715286a88256b915b"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a0aef51c92ff3f3b715286a88256b915b">operations_research::Bitset64::ClearBucket</a></div><div class="ttdeci">void ClearBucket(IndexType i)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00464">bitset.h:464</a></div></div>
|
|
<div class="ttc" id="pack_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#l00509">pack.cc:509</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html_a838e4744903ec12e6ebcf2999f4a90df"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a838e4744903ec12e6ebcf2999f4a90df">operations_research::SparseBitset::NumberOfSetCallsWithDifferentArguments</a></div><div class="ttdeci">int NumberOfSetCallsWithDifferentArguments() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00811">bitset.h:811</a></div></div>
|
|
<div class="ttc" id="base_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#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a1df2b3a4485e328397fda9b5f9b3ea2b"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a1df2b3a4485e328397fda9b5f9b3ea2b">operations_research::Bitset64::size</a></div><div class="ttdeci">IndexType size() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00423">bitset.h:423</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_aa7d76b766faf39c1652b6617eac5fe20"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#aa7d76b766faf39c1652b6617eac5fe20">operations_research::Bitset64::ClearAll</a></div><div class="ttdeci">void ClearAll()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00454">bitset.h:454</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_af789197eaf23a66b25a390f00c04ddd4"><div class="ttname"><a href="namespaceoperations__research.html#af789197eaf23a66b25a390f00c04ddd4">operations_research::kAllBits32</a></div><div class="ttdeci">static const uint32_t kAllBits32</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00035">bitset.h:35</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_aeb19de8c81811a72d9f39aeec6dd60ef"><div class="ttname"><a href="namespaceoperations__research.html#aeb19de8c81811a72d9f39aeec6dd60ef">operations_research::SetBit64</a></div><div class="ttdeci">void SetBit64(uint64_t *const bitset, uint64_t pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00354">bitset.h:354</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a7576b31962bb7a61a8a2f84643a1aed4"><div class="ttname"><a href="namespaceoperations__research.html#a7576b31962bb7a61a8a2f84643a1aed4">operations_research::UnsafeLeastSignificantBitPosition32</a></div><div class="ttdeci">int32_t UnsafeLeastSignificantBitPosition32(const uint32_t *const bitset, uint32_t start, uint32_t end)</div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html_aa7d76b766faf39c1652b6617eac5fe20"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#aa7d76b766faf39c1652b6617eac5fe20">operations_research::SparseBitset::ClearAll</a></div><div class="ttdeci">void ClearAll()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00775">bitset.h:775</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="base_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#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html_ac434cc72f8d4407fef6f5775266f60f5"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#ac434cc72f8d4407fef6f5775266f60f5">operations_research::SparseBitset::operator[]</a></div><div class="ttdeci">bool operator[](IntegerType index) const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00803">bitset.h:803</a></div></div>
|
|
<div class="ttc" id="base_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#l00886">base/logging.h:886</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html_ae09e38958e558d2c776bc555a0dc2fc7"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">operations_research::SparseBitset::ClearAndResize</a></div><div class="ttdeci">void ClearAndResize(IntegerType size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00779">bitset.h:779</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a5e5dec4e90b44b09c72ed21ef01fbceb"><div class="ttname"><a href="namespaceoperations__research.html#a5e5dec4e90b44b09c72ed21ef01fbceb">operations_research::BitCountRange64</a></div><div class="ttdeci">uint64_t BitCountRange64(const uint64_t *const bitset, uint64_t start, uint64_t end)</div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a83a9e2ac64c481c6772ea2204fbd3ebb"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a83a9e2ac64c481c6772ea2204fbd3ebb">operations_research::Bitset64::SetContentFromBitset</a></div><div class="ttdeci">void SetContentFromBitset(const Bitset64< OtherIndexType > &other)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00520">bitset.h:520</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_aa454a4099ee887726b8f5b4a8ed1a81d"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#aa454a4099ee887726b8f5b4a8ed1a81d">operations_research::Bitset64::IsSet</a></div><div class="ttdeci">bool IsSet(IndexType i) const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00485">bitset.h:485</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ae13fcb4162a4180395806f43237c44b2"><div class="ttname"><a href="namespaceoperations__research.html#ae13fcb4162a4180395806f43237c44b2">operations_research::LeastSignificantBitPosition64</a></div><div class="ttdeci">int LeastSignificantBitPosition64(uint64_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00127">bitset.h:127</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_ab445cb42bc06b03f5e164f99055645d7"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#ab445cb42bc06b03f5e164f99055645d7">operations_research::Bitset64::Bitset64</a></div><div class="ttdeci">Bitset64()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00416">bitset.h:416</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_abc979832d72da1ae793ba6d28ae46672"><div class="ttname"><a href="namespaceoperations__research.html#abc979832d72da1ae793ba6d28ae46672">operations_research::BitCount64</a></div><div class="ttdeci">uint64_t BitCount64(uint64_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00042">bitset.h:42</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a4395e95bab44e222cb2e77251017a0e2"><div class="ttname"><a href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a></div><div class="ttdeci">#define DCHECK_LE(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="classoperations__research_1_1_bit_queue64_html_a704ec3ccc1510e90b041a92a0e04b71c"><div class="ttname"><a href="classoperations__research_1_1_bit_queue64.html#a704ec3ccc1510e90b041a92a0e04b71c">operations_research::BitQueue64::ClearTop</a></div><div class="ttdeci">void ClearTop()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00725">bitset.h:725</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a61e6f65595ec1afb4b7955f370c67c08"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a61e6f65595ec1afb4b7955f370c67c08">operations_research::Bitset64::Clear</a></div><div class="ttdeci">void Clear(IndexType i)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00457">bitset.h:457</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html_a1e5ae9fb14fd6b25919148ae8bbaf050"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">operations_research::SparseBitset::PositionsSetAtLeastOnce</a></div><div class="ttdeci">const std::vector< IntegerType > & PositionsSetAtLeastOnce() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00814">bitset.h:814</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html_a19532e9c7a3ea6ea3cb15c4fdd2fc8bc"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a19532e9c7a3ea6ea3cb15c4fdd2fc8bc">operations_research::SparseBitset::SparseBitset</a></div><div class="ttdeci">SparseBitset(IntegerType size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00769">bitset.h:769</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_ad197f61c44fe8fd4d2ef58278be45215"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#ad197f61c44fe8fd4d2ef58278be45215">operations_research::Bitset64::operator[]</a></div><div class="ttdeci">bool operator[](IndexType i) const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00492">bitset.h:492</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ab7253ffd8b7aba4b7cb5f981c7627526"><div class="ttname"><a href="namespaceoperations__research.html#ab7253ffd8b7aba4b7cb5f981c7627526">operations_research::BitPos64</a></div><div class="ttdeci">uint32_t BitPos64(uint64_t pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00330">bitset.h:330</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_accd480b0f48f07182d45f247efdc8dee"><div class="ttname"><a href="namespaceoperations__research.html#accd480b0f48f07182d45f247efdc8dee">operations_research::IsBitSet64</a></div><div class="ttdeci">bool IsBitSet64(const uint64_t *const bitset, uint64_t pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00346">bitset.h:346</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ae5948f76a02af5bf9638b3c29038cb96"><div class="ttname"><a href="namespaceoperations__research.html#ae5948f76a02af5bf9638b3c29038cb96">operations_research::MostSignificantBitPosition64Default</a></div><div class="ttdeci">int MostSignificantBitPosition64Default(uint64_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00203">bitset.h:203</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bit_queue64_html_a2c9e03b5ffa844d119c926de4689ce59"><div class="ttname"><a href="classoperations__research_1_1_bit_queue64.html#a2c9e03b5ffa844d119c926de4689ce59">operations_research::BitQueue64::IncreaseSize</a></div><div class="ttdeci">void IncreaseSize(int size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00690">bitset.h:690</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a6c28e2e61b6d0fddca6ec153bbb574c2"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a6c28e2e61b6d0fddca6ec153bbb574c2">operations_research::Bitset64::Union</a></div><div class="ttdeci">void Union(const Bitset64< IndexType > &other)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00556">bitset.h:556</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_aeaca21c840bf285f12127938231369b9"><div class="ttname"><a href="namespaceoperations__research.html#aeaca21c840bf285f12127938231369b9">operations_research::LeastSignificantBitPosition32</a></div><div class="ttdeci">int LeastSignificantBitPosition32(uint32_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00182">bitset.h:182</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_afc1edb584c61b63496ced749e1a92634"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#afc1edb584c61b63496ced749e1a92634">operations_research::Bitset64::PushBack</a></div><div class="ttdeci">void PushBack(bool value)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00426">bitset.h:426</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html_ae4353022b96af47f05598cf4475f591f"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#ae4353022b96af47f05598cf4475f591f">operations_research::SparseBitset::SparseBitset</a></div><div class="ttdeci">SparseBitset()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00768">bitset.h:768</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ab805aeb27f36d4e358e29a27f4751dbb"><div class="ttname"><a href="namespaceoperations__research.html#ab805aeb27f36d4e358e29a27f4751dbb">operations_research::IsEmptyRange64</a></div><div class="ttdeci">bool IsEmptyRange64(const uint64_t *const bitset, uint64_t start, uint64_t end)</div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a74bf4c5f3b2b625258f9b5f7c4e1ab11"><div class="ttname"><a href="namespaceoperations__research.html#a74bf4c5f3b2b625258f9b5f7c4e1ab11">operations_research::kAllBitsButLsb64</a></div><div class="ttdeci">static const uint64_t kAllBitsButLsb64</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00034">bitset.h:34</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a62469461ed7c932afba3808f4da0fe3d"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a62469461ed7c932afba3808f4da0fe3d">operations_research::Bitset64::end</a></div><div class="ttdeci">Iterator end() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00639">bitset.h:639</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a6a4eefefc8c7cf8ee2f381b692e370a6"><div class="ttname"><a href="namespaceoperations__research.html#a6a4eefefc8c7cf8ee2f381b692e370a6">operations_research::LeastSignificantBitPosition64Default</a></div><div class="ttdeci">int LeastSignificantBitPosition64Default(uint64_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00093">bitset.h:93</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a95a7b1824d872a78f5b53153c8436f36"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a95a7b1824d872a78f5b53153c8436f36">operations_research::Bitset64::Resize</a></div><div class="ttdeci">void Resize(IndexType size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00433">bitset.h:433</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html_a399d93a7ffba068b02341291d703fef7"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a399d93a7ffba068b02341291d703fef7">operations_research::SparseBitset::NotifyAllClear</a></div><div class="ttdeci">void NotifyAllClear()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00824">bitset.h:824</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_1_1_iterator_html_a33dafef83130614fa669c9fbaab049fe"><div class="ttname"><a href="classoperations__research_1_1_bitset64_1_1_iterator.html#a33dafef83130614fa669c9fbaab049fe">operations_research::Bitset64::Iterator::Iterator</a></div><div class="ttdeci">Iterator(const Bitset64 &data_)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00569">bitset.h:569</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_af8ee09b89dbde91655b7aa7537da21fb"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#af8ee09b89dbde91655b7aa7537da21fb">operations_research::Bitset64::AreOneOfTwoBitsSet</a></div><div class="ttdeci">bool AreOneOfTwoBitsSet(IndexType i) const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00478">bitset.h:478</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ad3b1b38c2438246bcebce4884b498840"><div class="ttname"><a href="namespaceoperations__research.html#ad3b1b38c2438246bcebce4884b498840">operations_research::OneRange32</a></div><div class="ttdeci">uint32_t OneRange32(uint32_t s, uint32_t e)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00292">bitset.h:292</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_1_1_iterator_html_a710b1a5c9f835b20b87a76ce12e4f305"><div class="ttname"><a href="classoperations__research_1_1_bitset64_1_1_iterator.html#a710b1a5c9f835b20b87a76ce12e4f305">operations_research::Bitset64::Iterator::operator!=</a></div><div class="ttdeci">bool operator!=(const Iterator &other) const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00620">bitset.h:620</a></div></div>
|
|
<div class="ttc" id="demon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ace10d9b6a07c87e11942df49bb04fc71"><div class="ttname"><a href="namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71">operations_research::OneBit64</a></div><div class="ttdeci">uint64_t OneBit64(int pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00038">bitset.h:38</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_html_a76e58f3dd327215d28ea8c48f8c86009"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html#a76e58f3dd327215d28ea8c48f8c86009">operations_research::Bitset64::Set</a></div><div class="ttdeci">void Set(IndexType i)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00495">bitset.h:495</a></div></div>
|
|
<div class="ttc" id="base_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#l00889">base/logging.h:889</a></div></div>
|
|
<div class="ttc" id="macros_8h_html_af8df3547bfde53a5acb93e2607b0034a"><div class="ttname"><a href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a></div><div class="ttdeci">#define DISALLOW_COPY_AND_ASSIGN(TypeName)</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00029">macros.h:29</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a588a37fe4aa71e468b26ca5388732ea0"><div class="ttname"><a href="namespaceoperations__research.html#a588a37fe4aa71e468b26ca5388732ea0">operations_research::LeastSignificantBitPosition64DeBruijn</a></div><div class="ttdeci">int LeastSignificantBitPosition64DeBruijn(uint64_t n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00081">bitset.h:81</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_bitset64_1_1_iterator_html"><div class="ttname"><a href="classoperations__research_1_1_bitset64_1_1_iterator.html">operations_research::Bitset64::Iterator</a></div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00567">bitset.h:567</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_a3328a0ea67a2aaa160c2783ffbaa5dc.html">util</a></li><li class="navelem"><a class="el" href="bitset_8h.html">bitset.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.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|