972973974975976977978979980981
for (int i = howMany - 1; i >= 0; i--) { results[i] = queue.fillFields(queue.pop()); } } else { for (int i = howMany - 1; i >= 0; i--) { Entry entry = pq.pop(); results[i] = new FieldDoc(entry.doc, entry.score); } } }
11831184118511861187118811891190
return new PagingFieldCollector(queue, after, numHits, fillFields, trackDocScores, trackMaxScore); } } final void add(int slot, int doc, float score) { bottom = pq.add(new Entry(slot, docBase + doc, score)); queueFull = totalHits == numHits; }
1202120312041205120612071208120912101211
975976977978979980981982983984985
// Compute score only if it is competitive. if (trackDocScores && !trackMaxScore) { score = scorer.score(); } bottom = pq.add(new Entry(slot, docBase + doc, score)); queueFull = collectedHits == numHits; if (queueFull) { for (int i = 0; i < comparators.length; i++) { comparators[i].setBottom(bottom.slot); }
923924925926927928929930
} } } final void add(int slot, int doc, float score) { bottom = (Entry) pq.add(new Entry(slot, docBase + doc, score)); queueFull = totalHits == numHits; }
941942943944945946947948949950
for (int i = howMany - 1; i >= 0; i--) { results[i] = queue.fillFields((Entry) queue.pop()); } } else { for (int i = howMany - 1; i >= 0; i--) { Entry entry = (Entry) pq.pop(); results[i] = new FieldDoc(entry.docID, entry.score); } } }
953954955956957958959960
} } } final void add(int slot, int doc, float score) { bottom = pq.add(new Entry(slot, docBase + doc, score)); queueFull = totalHits == numHits; }