// next one in the tree, add them back in.
if (savedValues.size() > 0 && savedPriority == distanceQueue.getPriority()) {
for (int svi = 0; svi < savedValues.size(); svi++) {
distanceQueue.insert(savedValues.get(svi), savedPriority);
}
savedValues.reset();
}
// narrow the search, if we have already found N items
if (distanceQueue.getPriority() < furthestDistanceSq && distanceQueue.size() >= count) {
furthestDistanceSq = distanceQueue.getPriority();