JavaFX 24 · com.sun.javafx.geom.Shape · APIdia, the JavaDoc alternative

Modifier and Type	Field and Description
public static final int	OUT_BOTTOM The bitmask that indicates that a point lies below this `Rectangle2D`.
public static final int	OUT_LEFT The bitmask that indicates that a point lies to the left of this `Rectangle2D`.
public static final int	OUT_RIGHT The bitmask that indicates that a point lies to the right of this `Rectangle2D`.
public static final int	OUT_TOP The bitmask that indicates that a point lies above this `Rectangle2D`.
public static final int	RECT_INTERSECTS The rectangle intersection test counts the number of times that the path crosses through the shadow that the rectangle projects to the right towards (x => +INFINITY).

Access	Constructor and Description
public	Shape()

Method Summary

Modifier and Type	Method and Description
public static void	accumulate(float[] bbox, Shape s, BaseTransform tx)
public static void	accumulateCubic(float[] bbox, int off, float v0, float vc0, float vc1, float v1)
public static void	accumulateCubic(float[] bbox, int off, float t, float v0, float vc0, float vc1, float v1)
public static void	accumulateQuad(float[] bbox, int off, float v0, float vc, float v1)
public abstract boolean	Returns: `true` if the specified coordinates are inside the `Shape` boundary; `false` otherwise. contains(float the specified X coordinate to be tested x, float the specified Y coordinate to be tested y) Tests if the specified coordinates are inside the boundary of the `Shape`.
public boolean	Returns: `true` if the specified `Point2D` is inside the boundary of the `Shape`; `false` otherwise. contains(Point2D the specified `Point2D` to be tested p) Tests if a specified `Point2D` is inside the boundary of the `Shape`.
public abstract boolean	Returns: `true` if the interior of the `Shape` entirely contains the specified rectangular area; `false` otherwise or, if the `Shape` contains the rectangular area and the `intersects` method returns `true` and the containment calculations would be too expensive to perform. contains(float the X coordinate of the upper-left corner of the specified rectangular area x, float the Y coordinate of the upper-left corner of the specified rectangular area y, float the width of the specified rectangular area w, float the height of the specified rectangular area h) Tests if the interior of the `Shape` entirely contains the specified rectangular area.
public boolean	Returns: `true` if the interior of the `Shape` entirely contains the `RectBounds`; `false` otherwise or, if the `Shape` contains the `RectBounds` and the `intersects` method returns `true` and the containment calculations would be too expensive to perform. contains(RectBounds The specified `RectBounds` r) Tests if the interior of the `Shape` entirely contains the specified `RectBounds`.
public abstract Shape	Returns: a copy of this shape copy() Returns a new copy of this `Shape` instance.
public abstract RectBounds	Returns: an instance of `RectBounds` getBounds() Note that there is no guarantee that the returned `RectBounds` is the smallest bounding box that encloses the `Shape`, only that the `Shape` lies entirely within the indicated `RectBounds`.
public abstract PathIterator	Returns: a new `PathIterator` object, which independently traverses the geometry of the `Shape`. getPathIterator(BaseTransform an optional `BaseTransform` to be applied to the coordinates as they are returned in the iteration, or `null` if untransformed coordinates are desired tx) Returns an iterator object that iterates along the `Shape` boundary and provides access to the geometry of the `Shape` outline.
public abstract PathIterator	Returns: a new `PathIterator` that independently traverses a flattened view of the geometry of the `Shape`. getPathIterator(BaseTransform an optional `BaseTransform` to be applied to the coordinates as they are returned in the iteration, or `null` if untransformed coordinates are desired tx, float the maximum distance that the line segments used to approximate the curved segments are allowed to deviate from any point on the original curve flatness) Returns an iterator object that iterates along the `Shape` boundary and provides access to a flattened view of the `Shape` outline geometry.
public abstract boolean	Returns: `true` if the interior of the `Shape` and the interior of the rectangular area intersect, or are both highly likely to intersect and intersection calculations would be too expensive to perform; `false` otherwise. intersects(float the X coordinate of the upper-left corner of the specified rectangular area x, float the Y coordinate of the upper-left corner of the specified rectangular area y, float the width of the specified rectangular area w, float the height of the specified rectangular area h) Tests if the interior of the `Shape` intersects the interior of a specified rectangular area.
public boolean	Returns: `true` if the interior of the `Shape` and the interior of the rectangular area intersect, or are both highly likely to intersect and intersection calculations would be too expensive to perform; `false` otherwise. intersects(RectBounds r) Tests if the interior of the `Shape` intersects the interior of a specified rectangular area.
pack-priv static boolean	intersectsLine(float rx1, float ry1, float rwidth, float rheight, float x1, float y1, float x2, float y2) Tests if the specified line segment intersects the interior of the rectangle denoted by rx1, ry1, rx2, ry2.
pack-priv static int	outcode(float rx, float ry, float rwidth, float rheight, float x, float y)
public static int	pointCrossingsForCubic(float px, float py, float x0, float y0, float xc0, float yc0, float xc1, float yc1, float x1, float y1, int level) Calculates the number of times the cubic from (x0,y0) to (x1,y1) crosses the ray extending to the right from (px,py).
public static int	pointCrossingsForLine(float px, float py, float x0, float y0, float x1, float y1) Calculates the number of times the line from (x0,y0) to (x1,y1) crosses the ray extending to the right from (px,py).
public static int	pointCrossingsForPath(PathIterator pi, float px, float py) Calculates the number of times the given path crosses the ray extending to the right from (px,py).
public static int	pointCrossingsForQuad(float px, float py, float x0, float y0, float xc, float yc, float x1, float y1, int level) Calculates the number of times the quad from (x0,y0) to (x1,y1) crosses the ray extending to the right from (px,py).
public static int	rectCrossingsForCubic(int crossings, float rxmin, float rymin, float rxmax, float rymax, float x0, float y0, float xc0, float yc0, float xc1, float yc1, float x1, float y1, int level) Accumulate the number of times the cubic crosses the shadow extending to the right of the rectangle.
public static int	rectCrossingsForLine(int crossings, float rxmin, float rymin, float rxmax, float rymax, float x0, float y0, float x1, float y1) Accumulate the number of times the line crosses the shadow extending to the right of the rectangle.
public static int	rectCrossingsForPath(PathIterator pi, float rxmin, float rymin, float rxmax, float rymax) Accumulate the number of times the path crosses the shadow extending to the right of the rectangle.
public static int	rectCrossingsForQuad(int crossings, float rxmin, float rymin, float rxmax, float rymax, float x0, float y0, float xc, float yc, float x1, float y1, int level) Accumulate the number of times the quad crosses the shadow extending to the right of the rectangle.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

