| <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://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.3"/> |
| <title>Lucene.Net: core/Util/OpenBitSet.cs 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="search/search.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="search/search.js"></script> |
| <script type="text/javascript"> |
| $(document).ready(function() { searchBox.OnSelectItem(0); }); |
| </script> |
| <link href="doxygen.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="lucene-net-icon-128x128.png"/></td> |
| <td style="padding-left: 0.5em;"> |
| <div id="projectname">Lucene.Net |
|  <span id="projectnumber">3.0.3</span> |
| </div> |
| <div id="projectbrief">Lucene.Net is a .NET port of the Java Lucene Indexing Library</div> |
| </td> |
| </tr> |
| </tbody> |
| </table> |
| </div> |
| <!-- end header part --> |
| <!-- Generated by Doxygen 1.8.3 --> |
| <script type="text/javascript"> |
| var searchBox = new SearchBox("searchBox", "search",false,'Search'); |
| </script> |
| <div id="navrow1" class="tabs"> |
| <ul class="tablist"> |
| <li><a href="Index.html"><span>Main Page</span></a></li> |
| <li><a href="namespaces.html"><span>Packages</span></a></li> |
| <li><a href="annotated.html"><span>Classes</span></a></li> |
| <li class="current"><a href="files.html"><span>Files</span></a></li> |
| <li> |
| <div id="MSearchBox" class="MSearchBoxInactive"> |
| <span class="left"> |
| <img id="MSearchSelect" src="search/mag_sel.png" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| alt=""/> |
| <input type="text" id="MSearchField" value="Search" accesskey="S" |
| onfocus="searchBox.OnSearchFieldFocus(true)" |
| onblur="searchBox.OnSearchFieldFocus(false)" |
| onkeyup="searchBox.OnSearchFieldChange(event)"/> |
| </span><span class="right"> |
| <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> |
| </span> |
| </div> |
| </li> |
| </ul> |
| </div> |
| <div id="navrow2" class="tabs2"> |
| <ul class="tablist"> |
| <li><a href="files.html"><span>File List</span></a></li> |
| <li><a href="globals.html"><span>File Members</span></a></li> |
| </ul> |
| </div> |
| <!-- window showing the filter options --> |
| <div id="MSearchSelectWindow" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| onkeydown="return searchBox.OnSearchSelectKey(event)"> |
| <a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Properties</a></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 id="nav-path" class="navpath"> |
| <ul> |
| <li class="navelem"><a class="el" href="dir_1efe588324fc547683bba4a3f1bac847.html">core</a></li><li class="navelem"><a class="el" href="dir_d1ecf42529ca901cc6a3edb20ba43b64.html">Util</a></li> </ul> |
| </div> |
| </div><!-- top --> |
| <div class="header"> |
| <div class="headertitle"> |
| <div class="title">OpenBitSet.cs</div> </div> |
| </div><!--header--> |
| <div class="contents"> |
| <a href="_open_bit_set_8cs.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">/* </span></div> |
| <div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Licensed to the Apache Software Foundation (ASF) under one or more</span></div> |
| <div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * contributor license agreements. See the NOTICE file distributed with</span></div> |
| <div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * this work for additional information regarding copyright ownership.</span></div> |
| <div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * The ASF licenses this file to You under the Apache License, Version 2.0</span></div> |
| <div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * (the "License"); you may not use this file except in compliance with</span></div> |
| <div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * the License. You may obtain a copy of the License at</span></div> |
| <div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * </span></div> |
| <div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> * http://www.apache.org/licenses/LICENSE-2.0</span></div> |
| <div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> * </span></div> |
| <div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> * Unless required by applicable law or agreed to in writing, software</span></div> |
| <div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> * distributed under the License is distributed on an "AS IS" BASIS,</span></div> |
| <div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div> |
| <div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * See the License for the specific language governing permissions and</span></div> |
| <div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> * limitations under the License.</span></div> |
| <div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div> |
| <div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="keyword">using</span> System;</div> |
| <div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="keyword">using</span> Lucene.Net.Support;</div> |
| <div class="line"><a name="l00020"></a><span class="lineno"><a class="code" href="_open_bit_set_8cs.html#a4245eee1c0c260a340820cfe67797b43"> 20</a></span> <span class="keyword">using</span> <a class="code" href="_doc_id_bit_set_8cs.html#a4245eee1c0c260a340820cfe67797b43">DocIdSet</a> = Lucene.Net.Search.DocIdSet;</div> |
| <div class="line"><a name="l00021"></a><span class="lineno"><a class="code" href="_open_bit_set_8cs.html#adbba0575d48e29661f658fa4071fde4f"> 21</a></span> <span class="keyword">using</span> <a class="code" href="_doc_id_bit_set_8cs.html#adbba0575d48e29661f658fa4071fde4f">DocIdSetIterator</a> = Lucene.Net.Search.DocIdSetIterator;</div> |
| <div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div> |
| <div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="keyword">namespace </span>Lucene.Net.Util</div> |
| <div class="line"><a name="l00024"></a><span class="lineno"> 24</span> {</div> |
| <div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  </div> |
| <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  </div> |
| <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  [Serializable]</div> |
| <div class="line"><a name="l00081"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html"> 81</a></span>  <span class="keyword">public</span> <span class="keyword">class </span><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a>:<a class="code" href="_doc_id_bit_set_8cs.html#a4245eee1c0c260a340820cfe67797b43">DocIdSet</a>, System.ICloneable</div> |
| <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  {</div> |
| <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">protected</span> <span class="keyword">internal</span> <span class="keywordtype">long</span>[] internalbits;</div> |
| <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keyword">protected</span> <span class="keyword">internal</span> <span class="keywordtype">int</span> wlen; <span class="comment">// number of words (elements) used in the array</span></div> |
| <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  </div> |
| <div class="line"><a name="l00091"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#aaa9ef764ca56c4f16dacc7e5c13b1c39"> 91</a></span>  <span class="keyword">public</span> <a class="code" href="_field_cache_terms_filter_8cs.html#a39e4630d91e4f7fc118eb51aa4d221a0">OpenBitSet</a>(<span class="keywordtype">long</span> numBits)</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>  internalbits = <span class="keyword">new</span> <span class="keywordtype">long</span>[Bits2words(numBits)];</div> |
| <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  wlen = internalbits.Length;</div> |
| <div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div> |
| <div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  </div> |
| <div class="line"><a name="l00097"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#ae920f4727efb929d54e19543156d961e"> 97</a></span>  <span class="keyword">public</span> <a class="code" href="_field_cache_terms_filter_8cs.html#a39e4630d91e4f7fc118eb51aa4d221a0">OpenBitSet</a>():this(64)</div> |
| <div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  {</div> |
| <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  }</div> |
| <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  </div> |
| <div class="line"><a name="l00114"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a3f9f894eb48d2cd9541cf407987009a9"> 114</a></span>  <span class="keyword">public</span> <a class="code" href="_field_cache_terms_filter_8cs.html#a39e4630d91e4f7fc118eb51aa4d221a0">OpenBitSet</a>(<span class="keywordtype">long</span>[] bits, <span class="keywordtype">int</span> numWords)</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>  this.internalbits = bits;</div> |
| <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  this.wlen = numWords;</div> |
| <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div> |
| <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  </div> |
| <div class="line"><a name="l00120"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#aa6923d931a282a9334ec956ecf2bbaf2"> 120</a></span>  <span class="keyword">public</span> <span class="keyword">override</span> <a class="code" href="_doc_id_bit_set_8cs.html#adbba0575d48e29661f658fa4071fde4f">DocIdSetIterator</a> Iterator()</div> |
| <div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  {</div> |
| <div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set_iterator.html" title="An iterator to iterate over set bits in an OpenBitSet. This is faster than nextSetBit() for iterating...">OpenBitSetIterator</a>(internalbits, wlen);</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> </div> |
| <div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">bool</span> IsCacheable</div> |
| <div class="line"><a name="l00127"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a58941bb76242fd88c23b2a99ec31cc1e"> 127</a></span>  {</div> |
| <div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">get</span> { <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div> |
| <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  }</div> |
| <div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div> |
| <div class="line"><a name="l00132"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a8225a07c21e81a8a35e49a714251a304"> 132</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">long</span> Capacity()</div> |
| <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  {</div> |
| <div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">return</span> internalbits.Length << 6;</div> |
| <div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div> |
| <div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  </div> |
| <div class="line"><a name="l00140"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a19662b649fa0cfc0b67234a37bde2bd5"> 140</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">long</span> Size()</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="keywordflow">return</span> Capacity();</div> |
| <div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  }</div> |
| <div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  </div> |
| <div class="line"><a name="l00146"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#af629952e1073a0c79527e1b1dc3c2978"> 146</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> IsEmpty()</div> |
| <div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  {</div> |
| <div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">return</span> Cardinality() == 0;</div> |
| <div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div> |
| <div class="line"><a name="l00150"></a><span class="lineno"> 150</span> </div> |
| <div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  [System.Diagnostics.CodeAnalysis.SuppressMessage(<span class="stringliteral">"Microsoft.Performance"</span>, <span class="stringliteral">"CA1819:PropertiesShouldNotReturnArrays"</span>)]</div> |
| <div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">long</span>[] Bits</div> |
| <div class="line"><a name="l00154"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a943deca371208fa10f2c2446c78f1841"> 154</a></span>  {</div> |
| <div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keyword">set</span> { this.internalbits = value; }</div> |
| <div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">get</span> { <span class="keywordflow">return</span> internalbits; }</div> |
| <div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div> |
| <div class="line"><a name="l00158"></a><span class="lineno"> 158</span> </div> |
| <div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">int</span> NumWords</div> |
| <div class="line"><a name="l00161"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a7842a2c9d22204c0427ee762e83616e0"> 161</a></span>  {</div> |
| <div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keyword">get</span> { <span class="keywordflow">return</span> wlen; }</div> |
| <div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keyword">set</span> { this.wlen = value; }</div> |
| <div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div> |
| <div class="line"><a name="l00165"></a><span class="lineno"> 165</span> </div> |
| <div class="line"><a name="l00166"></a><span class="lineno"> 166</span> </div> |
| <div class="line"><a name="l00168"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a4d6d1c73a2874847105008abd76b2b55"> 168</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> Get(<span class="keywordtype">int</span> index)</div> |
| <div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  {</div> |
| <div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordtype">int</span> i = index >> 6; <span class="comment">// div 64</span></div> |
| <div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// signed shift will keep a negative index and force an</span></div> |
| <div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// array-index-out-of-bounds-exception, removing the need for an explicit check.</span></div> |
| <div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">if</span> (i >= internalbits.Length)</div> |
| <div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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="keywordtype">int</span> bit = index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">return</span> (internalbits[i] & bitmask) != 0;</div> |
| <div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  }</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="l00185"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#aa1fb74b4f2601b802fd458bfe58bf728"> 185</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> FastGet(<span class="keywordtype">int</span> index)</div> |
| <div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  {</div> |
| <div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordtype">int</span> i = index >> 6; <span class="comment">// div 64</span></div> |
| <div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// signed shift will keep a negative index and force an</span></div> |
| <div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// array-index-out-of-bounds-exception, removing the need for an explicit check.</span></div> |
| <div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordtype">int</span> bit = index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">return</span> (internalbits[i] & bitmask) != 0;</div> |
| <div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div> |
| <div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  </div> |
| <div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  </div> |
| <div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  </div> |
| <div class="line"><a name="l00198"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a041f606eda9d49ee94185df9fd0fc66a"> 198</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> Get(<span class="keywordtype">long</span> index)</div> |
| <div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  {</div> |
| <div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordtype">int</span> i = (int) (index >> 6); <span class="comment">// div 64</span></div> |
| <div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">if</span> (i >= internalbits.Length)</div> |
| <div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordtype">int</span> bit = (int) index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">return</span> (internalbits[i] & bitmask) != 0;</div> |
| <div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div> |
| <div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  </div> |
| <div class="line"><a name="l00211"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#afcb5737988ab2f1535d67ef5ab6e993d"> 211</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> FastGet(<span class="keywordtype">long</span> index)</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="keywordtype">int</span> i = (int) (index >> 6); <span class="comment">// div 64</span></div> |
| <div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordtype">int</span> bit = (int) index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">return</span> (internalbits[i] & bitmask) != 0;</div> |
| <div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  }</div> |
| <div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  </div> |
| <div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">/*</span></div> |
| <div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="comment"> // alternate implementation of get()</span></div> |
| <div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="comment"> public boolean get1(int index) {</span></div> |
| <div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="comment"> int i = index >> 6; // div 64</span></div> |
| <div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment"> int bit = index & 0x3f; // mod 64</span></div> |
| <div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment"> return ((bits[i]>>>bit) & 0x01) != 0;</span></div> |
| <div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment"> // this does a long shift and a bittest (on x86) vs</span></div> |
| <div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment"> // a long shift, and a long AND, (the test for zero is prob a no-op)</span></div> |
| <div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment"> // testing on a P4 indicates this is slower than (bits[i] & bitmask) != 0;</span></div> |
| <div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment"> }</span></div> |
| <div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="comment"> */</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"> 231</span>  </div> |
| <div class="line"><a name="l00235"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#ae28581233f57e1d7b3dae5b606065633"> 235</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">int</span> GetBit(<span class="keywordtype">int</span> index)</div> |
| <div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  {</div> |
| <div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordtype">int</span> i = index >> 6; <span class="comment">// div 64</span></div> |
| <div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordtype">int</span> bit = index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">return</span> ((<span class="keywordtype">int</span> )((ulong) (internalbits[i]) >> bit)) & 0x01;</div> |
| <div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div> |
| <div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  </div> |
| <div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  </div> |
| <div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="comment">/*</span></div> |
| <div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="comment"> public boolean get2(int index) {</span></div> |
| <div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="comment"> int word = index >> 6; // div 64</span></div> |
| <div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment"> int bit = index & 0x0000003f; // mod 64</span></div> |
| <div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment"> return (bits[word] << bit) < 0; // hmmm, this would work if bit order were reversed</span></div> |
| <div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="comment"> // we could right shift and check for parity bit, if it was available to us.</span></div> |
| <div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment"> }</span></div> |
| <div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  </div> |
| <div class="line"><a name="l00253"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#acfb26a60d06cb5c1231ab2e441acf049"> 253</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> Set(<span class="keywordtype">long</span> index)</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="keywordtype">int</span> wordNum = ExpandingWordNum(index);</div> |
| <div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordtype">int</span> bit = (int) index & 0x3f;</div> |
| <div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  internalbits[wordNum] |= bitmask;</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>  </div> |
| <div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  </div> |
| <div class="line"><a name="l00265"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a057407553b6877e8b7cd5dda93f7ae37"> 265</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> FastSet(<span class="keywordtype">int</span> index)</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="keywordtype">int</span> wordNum = index >> 6; <span class="comment">// div 64</span></div> |
| <div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordtype">int</span> bit = index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  internalbits[wordNum] |= bitmask;</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="l00276"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#aa3cbc469eff2fd996220d0d1dd192536"> 276</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> FastSet(<span class="keywordtype">long</span> index)</div> |
| <div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  {</div> |
| <div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordtype">int</span> wordNum = (int) (index >> 6);</div> |
| <div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordtype">int</span> bit = (int) index & 0x3f;</div> |
| <div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  internalbits[wordNum] |= bitmask;</div> |
| <div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  }</div> |
| <div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  </div> |
| <div class="line"><a name="l00291"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a2c3347e568ed69a6c61dbc02f57e8e5f"> 291</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> Set(<span class="keywordtype">long</span> startIndex, <span class="keywordtype">long</span> endIndex)</div> |
| <div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  {</div> |
| <div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">if</span> (endIndex <= startIndex)</div> |
| <div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  return ;</div> |
| <div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  </div> |
| <div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordtype">int</span> startWord = (int) (startIndex >> 6);</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>  <span class="comment">// since endIndex is one past the end, this is index of the last</span></div> |
| <div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// word to be changed.</span></div> |
| <div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordtype">int</span> endWord = ExpandingWordNum(endIndex - 1);</div> |
| <div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  </div> |
| <div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordtype">long</span> startmask = - 1L << (int) startIndex;</div> |
| <div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordtype">long</span> endmask = (long) (0xffffffffffffffffUL >> (<span class="keywordtype">int</span>) - endIndex); <span class="comment">// 64-(endIndex&0x3f) is the same as -endIndex due to wrap</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"> 305</span>  <span class="keywordflow">if</span> (startWord == endWord)</div> |
| <div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  {</div> |
| <div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  internalbits[startWord] |= (startmask & endmask);</div> |
| <div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  return ;</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>  </div> |
| <div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  internalbits[startWord] |= startmask;</div> |
| <div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = startWord + 1; i < endWord; i++)</div> |
| <div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  internalbits[i] = -1L;</div> |
| <div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  internalbits[endWord] |= endmask;</div> |
| <div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div> |
| <div class="line"><a name="l00316"></a><span class="lineno"> 316</span> </div> |
| <div class="line"><a name="l00317"></a><span class="lineno"> 317</span> </div> |
| <div class="line"><a name="l00318"></a><span class="lineno"> 318</span> </div> |
| <div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keyword">protected</span> <span class="keyword">internal</span> <span class="keyword">virtual</span> <span class="keywordtype">int</span> ExpandingWordNum(<span class="keywordtype">long</span> index)</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="keywordtype">int</span> wordNum = (int) (index >> 6);</div> |
| <div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">if</span> (wordNum >= wlen)</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>  EnsureCapacity(index + 1);</div> |
| <div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  wlen = wordNum + 1;</div> |
| <div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  }</div> |
| <div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">return</span> wordNum;</div> |
| <div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  }</div> |
| <div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  </div> |
| <div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  </div> |
| <div class="line"><a name="l00334"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#aee4dc45bf554e679291ea1144c0c4685"> 334</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> FastClear(<span class="keywordtype">int</span> index)</div> |
| <div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  {</div> |
| <div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordtype">int</span> wordNum = index >> 6;</div> |
| <div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordtype">int</span> bit = index & 0x03f;</div> |
| <div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  internalbits[wordNum] &= ~ bitmask;</div> |
| <div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">// hmmm, it takes one more instruction to clear than it does to set... any</span></div> |
| <div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">// way to work around this? If there were only 63 bits per word, we could</span></div> |
| <div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="comment">// use a right shift of 10111111...111 in binary to position the 0 in the</span></div> |
| <div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">// correct place (using sign extension).</span></div> |
| <div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="comment">// Could also use Long.rotateRight() or rotateLeft() *if* they were converted</span></div> |
| <div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">// by the JVM into a native instruction.</span></div> |
| <div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="comment">// bits[word] &= Long.rotateLeft(0xfffffffe,bit);</span></div> |
| <div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  }</div> |
| <div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  </div> |
| <div class="line"><a name="l00352"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a29984dff94dc3fac734d2d367c19db9b"> 352</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> FastClear(<span class="keywordtype">long</span> index)</div> |
| <div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  {</div> |
| <div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordtype">int</span> wordNum = (int) (index >> 6); <span class="comment">// div 64</span></div> |
| <div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordtype">int</span> bit = (int) index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  internalbits[wordNum] &= ~ bitmask;</div> |
| <div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  }</div> |
| <div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  </div> |
| <div class="line"><a name="l00361"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a725e13e033210eb75baaf493b3498c9f"> 361</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> Clear(<span class="keywordtype">long</span> index)</div> |
| <div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  {</div> |
| <div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordtype">int</span> wordNum = (int) (index >> 6); <span class="comment">// div 64</span></div> |
| <div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">if</span> (wordNum >= wlen)</div> |
| <div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  return ;</div> |
| <div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordtype">int</span> bit = (int) index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  internalbits[wordNum] &= ~ bitmask;</div> |
| <div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  }</div> |
| <div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  </div> |
| <div class="line"><a name="l00378"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a12859ce60e4c81f11cd427f3b521d390"> 378</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> Clear(<span class="keywordtype">int</span> startIndex, <span class="keywordtype">int</span> endIndex)</div> |
| <div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  {</div> |
| <div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordflow">if</span> (endIndex <= startIndex)</div> |
| <div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  return ;</div> |
| <div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  </div> |
| <div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordtype">int</span> startWord = (startIndex >> 6);</div> |
| <div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">if</span> (startWord >= wlen)</div> |
| <div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  return ;</div> |
| <div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  </div> |
| <div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="comment">// since endIndex is one past the end, this is index of the last</span></div> |
| <div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="comment">// word to be changed.</span></div> |
| <div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordtype">int</span> endWord = ((endIndex - 1) >> 6);</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="keywordtype">long</span> startmask = - 1L << startIndex;</div> |
| <div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordtype">long</span> endmask = (long) (0xffffffffffffffffUL >> - endIndex); <span class="comment">// 64-(endIndex&0x3f) is the same as -endIndex due to wrap</span></div> |
| <div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  </div> |
| <div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="comment">// invert masks since we are clearing</span></div> |
| <div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  startmask = ~ startmask;</div> |
| <div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  endmask = ~ endmask;</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>  <span class="keywordflow">if</span> (startWord == endWord)</div> |
| <div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  {</div> |
| <div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  internalbits[startWord] &= (startmask | endmask);</div> |
| <div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  return ;</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>  </div> |
| <div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  internalbits[startWord] &= startmask;</div> |
| <div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  </div> |
| <div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordtype">int</span> middle = System.Math.Min(wlen, endWord);</div> |
| <div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = startWord + 1; i < middle; i++)</div> |
| <div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  internalbits[i] = 0L;</div> |
| <div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">if</span> (endWord < wlen)</div> |
| <div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  {</div> |
| <div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  internalbits[endWord] &= endmask;</div> |
| <div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  }</div> |
| <div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  }</div> |
| <div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  </div> |
| <div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  </div> |
| <div class="line"><a name="l00423"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#ab3ae9fb8c0a17e5077eef2f4cdc8e5cc"> 423</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> Clear(<span class="keywordtype">long</span> startIndex, <span class="keywordtype">long</span> endIndex)</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="keywordflow">if</span> (endIndex <= startIndex)</div> |
| <div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  return ;</div> |
| <div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  </div> |
| <div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordtype">int</span> startWord = (int) (startIndex >> 6);</div> |
| <div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keywordflow">if</span> (startWord >= wlen)</div> |
| <div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  return ;</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">// since endIndex is one past the end, this is index of the last</span></div> |
| <div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="comment">// word to be changed.</span></div> |
| <div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keywordtype">int</span> endWord = (int) ((endIndex - 1) >> 6);</div> |
| <div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  </div> |
| <div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordtype">long</span> startmask = - 1L << (int) startIndex;</div> |
| <div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordtype">long</span> endmask = (long) (0xffffffffffffffffUL >> (<span class="keywordtype">int</span>) - endIndex); <span class="comment">// 64-(endIndex&0x3f) is the same as -endIndex due to wrap</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">// invert masks since we are clearing</span></div> |
| <div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  startmask = ~ startmask;</div> |
| <div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  endmask = ~ endmask;</div> |
| <div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  </div> |
| <div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keywordflow">if</span> (startWord == endWord)</div> |
| <div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  {</div> |
| <div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  internalbits[startWord] &= (startmask | endmask);</div> |
| <div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  return ;</div> |
| <div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  }</div> |
| <div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  </div> |
| <div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  internalbits[startWord] &= startmask;</div> |
| <div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  </div> |
| <div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordtype">int</span> middle = System.Math.Min(wlen, endWord);</div> |
| <div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = startWord + 1; i < middle; i++)</div> |
| <div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  internalbits[i] = 0L;</div> |
| <div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keywordflow">if</span> (endWord < wlen)</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>  internalbits[endWord] &= endmask;</div> |
| <div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  }</div> |
| <div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  }</div> |
| <div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  </div> |
| <div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  </div> |
| <div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  </div> |
| <div class="line"><a name="l00465"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#ad58e002d18ccb1cbf6750f9cd1cafc92"> 465</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> GetAndSet(<span class="keywordtype">int</span> index)</div> |
| <div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  {</div> |
| <div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordtype">int</span> wordNum = index >> 6; <span class="comment">// div 64</span></div> |
| <div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keywordtype">int</span> bit = index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordtype">bool</span> val = (internalbits[wordNum] & bitmask) != 0;</div> |
| <div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  internalbits[wordNum] |= bitmask;</div> |
| <div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">return</span> val;</div> |
| <div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  }</div> |
| <div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  </div> |
| <div class="line"><a name="l00478"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#ae7289ce49872ca9c92a1142d3bdbfde3"> 478</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> GetAndSet(<span class="keywordtype">long</span> index)</div> |
| <div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  {</div> |
| <div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keywordtype">int</span> wordNum = (int) (index >> 6); <span class="comment">// div 64</span></div> |
| <div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordtype">int</span> bit = (int) index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordtype">bool</span> val = (internalbits[wordNum] & bitmask) != 0;</div> |
| <div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  internalbits[wordNum] |= bitmask;</div> |
| <div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="keywordflow">return</span> val;</div> |
| <div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  }</div> |
| <div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  </div> |
| <div class="line"><a name="l00491"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#abde2b05948b3c454d90bcef0cc7ecfa6"> 491</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> FastFlip(<span class="keywordtype">int</span> index)</div> |
| <div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  {</div> |
| <div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keywordtype">int</span> wordNum = index >> 6; <span class="comment">// div 64</span></div> |
| <div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordtype">int</span> bit = index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  internalbits[wordNum] ^= bitmask;</div> |
| <div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  }</div> |
| <div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  </div> |
| <div class="line"><a name="l00502"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#ad4ec51a8a227c7c8458b84e023da4e3f"> 502</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> FastFlip(<span class="keywordtype">long</span> index)</div> |
| <div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  {</div> |
| <div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keywordtype">int</span> wordNum = (int) (index >> 6); <span class="comment">// div 64</span></div> |
| <div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordtype">int</span> bit = (int) index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  internalbits[wordNum] ^= bitmask;</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="l00511"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#aa792d629332cb21cc67c85c02ff6ff5d"> 511</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> Flip(<span class="keywordtype">long</span> index)</div> |
| <div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  {</div> |
| <div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordtype">int</span> wordNum = ExpandingWordNum(index);</div> |
| <div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordtype">int</span> bit = (int) index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  internalbits[wordNum] ^= bitmask;</div> |
| <div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  }</div> |
| <div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  </div> |
| <div class="line"><a name="l00522"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a9aeaa06817acc3a3dbb70d90981f8eff"> 522</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> FlipAndGet(<span class="keywordtype">int</span> index)</div> |
| <div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  {</div> |
| <div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keywordtype">int</span> wordNum = index >> 6; <span class="comment">// div 64</span></div> |
| <div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keywordtype">int</span> bit = index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  internalbits[wordNum] ^= bitmask;</div> |
| <div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keywordflow">return</span> (internalbits[wordNum] & bitmask) != 0;</div> |
| <div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  }</div> |
| <div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  </div> |
| <div class="line"><a name="l00534"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#aa293dee02a159bb146e289347354a545"> 534</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> FlipAndGet(<span class="keywordtype">long</span> index)</div> |
| <div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  {</div> |
| <div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="keywordtype">int</span> wordNum = (int) (index >> 6); <span class="comment">// div 64</span></div> |
| <div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keywordtype">int</span> bit = (int) index & 0x3f; <span class="comment">// mod 64</span></div> |
| <div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordtype">long</span> bitmask = 1L << bit;</div> |
| <div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  internalbits[wordNum] ^= bitmask;</div> |
| <div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keywordflow">return</span> (internalbits[wordNum] & bitmask) != 0;</div> |
| <div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  }</div> |
| <div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  </div> |
| <div class="line"><a name="l00550"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a27c1085d1fdc52436bd1305d9b581f1c"> 550</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> Flip(<span class="keywordtype">long</span> startIndex, <span class="keywordtype">long</span> endIndex)</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>  <span class="keywordflow">if</span> (endIndex <= startIndex)</div> |
| <div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  return ;</div> |
| <div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordtype">int</span> startWord = (int) (startIndex >> 6);</div> |
| <div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  </div> |
| <div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="comment">// since endIndex is one past the end, this is index of the last</span></div> |
| <div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="comment">// word to be changed.</span></div> |
| <div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordtype">int</span> endWord = ExpandingWordNum(endIndex - 1);</div> |
| <div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  </div> |
| <div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="comment">/* Grrr, java shifting wraps around so -1L>>>64 == -1</span></div> |
| <div class="line"><a name="l00561"></a><span class="lineno"> 561</span> <span class="comment"> * for that reason, make sure not to use endmask if the bits to flip will</span></div> |
| <div class="line"><a name="l00562"></a><span class="lineno"> 562</span> <span class="comment"> * be zero in the last word (redefine endWord to be the last changed...)</span></div> |
| <div class="line"><a name="l00563"></a><span class="lineno"> 563</span> <span class="comment"> long startmask = -1L << (startIndex & 0x3f); // example: 11111...111000</span></div> |
| <div class="line"><a name="l00564"></a><span class="lineno"> 564</span> <span class="comment"> long endmask = -1L >>> (64-(endIndex & 0x3f)); // example: 00111...111111</span></div> |
| <div class="line"><a name="l00565"></a><span class="lineno"> 565</span> <span class="comment"> ***/</span></div> |
| <div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  </div> |
| <div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keywordtype">long</span> startmask = - 1L << (int) startIndex;</div> |
| <div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keywordtype">long</span> endmask = (long) (0xffffffffffffffffUL >> (<span class="keywordtype">int</span>) - endIndex); <span class="comment">// 64-(endIndex&0x3f) is the same as -endIndex due to wrap</span></div> |
| <div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  </div> |
| <div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="keywordflow">if</span> (startWord == endWord)</div> |
| <div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  {</div> |
| <div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  internalbits[startWord] ^= (startmask & endmask);</div> |
| <div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  return ;</div> |
| <div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  }</div> |
| <div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  </div> |
| <div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  internalbits[startWord] ^= startmask;</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>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = startWord + 1; i < endWord; i++)</div> |
| <div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  {</div> |
| <div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  internalbits[i] = ~ internalbits[i];</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>  </div> |
| <div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  internalbits[endWord] ^= endmask;</div> |
| <div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  }</div> |
| <div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  </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>  <span class="comment">/*</span></div> |
| <div class="line"><a name="l00588"></a><span class="lineno"> 588</span> <span class="comment"> public static int pop(long v0, long v1, long v2, long v3) {</span></div> |
| <div class="line"><a name="l00589"></a><span class="lineno"> 589</span> <span class="comment"> // derived from pop_array by setting last four elems to 0.</span></div> |
| <div class="line"><a name="l00590"></a><span class="lineno"> 590</span> <span class="comment"> // exchanges one pop() call for 10 elementary operations</span></div> |
| <div class="line"><a name="l00591"></a><span class="lineno"> 591</span> <span class="comment"> // saving about 7 instructions... is there a better way?</span></div> |
| <div class="line"><a name="l00592"></a><span class="lineno"> 592</span> <span class="comment"> long twosA=v0 & v1;</span></div> |
| <div class="line"><a name="l00593"></a><span class="lineno"> 593</span> <span class="comment"> long ones=v0^v1;</span></div> |
| <div class="line"><a name="l00594"></a><span class="lineno"> 594</span> <span class="comment"> </span></div> |
| <div class="line"><a name="l00595"></a><span class="lineno"> 595</span> <span class="comment"> long u2=ones^v2;</span></div> |
| <div class="line"><a name="l00596"></a><span class="lineno"> 596</span> <span class="comment"> long twosB =(ones&v2)|(u2&v3);</span></div> |
| <div class="line"><a name="l00597"></a><span class="lineno"> 597</span> <span class="comment"> ones=u2^v3;</span></div> |
| <div class="line"><a name="l00598"></a><span class="lineno"> 598</span> <span class="comment"> </span></div> |
| <div class="line"><a name="l00599"></a><span class="lineno"> 599</span> <span class="comment"> long fours=(twosA&twosB);</span></div> |
| <div class="line"><a name="l00600"></a><span class="lineno"> 600</span> <span class="comment"> long twos=twosA^twosB;</span></div> |
| <div class="line"><a name="l00601"></a><span class="lineno"> 601</span> <span class="comment"> </span></div> |
| <div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="comment"> return (pop(fours)<<2)</span></div> |
| <div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="comment"> + (pop(twos)<<1)</span></div> |
| <div class="line"><a name="l00604"></a><span class="lineno"> 604</span> <span class="comment"> + pop(ones);</span></div> |
| <div class="line"><a name="l00605"></a><span class="lineno"> 605</span> <span class="comment"> </span></div> |
| <div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="comment"> }</span></div> |
| <div class="line"><a name="l00607"></a><span class="lineno"> 607</span> <span class="comment"> */</span></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="l00612"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a80b948d365c48ddaa7ee1d84a938f3f1"> 612</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">long</span> Cardinality()</div> |
| <div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  {</div> |
| <div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keywordflow">return</span> <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html" title="A variety of high efficiencly bit twiddling routines.">BitUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html#afa47a0dc67f555b39eaf1145ce93d89e" title="Returns the number of set bits in an array of longs. ">Pop_array</a>(internalbits, 0, wlen);</div> |
| <div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  }</div> |
| <div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  </div> |
| <div class="line"><a name="l00620"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a20c075e4ec3a7208b99ca12c96b5f06f"> 620</a></span>  <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">long</span> IntersectionCount(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> a, <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> b)</div> |
| <div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  {</div> |
| <div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keywordflow">return</span> <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html" title="A variety of high efficiencly bit twiddling routines.">BitUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html#a8e59e06c15a8b4e80502675b84e1f81c" title="Returns the popcount or cardinality of the two sets after an intersection. Neither array is modified...">Pop_intersect</a>(a.internalbits, b.internalbits, 0, System.Math.Min(a.wlen, b.wlen));</div> |
| <div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  }</div> |
| <div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  </div> |
| <div class="line"><a name="l00628"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a7900b1c975b62681cd5c0130c358ed43"> 628</a></span>  <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">long</span> UnionCount(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> a, <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> b)</div> |
| <div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  {</div> |
| <div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keywordtype">long</span> tot = <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html" title="A variety of high efficiencly bit twiddling routines.">BitUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html#a9fced3bc849f2362f1b2e72aa6971014" title="Returns the popcount or cardinality of the union of two sets. Neither array is modified. ">Pop_union</a>(a.internalbits, b.internalbits, 0, System.Math.Min(a.wlen, b.wlen));</div> |
| <div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keywordflow">if</span> (a.wlen < b.wlen)</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>  tot += <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html" title="A variety of high efficiencly bit twiddling routines.">BitUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html#afa47a0dc67f555b39eaf1145ce93d89e" title="Returns the number of set bits in an array of longs. ">Pop_array</a>(b.internalbits, a.wlen, b.wlen - a.wlen);</div> |
| <div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  }</div> |
| <div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (a.wlen > b.wlen)</div> |
| <div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  {</div> |
| <div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  tot += <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html" title="A variety of high efficiencly bit twiddling routines.">BitUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html#afa47a0dc67f555b39eaf1145ce93d89e" title="Returns the number of set bits in an array of longs. ">Pop_array</a>(a.internalbits, b.wlen, a.wlen - b.wlen);</div> |
| <div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  }</div> |
| <div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keywordflow">return</span> tot;</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>  </div> |
| <div class="line"><a name="l00646"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#afc63a8a9fd56d04d4692fcc829a7e397"> 646</a></span>  <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">long</span> AndNotCount(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> a, <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> b)</div> |
| <div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  {</div> |
| <div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keywordtype">long</span> tot = <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html" title="A variety of high efficiencly bit twiddling routines.">BitUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html#a172c8fc65f80746ad885a61ecba6e151" title="Returns the popcount or cardinality of A & ~B Neither array is modified. ">Pop_andnot</a>(a.internalbits, b.internalbits, 0, System.Math.Min(a.wlen, b.wlen));</div> |
| <div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keywordflow">if</span> (a.wlen > b.wlen)</div> |
| <div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  {</div> |
| <div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  tot += <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html" title="A variety of high efficiencly bit twiddling routines.">BitUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html#afa47a0dc67f555b39eaf1145ce93d89e" title="Returns the number of set bits in an array of longs. ">Pop_array</a>(a.internalbits, b.wlen, a.wlen - b.wlen);</div> |
| <div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  }</div> |
| <div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keywordflow">return</span> tot;</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="l00659"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a814ad99c31817bf663a8be65970ee22c"> 659</a></span>  <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">long</span> XorCount(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> a, <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> b)</div> |
| <div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  {</div> |
| <div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordtype">long</span> tot = <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html" title="A variety of high efficiencly bit twiddling routines.">BitUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html#a3dc8cf0d64cb4e79888d16fffecccaad">Pop_xor</a>(a.internalbits, b.internalbits, 0, System.Math.Min(a.wlen, b.wlen));</div> |
| <div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordflow">if</span> (a.wlen < b.wlen)</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>  tot += <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html" title="A variety of high efficiencly bit twiddling routines.">BitUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html#afa47a0dc67f555b39eaf1145ce93d89e" title="Returns the number of set bits in an array of longs. ">Pop_array</a>(b.internalbits, a.wlen, b.wlen - a.wlen);</div> |
| <div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  }</div> |
| <div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (a.wlen > b.wlen)</div> |
| <div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  {</div> |
| <div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  tot += <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html" title="A variety of high efficiencly bit twiddling routines.">BitUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html#afa47a0dc67f555b39eaf1145ce93d89e" title="Returns the number of set bits in an array of longs. ">Pop_array</a>(a.internalbits, b.wlen, a.wlen - b.wlen);</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>  <span class="keywordflow">return</span> tot;</div> |
| <div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  }</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>  </div> |
| <div class="line"><a name="l00677"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a1715abb16f88a466e23cc26daa2e6239"> 677</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">int</span> NextSetBit(<span class="keywordtype">int</span> index)</div> |
| <div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  {</div> |
| <div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keywordtype">int</span> i = index >> 6;</div> |
| <div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">if</span> (i >= wlen)</div> |
| <div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keywordflow">return</span> - 1;</div> |
| <div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keywordtype">int</span> subIndex = index & 0x3f; <span class="comment">// index within the word</span></div> |
| <div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="keywordtype">long</span> word = internalbits[i] >> subIndex; <span class="comment">// skip all the bits to the right of index</span></div> |
| <div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  </div> |
| <div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keywordflow">if</span> (word != 0)</div> |
| <div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  {</div> |
| <div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keywordflow">return</span> (i << 6) + subIndex + <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html" title="A variety of high efficiencly bit twiddling routines.">BitUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html#abccb54437f5f26909ffe2fc0621f3e65" title="Returns number of trailing zeros in a 64 bit long value. ">Ntz</a>(word);</div> |
| <div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  }</div> |
| <div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  </div> |
| <div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keywordflow">while</span> (++i < wlen)</div> |
| <div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  {</div> |
| <div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  word = internalbits[i];</div> |
| <div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keywordflow">if</span> (word != 0)</div> |
| <div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keywordflow">return</span> (i << 6) + <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html" title="A variety of high efficiencly bit twiddling routines.">BitUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html#abccb54437f5f26909ffe2fc0621f3e65" title="Returns number of trailing zeros in a 64 bit long value. ">Ntz</a>(word);</div> |
| <div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  }</div> |
| <div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  </div> |
| <div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keywordflow">return</span> - 1;</div> |
| <div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  }</div> |
| <div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  </div> |
| <div class="line"><a name="l00703"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a0edac9476400be60bc9effaee693df3b"> 703</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">long</span> NextSetBit(<span class="keywordtype">long</span> index)</div> |
| <div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  {</div> |
| <div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="keywordtype">int</span> i = (int) (index >> 6);</div> |
| <div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keywordflow">if</span> (i >= wlen)</div> |
| <div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="keywordflow">return</span> - 1;</div> |
| <div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keywordtype">int</span> subIndex = (int) index & 0x3f; <span class="comment">// index within the word</span></div> |
| <div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keywordtype">long</span> word = (long) ((ulong) internalbits[i] >> subIndex); <span class="comment">// skip all the bits to the right of index</span></div> |
| <div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  </div> |
| <div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="keywordflow">if</span> (word != 0)</div> |
| <div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  {</div> |
| <div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keywordflow">return</span> (((<span class="keywordtype">long</span>) i) << 6) + (subIndex + <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html" title="A variety of high efficiencly bit twiddling routines.">BitUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html#abccb54437f5f26909ffe2fc0621f3e65" title="Returns number of trailing zeros in a 64 bit long value. ">Ntz</a>(word));</div> |
| <div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  }</div> |
| <div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  </div> |
| <div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keywordflow">while</span> (++i < wlen)</div> |
| <div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  {</div> |
| <div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  word = internalbits[i];</div> |
| <div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keywordflow">if</span> (word != 0)</div> |
| <div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keywordflow">return</span> (((<span class="keywordtype">long</span>) i) << 6) + <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html" title="A variety of high efficiencly bit twiddling routines.">BitUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_bit_util.html#abccb54437f5f26909ffe2fc0621f3e65" title="Returns number of trailing zeros in a 64 bit long value. ">Ntz</a>(word);</div> |
| <div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  }</div> |
| <div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  </div> |
| <div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keywordflow">return</span> - 1;</div> |
| <div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  }</div> |
| <div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  </div> |
| <div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  </div> |
| <div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  </div> |
| <div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  </div> |
| <div class="line"><a name="l00729"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a4c371191561566d0595c5265aa393c0a"> 729</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> System.Object Clone()</div> |
| <div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  {</div> |
| <div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keywordflow">try</span></div> |
| <div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  {</div> |
| <div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> obs = <span class="keyword">new</span> <a class="code" href="_field_cache_terms_filter_8cs.html#a39e4630d91e4f7fc118eb51aa4d221a0">OpenBitSet</a>((<span class="keywordtype">long</span>[]) internalbits.Clone(), wlen);</div> |
| <div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <span class="comment">//obs.bits = new long[obs.bits.Length];</span></div> |
| <div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="comment">//obs.bits.CopyTo(obs.bits, 0); // hopefully an array clone is as fast(er) than arraycopy</span></div> |
| <div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keywordflow">return</span> obs;</div> |
| <div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  }</div> |
| <div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="keywordflow">catch</span> (System.Exception e)</div> |
| <div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  {</div> |
| <div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keywordflow">throw</span> <span class="keyword">new</span> System.SystemException(e.Message, e);</div> |
| <div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  }</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="l00745"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a30fc475a258be869ed655992e148138b"> 745</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> Intersect(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> other)</div> |
| <div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  {</div> |
| <div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keywordtype">int</span> newLen = System.Math.Min(this.wlen, other.wlen);</div> |
| <div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keywordtype">long</span>[] thisArr = this.internalbits;</div> |
| <div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keywordtype">long</span>[] otherArr = other.internalbits;</div> |
| <div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="comment">// testing against zero can be more efficient</span></div> |
| <div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keywordtype">int</span> pos = newLen;</div> |
| <div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keywordflow">while</span> (--pos >= 0)</div> |
| <div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  {</div> |
| <div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  thisArr[pos] &= otherArr[pos];</div> |
| <div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  }</div> |
| <div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="keywordflow">if</span> (this.wlen > newLen)</div> |
| <div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  {</div> |
| <div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="comment">// fill zeros from the new shorter length to the old length</span></div> |
| <div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = newLen; i < this.wlen; i++)</div> |
| <div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  internalbits[i] = 0L;</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>  this.wlen = newLen;</div> |
| <div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  }</div> |
| <div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  </div> |
| <div class="line"><a name="l00766"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a86957644b2b4e03105e83df169b266c9"> 766</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> Union(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> other)</div> |
| <div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  {</div> |
| <div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="keywordtype">int</span> newLen = System.Math.Max(wlen, other.wlen);</div> |
| <div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  EnsureCapacityWords(newLen);</div> |
| <div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  </div> |
| <div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="keywordtype">long</span>[] thisArr = this.internalbits;</div> |
| <div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <span class="keywordtype">long</span>[] otherArr = other.internalbits;</div> |
| <div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="keywordtype">int</span> pos = System.Math.Min(wlen, other.wlen);</div> |
| <div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keywordflow">while</span> (--pos >= 0)</div> |
| <div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  {</div> |
| <div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  thisArr[pos] |= otherArr[pos];</div> |
| <div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  }</div> |
| <div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="keywordflow">if</span> (this.wlen < newLen)</div> |
| <div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  {</div> |
| <div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  Array.Copy(otherArr, this.wlen, thisArr, this.wlen, newLen - this.wlen);</div> |
| <div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  }</div> |
| <div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  this.wlen = newLen;</div> |
| <div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  }</div> |
| <div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  </div> |
| <div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  </div> |
| <div class="line"><a name="l00787"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a6227709fd3b5042f311acfed45defa65"> 787</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> Remove(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> other)</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>  <span class="keywordtype">int</span> idx = System.Math.Min(wlen, other.wlen);</div> |
| <div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keywordtype">long</span>[] thisArr = this.internalbits;</div> |
| <div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="keywordtype">long</span>[] otherArr = other.internalbits;</div> |
| <div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keywordflow">while</span> (--idx >= 0)</div> |
| <div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  {</div> |
| <div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  thisArr[idx] &= ~ otherArr[idx];</div> |
| <div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  }</div> |
| <div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  }</div> |
| <div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  </div> |
| <div class="line"><a name="l00799"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a5fe53c09f9673afb4036d05ef9298c8d"> 799</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> Xor(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> other)</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>  <span class="keywordtype">int</span> newLen = System.Math.Max(wlen, other.wlen);</div> |
| <div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  EnsureCapacityWords(newLen);</div> |
| <div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  </div> |
| <div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordtype">long</span>[] thisArr = this.internalbits;</div> |
| <div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="keywordtype">long</span>[] otherArr = other.internalbits;</div> |
| <div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="keywordtype">int</span> pos = System.Math.Min(wlen, other.wlen);</div> |
| <div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="keywordflow">while</span> (--pos >= 0)</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>  thisArr[pos] ^= otherArr[pos];</div> |
| <div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  }</div> |
| <div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="keywordflow">if</span> (this.wlen < newLen)</div> |
| <div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  {</div> |
| <div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  Array.Copy(otherArr, this.wlen, thisArr, this.wlen, newLen - this.wlen);</div> |
| <div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  }</div> |
| <div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  this.wlen = newLen;</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>  </div> |
| <div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="comment">// some BitSet compatability methods</span></div> |
| <div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  </div> |
| <div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="comment">//* see <see cref="intersect" /> */</span></div> |
| <div class="line"><a name="l00822"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a6fdeb324fef4eec0c3801968b67f42a8"> 822</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> And(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> other)</div> |
| <div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  {</div> |
| <div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  Intersect(other);</div> |
| <div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  }</div> |
| <div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  </div> |
| <div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="comment">//* see <see cref="union" /> */</span></div> |
| <div class="line"><a name="l00828"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#ac1796923673f129f923bcb2a8c8324d8"> 828</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> Or(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> other)</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>  Union(other);</div> |
| <div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  }</div> |
| <div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  </div> |
| <div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="comment">//* see <see cref="andNot" /> */</span></div> |
| <div class="line"><a name="l00834"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a4719489a3e616544713c7abe2a7010bf"> 834</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> AndNot(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> other)</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>  Remove(other);</div> |
| <div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  }</div> |
| <div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  </div> |
| <div class="line"><a name="l00840"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a6eefd0dba97f9e83d02204a7c70cd6cd"> 840</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> Intersects(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a> other)</div> |
| <div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  {</div> |
| <div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keywordtype">int</span> pos = System.Math.Min(this.wlen, other.wlen);</div> |
| <div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keywordtype">long</span>[] thisArr = this.internalbits;</div> |
| <div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keywordtype">long</span>[] otherArr = other.internalbits;</div> |
| <div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keywordflow">while</span> (--pos >= 0)</div> |
| <div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  {</div> |
| <div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <span class="keywordflow">if</span> ((thisArr[pos] & otherArr[pos]) != 0)</div> |
| <div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  }</div> |
| <div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  }</div> |
| <div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  </div> |
| <div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  </div> |
| <div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  </div> |
| <div class="line"><a name="l00858"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a8530166d7f5d5d77b4405860b501b35d"> 858</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> EnsureCapacityWords(<span class="keywordtype">int</span> numWords)</div> |
| <div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  {</div> |
| <div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="keywordflow">if</span> (internalbits.Length < numWords)</div> |
| <div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  {</div> |
| <div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  internalbits = <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_array_util.html" title="Methods for manipulating arrays.">ArrayUtil</a>.<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_array_util.html#aacb27c72ceac2461bd7f93ede0837cf5">Grow</a>(internalbits, numWords);</div> |
| <div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  }</div> |
| <div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  }</div> |
| <div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  </div> |
| <div class="line"><a name="l00869"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#ad720e69c14445d8d5ee6b7203ef8c649"> 869</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> EnsureCapacity(<span class="keywordtype">long</span> numBits)</div> |
| <div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  {</div> |
| <div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  EnsureCapacityWords(Bits2words(numBits));</div> |
| <div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  }</div> |
| <div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  </div> |
| <div class="line"><a name="l00877"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#ac78156ed94f242ae6712e6acc4621e46"> 877</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> TrimTrailingZeros()</div> |
| <div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  {</div> |
| <div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="keywordtype">int</span> idx = wlen - 1;</div> |
| <div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keywordflow">while</span> (idx >= 0 && internalbits[idx] == 0)</div> |
| <div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  idx--;</div> |
| <div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  wlen = idx + 1;</div> |
| <div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  }</div> |
| <div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  </div> |
| <div class="line"><a name="l00886"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a47ae918510f9b8c49d0b01e77ada5f43"> 886</a></span>  <span class="keyword">public</span> <span class="keyword">static</span> <span class="keywordtype">int</span> Bits2words(<span class="keywordtype">long</span> numBits)</div> |
| <div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  {</div> |
| <div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keywordflow">return</span> (<span class="keywordtype">int</span>) ((((numBits - 1) >> 6)) + 1);</div> |
| <div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  }</div> |
| <div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  </div> |
| <div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  </div> |
| <div class="line"><a name="l00893"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a234e0ba7994718443f52037c4970d7ac"> 893</a></span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">bool</span> Equals(System.Object o)</div> |
| <div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  {</div> |
| <div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="keywordflow">if</span> (<span class="keyword">this</span> == o)</div> |
| <div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keywordflow">if</span> (!(o is <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html" title="An "open" BitSet implementation that allows direct access to the array of words storing the bits...">OpenBitSet</a>))</div> |
| <div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  OpenBitSet a;</div> |
| <div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  OpenBitSet b = (<a class="code" href="_field_cache_terms_filter_8cs.html#a39e4630d91e4f7fc118eb51aa4d221a0">OpenBitSet</a>) o;</div> |
| <div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="comment">// make a the larger set.</span></div> |
| <div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="keywordflow">if</span> (b.wlen > <span class="keyword">this</span>.wlen)</div> |
| <div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  {</div> |
| <div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  a = b; b = <span class="keyword">this</span>;</div> |
| <div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  }</div> |
| <div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  {</div> |
| <div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  a = <span class="keyword">this</span>;</div> |
| <div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  }</div> |
| <div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  </div> |
| <div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="comment">// check for any set bits out of the range of b</span></div> |
| <div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = a.wlen - 1; i >= b.wlen; i--)</div> |
| <div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  {</div> |
| <div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keywordflow">if</span> (a.internalbits[i] != 0)</div> |
| <div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  }</div> |
| <div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  </div> |
| <div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = b.wlen - 1; i >= 0; i--)</div> |
| <div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  {</div> |
| <div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="keywordflow">if</span> (a.internalbits[i] != b.internalbits[i])</div> |
| <div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  }</div> |
| <div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  </div> |
| <div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  }</div> |
| <div class="line"><a name="l00926"></a><span class="lineno"> 926</span> </div> |
| <div class="line"><a name="l00927"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_open_bit_set.html#a39ed1b044e52819b6367372e013972c0"> 927</a></span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">int</span> GetHashCode()</div> |
| <div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  {</div> |
| <div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  <span class="comment">// Start with a zero hash and use a mix that results in zero if the input is zero.</span></div> |
| <div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="comment">// This effectively truncates trailing zeros without an explicit check.</span></div> |
| <div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="keywordtype">long</span> h = 0;</div> |
| <div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = internalbits.Length; --i >= 0; )</div> |
| <div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  {</div> |
| <div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  h ^= internalbits[i];</div> |
| <div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  h = (h << 1) | (<a class="code" href="class_lucene_1_1_net_1_1_support_1_1_number.html" title="A simple class for number conversions. ">Number</a>.<a class="code" href="class_lucene_1_1_net_1_1_support_1_1_number.html#aafe44e2acf7feacad6abd2a425730644" title="Performs an unsigned bitwise right shift with the specified number ">URShift</a>(h, 63)); <span class="comment">// rotate left</span></div> |
| <div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  }</div> |
| <div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="comment">// fold leftmost bits into right and add a constant to prevent</span></div> |
| <div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="comment">// empty sets from returning 0, which is too common.</span></div> |
| <div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="keywordflow">return</span> (<span class="keywordtype">int</span>)(((h >> 32) ^ h) + 0x98761234);</div> |
| <div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  }</div> |
| <div class="line"><a name="l00941"></a><span class="lineno"> 941</span> </div> |
| <div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  </div> |
| <div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  }</div> |
| <div class="line"><a name="l00944"></a><span class="lineno"> 944</span> }</div> |
| </div><!-- fragment --></div><!-- contents --> |
| <!-- start footer part --> |
| <hr class="footer"/><address class="footer"><small> |
| Generated on Thu Jan 3 2013 02:12:46 for Lucene.Net by  <a href="http://www.doxygen.org/index.html"> |
| <img class="footer" src="doxygen.png" alt="doxygen"/> |
| </a> 1.8.3 |
| </small></address> |
| </body> |
| </html> |
