How to use

smile.sort.HeapSelect

constructor

@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;
}

HeapSelect<Node> heap = new HeapSelect<>(top2);
for (Node neuron : nodes) {
  neuron.dist = Math.squaredDistance(neuron.w, x);

@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);

HeapSelect<Neighbor<AbstractSentence, E>> heap = new HeapSelect<>(neighbors);
Neighbor<AbstractSentence, E> neighbor = new Neighbor<>(null, null, 0, Double.MAX_VALUE);
for (int i = 0; i < k; i++) {

@SuppressWarnings("unchecked")
SimpleNeighbor<T>[] neighbors = (SimpleNeighbor<T>[]) java.lang.reflect.Array.newInstance(neighbor.getClass(), k);
HeapSelect<Neighbor<T,T>> heap = new HeapSelect<>(neighbors);
for (int i = 0; i < k; i++) {
  heap.add(neighbor);

@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);

HeapSelect<Neighbor> heap = new HeapSelect<>(neighbors);