OUT_BOTTOM	back to summary
public static final int OUT_BOTTOM The bitmask that indicates that a point lies below this `Rectangle2D`.

OUT_LEFT	back to summary
public static final int OUT_LEFT The bitmask that indicates that a point lies to the left of this `Rectangle2D`.

OUT_RIGHT	back to summary
public static final int OUT_RIGHT The bitmask that indicates that a point lies to the right of this `Rectangle2D`.

OUT_TOP	back to summary
public static final int OUT_TOP The bitmask that indicates that a point lies above this `Rectangle2D`.

RECT_INTERSECTS	back to summary
public static final int RECT_INTERSECTS The rectangle intersection test counts the number of times that the path crosses through the shadow that the rectangle projects to the right towards (x => +INFINITY). During processing of the path it actually counts every time the path crosses either or both of the top and bottom edges of that shadow. If the path enters from the top, the count is incremented. If it then exits back through the top, the same way it came in, the count is decremented and there is no impact on the winding count. If, instead, the path exits out the bottom, then the count is incremented again and a full pass through the shadow is indicated by the winding count having been incremented by 2. Thus, the winding count that it accumulates is actually float the real winding count. Since the path is continuous, the final answer should be a multiple of 2, otherwise there is a logic error somewhere. If the path ever has a direct hit on the rectangle, then a special value is returned. This special value terminates all ongoing accumulation on up through the call chain and ends up getting returned to the calling function which can then produce an answer directly. For intersection tests, the answer is always "true" if the path intersects the rectangle. For containment tests, the answer is always "false" if the path intersects the rectangle. Thus, no further processing is ever needed if an intersection occurs.

