Google Git
Sign in
apache / lucenenet-site / b7932cab2a602cd78b928b7dd2376969de9ab8e2 / . / docs / 3.0.3 / _scorer_doc_queue_8cs_source.html
blob: 0ba2d99a26fd2dc6ca8c1bcbc8d0da92b2ee5e6d [file] [log] [blame]
<!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/ScorerDocQueue.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
&#160;<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&#160;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&#160;List</span></a></li>
<li><a href="globals.html"><span>File&#160;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">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</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">ScorerDocQueue.cs</div> </div>
</div><!--header-->
<div class="contents">
<a href="_scorer_doc_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>&#160;<span class="comment">/* </span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<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>&#160;<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>&#160;<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>&#160;<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>&#160;<span class="comment"> * (the &quot;License&quot;); you may not use this file except in compliance with</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160;<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>&#160;<span class="comment"> * </span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span>&#160;<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>&#160;<span class="comment"> * </span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>&#160;<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>&#160;<span class="comment"> * distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;<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>&#160;<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>&#160;<span class="comment"> * limitations under the License.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;</div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;</div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="comment">/* Derived from Lucene.Net.Util.PriorityQueue of March 2005 */</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="keyword">using</span> System;</div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="keyword">using</span> Lucene.Net.Support;</div>
<div class="line"><a name="l00022"></a><span class="lineno"><a class="code" href="_scorer_doc_queue_8cs.html#adbba0575d48e29661f658fa4071fde4f"> 22</a></span>&#160;<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="l00023"></a><span class="lineno"><a class="code" href="_scorer_doc_queue_8cs.html#a83f1a9bf052559c9fc4b5dc2c3d490f1"> 23</a></span>&#160;<span class="keyword">using</span> <a class="code" href="_documents_writer_8cs.html#a83f1a9bf052559c9fc4b5dc2c3d490f1">Scorer</a> = Lucene.Net.Search.Scorer;</div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;</div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;<span class="keyword">namespace </span>Lucene.Net.Util</div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160;{</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160; </div>
<div class="line"><a name="l00032"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html"> 32</a></span>&#160; <span class="keyword">public</span> <span class="keyword">class </span><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html" title="A ScorerDocQueue maintains a partial ordering of its Scorers such that the least Scorer can always be...">ScorerDocQueue</a></div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160; {</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; <span class="comment">// later: SpansQueue for spans with doc and term positions</span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; <span class="keyword">private</span> HeapedScorerDoc[] heap;</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; <span class="keyword">private</span> <span class="keywordtype">int</span> maxSize;</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; <span class="keyword">private</span> <span class="keywordtype">int</span> size;</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; </div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; <span class="keyword">private</span> <span class="keyword">class </span>HeapedScorerDoc</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; {</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; <span class="keyword">private</span> <span class="keywordtype">void</span> InitBlock(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html" title="A ScorerDocQueue maintains a partial ordering of its Scorers such that the least Scorer can always be...">ScorerDocQueue</a> enclosingInstance)</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; {</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; this.enclosingInstance = enclosingInstance;</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; }</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; <span class="keyword">private</span> <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html" title="A ScorerDocQueue maintains a partial ordering of its Scorers such that the least Scorer can always be...">ScorerDocQueue</a> enclosingInstance;</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="keyword">public</span> <a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html" title="A ScorerDocQueue maintains a partial ordering of its Scorers such that the least Scorer can always be...">ScorerDocQueue</a> Enclosing_Instance</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; {</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <span class="keyword">get</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; {</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="keywordflow">return</span> enclosingInstance;</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; }</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; </div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; }</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="keyword">internal</span> <a class="code" href="_documents_writer_8cs.html#a83f1a9bf052559c9fc4b5dc2c3d490f1">Scorer</a> scorer;</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; <span class="keyword">internal</span> <span class="keywordtype">int</span> doc;</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; </div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="keyword">internal</span> HeapedScorerDoc(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html" title="A ScorerDocQueue maintains a partial ordering of its Scorers such that the least Scorer can always be...">ScorerDocQueue</a> enclosingInstance, <a class="code" href="_documents_writer_8cs.html#a83f1a9bf052559c9fc4b5dc2c3d490f1">Scorer</a> s):<span class="keyword">this</span>(enclosingInstance, s, s.DocID())</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; {</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; }</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; </div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <span class="keyword">internal</span> HeapedScorerDoc(<a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html" title="A ScorerDocQueue maintains a partial ordering of its Scorers such that the least Scorer can always be...">ScorerDocQueue</a> enclosingInstance, <a class="code" href="_documents_writer_8cs.html#a83f1a9bf052559c9fc4b5dc2c3d490f1">Scorer</a> scorer, <span class="keywordtype">int</span> doc)</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; {</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; InitBlock(enclosingInstance);</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; this.scorer = scorer;</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; this.doc = doc;</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; }</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; </div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; <span class="keyword">internal</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> Adjust()</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; {</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; doc = scorer.DocID();</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; }</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; }</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; </div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <span class="keyword">private</span> HeapedScorerDoc topHSD; <span class="comment">// same as heap[1], only for speed</span></div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; </div>
<div class="line"><a name="l00077"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html#acbd8af47d7006901c82727b7a828ac09"> 77</a></span>&#160; <span class="keyword">public</span> <a class="code" href="_disjunction_sum_scorer_8cs.html#ae81422266e9445b60fdebc20a7af6825">ScorerDocQueue</a>(<span class="keywordtype">int</span> maxSize)</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; {</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <span class="comment">// assert maxSize &gt;= 0;</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; size = 0;</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <span class="keywordtype">int</span> heapSize = maxSize + 1;</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; heap = <span class="keyword">new</span> HeapedScorerDoc[heapSize];</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; this.maxSize = maxSize;</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; topHSD = heap[1]; <span class="comment">// initially null</span></div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; }</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; </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_scorer_doc_queue.html#a25bb29c2dc500e738c78ae512433aad3"> 91</a></span>&#160; <span class="keyword">public</span> <span class="keywordtype">void</span> Put(<a class="code" href="_documents_writer_8cs.html#a83f1a9bf052559c9fc4b5dc2c3d490f1">Scorer</a> scorer)</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; {</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; size++;</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; heap[size] = <span class="keyword">new</span> HeapedScorerDoc(<span class="keyword">this</span>, scorer);</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; UpHeap();</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; }</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; </div>
<div class="line"><a name="l00105"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html#a1d529f72857e7a0c7250ebb709fb4b1b"> 105</a></span>&#160; <span class="keyword">public</span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> Insert(<a class="code" href="_documents_writer_8cs.html#a83f1a9bf052559c9fc4b5dc2c3d490f1">Scorer</a> scorer)</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; {</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; <span class="keywordflow">if</span> (size &lt; maxSize)</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; {</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; Put(scorer);</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; }</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; {</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; <span class="keywordtype">int</span> docNr = scorer.DocID();</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <span class="keywordflow">if</span> ((size &gt; 0) &amp;&amp; (!(docNr &lt; topHSD.doc)))</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; {</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; <span class="comment">// heap[1] is top()</span></div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; heap[1] = <span class="keyword">new</span> HeapedScorerDoc(<span class="keyword">this</span>, scorer, docNr);</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; DownHeap();</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; }</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; {</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; }</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; }</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; }</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; </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_scorer_doc_queue.html#a9bd04f65174ee7d0078fa65f16838d86"> 132</a></span>&#160; <span class="keyword">public</span> <a class="code" href="_documents_writer_8cs.html#a83f1a9bf052559c9fc4b5dc2c3d490f1">Scorer</a> Top()</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; {</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; <span class="comment">// assert size &gt; 0;</span></div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; <span class="keywordflow">return</span> topHSD.scorer;</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; }</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; </div>
<div class="line"><a name="l00142"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html#acc36f640b01b12504023e90ca2d4d9e2"> 142</a></span>&#160; <span class="keyword">public</span> <span class="keywordtype">int</span> TopDoc()</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; {</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160; <span class="comment">// assert size &gt; 0;</span></div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; <span class="keywordflow">return</span> topHSD.doc;</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; }</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; </div>
<div class="line"><a name="l00148"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html#a367c8f71c1e6c18061e899c23883230c"> 148</a></span>&#160; <span class="keyword">public</span> <span class="keywordtype">float</span> TopScore()</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160; {</div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160; <span class="comment">// assert size &gt; 0;</span></div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>&#160; <span class="keywordflow">return</span> topHSD.scorer.Score();</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; }</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; </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_scorer_doc_queue.html#a1f1401cee22d5c402c76da59828ac19c"> 154</a></span>&#160; <span class="keyword">public</span> <span class="keywordtype">bool</span> TopNextAndAdjustElsePop()</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; {</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160; <span class="keywordflow">return</span> CheckAdjustElsePop(topHSD.scorer.NextDoc() != <a class="code" href="_doc_id_bit_set_8cs.html#adbba0575d48e29661f658fa4071fde4f">DocIdSetIterator</a>.NO_MORE_DOCS);</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160; }</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160; </div>
<div class="line"><a name="l00159"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html#ab3e05ac7fc00bea57f76b2009534fed5"> 159</a></span>&#160; <span class="keyword">public</span> <span class="keywordtype">bool</span> TopSkipToAndAdjustElsePop(<span class="keywordtype">int</span> target)</div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160; {</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160; <span class="keywordflow">return</span> CheckAdjustElsePop(topHSD.scorer.Advance(target) != <a class="code" href="_doc_id_bit_set_8cs.html#adbba0575d48e29661f658fa4071fde4f">DocIdSetIterator</a>.NO_MORE_DOCS);</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; }</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; </div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; <span class="keyword">private</span> <span class="keywordtype">bool</span> CheckAdjustElsePop(<span class="keywordtype">bool</span> cond)</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; {</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160; <span class="keywordflow">if</span> (cond)</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160; {</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160; <span class="comment">// see also adjustTop</span></div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160; topHSD.doc = topHSD.scorer.DocID();</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>&#160; }</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160; {</div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>&#160; <span class="comment">// see also popNoResult</span></div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160; heap[1] = heap[size]; <span class="comment">// move last to first</span></div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160; heap[size] = null;</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160; size--;</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; }</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; DownHeap();</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; <span class="keywordflow">return</span> cond;</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; }</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160; </div>
<div class="line"><a name="l00186"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html#a45de7cf1962902f20aabddff4588632b"> 186</a></span>&#160; <span class="keyword">public</span> <a class="code" href="_documents_writer_8cs.html#a83f1a9bf052559c9fc4b5dc2c3d490f1">Scorer</a> Pop()</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>&#160; {</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; <span class="comment">// assert size &gt; 0;</span></div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; <a class="code" href="_documents_writer_8cs.html#a83f1a9bf052559c9fc4b5dc2c3d490f1">Scorer</a> result = topHSD.scorer;</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; PopNoResult();</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; <span class="keywordflow">return</span> result;</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; }</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; </div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; <span class="keyword">private</span> <span class="keywordtype">void</span> PopNoResult()</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; {</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; heap[1] = heap[size]; <span class="comment">// move last to first</span></div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; heap[size] = null;</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160; size--;</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160; DownHeap(); <span class="comment">// adjust heap</span></div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160; }</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160; </div>
<div class="line"><a name="l00212"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html#a682224bb8458c3ad5265c255399389d8"> 212</a></span>&#160; <span class="keyword">public</span> <span class="keywordtype">void</span> AdjustTop()</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; {</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; <span class="comment">// assert size &gt; 0;</span></div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160; topHSD.Adjust();</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; DownHeap();</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; }</div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160; </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_scorer_doc_queue.html#a2c91a012971ee063125d4669347971e4"> 220</a></span>&#160; <span class="keyword">public</span> <span class="keywordtype">int</span> Size()</div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160; {</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160; <span class="keywordflow">return</span> size;</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160; }</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160; </div>
<div class="line"><a name="l00226"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_util_1_1_scorer_doc_queue.html#a8d2172b2926ab51b690b83cf23015b32"> 226</a></span>&#160; <span class="keyword">public</span> <span class="keywordtype">void</span> Clear()</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; {</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= size; i++)</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160; {</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; heap[i] = null;</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160; }</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160; size = 0;</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; }</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; </div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; <span class="keyword">private</span> <span class="keywordtype">void</span> UpHeap()</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; {</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160; <span class="keywordtype">int</span> i = size;</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160; HeapedScorerDoc node = heap[i]; <span class="comment">// save bottom node</span></div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160; <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="l00240"></a><span class="lineno"> 240</span>&#160; <span class="keywordflow">while</span> ((j &gt; 0) &amp;&amp; (node.doc &lt; heap[j].doc))</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160; {</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160; heap[i] = heap[j]; <span class="comment">// shift parents down</span></div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; i = j;</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160; 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="l00245"></a><span class="lineno"> 245</span>&#160; }</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160; heap[i] = node; <span class="comment">// install saved node</span></div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160; topHSD = heap[1];</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160; }</div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160; </div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160; <span class="keyword">private</span> <span class="keywordtype">void</span> DownHeap()</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160; {</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160; <span class="keywordtype">int</span> i = 1;</div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>&#160; HeapedScorerDoc node = heap[i]; <span class="comment">// save top node</span></div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>&#160; <span class="keywordtype">int</span> j = i &lt;&lt; 1; <span class="comment">// find smaller child</span></div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>&#160; <span class="keywordtype">int</span> k = j + 1;</div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>&#160; <span class="keywordflow">if</span> ((k &lt;= size) &amp;&amp; (heap[k].doc &lt; heap[j].doc))</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>&#160; {</div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>&#160; j = k;</div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160; }</div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>&#160; <span class="keywordflow">while</span> ((j &lt;= size) &amp;&amp; (heap[j].doc &lt; node.doc))</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160; {</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>&#160; heap[i] = heap[j]; <span class="comment">// shift up child</span></div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160; i = j;</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160; j = i &lt;&lt; 1;</div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160; k = j + 1;</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160; <span class="keywordflow">if</span> (k &lt;= size &amp;&amp; (heap[k].doc &lt; heap[j].doc))</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160; {</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; j = k;</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160; }</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160; }</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160; heap[i] = node; <span class="comment">// install saved node</span></div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; topHSD = heap[1];</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160; }</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; }</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160;}</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 &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.3
</small></address>
</body>
</html>