298299300301302303304305
throw new IllegalArgumentException("Sort must only one field"); } } final void add(int slot, int doc, float score) { bottom = pq.add(new Entry(slot, docBase + doc, score)); queueFull = totalHits == numHits; }
317318319320321322323324325326
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); } } }
957958959960961962963964
} } } final void add(int slot, int doc, float score) { bottom = pq.add(new Entry(slot, docBase + doc, score)); queueFull = totalHits == numHits; }
976977978979980981982983984985
11731174117511761177117811791180
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; }
1192119311941195119611971198119912001201
965966967968969970971972973974975
// 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); }
950951952953954955956957
969970971972973974975976977978
953954955956957958959960