Shape	back to summary
public Shape()

Method Detail

accumulate	back to summary
public static void accumulate(float[] bbox, Shape s, BaseTransform tx)

accumulateCubic	back to summary
public static void accumulateCubic(float[] bbox, int off, float v0, float vc0, float vc1, float v1)

accumulateCubic	back to summary
public static void accumulateCubic(float[] bbox, int off, float t, float v0, float vc0, float vc1, float v1)

accumulateQuad	back to summary
public static void accumulateQuad(float[] bbox, int off, float v0, float vc, float v1)

contains back to summary

contains	back to summary
public abstract boolean contains(float x, float y) Tests if the specified coordinates are inside the boundary of the `Shape`. Parameters x:float the specified X coordinate to be tested y:float the specified Y coordinate to be tested Returns:boolean `true` if the specified coordinates are inside the `Shape` boundary; `false` otherwise.

public abstract boolean contains(float x, float y)

Tests if the specified coordinates are inside the boundary of the Shape.

Parameters

x:float: the specified X coordinate to be tested
y:float: the specified Y coordinate to be tested

Returns:boolean

true if the specified coordinates are inside the Shape boundary; false otherwise.

contains back to summary

contains	back to summary
public boolean contains(Point2D p) Tests if a specified `Point2D` is inside the boundary of the `Shape`. Parameters p:Point2D the specified `Point2D` to be tested Returns:boolean `true` if the specified `Point2D` is inside the boundary of the `Shape`; `false` otherwise.

public boolean contains(Point2D p)

Tests if a specified Point2D is inside the boundary of the Shape.

Parameters

p:Point2D: the specified Point2D to be tested

Returns:boolean

true if the specified Point2D is inside the boundary of the Shape; false otherwise.

contains back to summary

contains	back to summary
public abstract boolean contains(float x, float y, float w, float h) Tests if the interior of the `Shape` entirely contains the specified rectangular area. All coordinates that lie inside the rectangular area must lie within the `Shape` for the entire rectanglar area to be considered contained within the `Shape`. The `Shape.contains()` method allows a `Shape` implementation to conservatively return `false` when: the `intersect` method returns `true` and the calculations to determine whether or not the `Shape` entirely contains the rectangular area are prohibitively expensive. This means that for some `Shapes` this method might return `false` even though the `Shape` contains the rectangular area. The `Area` class performs more accurate geometric computations than most `Shape` objects and therefore can be used if a more precise answer is required. Parameters x:float the X coordinate of the upper-left corner of the specified rectangular area y:float the Y coordinate of the upper-left corner of the specified rectangular area w:float the width of the specified rectangular area h:float the height of the specified rectangular area Returns:boolean `true` if the interior of the `Shape` entirely contains the specified rectangular area; `false` otherwise or, if the `Shape` contains the rectangular area and the `intersects` method returns `true` and the containment calculations would be too expensive to perform. See Also `intersects`

public abstract boolean contains(float x, float y, float w, float h)

Tests if the interior of the Shape entirely contains the specified rectangular area. All coordinates that lie inside the rectangular area must lie within the Shape for the entire rectanglar area to be considered contained within the Shape.

The Shape.contains() method allows a Shape implementation to conservatively return false when:

the intersect method returns true and
the calculations to determine whether or not the Shape entirely contains the rectangular area are prohibitively expensive.

This means that for some Shapes this method might return false even though the Shape contains the rectangular area. The Area class performs more accurate geometric computations than most Shape objects and therefore can be used if a more precise answer is required.

Parameters

x:float: the X coordinate of the upper-left corner of the specified rectangular area
y:float: the Y coordinate of the upper-left corner of the specified rectangular area
w:float: the width of the specified rectangular area
h:float: the height of the specified rectangular area

Returns:boolean

true if the interior of the Shape entirely contains the specified rectangular area; false otherwise or, if the Shape contains the rectangular area and the intersects method returns true and the containment calculations would be too expensive to perform.

See Also

intersects

contains back to summary

contains	back to summary
public boolean contains(RectBounds r) Tests if the interior of the `Shape` entirely contains the specified `RectBounds`. The `Shape.contains()` method allows a `Shape` implementation to conservatively return `false` when: the `intersect` method returns `true` and the calculations to determine whether or not the `Shape` entirely contains the `RectBounds` are prohibitively expensive. This means that for some `Shapes` this method might return `false` even though the `Shape` contains the `RectBounds`. The `Area` class performs more accurate geometric computations than most `Shape` objects and therefore can be used if a more precise answer is required. Parameters r:RectBounds The specified `RectBounds` Returns:boolean `true` if the interior of the `Shape` entirely contains the `RectBounds`; `false` otherwise or, if the `Shape` contains the `RectBounds` and the `intersects` method returns `true` and the containment calculations would be too expensive to perform. See Also `contains(float, float, float, float)`

public boolean contains(RectBounds r)

Tests if the interior of the Shape entirely contains the specified RectBounds. The Shape.contains() method allows a Shape implementation to conservatively return false when:

the intersect method returns true and
the calculations to determine whether or not the Shape entirely contains the RectBounds are prohibitively expensive.

This means that for some Shapes this method might return false even though the Shape contains the RectBounds. The Area class performs more accurate geometric computations than most Shape objects and therefore can be used if a more precise answer is required.

Parameters

r:RectBounds: The specified RectBounds

Returns:boolean

true if the interior of the Shape entirely contains the RectBounds; false otherwise or, if the Shape contains the RectBounds and the intersects method returns true and the containment calculations would be too expensive to perform.

See Also

contains(float, float, float, float)

copy back to summary

copy	back to summary
public abstract Shape copy() Returns a new copy of this `Shape` instance. Returns:Shape a copy of this shape

public abstract Shape copy()

Returns a new copy of this Shape instance.

Returns:Shape: a copy of this shape

getBounds back to summary

getBounds	back to summary
public abstract RectBounds getBounds() Note that there is no guarantee that the returned `RectBounds` is the smallest bounding box that encloses the `Shape`, only that the `Shape` lies entirely within the indicated `RectBounds`. Returns:RectBounds an instance of `RectBounds`

public abstract RectBounds getBounds()

Note that there is no guarantee that the returned RectBounds is the smallest bounding box that encloses the Shape, only that the Shape lies entirely within the indicated RectBounds.

Returns:RectBounds: an instance of RectBounds

getPathIterator back to summary

getPathIterator	back to summary
public abstract PathIterator getPathIterator(BaseTransform tx) Returns an iterator object that iterates along the `Shape` boundary and provides access to the geometry of the `Shape` outline. If an optional `BaseTransform` is specified, the coordinates returned in the iteration are transformed accordingly. Each call to this method returns a fresh `PathIterator` object that traverses the geometry of the `Shape` object independently from any other `PathIterator` objects in use at the same time. It is recommended, but not guaranteed, that objects implementing the `Shape` interface isolate iterations that are in process from any changes that might occur to the original object's geometry during such iterations. Parameters tx:BaseTransform an optional `BaseTransform` to be applied to the coordinates as they are returned in the iteration, or `null` if untransformed coordinates are desired Returns:PathIterator a new `PathIterator` object, which independently traverses the geometry of the `Shape`.

public abstract PathIterator getPathIterator(BaseTransform tx)

Returns an iterator object that iterates along the Shape boundary and provides access to the geometry of the Shape outline. If an optional BaseTransform is specified, the coordinates returned in the iteration are transformed accordingly.

Each call to this method returns a fresh PathIterator object that traverses the geometry of the Shape object independently from any other PathIterator objects in use at the same time.

It is recommended, but not guaranteed, that objects implementing the Shape interface isolate iterations that are in process from any changes that might occur to the original object's geometry during such iterations.

Parameters

tx:BaseTransform: an optional BaseTransform to be applied to the coordinates as they are returned in the iteration, or null if untransformed coordinates are desired

Returns:PathIterator

a new PathIterator object, which independently traverses the geometry of the Shape.

getPathIterator back to summary

getPathIterator	back to summary
public abstract PathIterator getPathIterator(BaseTransform tx, float flatness) Returns an iterator object that iterates along the `Shape` boundary and provides access to a flattened view of the `Shape` outline geometry. Only SEG_MOVETO, SEG_LINETO, and SEG_CLOSE point types are returned by the iterator. If an optional `BaseTransform` is specified, the coordinates returned in the iteration are transformed accordingly. The amount of subdivision of the curved segments is controlled by the `flatness` parameter, which specifies the maximum distance that any point on the unflattened transformed curve can deviate from the returned flattened path segments. Note that a limit on the accuracy of the flattened path might be silently imposed, causing very small flattening parameters to be treated as larger values. This limit, if there is one, is defined by the particular implementation that is used. Each call to this method returns a fresh `PathIterator` object that traverses the `Shape` object geometry independently from any other `PathIterator` objects in use at the same time. It is recommended, but not guaranteed, that objects implementing the `Shape` interface isolate iterations that are in process from any changes that might occur to the original object's geometry during such iterations. Parameters tx:BaseTransform an optional `BaseTransform` to be applied to the coordinates as they are returned in the iteration, or `null` if untransformed coordinates are desired flatness:float the maximum distance that the line segments used to approximate the curved segments are allowed to deviate from any point on the original curve Returns:PathIterator a new `PathIterator` that independently traverses a flattened view of the geometry of the `Shape`.

public abstract PathIterator getPathIterator(BaseTransform tx, float flatness)

Returns an iterator object that iterates along the Shape boundary and provides access to a flattened view of the Shape outline geometry.

Only SEG_MOVETO, SEG_LINETO, and SEG_CLOSE point types are returned by the iterator.

If an optional BaseTransform is specified, the coordinates returned in the iteration are transformed accordingly.

The amount of subdivision of the curved segments is controlled by the flatness parameter, which specifies the maximum distance that any point on the unflattened transformed curve can deviate from the returned flattened path segments. Note that a limit on the accuracy of the flattened path might be silently imposed, causing very small flattening parameters to be treated as larger values. This limit, if there is one, is defined by the particular implementation that is used.

Each call to this method returns a fresh PathIterator object that traverses the Shape object geometry independently from any other PathIterator objects in use at the same time.

Parameters

tx:BaseTransform: an optional BaseTransform to be applied to the coordinates as they are returned in the iteration, or null if untransformed coordinates are desired
flatness:float: the maximum distance that the line segments used to approximate the curved segments are allowed to deviate from any point on the original curve

Returns:PathIterator

a new PathIterator that independently traverses a flattened view of the geometry of the Shape.

intersects back to summary

intersects	back to summary
public abstract boolean intersects(float x, float y, float w, float h) Tests if the interior of the `Shape` intersects the interior of a specified rectangular area. The rectangular area is considered to intersect the `Shape` if any point is contained in both the interior of the `Shape` and the specified rectangular area. The `Shape.intersects()` method allows a `Shape` implementation to conservatively return `true` when: there is a high probability that the rectangular area and the `Shape` intersect, but the calculations to accurately determine this intersection are prohibitively expensive. This means that for some `Shapes` this method might return `true` even though the rectangular area does not intersect the `Shape`. The `Area` class performs more accurate computations of geometric intersection than most `Shape` objects and therefore can be used if a more precise answer is required. Parameters x:float the X coordinate of the upper-left corner of the specified rectangular area y:float the Y coordinate of the upper-left corner of the specified rectangular area w:float the width of the specified rectangular area h:float the height of the specified rectangular area Returns:boolean `true` if the interior of the `Shape` and the interior of the rectangular area intersect, or are both highly likely to intersect and intersection calculations would be too expensive to perform; `false` otherwise.

public abstract boolean intersects(float x, float y, float w, float h)

Tests if the interior of the Shape intersects the interior of a specified rectangular area. The rectangular area is considered to intersect the Shape if any point is contained in both the interior of the Shape and the specified rectangular area.

The Shape.intersects() method allows a Shape implementation to conservatively return true when:

there is a high probability that the rectangular area and the Shape intersect, but
the calculations to accurately determine this intersection are prohibitively expensive.

This means that for some Shapes this method might return true even though the rectangular area does not intersect the Shape. The Area class performs more accurate computations of geometric intersection than most Shape objects and therefore can be used if a more precise answer is required.

Parameters

x:float: the X coordinate of the upper-left corner of the specified rectangular area
y:float: the Y coordinate of the upper-left corner of the specified rectangular area
w:float: the width of the specified rectangular area
h:float: the height of the specified rectangular area

Returns:boolean

true if the interior of the Shape and the interior of the rectangular area intersect, or are both highly likely to intersect and intersection calculations would be too expensive to perform; false otherwise.

intersects back to summary

intersects	back to summary
public boolean intersects(RectBounds r) Tests if the interior of the `Shape` intersects the interior of a specified rectangular area. The rectangular area is considered to intersect the `Shape` if any point is contained in both the interior of the `Shape` and the specified rectangular area. The `Shape.intersects()` method allows a `Shape` implementation to conservatively return `true` when: there is a high probability that the rectangular area and the `Shape` intersect, but the calculations to accurately determine this intersection are prohibitively expensive. This means that for some `Shapes` this method might return `true` even though the rectangular area does not intersect the `Shape`. The `Area` class performs more accurate computations of geometric intersection than most `Shape` objects and therefore can be used if a more precise answer is required. Returns:boolean `true` if the interior of the `Shape` and the interior of the rectangular area intersect, or are both highly likely to intersect and intersection calculations would be too expensive to perform; `false` otherwise.

public boolean intersects(RectBounds r)

The Shape.intersects() method allows a Shape implementation to conservatively return true when:

there is a high probability that the rectangular area and the Shape intersect, but
the calculations to accurately determine this intersection are prohibitively expensive.

Returns:boolean: true if the interior of the Shape and the interior of the rectangular area intersect, or are both highly likely to intersect and intersection calculations would be too expensive to perform; false otherwise.

intersectsLine	back to summary
pack-priv static boolean intersectsLine(float rx1, float ry1, float rwidth, float rheight, float x1, float y1, float x2, float y2) Tests if the specified line segment intersects the interior of the rectangle denoted by rx1, ry1, rx2, ry2.

outcode	back to summary
pack-priv static int outcode(float rx, float ry, float rwidth, float rheight, float x, float y)

pointCrossingsForCubic	back to summary
public static int pointCrossingsForCubic(float px, float py, float x0, float y0, float xc0, float yc0, float xc1, float yc1, float x1, float y1, int level) Calculates the number of times the cubic from (x0,y0) to (x1,y1) crosses the ray extending to the right from (px,py). If the point lies on a part of the curve, then no crossings are counted for that intersection. the level parameter should be 0 at the top-level call and will count up for each recursion level to prevent infinite recursion +1 is added for each crossing where the Y coordinate is increasing -1 is added for each crossing where the Y coordinate is decreasing

pointCrossingsForCubic

back to summary

public static int pointCrossingsForCubic(float px, float py, float x0, float y0, float xc0, float yc0, float xc1, float yc1, float x1, float y1, int level)

Calculates the number of times the cubic from (x0,y0) to (x1,y1) crosses the ray extending to the right from (px,py). If the point lies on a part of the curve, then no crossings are counted for that intersection. the level parameter should be 0 at the top-level call and will count up for each recursion level to prevent infinite recursion +1 is added for each crossing where the Y coordinate is increasing -1 is added for each crossing where the Y coordinate is decreasing

pointCrossingsForLine	back to summary
public static int pointCrossingsForLine(float px, float py, float x0, float y0, float x1, float y1) Calculates the number of times the line from (x0,y0) to (x1,y1) crosses the ray extending to the right from (px,py). If the point lies on the line, then no crossings are recorded. +1 is returned for a crossing where the Y coordinate is increasing -1 is returned for a crossing where the Y coordinate is decreasing

pointCrossingsForLine

back to summary

public static int pointCrossingsForLine(float px, float py, float x0, float y0, float x1, float y1)

Calculates the number of times the line from (x0,y0) to (x1,y1) crosses the ray extending to the right from (px,py). If the point lies on the line, then no crossings are recorded. +1 is returned for a crossing where the Y coordinate is increasing -1 is returned for a crossing where the Y coordinate is decreasing

pointCrossingsForPath	back to summary
public static int pointCrossingsForPath(PathIterator pi, float px, float py) Calculates the number of times the given path crosses the ray extending to the right from (px,py). If the point lies on a part of the path, then no crossings are counted for that intersection. +1 is added for each crossing where the Y coordinate is increasing -1 is added for each crossing where the Y coordinate is decreasing The return value is the sum of all crossings for every segment in the path. The path must start with a SEG_MOVETO, otherwise an exception is thrown. The caller must check p[xy] for NaN values. The caller may also reject infinite p[xy] values as well.

