-
Notifications
You must be signed in to change notification settings - Fork 0
/
PointSET.java
75 lines (66 loc) · 2.12 KB
/
PointSET.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
import edu.princeton.cs.algs4.Point2D;
import edu.princeton.cs.algs4.RectHV;
import edu.princeton.cs.algs4.SET;
import java.util.Iterator;
public class PointSET {
private SET<Point2D> points;
public PointSET() // construct an empty set of points
{
points = new SET<Point2D>();
}
public boolean isEmpty() // is the set empty?
{
return points.isEmpty();
}
public int size() // number of points in the set
{
return points.size();
}
public void insert(Point2D p) // add the point to the set (if it is not already in the set)
{
validatePoint(p);
if (!contains(p)) {
points.add(p);
}
}
public boolean contains(Point2D p) // does the set contain point p?
{
validatePoint(p);
return points.contains(p);
}
public void draw() // draw all points to standard draw
{
for (Point2D p : points) {
p.draw();
}
}
public Iterable<Point2D> range(RectHV rect) // all points that are inside the rectangle (or on the boundary)
{
if (rect == null) throw new IllegalArgumentException();
return null;
}
public Point2D nearest(Point2D p) // a nearest neighbor in the set to point p; null if the set is empty
{
validatePoint(p);
if (isEmpty()) {
return null;
}
Point2D result = p;
double distance = Double.POSITIVE_INFINITY;
for (Point2D point : points) {
double t = point.distanceTo(p);
if (t < distance) {
distance = t;
result = point;
}
}
return result;
}
private void validatePoint(Point2D p) {
if (p == null) {
throw new IllegalArgumentException();
}
}
public static void main(String[] args) // unit testing of the methods (optional)
{}
}