111112113114115116117118119120121
if (reuse == null) { reuse = new TopOrdAndFloatQueue.OrdAndValue(); } reuse.ord = ord; reuse.value = values[ord]; reuse = q.insertWithOverflow(reuse); if (q.size() == topN) { bottomValue = q.top().value; } } }