我如何移植
Iterables.filter(tree
// do the first search using the bounds
.search(bounds),
// refine using the exact distance
entry -> {
Point p = entry.geometry();
Position position = Position.create(p.y(), p.x());
return from.getDistanceToKm(position) < distanceKm;
});
从 Java 到 Scala?我的以下方法失败了:
import com.github.davidmoten.grumpy.core.Position
import com.github.davidmoten.rtree2.{Iterables, RTree}
import com.github.davidmoten.rtree2.geometry.{Geometries, Point}
val sydney = Geometries.point(151.2094, -33.86)
val canberra = Geometries.point(149.1244, -35.3075)
val brisbane = Geometries.point(153.0278, -27.4679)
val bungendore = Geometries.point(149.4500, -35.2500)
var tree = RTree.star.create[String, Point]
tree = tree.add("Sydney", sydney)
tree = tree.add("Brisbane", brisbane)
val distanceKm = 300
val list = Iterables.toList(search(tree, canberra, distanceKm))
def createBounds(from: Position, distanceKm: Double) = { // this calculates a pretty accurate bounding box. Depending on the
// performance you require you wouldn't have to be this accurate because
// accuracy is enforced later
val north = from.predict(distanceKm, 0)
val south = from.predict(distanceKm, 180)
val east = from.predict(distanceKm, 90)
val west = from.predict(distanceKm, 270)
Geometries.rectangle(west.getLon, south.getLat, east.getLon, north.getLat)
}
因为类型entry似乎没有明确定义。
喵喵时光机
相关分类