| <!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/Search/TopFieldCollector.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_56f9b3c34a852b92179da152ee78b823.html">Search</a></li> </ul> |
| </div> |
| </div><!-- top --> |
| <div class="header"> |
| <div class="headertitle"> |
| <div class="title">TopFieldCollector.cs</div> </div> |
| </div><!--header--> |
| <div class="contents"> |
| <a href="_top_field_collector_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.Util;</div> |
| <div class="line"><a name="l00020"></a><span class="lineno"><a class="code" href="_top_field_collector_8cs.html#a2a6914ea10bbe06764856e29e5674e66"> 20</a></span> <span class="keyword">using</span> <a class="code" href="_more_like_this_8cs.html#a2a6914ea10bbe06764856e29e5674e66">IndexReader</a> = Lucene.Net.Index.IndexReader;</div> |
| <div class="line"><a name="l00021"></a><span class="lineno"><a class="code" href="_top_field_collector_8cs.html#ac2a1112fdb5c9e846a6178979c145dfa"> 21</a></span> <span class="keyword">using</span> <a class="code" href="_top_field_collector_8cs.html#ac2a1112fdb5c9e846a6178979c145dfa">Entry</a> = Lucene.Net.Search.FieldValueHitQueue.Entry;</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.Search</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="l00035"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_search_1_1_top_field_collector.html"> 35</a></span>  <span class="keyword">public</span> <span class="keyword">abstract</span> <span class="keyword">class </span><a class="code" href="class_lucene_1_1_net_1_1_search_1_1_top_field_collector.html" title="A Collector that sorts by SortField using FieldComparators. See the Create method for instantiating a...">TopFieldCollector</a> : TopDocsCollector<Entry></div> |
| <div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  {</div> |
| <div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="comment">// TODO: one optimization we could do is to pre-fill</span></div> |
| <div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="comment">// the queue with sentinel value that guaranteed to</span></div> |
| <div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="comment">// always compare lower than a real hit; this would</span></div> |
| <div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="comment">// save having to check queueFull on each insert</span></div> |
| <div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  </div> |
| <div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">//</span></div> |
| <div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="comment">// Implements a TopFieldCollector over one SortField criteria, without</span></div> |
| <div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="comment">// tracking document scores and maxScore.</span></div> |
| <div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">//</span></div> |
| <div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">private</span> <span class="keyword">class </span>OneComparatorNonScoringCollector : <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_top_field_collector.html" title="A Collector that sorts by SortField using FieldComparators. See the Create method for instantiating a...">TopFieldCollector</a></div> |
| <div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  {</div> |
| <div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">internal</span> <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_comparator.html" title="Expert: a FieldComparator compares hits so as to determine their sort order when collecting the top r...">FieldComparator</a> comparator;</div> |
| <div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keyword">internal</span> <span class="keywordtype">int</span> reverseMul;</div> |
| <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div> |
| <div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keyword">public</span> OneComparatorNonScoringCollector(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a> queue, <span class="keywordtype">int</span> numHits, <span class="keywordtype">bool</span> fillFields):base(queue, numHits, fillFields)</div> |
| <div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  {</div> |
| <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  comparator = queue.GetComparators()[0];</div> |
| <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  reverseMul = queue.GetReverseMul()[0];</div> |
| <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  }</div> |
| <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  </div> |
| <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">internal</span> <span class="keywordtype">void</span> UpdateBottom(<span class="keywordtype">int</span> doc)</div> |
| <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  {</div> |
| <div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">// bottom.score is already set to Float.NaN in add().</span></div> |
| <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  bottom.Doc = docBase + doc;</div> |
| <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  bottom = pq.UpdateTop();</div> |
| <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  }</div> |
| <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  </div> |
| <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> Collect(<span class="keywordtype">int</span> doc)</div> |
| <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  {</div> |
| <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  ++internalTotalHits;</div> |
| <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  {</div> |
| <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">if</span> ((reverseMul * comparator.CompareBottom(doc)) <= 0)</div> |
| <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  {</div> |
| <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// since docs are visited in doc Id order, if compare is 0, it means</span></div> |
| <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// this document is largest than anything else in the queue, and</span></div> |
| <div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// therefore not competitive.</span></div> |
| <div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  return ;</div> |
| <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  }</div> |
| <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  </div> |
| <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// This hit is competitive - replace bottom element in queue & adjustTop</span></div> |
| <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  comparator.Copy(bottom.slot, doc);</div> |
| <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  UpdateBottom(doc);</div> |
| <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  comparator.SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  }</div> |
| <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  {</div> |
| <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// Startup transient: queue hasn't gathered numHits yet</span></div> |
| <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">int</span> slot = internalTotalHits - 1;</div> |
| <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// Copy hit into queue</span></div> |
| <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  comparator.Copy(slot, doc);</div> |
| <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  Add(slot, doc, System.Single.NaN);</div> |
| <div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  {</div> |
| <div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  comparator.SetBottom(bottom.slot);</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>  }</div> |
| <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  }</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>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> SetNextReader(<a class="code" href="_more_like_this_8cs.html#a2a6914ea10bbe06764856e29e5674e66">IndexReader</a> reader, <span class="keywordtype">int</span> docBase)</div> |
| <div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  {</div> |
| <div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  this.docBase = docBase;</div> |
| <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  comparator.SetNextReader(reader, docBase);</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>  </div> |
| <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> SetScorer(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_scorer.html" title="Expert: Common scoring functionality for different types of queries.">Scorer</a> scorer)</div> |
| <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  {</div> |
| <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  comparator.SetScorer(scorer);</div> |
| <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div> |
| <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div> |
| <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  </div> |
| <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">//</span></div> |
| <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// Implements a TopFieldCollector over one SortField criteria, without</span></div> |
| <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">// tracking document scores and maxScore, and assumes out of orderness in doc</span></div> |
| <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">// Ids collection.</span></div> |
| <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">//</span></div> |
| <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">private</span> <span class="keyword">class </span>OutOfOrderOneComparatorNonScoringCollector:OneComparatorNonScoringCollector</div> |
| <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  {</div> |
| <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  </div> |
| <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">public</span> OutOfOrderOneComparatorNonScoringCollector(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a> queue, <span class="keywordtype">int</span> numHits, <span class="keywordtype">bool</span> fillFields):base(queue, numHits, fillFields)</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>  }</div> |
| <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  </div> |
| <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> Collect(<span class="keywordtype">int</span> doc)</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>  ++internalTotalHits;</div> |
| <div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">if</span> (queueFull)</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>  <span class="comment">// Fastmatch: return if this hit is not competitive</span></div> |
| <div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordtype">int</span> cmp = reverseMul * comparator.CompareBottom(doc);</div> |
| <div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">if</span> (cmp < 0 || (cmp == 0 && doc + docBase > bottom.Doc))</div> |
| <div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  {</div> |
| <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  return ;</div> |
| <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  }</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>  <span class="comment">// This hit is competitive - replace bottom element in queue & adjustTop</span></div> |
| <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  comparator.Copy(bottom.slot, doc);</div> |
| <div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  UpdateBottom(doc);</div> |
| <div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  comparator.SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div> |
| <div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  {</div> |
| <div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// Startup transient: queue hasn't gathered numHits yet</span></div> |
| <div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordtype">int</span> slot = internalTotalHits - 1;</div> |
| <div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// Copy hit into queue</span></div> |
| <div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  comparator.Copy(slot, doc);</div> |
| <div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  Add(slot, doc, System.Single.NaN);</div> |
| <div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  {</div> |
| <div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  comparator.SetBottom(bottom.slot);</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="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="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">bool</span> AcceptsDocsOutOfOrder</div> |
| <div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  {</div> |
| <div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">get</span> { <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div> |
| <div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  }</div> |
| <div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  }</div> |
| <div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  </div> |
| <div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">/*</span></div> |
| <div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"> * Implements a TopFieldCollector over one SortField criteria, while tracking</span></div> |
| <div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> * document scores but no maxScore.</span></div> |
| <div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keyword">private</span> <span class="keyword">class </span>OneComparatorScoringNoMaxScoreCollector : OneComparatorNonScoringCollector</div> |
| <div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  {</div> |
| <div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  </div> |
| <div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keyword">internal</span> <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_scorer.html" title="Expert: Common scoring functionality for different types of queries.">Scorer</a> scorer;</div> |
| <div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  </div> |
| <div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">public</span> OneComparatorScoringNoMaxScoreCollector(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a> queue, <span class="keywordtype">int</span> numHits, <span class="keywordtype">bool</span> fillFields):base(queue, numHits, fillFields)</div> |
| <div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  {</div> |
| <div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  }</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="keyword">internal</span> <span class="keywordtype">void</span> UpdateBottom(<span class="keywordtype">int</span> doc, <span class="keywordtype">float</span> score)</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>  bottom.Doc = docBase + doc;</div> |
| <div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  bottom.Score = score;</div> |
| <div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  bottom = pq.UpdateTop();</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>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> Collect(<span class="keywordtype">int</span> doc)</div> |
| <div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  {</div> |
| <div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  ++internalTotalHits;</div> |
| <div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  {</div> |
| <div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">if</span> ((reverseMul * comparator.CompareBottom(doc)) <= 0)</div> |
| <div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  {</div> |
| <div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">// since docs are visited in doc Id order, if compare is 0, it means</span></div> |
| <div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">// this document is largest than anything else in the queue, and</span></div> |
| <div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// therefore not competitive.</span></div> |
| <div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  return ;</div> |
| <div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div> |
| <div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  </div> |
| <div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// Compute the score only if the hit is competitive.</span></div> |
| <div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordtype">float</span> score = scorer.Score();</div> |
| <div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  </div> |
| <div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">// This hit is competitive - replace bottom element in queue & adjustTop</span></div> |
| <div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  comparator.Copy(bottom.slot, doc);</div> |
| <div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  UpdateBottom(doc, score);</div> |
| <div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  comparator.SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  }</div> |
| <div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">else</span></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="comment">// Compute the score only if the hit is competitive.</span></div> |
| <div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordtype">float</span> score = scorer.Score();</div> |
| <div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  </div> |
| <div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// Startup transient: queue hasn't gathered numHits yet</span></div> |
| <div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordtype">int</span> slot = internalTotalHits - 1;</div> |
| <div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="comment">// Copy hit into queue</span></div> |
| <div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  comparator.Copy(slot, doc);</div> |
| <div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  Add(slot, doc, score);</div> |
| <div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  {</div> |
| <div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  comparator.SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  }</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>  }</div> |
| <div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  </div> |
| <div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> SetScorer(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_scorer.html" title="Expert: Common scoring functionality for different types of queries.">Scorer</a> scorer)</div> |
| <div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  {</div> |
| <div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  this.scorer = scorer;</div> |
| <div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  comparator.SetScorer(scorer);</div> |
| <div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  }</div> |
| <div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  }</div> |
| <div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  </div> |
| <div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">/*</span></div> |
| <div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment"> * Implements a TopFieldCollector over one SortField criteria, while tracking</span></div> |
| <div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment"> * document scores but no maxScore, and assumes out of orderness in doc Ids</span></div> |
| <div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment"> * collection.</span></div> |
| <div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keyword">private</span> <span class="keyword">class </span>OutOfOrderOneComparatorScoringNoMaxScoreCollector : OneComparatorScoringNoMaxScoreCollector</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>  </div> |
| <div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keyword">public</span> OutOfOrderOneComparatorScoringNoMaxScoreCollector(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a> queue, <span class="keywordtype">int</span> numHits, <span class="keywordtype">bool</span> fillFields):base(queue, numHits, fillFields)</div> |
| <div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  {</div> |
| <div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  }</div> |
| <div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  </div> |
| <div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> Collect(<span class="keywordtype">int</span> doc)</div> |
| <div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  {</div> |
| <div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  ++internalTotalHits;</div> |
| <div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  {</div> |
| <div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">// Fastmatch: return if this hit is not competitive</span></div> |
| <div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordtype">int</span> cmp = reverseMul * comparator.CompareBottom(doc);</div> |
| <div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">if</span> (cmp < 0 || (cmp == 0 && doc + docBase > bottom.Doc))</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>  return ;</div> |
| <div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  }</div> |
| <div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  </div> |
| <div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// Compute the score only if the hit is competitive.</span></div> |
| <div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordtype">float</span> score = scorer.Score();</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>  <span class="comment">// This hit is competitive - replace bottom element in queue & adjustTop</span></div> |
| <div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  comparator.Copy(bottom.slot, doc);</div> |
| <div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  UpdateBottom(doc, score);</div> |
| <div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  comparator.SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  }</div> |
| <div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">else</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="comment">// Compute the score only if the hit is competitive.</span></div> |
| <div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordtype">float</span> score = scorer.Score();</div> |
| <div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  </div> |
| <div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="comment">// Startup transient: queue hasn't gathered numHits yet</span></div> |
| <div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordtype">int</span> slot = internalTotalHits - 1;</div> |
| <div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">// Copy hit into queue</span></div> |
| <div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  comparator.Copy(slot, doc);</div> |
| <div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  Add(slot, doc, score);</div> |
| <div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">if</span> (queueFull)</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>  comparator.SetBottom(bottom.slot);</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>  }</div> |
| <div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  }</div> |
| <div class="line"><a name="l00270"></a><span class="lineno"> 270</span> </div> |
| <div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">bool</span> AcceptsDocsOutOfOrder</div> |
| <div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  {</div> |
| <div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keyword">get</span> { <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div> |
| <div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  }</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>  <span class="comment">//</span></div> |
| <div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// Implements a TopFieldCollector over one SortField criteria, with tracking</span></div> |
| <div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="comment">// document scores and maxScore.</span></div> |
| <div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="comment">//</span></div> |
| <div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keyword">private</span> <span class="keyword">class </span>OneComparatorScoringMaxScoreCollector:OneComparatorNonScoringCollector</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="l00284"></a><span class="lineno"> 284</span>  <span class="keyword">internal</span> <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_scorer.html" title="Expert: Common scoring functionality for different types of queries.">Scorer</a> scorer;</div> |
| <div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  </div> |
| <div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keyword">public</span> OneComparatorScoringMaxScoreCollector(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a> queue, <span class="keywordtype">int</span> numHits, <span class="keywordtype">bool</span> fillFields):base(queue, numHits, fillFields)</div> |
| <div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  {</div> |
| <div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="comment">// Must set maxScore to NEG_INF, or otherwise Math.max always returns NaN.</span></div> |
| <div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  maxScore = System.Single.NegativeInfinity;</div> |
| <div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</div> |
| <div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  </div> |
| <div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keyword">internal</span> <span class="keywordtype">void</span> UpdateBottom(<span class="keywordtype">int</span> doc, <span class="keywordtype">float</span> score)</div> |
| <div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  {</div> |
| <div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  bottom.Doc = docBase + doc;</div> |
| <div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  bottom.Score = score;</div> |
| <div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  bottom = pq.UpdateTop();</div> |
| <div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  }</div> |
| <div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  </div> |
| <div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> Collect(<span class="keywordtype">int</span> doc)</div> |
| <div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  {</div> |
| <div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordtype">float</span> score = scorer.Score();</div> |
| <div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">if</span> (score > maxScore)</div> |
| <div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  {</div> |
| <div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  maxScore = score;</div> |
| <div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  }</div> |
| <div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  ++internalTotalHits;</div> |
| <div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  {</div> |
| <div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">if</span> ((reverseMul * comparator.CompareBottom(doc)) <= 0)</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>  <span class="comment">// since docs are visited in doc Id order, if compare is 0, it means</span></div> |
| <div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="comment">// this document is largest than anything else in the queue, and</span></div> |
| <div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="comment">// therefore not competitive.</span></div> |
| <div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  return ;</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>  <span class="comment">// This hit is competitive - replace bottom element in queue & adjustTop</span></div> |
| <div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  comparator.Copy(bottom.slot, doc);</div> |
| <div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  UpdateBottom(doc, score);</div> |
| <div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  comparator.SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  }</div> |
| <div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  {</div> |
| <div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="comment">// Startup transient: queue hasn't gathered numHits yet</span></div> |
| <div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keywordtype">int</span> slot = internalTotalHits - 1;</div> |
| <div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="comment">// Copy hit into queue</span></div> |
| <div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  comparator.Copy(slot, doc);</div> |
| <div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  Add(slot, doc, score);</div> |
| <div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  {</div> |
| <div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  comparator.SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  }</div> |
| <div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  }</div> |
| <div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  }</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="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> SetScorer(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_scorer.html" title="Expert: Common scoring functionality for different types of queries.">Scorer</a> scorer)</div> |
| <div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  {</div> |
| <div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  this.scorer = scorer;</div> |
| <div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  base.SetScorer(scorer);</div> |
| <div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  }</div> |
| <div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  }</div> |
| <div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  </div> |
| <div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">//</span></div> |
| <div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="comment">// Implements a TopFieldCollector over one SortField criteria, with tracking</span></div> |
| <div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">// document scores and maxScore, and assumes out of orderness in doc Ids</span></div> |
| <div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="comment">// collection.</span></div> |
| <div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="comment">//</span></div> |
| <div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keyword">private</span> <span class="keyword">class </span>OutOfOrderOneComparatorScoringMaxScoreCollector : OneComparatorScoringMaxScoreCollector</div> |
| <div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  {</div> |
| <div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  </div> |
| <div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">public</span> OutOfOrderOneComparatorScoringMaxScoreCollector(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a> queue, <span class="keywordtype">int</span> numHits, <span class="keywordtype">bool</span> fillFields):base(queue, numHits, fillFields)</div> |
| <div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  {</div> |
| <div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  }</div> |
| <div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  </div> |
| <div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> Collect(<span class="keywordtype">int</span> doc)</div> |
| <div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  {</div> |
| <div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordtype">float</span> score = scorer.Score();</div> |
| <div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">if</span> (score > maxScore)</div> |
| <div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  {</div> |
| <div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  maxScore = score;</div> |
| <div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  }</div> |
| <div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  ++internalTotalHits;</div> |
| <div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  {</div> |
| <div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="comment">// Fastmatch: return if this hit is not competitive</span></div> |
| <div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordtype">int</span> cmp = reverseMul * comparator.CompareBottom(doc);</div> |
| <div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordflow">if</span> (cmp < 0 || (cmp == 0 && doc + docBase > bottom.Doc))</div> |
| <div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  {</div> |
| <div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  return ;</div> |
| <div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  }</div> |
| <div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  </div> |
| <div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="comment">// This hit is competitive - replace bottom element in queue & adjustTop</span></div> |
| <div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  comparator.Copy(bottom.slot, doc);</div> |
| <div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  UpdateBottom(doc, score);</div> |
| <div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  comparator.SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  }</div> |
| <div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  {</div> |
| <div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="comment">// Startup transient: queue hasn't gathered numHits yet</span></div> |
| <div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordtype">int</span> slot = internalTotalHits - 1;</div> |
| <div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="comment">// Copy hit into queue</span></div> |
| <div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  comparator.Copy(slot, doc);</div> |
| <div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  Add(slot, doc, score);</div> |
| <div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  {</div> |
| <div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  comparator.SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  }</div> |
| <div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  }</div> |
| <div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  }</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="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">bool</span> AcceptsDocsOutOfOrder</div> |
| <div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  {</div> |
| <div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keyword">get</span> { <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div> |
| <div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  }</div> |
| <div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  }</div> |
| <div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  </div> |
| <div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="comment">/*</span></div> |
| <div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="comment"> * Implements a TopFieldCollector over multiple SortField criteria, without</span></div> |
| <div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="comment"> * tracking document scores and maxScore.</span></div> |
| <div class="line"><a name="l00400"></a><span class="lineno"> 400</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keyword">private</span> <span class="keyword">class </span>MultiComparatorNonScoringCollector:<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_top_field_collector.html" title="A Collector that sorts by SortField using FieldComparators. See the Create method for instantiating a...">TopFieldCollector</a></div> |
| <div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  {</div> |
| <div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keyword">internal</span> <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_comparator.html" title="Expert: a FieldComparator compares hits so as to determine their sort order when collecting the top r...">FieldComparator</a>[] comparators;</div> |
| <div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keyword">internal</span> <span class="keywordtype">int</span>[] reverseMul;</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="keyword">public</span> MultiComparatorNonScoringCollector(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a> queue, <span class="keywordtype">int</span> numHits, <span class="keywordtype">bool</span> fillFields):base(queue, numHits, fillFields)</div> |
| <div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  {</div> |
| <div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  comparators = queue.GetComparators();</div> |
| <div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  reverseMul = queue.GetReverseMul();</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>  </div> |
| <div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keyword">internal</span> <span class="keywordtype">void</span> UpdateBottom(<span class="keywordtype">int</span> doc)</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>  <span class="comment">// bottom.score is already set to Float.NaN in add().</span></div> |
| <div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  bottom.Doc = docBase + doc;</div> |
| <div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  bottom = pq.UpdateTop();</div> |
| <div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  }</div> |
| <div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  </div> |
| <div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> Collect(<span class="keywordtype">int</span> doc)</div> |
| <div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  {</div> |
| <div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  ++internalTotalHits;</div> |
| <div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  {</div> |
| <div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="comment">// Fastmatch: return if this hit is not competitive</span></div> |
| <div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; ; i++)</div> |
| <div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  {</div> |
| <div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordtype">int</span> c = reverseMul[i] * comparators[i].CompareBottom(doc);</div> |
| <div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordflow">if</span> (c < 0)</div> |
| <div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  {</div> |
| <div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="comment">// Definitely not competitive.</span></div> |
| <div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  return ;</div> |
| <div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  }</div> |
| <div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c > 0)</div> |
| <div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  {</div> |
| <div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="comment">// Definitely competitive.</span></div> |
| <div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  }</div> |
| <div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i == comparators.Length - 1)</div> |
| <div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  {</div> |
| <div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">// Here c=0. If we're at the last comparator, this doc is not</span></div> |
| <div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="comment">// competitive, since docs are visited in doc Id order, which means</span></div> |
| <div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="comment">// this doc cannot compete with any other document in the queue.</span></div> |
| <div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  return ;</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>  }</div> |
| <div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  </div> |
| <div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="comment">// This hit is competitive - replace bottom element in queue & adjustTop</span></div> |
| <div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  {</div> |
| <div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  comparators[i].Copy(bottom.slot, doc);</div> |
| <div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  }</div> |
| <div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  </div> |
| <div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  UpdateBottom(doc);</div> |
| <div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  </div> |
| <div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  {</div> |
| <div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  comparators[i].SetBottom(bottom.slot);</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>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  {</div> |
| <div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="comment">// Startup transient: queue hasn't gathered numHits yet</span></div> |
| <div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keywordtype">int</span> slot = internalTotalHits - 1;</div> |
| <div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="comment">// Copy hit into queue</span></div> |
| <div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</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>  comparators[i].Copy(slot, doc);</div> |
| <div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  }</div> |
| <div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  Add(slot, doc, System.Single.NaN);</div> |
| <div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  {</div> |
| <div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</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>  comparators[i].SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  }</div> |
| <div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  }</div> |
| <div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  }</div> |
| <div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  }</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="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> SetNextReader(<a class="code" href="_more_like_this_8cs.html#a2a6914ea10bbe06764856e29e5674e66">IndexReader</a> reader, <span class="keywordtype">int</span> docBase)</div> |
| <div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  {</div> |
| <div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  this.docBase = docBase;</div> |
| <div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  {</div> |
| <div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  comparators[i].SetNextReader(reader, docBase);</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="l00488"></a><span class="lineno"> 488</span>  </div> |
| <div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> SetScorer(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_scorer.html" title="Expert: Common scoring functionality for different types of queries.">Scorer</a> scorer)</div> |
| <div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  {</div> |
| <div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="comment">// set the scorer on all comparators</span></div> |
| <div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  {</div> |
| <div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  comparators[i].SetScorer(scorer);</div> |
| <div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  }</div> |
| <div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  }</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="l00499"></a><span class="lineno"> 499</span>  <span class="comment">/*</span></div> |
| <div class="line"><a name="l00500"></a><span class="lineno"> 500</span> <span class="comment"> * Implements a TopFieldCollector over multiple SortField criteria, without</span></div> |
| <div class="line"><a name="l00501"></a><span class="lineno"> 501</span> <span class="comment"> * tracking document scores and maxScore, and assumes out of orderness in doc</span></div> |
| <div class="line"><a name="l00502"></a><span class="lineno"> 502</span> <span class="comment"> * Ids collection.</span></div> |
| <div class="line"><a name="l00503"></a><span class="lineno"> 503</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keyword">private</span> <span class="keyword">class </span>OutOfOrderMultiComparatorNonScoringCollector:MultiComparatorNonScoringCollector</div> |
| <div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  {</div> |
| <div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  </div> |
| <div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keyword">public</span> OutOfOrderMultiComparatorNonScoringCollector(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a> queue, <span class="keywordtype">int</span> numHits, <span class="keywordtype">bool</span> fillFields):base(queue, numHits, fillFields)</div> |
| <div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  {</div> |
| <div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  }</div> |
| <div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  </div> |
| <div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> Collect(<span class="keywordtype">int</span> doc)</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>  ++internalTotalHits;</div> |
| <div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  {</div> |
| <div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="comment">// Fastmatch: return if this hit is not competitive</span></div> |
| <div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; ; i++)</div> |
| <div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  {</div> |
| <div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordtype">int</span> c = reverseMul[i] * comparators[i].CompareBottom(doc);</div> |
| <div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">if</span> (c < 0)</div> |
| <div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  {</div> |
| <div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="comment">// Definitely not competitive.</span></div> |
| <div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  return ;</div> |
| <div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  }</div> |
| <div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c > 0)</div> |
| <div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  {</div> |
| <div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="comment">// Definitely competitive.</span></div> |
| <div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keywordflow">break</span>;</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>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i == comparators.Length - 1)</div> |
| <div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  {</div> |
| <div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="comment">// This is the equals case.</span></div> |
| <div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">if</span> (doc + docBase > bottom.Doc)</div> |
| <div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  {</div> |
| <div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="comment">// Definitely not competitive</span></div> |
| <div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  return ;</div> |
| <div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  }</div> |
| <div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  }</div> |
| <div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  }</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>  <span class="comment">// This hit is competitive - replace bottom element in queue & adjustTop</span></div> |
| <div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  {</div> |
| <div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  comparators[i].Copy(bottom.slot, doc);</div> |
| <div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  }</div> |
| <div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  </div> |
| <div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  UpdateBottom(doc);</div> |
| <div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  </div> |
| <div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</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>  comparators[i].SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  }</div> |
| <div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  }</div> |
| <div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  {</div> |
| <div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="comment">// Startup transient: queue hasn't gathered numHits yet</span></div> |
| <div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordtype">int</span> slot = internalTotalHits - 1;</div> |
| <div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="comment">// Copy hit into queue</span></div> |
| <div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  {</div> |
| <div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  comparators[i].Copy(slot, doc);</div> |
| <div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  }</div> |
| <div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  Add(slot, doc, System.Single.NaN);</div> |
| <div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordflow">if</span> (queueFull)</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="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  {</div> |
| <div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  comparators[i].SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  }</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>  }</div> |
| <div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  }</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>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">bool</span> AcceptsDocsOutOfOrder</div> |
| <div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  {</div> |
| <div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keyword">get</span> { <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div> |
| <div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  }</div> |
| <div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  }</div> |
| <div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  </div> |
| <div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="comment">/*</span></div> |
| <div class="line"><a name="l00582"></a><span class="lineno"> 582</span> <span class="comment"> * Implements a TopFieldCollector over multiple SortField criteria, with</span></div> |
| <div class="line"><a name="l00583"></a><span class="lineno"> 583</span> <span class="comment"> * tracking document scores and maxScore.</span></div> |
| <div class="line"><a name="l00584"></a><span class="lineno"> 584</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keyword">private</span> <span class="keyword">class </span>MultiComparatorScoringMaxScoreCollector : MultiComparatorNonScoringCollector</div> |
| <div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  {</div> |
| <div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  </div> |
| <div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keyword">internal</span> <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_scorer.html" title="Expert: Common scoring functionality for different types of queries.">Scorer</a> scorer;</div> |
| <div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  </div> |
| <div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keyword">public</span> MultiComparatorScoringMaxScoreCollector(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a> queue, <span class="keywordtype">int</span> numHits, <span class="keywordtype">bool</span> fillFields):base(queue, numHits, fillFields)</div> |
| <div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  {</div> |
| <div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="comment">// Must set maxScore to NEG_INF, or otherwise Math.max always returns NaN.</span></div> |
| <div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  maxScore = System.Single.NegativeInfinity;</div> |
| <div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  }</div> |
| <div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  </div> |
| <div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keyword">internal</span> <span class="keywordtype">void</span> UpdateBottom(<span class="keywordtype">int</span> doc, <span class="keywordtype">float</span> score)</div> |
| <div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  {</div> |
| <div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  bottom.Doc = docBase + doc;</div> |
| <div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  bottom.Score = score;</div> |
| <div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  bottom = pq.UpdateTop();</div> |
| <div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  }</div> |
| <div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  </div> |
| <div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> Collect(<span class="keywordtype">int</span> doc)</div> |
| <div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  {</div> |
| <div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="keywordtype">float</span> score = scorer.Score();</div> |
| <div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keywordflow">if</span> (score > maxScore)</div> |
| <div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  {</div> |
| <div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  maxScore = score;</div> |
| <div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  }</div> |
| <div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  ++internalTotalHits;</div> |
| <div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  {</div> |
| <div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="comment">// Fastmatch: return if this hit is not competitive</span></div> |
| <div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; ; i++)</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>  <span class="keywordtype">int</span> c = reverseMul[i] * comparators[i].CompareBottom(doc);</div> |
| <div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keywordflow">if</span> (c < 0)</div> |
| <div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  {</div> |
| <div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="comment">// Definitely not competitive.</span></div> |
| <div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  return ;</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">else</span> <span class="keywordflow">if</span> (c > 0)</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>  <span class="comment">// Definitely competitive.</span></div> |
| <div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  }</div> |
| <div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i == comparators.Length - 1)</div> |
| <div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  {</div> |
| <div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="comment">// Here c=0. If we're at the last comparator, this doc is not</span></div> |
| <div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="comment">// competitive, since docs are visited in doc Id order, which means</span></div> |
| <div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="comment">// this doc cannot compete with any other document in the queue.</span></div> |
| <div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  return ;</div> |
| <div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  }</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>  </div> |
| <div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="comment">// This hit is competitive - replace bottom element in queue & adjustTop</span></div> |
| <div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</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>  comparators[i].Copy(bottom.slot, doc);</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="l00642"></a><span class="lineno"> 642</span>  UpdateBottom(doc, score);</div> |
| <div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  </div> |
| <div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  {</div> |
| <div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  comparators[i].SetBottom(bottom.slot);</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>  }</div> |
| <div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keywordflow">else</span></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>  <span class="comment">// Startup transient: queue hasn't gathered numHits yet</span></div> |
| <div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keywordtype">int</span> slot = internalTotalHits - 1;</div> |
| <div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="comment">// Copy hit into queue</span></div> |
| <div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  {</div> |
| <div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  comparators[i].Copy(slot, doc);</div> |
| <div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  }</div> |
| <div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  Add(slot, doc, score);</div> |
| <div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="keywordflow">if</span> (queueFull)</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="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  {</div> |
| <div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  comparators[i].SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  }</div> |
| <div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  }</div> |
| <div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  }</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>  </div> |
| <div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> SetScorer(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_scorer.html" title="Expert: Common scoring functionality for different types of queries.">Scorer</a> scorer)</div> |
| <div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  {</div> |
| <div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  this.scorer = scorer;</div> |
| <div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  base.SetScorer(scorer);</div> |
| <div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  }</div> |
| <div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  }</div> |
| <div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  </div> |
| <div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="comment">/*</span></div> |
| <div class="line"><a name="l00677"></a><span class="lineno"> 677</span> <span class="comment"> * Implements a TopFieldCollector over multiple SortField criteria, with</span></div> |
| <div class="line"><a name="l00678"></a><span class="lineno"> 678</span> <span class="comment"> * tracking document scores and maxScore, and assumes out of orderness in doc</span></div> |
| <div class="line"><a name="l00679"></a><span class="lineno"> 679</span> <span class="comment"> * Ids collection.</span></div> |
| <div class="line"><a name="l00680"></a><span class="lineno"> 680</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keyword">private</span> sealed <span class="keyword">class </span>OutOfOrderMultiComparatorScoringMaxScoreCollector:MultiComparatorScoringMaxScoreCollector</div> |
| <div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  {</div> |
| <div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  </div> |
| <div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keyword">public</span> OutOfOrderMultiComparatorScoringMaxScoreCollector(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a> queue, <span class="keywordtype">int</span> numHits, <span class="keywordtype">bool</span> fillFields):base(queue, numHits, fillFields)</div> |
| <div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  {</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>  </div> |
| <div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> Collect(<span class="keywordtype">int</span> doc)</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="keywordtype">float</span> score = scorer.Score();</div> |
| <div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keywordflow">if</span> (score > maxScore)</div> |
| <div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  {</div> |
| <div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  maxScore = score;</div> |
| <div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  }</div> |
| <div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  ++internalTotalHits;</div> |
| <div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  {</div> |
| <div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="comment">// Fastmatch: return if this hit is not competitive</span></div> |
| <div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; ; i++)</div> |
| <div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  {</div> |
| <div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="keywordtype">int</span> c = reverseMul[i] * comparators[i].CompareBottom(doc);</div> |
| <div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keywordflow">if</span> (c < 0)</div> |
| <div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  {</div> |
| <div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="comment">// Definitely not competitive.</span></div> |
| <div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  return ;</div> |
| <div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  }</div> |
| <div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c > 0)</div> |
| <div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  {</div> |
| <div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="comment">// Definitely competitive.</span></div> |
| <div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  }</div> |
| <div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i == comparators.Length - 1)</div> |
| <div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  {</div> |
| <div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="comment">// This is the equals case.</span></div> |
| <div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keywordflow">if</span> (doc + docBase > bottom.Doc)</div> |
| <div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  {</div> |
| <div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="comment">// Definitely not competitive</span></div> |
| <div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  return ;</div> |
| <div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  }</div> |
| <div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keywordflow">break</span>;</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>  </div> |
| <div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="comment">// This hit is competitive - replace bottom element in queue & adjustTop</span></div> |
| <div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</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>  comparators[i].Copy(bottom.slot, doc);</div> |
| <div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  }</div> |
| <div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  </div> |
| <div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  UpdateBottom(doc, score);</div> |
| <div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  </div> |
| <div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  {</div> |
| <div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  comparators[i].SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  }</div> |
| <div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  }</div> |
| <div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  {</div> |
| <div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="comment">// Startup transient: queue hasn't gathered numHits yet</span></div> |
| <div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keywordtype">int</span> slot = internalTotalHits - 1;</div> |
| <div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="comment">// Copy hit into queue</span></div> |
| <div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  {</div> |
| <div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  comparators[i].Copy(slot, doc);</div> |
| <div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  }</div> |
| <div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  Add(slot, doc, score);</div> |
| <div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  {</div> |
| <div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  {</div> |
| <div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  comparators[i].SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  }</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>  }</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> </div> |
| <div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">bool</span> AcceptsDocsOutOfOrder</div> |
| <div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  {</div> |
| <div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keyword">get</span> { <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div> |
| <div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  }</div> |
| <div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  }</div> |
| <div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  </div> |
| <div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="comment">/*</span></div> |
| <div class="line"><a name="l00764"></a><span class="lineno"> 764</span> <span class="comment"> * Implements a TopFieldCollector over multiple SortField criteria, with</span></div> |
| <div class="line"><a name="l00765"></a><span class="lineno"> 765</span> <span class="comment"> * tracking document scores and maxScore.</span></div> |
| <div class="line"><a name="l00766"></a><span class="lineno"> 766</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keyword">private</span> <span class="keyword">class </span>MultiComparatorScoringNoMaxScoreCollector:MultiComparatorNonScoringCollector</div> |
| <div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  {</div> |
| <div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  </div> |
| <div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="keyword">internal</span> <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_scorer.html" title="Expert: Common scoring functionality for different types of queries.">Scorer</a> scorer;</div> |
| <div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  </div> |
| <div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <span class="keyword">public</span> MultiComparatorScoringNoMaxScoreCollector(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a> queue, <span class="keywordtype">int</span> numHits, <span class="keywordtype">bool</span> fillFields):base(queue, numHits, fillFields)</div> |
| <div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  {</div> |
| <div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  }</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>  <span class="keyword">internal</span> <span class="keywordtype">void</span> UpdateBottom(<span class="keywordtype">int</span> doc, <span class="keywordtype">float</span> score)</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>  bottom.Doc = docBase + doc;</div> |
| <div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  bottom.Score = score;</div> |
| <div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  bottom = pq.UpdateTop();</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>  </div> |
| <div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> Collect(<span class="keywordtype">int</span> doc)</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>  ++internalTotalHits;</div> |
| <div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  {</div> |
| <div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="comment">// Fastmatch: return if this hit is not competitive</span></div> |
| <div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; ; i++)</div> |
| <div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  {</div> |
| <div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="keywordtype">int</span> c = reverseMul[i] * comparators[i].CompareBottom(doc);</div> |
| <div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keywordflow">if</span> (c < 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>  <span class="comment">// Definitely not competitive.</span></div> |
| <div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  return ;</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>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c > 0)</div> |
| <div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  {</div> |
| <div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="comment">// Definitely competitive.</span></div> |
| <div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  }</div> |
| <div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i == comparators.Length - 1)</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="comment">// Here c=0. If we're at the last comparator, this doc is not</span></div> |
| <div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="comment">// competitive, since docs are visited in doc Id order, which means</span></div> |
| <div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="comment">// this doc cannot compete with any other document in the queue.</span></div> |
| <div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  return ;</div> |
| <div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  }</div> |
| <div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  }</div> |
| <div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  </div> |
| <div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="comment">// This hit is competitive - replace bottom element in queue & adjustTop</span></div> |
| <div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  {</div> |
| <div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  comparators[i].Copy(bottom.slot, doc);</div> |
| <div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  }</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>  <span class="comment">// Compute score only if it is competitive.</span></div> |
| <div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="keywordtype">float</span> score = scorer.Score();</div> |
| <div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  UpdateBottom(doc, score);</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="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  {</div> |
| <div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  comparators[i].SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  }</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>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  {</div> |
| <div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <span class="comment">// Startup transient: queue hasn't gathered numHits yet</span></div> |
| <div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="keywordtype">int</span> slot = internalTotalHits - 1;</div> |
| <div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="comment">// Copy hit into queue</span></div> |
| <div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</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>  comparators[i].Copy(slot, doc);</div> |
| <div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  }</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>  <span class="comment">// Compute score only if it is competitive.</span></div> |
| <div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keywordtype">float</span> score = scorer.Score();</div> |
| <div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  Add(slot, doc, score);</div> |
| <div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="keywordflow">if</span> (queueFull)</div> |
| <div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  {</div> |
| <div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  {</div> |
| <div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  comparators[i].SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  }</div> |
| <div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  }</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>  }</div> |
| <div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  </div> |
| <div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> SetScorer(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_scorer.html" title="Expert: Common scoring functionality for different types of queries.">Scorer</a> scorer)</div> |
| <div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  {</div> |
| <div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  this.scorer = scorer;</div> |
| <div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  base.SetScorer(scorer);</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="l00855"></a><span class="lineno"> 855</span>  </div> |
| <div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="comment">/*</span></div> |
| <div class="line"><a name="l00857"></a><span class="lineno"> 857</span> <span class="comment"> * Implements a TopFieldCollector over multiple SortField criteria, with</span></div> |
| <div class="line"><a name="l00858"></a><span class="lineno"> 858</span> <span class="comment"> * tracking document scores and maxScore, and assumes out of orderness in doc</span></div> |
| <div class="line"><a name="l00859"></a><span class="lineno"> 859</span> <span class="comment"> * Ids collection.</span></div> |
| <div class="line"><a name="l00860"></a><span class="lineno"> 860</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keyword">private</span> sealed <span class="keyword">class </span>OutOfOrderMultiComparatorScoringNoMaxScoreCollector:MultiComparatorScoringNoMaxScoreCollector</div> |
| <div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  {</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>  <span class="keyword">public</span> OutOfOrderMultiComparatorScoringNoMaxScoreCollector(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a> queue, <span class="keywordtype">int</span> numHits, <span class="keywordtype">bool</span> fillFields):base(queue, numHits, fillFields)</div> |
| <div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  {</div> |
| <div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  }</div> |
| <div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  </div> |
| <div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> Collect(<span class="keywordtype">int</span> doc)</div> |
| <div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  {</div> |
| <div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  ++internalTotalHits;</div> |
| <div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="keywordflow">if</span> (queueFull)</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>  <span class="comment">// Fastmatch: return if this hit is not competitive</span></div> |
| <div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; ; i++)</div> |
| <div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  {</div> |
| <div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keywordtype">int</span> c = reverseMul[i] * comparators[i].CompareBottom(doc);</div> |
| <div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="keywordflow">if</span> (c < 0)</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="comment">// Definitely not competitive.</span></div> |
| <div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  return ;</div> |
| <div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  }</div> |
| <div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c > 0)</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>  <span class="comment">// Definitely competitive.</span></div> |
| <div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  }</div> |
| <div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i == comparators.Length - 1)</div> |
| <div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  {</div> |
| <div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="comment">// This is the equals case.</span></div> |
| <div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keywordflow">if</span> (doc + docBase > bottom.Doc)</div> |
| <div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  {</div> |
| <div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="comment">// Definitely not competitive</span></div> |
| <div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  return ;</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">break</span>;</div> |
| <div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  }</div> |
| <div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  }</div> |
| <div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  </div> |
| <div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <span class="comment">// This hit is competitive - replace bottom element in queue & adjustTop</span></div> |
| <div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  {</div> |
| <div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  comparators[i].Copy(bottom.slot, doc);</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>  </div> |
| <div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="comment">// Compute score only if it is competitive.</span></div> |
| <div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keywordtype">float</span> score = scorer.Score();</div> |
| <div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  UpdateBottom(doc, score);</div> |
| <div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  </div> |
| <div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</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>  comparators[i].SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  }</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">else</span></div> |
| <div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  {</div> |
| <div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="comment">// Startup transient: queue hasn't gathered numHits yet</span></div> |
| <div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keywordtype">int</span> slot = internalTotalHits - 1;</div> |
| <div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="comment">// Copy hit into queue</span></div> |
| <div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  {</div> |
| <div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  comparators[i].Copy(slot, doc);</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="comment">// Compute score only if it is competitive.</span></div> |
| <div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="keywordtype">float</span> score = scorer.Score();</div> |
| <div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  Add(slot, doc, score);</div> |
| <div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="keywordflow">if</span> (queueFull)</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="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < comparators.Length; i++)</div> |
| <div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  {</div> |
| <div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  comparators[i].SetBottom(bottom.slot);</div> |
| <div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  }</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>  }</div> |
| <div class="line"><a name="l00935"></a><span class="lineno"> 935</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="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">void</span> SetScorer(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_scorer.html" title="Expert: Common scoring functionality for different types of queries.">Scorer</a> scorer)</div> |
| <div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  {</div> |
| <div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  this.scorer = scorer;</div> |
| <div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  base.SetScorer(scorer);</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>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">bool</span> AcceptsDocsOutOfOrder</div> |
| <div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  {</div> |
| <div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keyword">get</span> { <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div> |
| <div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  }</div> |
| <div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  }</div> |
| <div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  </div> |
| <div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <span class="keyword">private</span> <span class="keyword">static</span> readonly <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_score_doc.html" title="Expert: Returned by low-level search implementations.">ScoreDoc</a>[] EMPTY_SCOREDOCS = <span class="keyword">new</span> <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_score_doc.html" title="Expert: Returned by low-level search implementations.">ScoreDoc</a>[0];</div> |
| <div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  </div> |
| <div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  <span class="keyword">private</span> <span class="keywordtype">bool</span> fillFields;</div> |
| <div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  </div> |
| <div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="comment">/*</span></div> |
| <div class="line"><a name="l00954"></a><span class="lineno"> 954</span> <span class="comment"> * Stores the maximum score value encountered, needed for normalizing. If</span></div> |
| <div class="line"><a name="l00955"></a><span class="lineno"> 955</span> <span class="comment"> * document scores are not tracked, this value is initialized to NaN.</span></div> |
| <div class="line"><a name="l00956"></a><span class="lineno"> 956</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  <span class="keyword">internal</span> <span class="keywordtype">float</span> maxScore = System.Single.NaN;</div> |
| <div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  </div> |
| <div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keyword">internal</span> <span class="keywordtype">int</span> numHits;</div> |
| <div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="keyword">internal</span> <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a>.Entry bottom = null;</div> |
| <div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <span class="keyword">internal</span> <span class="keywordtype">bool</span> queueFull;</div> |
| <div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keyword">internal</span> <span class="keywordtype">int</span> docBase;</div> |
| <div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  </div> |
| <div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <span class="comment">// Declaring the constructor private prevents extending this class by anyone</span></div> |
| <div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="comment">// else. Note that the class cannot be final since it's extended by the</span></div> |
| <div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="comment">// internal versions. If someone will define a constructor with any other</span></div> |
| <div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="comment">// visibility, then anyone will be able to extend the class, which is not what</span></div> |
| <div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <span class="comment">// we want.</span></div> |
| <div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keyword">private</span> <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_top_field_collector.html" title="A Collector that sorts by SortField using FieldComparators. See the Create method for instantiating a...">TopFieldCollector</a>(PriorityQueue<Entry> pq, <span class="keywordtype">int</span> numHits, <span class="keywordtype">bool</span> fillFields)</div> |
| <div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  : base(pq)</div> |
| <div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  {</div> |
| <div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  this.numHits = numHits;</div> |
| <div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  this.fillFields = fillFields;</div> |
| <div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  }</div> |
| <div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  </div> |
| <div class="line"><a name="l01012"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_search_1_1_top_field_collector.html#acb40dd39119e08534429eb92f0e3ab5f"> 1012</a></span>  <span class="keyword">public</span> <span class="keyword">static</span> <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_top_field_collector.html" title="A Collector that sorts by SortField using FieldComparators. See the Create method for instantiating a...">TopFieldCollector</a> Create(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_sort.html" title="Encapsulates sort criteria for returned hits.">Sort</a> sort, <span class="keywordtype">int</span> numHits, <span class="keywordtype">bool</span> fillFields, <span class="keywordtype">bool</span> trackDocScores, <span class="keywordtype">bool</span> trackMaxScore, <span class="keywordtype">bool</span> docsScoredInOrder)</div> |
| <div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  {</div> |
| <div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  <span class="keywordflow">if</span> (sort.fields.Length == 0)</div> |
| <div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  {</div> |
| <div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <span class="keywordflow">throw</span> <span class="keyword">new</span> System.ArgumentException(<span class="stringliteral">"Sort must contain at least one field"</span>);</div> |
| <div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  }</div> |
| <div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  </div> |
| <div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a> queue = <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a>.<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html#ad5d080e0998713887e9a307f74c017a8" title="Creates a hit queue sorted by the given list of fields.">Create</a>(sort.fields, numHits);</div> |
| <div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <span class="keywordflow">if</span> (queue.GetComparators().Length == 1)</div> |
| <div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  {</div> |
| <div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <span class="keywordflow">if</span> (docsScoredInOrder)</div> |
| <div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  {</div> |
| <div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <span class="keywordflow">if</span> (trackMaxScore)</div> |
| <div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  {</div> |
| <div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> OneComparatorScoringMaxScoreCollector(queue, numHits, fillFields);</div> |
| <div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  }</div> |
| <div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (trackDocScores)</div> |
| <div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  {</div> |
| <div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> OneComparatorScoringNoMaxScoreCollector(queue, numHits, fillFields);</div> |
| <div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  }</div> |
| <div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  {</div> |
| <div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> OneComparatorNonScoringCollector(queue, numHits, fillFields);</div> |
| <div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  }</div> |
| <div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  }</div> |
| <div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  {</div> |
| <div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="keywordflow">if</span> (trackMaxScore)</div> |
| <div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  {</div> |
| <div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> OutOfOrderOneComparatorScoringMaxScoreCollector(queue, numHits, fillFields);</div> |
| <div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  }</div> |
| <div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (trackDocScores)</div> |
| <div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  {</div> |
| <div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> OutOfOrderOneComparatorScoringNoMaxScoreCollector(queue, numHits, fillFields);</div> |
| <div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  }</div> |
| <div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  {</div> |
| <div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> OutOfOrderOneComparatorNonScoringCollector(queue, numHits, fillFields);</div> |
| <div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  }</div> |
| <div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  }</div> |
| <div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  }</div> |
| <div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  </div> |
| <div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  <span class="comment">// multiple comparators.</span></div> |
| <div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="keywordflow">if</span> (docsScoredInOrder)</div> |
| <div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  {</div> |
| <div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="keywordflow">if</span> (trackMaxScore)</div> |
| <div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  {</div> |
| <div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> MultiComparatorScoringMaxScoreCollector(queue, numHits, fillFields);</div> |
| <div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  }</div> |
| <div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (trackDocScores)</div> |
| <div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  {</div> |
| <div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> MultiComparatorScoringNoMaxScoreCollector(queue, numHits, fillFields);</div> |
| <div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  }</div> |
| <div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  {</div> |
| <div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> MultiComparatorNonScoringCollector(queue, numHits, fillFields);</div> |
| <div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  }</div> |
| <div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  }</div> |
| <div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  {</div> |
| <div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <span class="keywordflow">if</span> (trackMaxScore)</div> |
| <div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  {</div> |
| <div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> OutOfOrderMultiComparatorScoringMaxScoreCollector(queue, numHits, fillFields);</div> |
| <div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  }</div> |
| <div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (trackDocScores)</div> |
| <div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  {</div> |
| <div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> OutOfOrderMultiComparatorScoringNoMaxScoreCollector(queue, numHits, fillFields);</div> |
| <div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  }</div> |
| <div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  {</div> |
| <div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> OutOfOrderMultiComparatorNonScoringCollector(queue, numHits, fillFields);</div> |
| <div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  }</div> |
| <div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  }</div> |
| <div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  }</div> |
| <div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  </div> |
| <div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  <span class="keyword">internal</span> <span class="keywordtype">void</span> Add(<span class="keywordtype">int</span> slot, <span class="keywordtype">int</span> doc, <span class="keywordtype">float</span> score)</div> |
| <div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  {</div> |
| <div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  bottom = pq.Add(<span class="keyword">new</span> <a class="code" href="_top_field_collector_8cs.html#ac2a1112fdb5c9e846a6178979c145dfa">Entry</a>(slot, docBase + doc, score));</div> |
| <div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  queueFull = internalTotalHits == numHits;</div> |
| <div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  }</div> |
| <div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  </div> |
| <div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="comment">/*</span></div> |
| <div class="line"><a name="l01094"></a><span class="lineno"> 1094</span> <span class="comment"> * Only the following callback methods need to be overridden since</span></div> |
| <div class="line"><a name="l01095"></a><span class="lineno"> 1095</span> <span class="comment"> * topDocs(int, int) calls them to return the results.</span></div> |
| <div class="line"><a name="l01096"></a><span class="lineno"> 1096</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  </div> |
| <div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <span class="keyword">protected</span> <span class="keyword">internal</span> <span class="keyword">override</span> <span class="keywordtype">void</span> PopulateResults(<a class="code" href="_document_8cs.html#a11bec7ba632f3ad2cac1484b3296e8c1">ScoreDoc</a>[] results, <span class="keywordtype">int</span> howMany)</div> |
| <div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  {</div> |
| <div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <span class="keywordflow">if</span> (fillFields)</div> |
| <div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  {</div> |
| <div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="comment">// avoid casting if unnecessary.</span></div> |
| <div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  FieldValueHitQueue queue = (FieldValueHitQueue) pq;</div> |
| <div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = howMany - 1; i >= 0; i--)</div> |
| <div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  {</div> |
| <div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  results[i] = queue.FillFields(queue.Pop());</div> |
| <div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  }</div> |
| <div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  }</div> |
| <div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  {</div> |
| <div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = howMany - 1; i >= 0; i--)</div> |
| <div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  {</div> |
| <div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <a class="code" href="_top_field_collector_8cs.html#ac2a1112fdb5c9e846a6178979c145dfa">Entry</a> entry = pq.Pop();</div> |
| <div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  results[i] = <span class="keyword">new</span> FieldDoc(entry.Doc, entry.Score);</div> |
| <div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  }</div> |
| <div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  }</div> |
| <div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  }</div> |
| <div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  </div> |
| <div class="line"><a name="l01119"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_search_1_1_top_field_collector.html#a7e89eaf4bbc7eea24a3b2c4dfde2adac"> 1119</a></span>  <span class="keyword">public</span> <span class="comment">/*protected internal*/</span> <span class="keyword">override</span> <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_top_docs.html" title="Represents hits returned by Searcher.Search(Query,Filter,int) and Searcher.Search(Query,int) ">TopDocs</a> NewTopDocs(<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_score_doc.html" title="Expert: Returned by low-level search implementations.">ScoreDoc</a>[] results, <span class="keywordtype">int</span> start)</div> |
| <div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  {</div> |
| <div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  <span class="keywordflow">if</span> (results == null)</div> |
| <div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  {</div> |
| <div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  results = EMPTY_SCOREDOCS;</div> |
| <div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <span class="comment">// Set maxScore to NaN, in case this is a maxScore tracking collector.</span></div> |
| <div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  maxScore = System.Single.NaN;</div> |
| <div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  }</div> |
| <div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  </div> |
| <div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <span class="comment">// If this is a maxScoring tracking collector and there were no results, </span></div> |
| <div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="class_lucene_1_1_net_1_1_search_1_1_top_field_docs.html" title="Represents hits returned by Searcher.Search(Query,Filter,int,Sort). ">TopFieldDocs</a>(internalTotalHits, results, ((<a class="code" href="class_lucene_1_1_net_1_1_search_1_1_field_value_hit_queue.html" title="Expert: A hit queue for sorting by hits by terms in more than one field. Uses FieldCache.DEFAULT for maintaining internal term lookup tables.">FieldValueHitQueue</a>) pq).GetFields(), maxScore);</div> |
| <div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  }</div> |
| <div class="line"><a name="l01131"></a><span class="lineno"> 1131</span> </div> |
| <div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  <span class="keyword">public</span> <span class="keyword">override</span> <span class="keywordtype">bool</span> AcceptsDocsOutOfOrder</div> |
| <div class="line"><a name="l01133"></a><span class="lineno"><a class="code" href="class_lucene_1_1_net_1_1_search_1_1_top_field_collector.html#a4d1a9b50983e6291c2870e999f19dc94"> 1133</a></span>  {</div> |
| <div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keyword">get</span> { <span class="keywordflow">return</span> <span class="keyword">false</span>; }</div> |
| <div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  }</div> |
| <div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  }</div> |
| <div class="line"><a name="l01137"></a><span class="lineno"> 1137</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> |
