| locateNear(Point, double, int[], int) |  | 98% |  | 89% | 3 | 15 | 1 | 37 | 0 | 1 |
| KDTree(Collection, Class) | | 100% | | 100% | 0 | 11 | 0 | 61 | 0 | 1 |
| selecti(int, int, int[], int, int, double[]) | | 100% | | 100% | 0 | 12 | 0 | 31 | 0 | 1 |
| nNearest(int, int[], double[], int) | | 100% | | 100% | 0 | 18 | 0 | 39 | 0 | 1 |
| nearestIndex(Point) | | 100% | | 100% | 0 | 8 | 0 | 24 | 0 | 1 |
| siftDown(double[], int[], int) | | 100% | | 100% | 0 | 5 | 0 | 17 | 0 | 1 |
| locateNear(Point, double, Point[], int) | | 100% | | 100% | 0 | 5 | 0 | 11 | 0 | 1 |
| locateBoxIndex(Point) | | 100% | | 100% | 0 | 3 | 0 | 10 | 0 | 1 |
| locate(int) | | 100% | | 100% | 0 | 3 | 0 | 8 | 0 | 1 |
| nNearest(int, Point[], double[], int) | | 100% | | 100% | 0 | 3 | 0 | 7 | 0 | 1 |
| distance(int, int) | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| swap(int[], int, int[], int) | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| nNearest(Point, int[], double[], int) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| nNearest(Point, Point[], double[], int) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| locateBox(Point) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| nearestPoint(Point) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |