thanks - I really wanted a library like this on the JVM
`kdTree.findNearestNeighbor(point, 2);` does this return
1. A list of ALL points that match the distance predicate?
2. Are they sorted by distance to the target?
3. Is it possible to cap to only the closest N points?