-
Notifications
You must be signed in to change notification settings - Fork 0
/
PointSET.java
70 lines (53 loc) · 1.65 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
import edu.princeton.cs.algs4.Point2D;
import edu.princeton.cs.algs4.RectHV;
import edu.princeton.cs.algs4.SET;
public class PointSET {
private final SET<Point2D> points;
public PointSET() {
points = new SET<Point2D>();
}
public boolean isEmpty() {
return points.isEmpty();
}
public int size() {
return points.size();
}
public void insert(Point2D p) {
if (p == null) throw new IllegalArgumentException();
points.add(p);
}
public boolean contains(Point2D p) {
if (p == null) throw new IllegalArgumentException();
return points.contains(p);
}
public void draw() {
for (Point2D point: points) {
point.draw();
}
}
public Iterable<Point2D> range(RectHV rect) {
if (rect == null) throw new IllegalArgumentException();
SET<Point2D> rangePoints = new SET<Point2D>();
for (Point2D point: points) {
if (rect.contains(point)) {
rangePoints.add(point);
}
}
return rangePoints;
}
public Point2D nearest(Point2D p) {
if (p == null) throw new IllegalArgumentException();
if (isEmpty()) return null;
Point2D nearestPoint = null;
for (Point2D point: points) {
if (nearestPoint == null) {
nearestPoint = point;
continue;
}
if (p.distanceSquaredTo(point) < p.distanceSquaredTo(nearestPoint)) {
nearestPoint = point;
}
}
return nearestPoint;
}
}