| testKNearestNeighbors() |  | 0% | | 0% | 6 | 6 | 30 | 30 | 1 | 1 |
| checkNN(String, String) | | 0% | | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| checkNN(String, String, String, String) | | 0% | | n/a | 1 | 1 | 10 | 10 | 1 | 1 |
| checkWithinDistance(String, String, double, boolean) | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| testKNearestNeighborsEmpty() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| testNearestNeighbourEmpty() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| createTree(Geometry) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| testNearestNeighboursTreesEmpty() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| isEqual(Object[], Geometry, Geometry) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| testNearestNeighboursEmpty() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| isEqualUnordered(Object[], Geometry, Geometry) | | 0% | | 0% | 3 | 3 | 1 | 1 | 1 | 1 |
| testWithinDistance() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| main(String[]) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| testNearestNeighbours2() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| testNearestNeighbours() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| testNearestNeighbourSingleItem() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| STRtreeNearestNeighbourTest(String) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |