diff options
Diffstat (limited to 'libjava/java/awt/geom/Area.java')
| -rw-r--r-- | libjava/java/awt/geom/Area.java | 23 |
1 files changed, 15 insertions, 8 deletions
diff --git a/libjava/java/awt/geom/Area.java b/libjava/java/awt/geom/Area.java index 68f905f08f4..782552940f9 100644 --- a/libjava/java/awt/geom/Area.java +++ b/libjava/java/awt/geom/Area.java @@ -89,13 +89,15 @@ public class Area implements Shape, Cloneable /** * Segment vectors containing solid areas and holes + * This is package-private to avoid an accessor method. */ - private Vector solids; + Vector solids; /** * Segment vectors containing solid areas and holes + * This is package-private to avoid an accessor method. */ - private Vector holes; + Vector holes; /** * Vector (temporary) storing curve-curve intersections @@ -1315,9 +1317,10 @@ public class Area implements Shape, Cloneable * This is a reasonably accurate method, although the recursion depth * is typically around 20, the bounding-box tests allow for significant * pruning of the subdivision tree. + * + * This is package-private to avoid an accessor method. */ - private Intersection[] cubicCubicIntersect(CubicSegment curve1, - CubicSegment curve2) + Intersection[] cubicCubicIntersect(CubicSegment curve1, CubicSegment curve2) { Rectangle2D r1 = curve1.getBounds(); Rectangle2D r2 = curve2.getBounds(); @@ -1349,8 +1352,9 @@ public class Area implements Shape, Cloneable * Or null if no intersections are found1 * This is done through combining the line's equation with the * parametric form of the Bezier and solving the resulting quadratic. + * This is package-private to avoid an accessor method. */ - private Intersection[] lineQuadIntersect(LineSegment l, QuadSegment c) + Intersection[] lineQuadIntersect(LineSegment l, QuadSegment c) { double[] y = new double[3]; double[] x = new double[3]; @@ -1453,8 +1457,9 @@ public class Area implements Shape, Cloneable * Returns the intersections between a line and a cubic segment * This is done through combining the line's equation with the * parametric form of the Bezier and solving the resulting quadratic. + * This is package-private to avoid an accessor method. */ - private Intersection[] lineCubicIntersect(LineSegment l, CubicSegment c) + Intersection[] lineCubicIntersect(LineSegment l, CubicSegment c) { double[] y = new double[4]; double[] x = new double[4]; @@ -1560,8 +1565,9 @@ public class Area implements Shape, Cloneable /** * Returns the intersection between two lines, or null if there is no * intersection. + * This is package-private to avoid an accessor method. */ - private Intersection linesIntersect(LineSegment a, LineSegment b) + Intersection linesIntersect(LineSegment a, LineSegment b) { Point2D P1 = a.P1; Point2D P2 = a.P2; @@ -1605,8 +1611,9 @@ public class Area implements Shape, Cloneable /** * Determines if two points are equal, within an error margin * 'snap distance' + * This is package-private to avoid an accessor method. */ - private boolean pointEquals(Point2D a, Point2D b) + boolean pointEquals(Point2D a, Point2D b) { return (a.equals(b) || a.distance(b) < PE_EPSILON); } |