throw new RuntimeException(e);
}
////System.out.println("Ranker created.");
sortedAccumulators.clear();
Accumulator a = new Accumulator(0, 0.0f);
// NodeWeight that must be achieved to enter result set.
double scoreThreshold = Double.NEGATIVE_INFINITY;
int docno = Integer.MAX_VALUE;
int nextDocno = structureReader.getNextCandidate(docno);
if(nextDocno < docno){
docno = nextDocno;
}
int cnt = 0;
while (docno < Integer.MAX_VALUE) {
float score = 0.0f;
// Document-at-a-time scoring.
// try {
// LOG.info("Advance to docno " + docno+" => "+getDocnoMapping().getDocid(docno));
// } catch (IOException e) {
// e.printStackTrace();
// }
NodeWeight sc = structureReader.computeScore(docno,0);
score = sc.getBM25((int) env.getDocumentCount(), env.getDocumentLength(docno), env.getCollectionSize()/ (float) env.getDocumentCount());
// LOG.info("Docno " + docno + ","+docnoMapping.getDocid(docno)+" scored: "+score);
cnt++;
// Keep track of numResults best accumulators.
if (score > scoreThreshold) {
a.docno = docno;
a.score = score;
sortedAccumulators.add(a);
if (sortedAccumulators.size() == numResults + 1) {
a = sortedAccumulators.poll();
scoreThreshold = sortedAccumulators.peek().score;
} else {
a = new Accumulator(0, 0.0f);
}
}
// Advance to next document
docno = Integer.MAX_VALUE;
nextDocno = structureReader.getNextCandidate(docno);
if(nextDocno < docno){
docno = nextDocno;
}
}
// Grab the accumulators off the stack, in (reverse) order.
Accumulator[] accs = new Accumulator[Math.min(numResults, sortedAccumulators.size())];
for (int i = 0; i < accs.length; i++) {
Accumulator acc = sortedAccumulators.poll();
// LOG.info((accs.length - 1 - i)+"="+acc.docno+","+acc.score);
accs[accs.length - 1 - i] = acc;
}
this.results.put(qid, accs);