list.insertSorted(d, m_Root.p()); return list; tmpnode = zero_set.element(i); if (tmpnode.dist <= upper_bound) { list.insertSorted(tmpnode.dist, tmpnode.n.p());
list.insertSorted(d, m_Root.p()); return list; tmpnode = zero_set.element(i); if (tmpnode.dist <= upper_bound) { list.insertSorted(tmpnode.dist, tmpnode.n.p());
ele = zero_set.element(i); if (ele.dist <= upper_k.peek().distance) { temp.insertSorted(ele.dist, ele.n.p()); // temp.push(ele.n.p());
ele = zero_set.element(i); if (ele.dist <= upper_k.peek().distance) { temp.insertSorted(ele.dist, ele.n.p()); // temp.push(ele.n.p());