proper exceptions (50/100)

Author: proton

week5/balanced-search-trees/assignment-kd-trees/KdTree.java

@@ -174,6 +174,7 @@ private void rangeSearch(RectHV rect, Node node, ArrayList<Point2D> points) {
   }
   // // a nearest neighbor in the set to point p; null if the set is empty
   public Point2D nearest(Point2D p) {
+    if (p == null) throw new IllegalArgumentException("nearest method called with a null argument");
     return nearestSearch(p, this.root, null, Double.POSITIVE_INFINITY);
   }
 

week5/balanced-search-trees/assignment-kd-trees/PointSET.java

@@ -20,10 +20,12 @@ public int size() {
   }
   // add the point to the set (if it is not already in the set)
   public void insert(Point2D p) {
+    if (p == null) throw new IllegalArgumentException("insert method called with a null argument");
     tree.add(p);
   }
   // // does the set contain point p?
   public boolean contains(Point2D p) {
+    if (p == null) throw new IllegalArgumentException("contains method called with a null argument");
     return tree.contains(p);
   }
   // draw all points to standard draw
@@ -34,6 +36,7 @@ public void draw() {
   }
   // all points that are inside the rectangle (or on the boundary)
   public Iterable<Point2D> range(RectHV rect) {
+    if (rect == null) throw new IllegalArgumentException("range method called with a null argument");
     ArrayList<Point2D> points = new ArrayList<Point2D>();
     for (Point2D p : tree) {
       if (rect.contains(p)) {
@@ -44,6 +47,7 @@ public Iterable<Point2D> range(RectHV rect) {
   }
   // // a nearest neighbor in the set to point p; null if the set is empty
   public Point2D nearest(Point2D p) {
+    if (p == null) throw new IllegalArgumentException("nearest method called with a null argument");
     Point2D nearest = null;
     double minDistance = Double.POSITIVE_INFINITY;
     for (Point2D point : tree) {