Advertisement
Guest User

Untitled

a guest
Aug 31st, 2015
73
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.36 KB | None | 0 0
  1.  
  2. RectHV r = new RectHV(0, 0, 1, 1);
  3. Iterable<Point2D> set = kdtree.range(r);
  4. for (Point2D p:set) {
  5. StdOut.println("("+ p.x() + ", " + p.y() + ")");
  6. if (kdtree.contains(p)) {
  7. StdOut.println("kdtree contains it");
  8. }
  9. else StdOut.println("kdtree does NOT contain it!");
  10. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement