| <!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/PriorityQueue.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">PriorityQueue.cs</div> </div> |
| </div><!--header--> |
| <div class="contents"> |
| <a href="_priority_queue_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"> 20</span> </div> |
| <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="keyword">namespace </span>Lucene.Net.Util</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>  </div> |
| <div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="comment">// TODO: T needs to be able to return null. Behavior might be unexpected otherwise, since it returns default(T)</span></div> |
| <div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="comment">// I only see a non-nullable type used in PriorityQueue in the tests. may be possible to re-write tests to</span></div> |
| <div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">// use an IComparable class, and this can be changed back to constraining on class, to return null, or should</span></div> |
| <div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="comment">// we leave as is?</span></div> |
| <div class="line"><a name="l00036"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_priority_queue_3_01_t_01_4.html"> 36</a></span>  <span class="keyword">public</span> <span class="keyword">abstract</span> <span class="keyword">class </span><a class="code" href="namespace_spell_checker_1_1_net_1_1_search_1_1_spell.html#a050da50134c60f7d9891255871a07fc1">PriorityQueue</a><T> <span class="comment">//where T : class</span></div> |
| <div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  {</div> |
| <div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keyword">private</span> <span class="keywordtype">int</span> size;</div> |
| <div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keyword">private</span> <span class="keywordtype">int</span> maxSize;</div> |
| <div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keyword">protected</span> <span class="keyword">internal</span> T[] heap;</div> |
| <div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  </div> |
| <div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keyword">public</span> <span class="keyword">abstract</span> <span class="keywordtype">bool</span> LessThan(T a, T b);</div> |
| <div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </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="keyword">virtual</span> T SentinelObject</div> |
| <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  {</div> |
| <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">get</span> { <span class="keywordflow">return</span> <span class="keywordflow">default</span>(T); }</div> |
| <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  }</div> |
| <div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div> |
| <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">protected</span> <span class="keyword">internal</span> <span class="keywordtype">void</span> Initialize(<span class="keywordtype">int</span> maxSize)</div> |
| <div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  {</div> |
| <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  size = 0;</div> |
| <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordtype">int</span> heapSize;</div> |
| <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">if</span> (0 == maxSize)</div> |
| <div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// We allocate 1 extra to avoid if statement in top()</span></div> |
| <div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  heapSize = 2;</div> |
| <div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">else</span></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>  <span class="keywordflow">if</span> (maxSize == Int32.MaxValue)</div> |
| <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  {</div> |
| <div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// Don't wrap heapSize to -1, in this case, which</span></div> |
| <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// causes a confusing NegativeArraySizeException.</span></div> |
| <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// Note that very likely this will simply then hit</span></div> |
| <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// an OOME, but at least that's more indicative to</span></div> |
| <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// caller that this values is too big. We don't +1</span></div> |
| <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// in this case, but it's very unlikely in practice</span></div> |
| <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// one will actually insert this many objects into</span></div> |
| <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// the PQ:</span></div> |
| <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  heapSize = Int32.MaxValue;</div> |
| <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  }</div> |
| <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  {</div> |
| <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">// NOTE: we add +1 because all access to heap is</span></div> |
| <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">// 1-based not 0-based. heap[0] is unused.</span></div> |
| <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  heapSize = maxSize + 1;</div> |
| <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  }</div> |
| <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  }</div> |
| <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  heap = <span class="keyword">new</span> T[heapSize];</div> |
| <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  this.maxSize = maxSize;</div> |
| <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  </div> |
| <div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="comment">// If sentinel objects are supported, populate the queue with them</span></div> |
| <div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  T sentinel = SentinelObject;</div> |
| <div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">if</span> (sentinel != null)</div> |
| <div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  {</div> |
| <div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  heap[1] = sentinel;</div> |
| <div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i < heap.Length; i++)</div> |
| <div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  {</div> |
| <div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  heap[i] = SentinelObject;</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>  size = maxSize;</div> |
| <div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  }</div> |
| <div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  }</div> |
| <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  </div> |
| <div class="line"><a name="l00141"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_priority_queue_3_01_t_01_4.html#a8eb5aea54d9933b046b24e4479d1dafd"> 141</a></span>  <span class="keyword">public</span> T Add(T element)</div> |
| <div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  {</div> |
| <div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  size++;</div> |
| <div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  heap[size] = element;</div> |
| <div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  UpHeap();</div> |
| <div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">return</span> heap[1];</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> </div> |
| <div class="line"><a name="l00158"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_priority_queue_3_01_t_01_4.html#ac8324416bbd0427bf908b8f2297a99c1"> 158</a></span>  <span class="keyword">public</span> <span class="keyword">virtual</span> T InsertWithOverflow(T element)</div> |
| <div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  {</div> |
| <div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">if</span> (size < maxSize)</div> |
| <div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  {</div> |
| <div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  Add(element);</div> |
| <div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">return</span> <span class="keywordflow">default</span>(T);</div> |
| <div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div> |
| <div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size > 0 && !LessThan(element, heap[1]))</div> |
| <div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  {</div> |
| <div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  T ret = heap[1];</div> |
| <div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  heap[1] = element;</div> |
| <div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  UpdateTop();</div> |
| <div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">return</span> ret;</div> |
| <div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div> |
| <div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  {</div> |
| <div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">return</span> element;</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>  }</div> |
| <div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div> |
| <div class="line"><a name="l00179"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_priority_queue_3_01_t_01_4.html#ab5ac87f7d0cd6aab82de9921af5e18e4"> 179</a></span>  <span class="keyword">public</span> T Top()</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>  <span class="comment">// We don't need to check size here: if maxSize is 0,</span></div> |
| <div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// then heap is length 2 array with both entries null.</span></div> |
| <div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// If size is 0 then heap[1] is already null.</span></div> |
| <div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">return</span> heap[1];</div> |
| <div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  }</div> |
| <div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  </div> |
| <div class="line"><a name="l00191"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_priority_queue_3_01_t_01_4.html#adf887603a88dab648d510e7e786d5423"> 191</a></span>  <span class="keyword">public</span> T Pop()</div> |
| <div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  {</div> |
| <div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">if</span> (size > 0)</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>  T result = heap[1]; <span class="comment">// save first value</span></div> |
| <div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  heap[1] = heap[size]; <span class="comment">// move last to first</span></div> |
| <div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  heap[size] = <span class="keywordflow">default</span>(T); <span class="comment">// permit GC of objects</span></div> |
| <div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  size--;</div> |
| <div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  DownHeap(); <span class="comment">// adjust heap</span></div> |
| <div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">return</span> result;</div> |
| <div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div> |
| <div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">return</span> <span class="keywordflow">default</span>(T);</div> |
| <div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  }</div> |
| <div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  </div> |
| <div class="line"><a name="l00220"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_priority_queue_3_01_t_01_4.html#a0a65ae316adbab3e7fb6bb58252b7a2a"> 220</a></span>  <span class="keyword">public</span> T UpdateTop()</div> |
| <div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  {</div> |
| <div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  DownHeap();</div> |
| <div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">return</span> heap[1];</div> |
| <div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div> |
| <div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  </div> |
| <div class="line"><a name="l00227"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_priority_queue_3_01_t_01_4.html#adce7118eba5559440cd7f26f686836d2"> 227</a></span>  <span class="keyword">public</span> <span class="keywordtype">int</span> Size()</div> |
| <div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  {</div> |
| <div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">return</span> size;</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="l00233"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_priority_queue_3_01_t_01_4.html#acaf0ddb271f95028ebb0363eb90397cb"> 233</a></span>  <span class="keyword">public</span> <span class="keywordtype">void</span> Clear()</div> |
| <div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  {</div> |
| <div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i <= size; i++)</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>  heap[i] = <span class="keywordflow">default</span>(T);</div> |
| <div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  }</div> |
| <div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  size = 0;</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>  <span class="keyword">private</span> <span class="keywordtype">void</span> UpHeap()</div> |
| <div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  {</div> |
| <div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordtype">int</span> i = size;</div> |
| <div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  T node = heap[i]; <span class="comment">// save bottom node</span></div> |
| <div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordtype">int</span> j = <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>(i, 1);</div> |
| <div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">while</span> (j > 0 && LessThan(node, heap[j]))</div> |
| <div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  {</div> |
| <div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  heap[i] = heap[j]; <span class="comment">// shift parents down</span></div> |
| <div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  i = j;</div> |
| <div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  j = <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>(j, 1);</div> |
| <div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  }</div> |
| <div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  heap[i] = node; <span class="comment">// install saved node</span></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>  </div> |
| <div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keyword">private</span> <span class="keywordtype">void</span> DownHeap()</div> |
| <div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  {</div> |
| <div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordtype">int</span> i = 1;</div> |
| <div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  T node = heap[i]; <span class="comment">// save top node</span></div> |
| <div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordtype">int</span> j = i << 1; <span class="comment">// find smaller child</span></div> |
| <div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordtype">int</span> k = j + 1;</div> |
| <div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">if</span> (k <= size && LessThan(heap[k], heap[j]))</div> |
| <div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  {</div> |
| <div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  j = k;</div> |
| <div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  }</div> |
| <div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">while</span> (j <= size && LessThan(heap[j], node))</div> |
| <div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  {</div> |
| <div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  heap[i] = heap[j]; <span class="comment">// shift up child</span></div> |
| <div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  i = j;</div> |
| <div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  j = i << 1;</div> |
| <div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  k = j + 1;</div> |
| <div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordflow">if</span> (k <= size && LessThan(heap[k], heap[j]))</div> |
| <div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  {</div> |
| <div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  j = k;</div> |
| <div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  }</div> |
| <div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  }</div> |
| <div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  heap[i] = node; <span class="comment">// install saved node</span></div> |
| <div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  }</div> |
| <div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  }</div> |
| <div class="line"><a name="l00280"></a><span class="lineno"> 280</span> }</div> |
| </div><!-- 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> |
