m_Instances.instance(m_InstList[i]), head.distance, m_Stats); if (distance < head.distance) { heap.putBySubstitute(m_InstList[i], distance); } else if (distance == head.distance) { heap.putKthNearest(m_InstList[i], distance);
m_Instances.instance(m_InstList[i]), head.distance, m_Stats); if (distance < head.distance) { heap.putBySubstitute(m_InstList[i], distance); } else if (distance == head.distance) { heap.putKthNearest(m_InstList[i], distance);
continue; if(distance < temp.distance) { heap.putBySubstitute(i, distance);
.instance(m_InstList[idx]), temp.distance, m_Stats); if (distance < temp.distance) { heap.putBySubstitute(m_InstList[idx], distance); } else if (distance == temp.distance) { heap.putKthNearest(m_InstList[idx], distance);
.instance(m_InstList[idx]), temp.distance, m_Stats); if (distance < temp.distance) { heap.putBySubstitute(m_InstList[idx], distance); } else if (distance == temp.distance) { heap.putKthNearest(m_InstList[idx], distance);
continue; if(distance < temp.distance) { heap.putBySubstitute(i, distance);