/** * Sort the smallest values. */ public void sort() { if (!sorted) { sort(heap, Math.min(k,n)); sorted = true; } }
/** * Returns the i-<i>th</i> smallest value seen so far. i = 0 returns the smallest * value seen, i = 1 the second largest, ..., i = k-1 the last position * tracked. Also, i must be less than the number of previous assimilated. */ public T get(int i) { if (i > Math.min(k, n) - 1) { throw new IllegalArgumentException("HeapSelect i is greater than the number of data received so far."); } if (i == k-1) { return heap[0]; } if (!sorted) { sort(heap, Math.min(k,n)); sorted = true; } return heap[k-1-i]; }
@Override public Neighbor<double[], E>[] knn(double[] q, int k) { if (k <= 0) { throw new IllegalArgumentException("Invalid k: " + k); } if (k > keys.length) { throw new IllegalArgumentException("Neighbor array length is larger than the dataset size"); } Neighbor<double[], E> neighbor = new Neighbor<>(null, null, 0, Double.MAX_VALUE); @SuppressWarnings("unchecked") Neighbor<double[], E>[] neighbors = (Neighbor<double[], E>[]) java.lang.reflect.Array.newInstance(neighbor.getClass(), k); HeapSelect<Neighbor<double[], E>> heap = new HeapSelect<>(neighbors); for (int i = 0; i < k; i++) { heap.add(neighbor); neighbor = new Neighbor<>(null, null, 0, Double.MAX_VALUE); } search(q, root, heap); heap.sort(); for (int i = 0; i < neighbors.length; i++) { neighbors[i].distance = Math.sqrt(neighbors[i].distance); } return neighbors; }
heap.sort(); return neighbors;
heap.sort(); if (hit < k) { Neighbor<AbstractSentence, E>[] n2 = (Neighbor<AbstractSentence, E>[])Array.newInstance(Neighbor.class, hit);