pointCrossingsForPath

back to summary

public static int pointCrossingsForPath(PathIterator pi, float px, float py)

Calculates the number of times the given path crosses the ray extending to the right from (px,py). If the point lies on a part of the path, then no crossings are counted for that intersection. +1 is added for each crossing where the Y coordinate is increasing -1 is added for each crossing where the Y coordinate is decreasing The return value is the sum of all crossings for every segment in the path. The path must start with a SEG_MOVETO, otherwise an exception is thrown. The caller must check p[xy] for NaN values. The caller may also reject infinite p[xy] values as well.

pointCrossingsForQuad	back to summary
public static int pointCrossingsForQuad(float px, float py, float x0, float y0, float xc, float yc, float x1, float y1, int level) Calculates the number of times the quad from (x0,y0) to (x1,y1) crosses the ray extending to the right from (px,py). If the point lies on a part of the curve, then no crossings are counted for that intersection. the level parameter should be 0 at the top-level call and will count up for each recursion level to prevent infinite recursion +1 is added for each crossing where the Y coordinate is increasing -1 is added for each crossing where the Y coordinate is decreasing

pointCrossingsForQuad

back to summary

public static int pointCrossingsForQuad(float px, float py, float x0, float y0, float xc, float yc, float x1, float y1, int level)

Calculates the number of times the quad from (x0,y0) to (x1,y1) crosses the ray extending to the right from (px,py). If the point lies on a part of the curve, then no crossings are counted for that intersection. the level parameter should be 0 at the top-level call and will count up for each recursion level to prevent infinite recursion +1 is added for each crossing where the Y coordinate is increasing -1 is added for each crossing where the Y coordinate is decreasing

rectCrossingsForCubic	back to summary
public static int rectCrossingsForCubic(int crossings, float rxmin, float rymin, float rxmax, float rymax, float x0, float y0, float xc0, float yc0, float xc1, float yc1, float x1, float y1, int level) Accumulate the number of times the cubic crosses the shadow extending to the right of the rectangle. See the comment for the RECT_INTERSECTS constant for more complete details.

rectCrossingsForLine	back to summary
public static int rectCrossingsForLine(int crossings, float rxmin, float rymin, float rxmax, float rymax, float x0, float y0, float x1, float y1) Accumulate the number of times the line crosses the shadow extending to the right of the rectangle. See the comment for the RECT_INTERSECTS constant for more complete details.

rectCrossingsForPath	back to summary
public static int rectCrossingsForPath(PathIterator pi, float rxmin, float rymin, float rxmax, float rymax) Accumulate the number of times the path crosses the shadow extending to the right of the rectangle. See the comment for the RECT_INTERSECTS constant for more complete details. The return value is the sum of all crossings for both the top and bottom of the shadow for every segment in the path, or the special value RECT_INTERSECTS if the path ever enters the interior of the rectangle. The path must start with a SEG_MOVETO, otherwise an exception is thrown. The caller must check r[xy]{min,max} for NaN values.

rectCrossingsForPath

back to summary

public static int rectCrossingsForPath(PathIterator pi, float rxmin, float rymin, float rxmax, float rymax)

Accumulate the number of times the path crosses the shadow extending to the right of the rectangle. See the comment for the RECT_INTERSECTS constant for more complete details. The return value is the sum of all crossings for both the top and bottom of the shadow for every segment in the path, or the special value RECT_INTERSECTS if the path ever enters the interior of the rectangle. The path must start with a SEG_MOVETO, otherwise an exception is thrown. The caller must check r[xy]{min,max} for NaN values.

rectCrossingsForQuad	back to summary
public static int rectCrossingsForQuad(int crossings, float rxmin, float rymin, float rxmax, float rymax, float x0, float y0, float xc, float yc, float x1, float y1, int level) Accumulate the number of times the quad crosses the shadow extending to the right of the rectangle. See the comment for the RECT_INTERSECTS constant for more complete details.

public abstract Class Shape

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail