| testRangeQuery() |  | 0% | | 0% | 3 | 3 | 19 | 19 | 1 | 1 |
| testNearestNeighbors() | | 0% | | 0% | 4 | 4 | 17 | 17 | 1 | 1 |
| testNearestNeighbor() | | 0% | | 0% | 3 | 3 | 16 | 16 | 1 | 1 |
| testSinglePoint() | | 0% | | 0% | 4 | 4 | 11 | 11 | 1 | 1 |
| testQuery(KdTree, Envelope, boolean, Coordinate[]) | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| testQuery(KdTree, Envelope, Coordinate[]) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| testCollectNodes() | | 0% | | 0% | 2 | 2 | 9 | 9 | 1 | 1 |
| bruteForceNearestNeighbor(KdTree, Coordinate) | | 0% | | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| testSizeDepth() | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| bruteForceInEnvelope(KdTree, Envelope) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| build(String, double) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| bruteForceNearestNeighbors(KdTree, Coordinate, int) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| testQuery(String, double, Envelope, String) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| testQueryRepeated(String, double, Envelope, String) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| testMultiplePoint() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| testSubset() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| testToleranceFailure() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| testTolerance2() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| testTolerance2_perturbedY() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| testSnapToNearest() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getAllPoints(KdTree) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testRangeQuery$0(List, KdNode) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| KdTreeTest(String) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$bruteForceNearestNeighbors$1(Coordinate, Coordinate) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| main(String[]) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |