+ public void range(Point p1, Point p2, Visitor<V> vis) {
+ visitor = vis;
+ rect.set(p1.x, p1.y, p1.z, p2.x, p2.y, p2.z);
+ rtree.intersects(rect, myIntProcedure);
+ visitor = null;
+ }
+
+ private class MyIntProcedure implements IntProcedure {
+ public boolean execute(int id) {
+ found = idToV.get(id);
+ if (visitor != null) {
+ return visitor.visit(found);
+ } else {
+ return false;
+ }
+ }
+ }