121 lines
54 KiB
HTML
121 lines
54 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.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.2</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_8cc_source.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">bitset.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="bitset_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="bitset_8h.html">ortools/util/bitset.h</a>"</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include "<a class="code" href="commandlineflags_8h.html">ortools/base/commandlineflags.h</a>"</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</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="l00018"></a><span class="lineno"> 18</span> </div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <a class="code" href="bitset_8cc.html#a95564ffe5aa637e68370ebd4ede9e98b">ABSL_FLAG</a>(<span class="keywordtype">int</span>, bitset_small_bitset_count, 8,</div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  <span class="stringliteral">"threshold to count bits with buckets"</span>);</div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> </div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</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="comment">// ---------- Bit Operations ----------</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"><a class="line" href="bitset_8cc.html#a8a1613218821bcc0746e658018b22e14"> 26</a></span> <span class="preprocessor">#define BIT_COUNT_RANGE(size, zero) \</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor"> uint##size##_t BitCountRange##size(const uint##size##_t* const bits, \</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor"> uint##size##_t start, \</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor"> uint##size##_t end) { \</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor"> if (end - start > absl::GetFlag(FLAGS_bitset_small_bitset_count)) { \</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor"> const int offset_start = BitOffset##size(start); \</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor"> const int pos_start = BitPos##size(start); \</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor"> const int offset_end = BitOffset##size(end); \</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor"> const int pos_end = BitPos##size(end); \</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor"> if (offset_end == offset_start) { \</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor"> return BitCount##size(bits[offset_start] & \</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor"> OneRange##size(pos_start, pos_end)); \</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor"> } else { \</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor"> uint##size##_t bit_count = zero; \</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor"> bit_count += \</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor"> BitCount##size(bits[offset_start] & IntervalUp##size(pos_start)); \</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor"> for (int offset = offset_start + 1; offset < offset_end; ++offset) { \</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor"> bit_count += BitCount##size(bits[offset]); \</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor"> bit_count += \</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor"> BitCount##size(bits[offset_end] & IntervalDown##size(pos_end)); \</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor"> return bit_count; \</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="preprocessor"> } else { \</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor"> uint##size##_t bit_count = zero; \</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="preprocessor"> for (uint##size##_t i = start; i <= end; ++i) { \</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor"> bit_count += IsBitSet##size(bits, i); \</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="preprocessor"> return bit_count; \</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor"> }</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <a class="code" href="bitset_8cc.html#a8a1613218821bcc0746e658018b22e14">BIT_COUNT_RANGE</a>(64, uint64_t{0})</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <a class="code" href="bitset_8cc.html#a8a1613218821bcc0746e658018b22e14">BIT_COUNT_RANGE</a>(32, 0U)</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> <span class="preprocessor">#undef BIT_COUNT_RANGE</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="bitset_8cc.html#a6d1d9d8e8f51f8c5c9c196cee565c99a"> 63</a></span> <span class="preprocessor">#define IS_EMPTY_RANGE(size) \</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor"> bool IsEmptyRange##size(const uint##size##_t* const bits, \</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor"> uint##size##_t start, uint##size##_t end) { \</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor"> const int offset_start = BitOffset##size(start); \</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="preprocessor"> const int pos_start = BitPos##size(start); \</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor"> const int offset_end = BitOffset##size(end); \</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="preprocessor"> const int pos_end = BitPos##size(end); \</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="preprocessor"> if (offset_end == offset_start) { \</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="preprocessor"> if (bits[offset_start] & OneRange##size(pos_start, pos_end)) { \</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="preprocessor"> return false; \</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="preprocessor"> } else { \</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="preprocessor"> if (bits[offset_start] & IntervalUp##size(pos_start)) { \</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="preprocessor"> return false; \</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="preprocessor"> for (int offset = offset_start + 1; offset < offset_end; ++offset) { \</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor"> if (bits[offset]) { \</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="preprocessor"> return false; \</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="preprocessor"> if (bits[offset_end] & IntervalDown##size(pos_end)) { \</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="preprocessor"> return false; \</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="preprocessor"> return true; \</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="preprocessor"> }</span></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> <a class="code" href="bitset_8cc.html#a6d1d9d8e8f51f8c5c9c196cee565c99a">IS_EMPTY_RANGE</a>(64)</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <a class="code" href="bitset_8cc.html#a6d1d9d8e8f51f8c5c9c196cee565c99a">IS_EMPTY_RANGE</a>(32)</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> </div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="preprocessor">#undef IS_EMPTY_RANGE</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> </div><div class="line"><a name="l00095"></a><span class="lineno"><a class="line" href="bitset_8cc.html#a0e35598507f1cefefed70d6b330e5564"> 95</a></span> <span class="preprocessor">#define LEAST_SIGNIFCANT_BIT_POSITION(size) \</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="preprocessor"> int##size##_t LeastSignificantBitPosition##size( \</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="preprocessor"> const uint##size##_t* const bits, uint##size##_t start, \</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="preprocessor"> uint##size##_t end) { \</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="preprocessor"> DCHECK_LE(start, end); \</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="preprocessor"> if (IsBitSet##size(bits, start)) { \</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="preprocessor"> return start; \</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="preprocessor"> const int offset_start = BitOffset##size(start); \</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="preprocessor"> const int offset_end = BitOffset##size(end); \</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="preprocessor"> const int pos_start = BitPos##size(start); \</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="preprocessor"> if (offset_start == offset_end) { \</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="preprocessor"> const int pos_end = BitPos##size(end); \</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="preprocessor"> const uint##size##_t active_range = \</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="preprocessor"> bits[offset_start] & OneRange##size(pos_start, pos_end); \</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="preprocessor"> if (active_range) { \</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="preprocessor"> return BitShift##size(offset_start) + \</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="preprocessor"> LeastSignificantBitPosition##size(active_range); \</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="preprocessor"> return -1; \</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="preprocessor"> } else { \</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="preprocessor"> const uint##size##_t start_mask = \</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="preprocessor"> bits[offset_start] & IntervalUp##size(pos_start); \</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="preprocessor"> if (start_mask) { \</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="preprocessor"> return BitShift##size(offset_start) + \</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="preprocessor"> LeastSignificantBitPosition##size(start_mask); \</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="preprocessor"> } else { \</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="preprocessor"> for (int offset = offset_start + 1; offset < offset_end; ++offset) { \</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="preprocessor"> if (bits[offset]) { \</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="preprocessor"> return BitShift##size(offset) + \</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="preprocessor"> LeastSignificantBitPosition##size(bits[offset]); \</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="preprocessor"> const int pos_end = BitPos##size(end); \</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="preprocessor"> const uint##size##_t active_range = \</span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="preprocessor"> bits[offset_end] & IntervalDown##size(pos_end); \</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="preprocessor"> if (active_range) { \</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="preprocessor"> return BitShift##size(offset_end) + \</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="preprocessor"> LeastSignificantBitPosition##size(active_range); \</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="preprocessor"> } else { \</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="preprocessor"> return -1; \</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="preprocessor"> }</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <a class="code" href="bitset_8cc.html#a0e35598507f1cefefed70d6b330e5564">LEAST_SIGNIFCANT_BIT_POSITION</a>(64)</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <a class="code" href="bitset_8cc.html#a0e35598507f1cefefed70d6b330e5564">LEAST_SIGNIFCANT_BIT_POSITION</a>(32)</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> </div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="preprocessor">#undef LEAST_SIGNIFCANT_BIT_POSITION</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> </div><div class="line"><a name="l00146"></a><span class="lineno"><a class="line" href="bitset_8cc.html#a6c95af60e681e064db683d517de7c3c8"> 146</a></span> <span class="preprocessor">#define MOST_SIGNIFICANT_BIT_POSITION(size) \</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="preprocessor"> int##size##_t MostSignificantBitPosition##size( \</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="preprocessor"> const uint##size##_t* const bits, uint##size##_t start, \</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="preprocessor"> uint##size##_t end) { \</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="preprocessor"> DCHECK_GE(end, start); \</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="preprocessor"> if (IsBitSet##size(bits, end)) { \</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="preprocessor"> return end; \</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="preprocessor"> const int offset_start = BitOffset##size(start); \</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="preprocessor"> const int offset_end = BitOffset##size(end); \</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="preprocessor"> const int pos_end = BitPos##size(end); \</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="preprocessor"> if (offset_start == offset_end) { \</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="preprocessor"> const int pos_start = BitPos##size(start); \</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="preprocessor"> const uint##size##_t active_range = \</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="preprocessor"> bits[offset_start] & OneRange##size(pos_start, pos_end); \</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="preprocessor"> if (active_range) { \</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="preprocessor"> return BitShift##size(offset_end) + \</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="preprocessor"> MostSignificantBitPosition##size(active_range); \</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="preprocessor"> } else { \</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="preprocessor"> return -1; \</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="preprocessor"> } else { \</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="preprocessor"> const uint##size##_t end_mask = \</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="preprocessor"> bits[offset_end] & IntervalDown##size(pos_end); \</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="preprocessor"> if (end_mask) { \</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="preprocessor"> return BitShift##size(offset_end) + \</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="preprocessor"> MostSignificantBitPosition##size(end_mask); \</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="preprocessor"> } else { \</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="preprocessor"> for (int offset = offset_end - 1; offset > offset_start; --offset) { \</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="preprocessor"> if (bits[offset]) { \</span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="preprocessor"> return BitShift##size(offset) + \</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="preprocessor"> MostSignificantBitPosition##size(bits[offset]); \</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="preprocessor"> const int pos_start = BitPos##size(start); \</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="preprocessor"> const uint##size##_t active_range = \</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="preprocessor"> bits[offset_start] & IntervalUp##size(pos_start); \</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="preprocessor"> if (active_range) { \</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="preprocessor"> return BitShift##size(offset_start) + \</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="preprocessor"> MostSignificantBitPosition##size(active_range); \</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="preprocessor"> } else { \</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="preprocessor"> return -1; \</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="preprocessor"> }</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> <a class="code" href="bitset_8cc.html#a6c95af60e681e064db683d517de7c3c8">MOST_SIGNIFICANT_BIT_POSITION</a>(64)</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <a class="code" href="bitset_8cc.html#a6c95af60e681e064db683d517de7c3c8">MOST_SIGNIFICANT_BIT_POSITION</a>(32)</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> </div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="preprocessor">#undef MOST_SIGNIFICANT_BIT_POSITION</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00198"></a><span class="lineno"><a class="line" href="bitset_8cc.html#ab483ccbdddfcad95eef8087de59791db"> 198</a></span> <span class="preprocessor">#define UNSAFE_LEAST_SIGNIFICANT_BIT_POSITION(size) \</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="preprocessor"> int##size##_t UnsafeLeastSignificantBitPosition##size( \</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="preprocessor"> const uint##size##_t* const bits, uint##size##_t start, \</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="preprocessor"> uint##size##_t end) { \</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="preprocessor"> DCHECK_LE(start, end); \</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="preprocessor"> DCHECK(IsBitSet##size(bits, end)); \</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="preprocessor"> if (IsBitSet##size(bits, start)) { \</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="preprocessor"> return start; \</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="preprocessor"> const int offset_start = BitOffset##size(start); \</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="preprocessor"> const int offset_end = BitOffset##size(end); \</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="preprocessor"> const int pos_start = BitPos##size(start); \</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="preprocessor"> const uint##size##_t start_mask = \</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="preprocessor"> bits[offset_start] & IntervalUp##size(pos_start); \</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="preprocessor"> if (start_mask) { \</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="preprocessor"> return BitShift##size(offset_start) + \</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="preprocessor"> LeastSignificantBitPosition##size(start_mask); \</span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="preprocessor"> for (int offset = offset_start + 1; offset <= offset_end; ++offset) { \</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="preprocessor"> if (bits[offset]) { \</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="preprocessor"> return BitShift##size(offset) + \</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="preprocessor"> LeastSignificantBitPosition##size(bits[offset]); \</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="preprocessor"> return -1; \</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="preprocessor"> }</span></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> <a class="code" href="bitset_8cc.html#ab483ccbdddfcad95eef8087de59791db">UNSAFE_LEAST_SIGNIFICANT_BIT_POSITION</a>(64)</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <a class="code" href="bitset_8cc.html#ab483ccbdddfcad95eef8087de59791db">UNSAFE_LEAST_SIGNIFICANT_BIT_POSITION</a>(32)</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="preprocessor">#undef UNSAFE_LEAST_SIGNIFICANT_BIT_POSITION</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> </div><div class="line"><a name="l00230"></a><span class="lineno"><a class="line" href="bitset_8cc.html#a1e8883f9118f3bc5cc8e7a892aa08215"> 230</a></span> <span class="preprocessor">#define UNSAFE_MOST_SIGNIFICANT_BIT_POSITION(size) \</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="preprocessor"> int##size##_t UnsafeMostSignificantBitPosition##size( \</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="preprocessor"> const uint##size##_t* const bits, uint##size##_t start, \</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="preprocessor"> uint##size##_t end) { \</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="preprocessor"> DCHECK_GE(end, start); \</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="preprocessor"> DCHECK(IsBitSet##size(bits, start)); \</span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="preprocessor"> if (IsBitSet##size(bits, end)) { \</span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="preprocessor"> return end; \</span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="preprocessor"> const int offset_start = BitOffset##size(start); \</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="preprocessor"> const int offset_end = BitOffset##size(end); \</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="preprocessor"> const int pos_end = BitPos##size(end); \</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="preprocessor"> const uint##size##_t end_mask = \</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="preprocessor"> bits[offset_end] & IntervalDown##size(pos_end); \</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="preprocessor"> if (end_mask) { \</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="preprocessor"> return BitShift##size(offset_end) + \</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="preprocessor"> MostSignificantBitPosition##size(end_mask); \</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="preprocessor"> for (int offset = offset_end - 1; offset >= offset_start; --offset) { \</span></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="preprocessor"> if (bits[offset]) { \</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="preprocessor"> return BitShift##size(offset) + \</span></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="preprocessor"> MostSignificantBitPosition##size(bits[offset]); \</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="preprocessor"> return -1; \</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="preprocessor"> }</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> </div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <a class="code" href="bitset_8cc.html#a1e8883f9118f3bc5cc8e7a892aa08215">UNSAFE_MOST_SIGNIFICANT_BIT_POSITION</a>(64)</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <a class="code" href="bitset_8cc.html#a1e8883f9118f3bc5cc8e7a892aa08215">UNSAFE_MOST_SIGNIFICANT_BIT_POSITION</a>(32)</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> </div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="preprocessor">#undef UNSAFE_MOST_SIGNIFICANT_BIT_POSITION</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> </div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="bitset_8cc_html_ab483ccbdddfcad95eef8087de59791db"><div class="ttname"><a href="bitset_8cc.html#ab483ccbdddfcad95eef8087de59791db">UNSAFE_LEAST_SIGNIFICANT_BIT_POSITION</a></div><div class="ttdeci">#define UNSAFE_LEAST_SIGNIFICANT_BIT_POSITION(size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8cc_source.html#l00198">bitset.cc:198</a></div></div>
|
|
<div class="ttc" id="bitset_8cc_html_a95564ffe5aa637e68370ebd4ede9e98b"><div class="ttname"><a href="bitset_8cc.html#a95564ffe5aa637e68370ebd4ede9e98b">ABSL_FLAG</a></div><div class="ttdeci">ABSL_FLAG(int, bitset_small_bitset_count, 8, "threshold to count bits with buckets")</div></div>
|
|
<div class="ttc" id="bitset_8cc_html_a6c95af60e681e064db683d517de7c3c8"><div class="ttname"><a href="bitset_8cc.html#a6c95af60e681e064db683d517de7c3c8">MOST_SIGNIFICANT_BIT_POSITION</a></div><div class="ttdeci">#define MOST_SIGNIFICANT_BIT_POSITION(size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8cc_source.html#l00146">bitset.cc:146</a></div></div>
|
|
<div class="ttc" id="bitset_8cc_html_a8a1613218821bcc0746e658018b22e14"><div class="ttname"><a href="bitset_8cc.html#a8a1613218821bcc0746e658018b22e14">BIT_COUNT_RANGE</a></div><div class="ttdeci">#define BIT_COUNT_RANGE(size, zero)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8cc_source.html#l00026">bitset.cc:26</a></div></div>
|
|
<div class="ttc" id="bitset_8cc_html_a6d1d9d8e8f51f8c5c9c196cee565c99a"><div class="ttname"><a href="bitset_8cc.html#a6d1d9d8e8f51f8c5c9c196cee565c99a">IS_EMPTY_RANGE</a></div><div class="ttdeci">#define IS_EMPTY_RANGE(size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8cc_source.html#l00063">bitset.cc:63</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="bitset_8cc_html_a0e35598507f1cefefed70d6b330e5564"><div class="ttname"><a href="bitset_8cc.html#a0e35598507f1cefefed70d6b330e5564">LEAST_SIGNIFCANT_BIT_POSITION</a></div><div class="ttdeci">#define LEAST_SIGNIFCANT_BIT_POSITION(size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8cc_source.html#l00095">bitset.cc:95</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="commandlineflags_8h_html"><div class="ttname"><a href="commandlineflags_8h.html">commandlineflags.h</a></div></div>
|
|
<div class="ttc" id="bitset_8h_html"><div class="ttname"><a href="bitset_8h.html">bitset.h</a></div></div>
|
|
<div class="ttc" id="bitset_8cc_html_a1e8883f9118f3bc5cc8e7a892aa08215"><div class="ttname"><a href="bitset_8cc.html#a1e8883f9118f3bc5cc8e7a892aa08215">UNSAFE_MOST_SIGNIFICANT_BIT_POSITION</a></div><div class="ttdeci">#define UNSAFE_MOST_SIGNIFICANT_BIT_POSITION(size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8cc_source.html#l00230">bitset.cc:230</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_8cc.html">bitset.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|