| java.lang.Object
 org.apache.harmony.awt.gl.Crossing
| Crossing | | public class Crossing (Code) | | |
| Inner Class :public static class QuadCurve | |
| Inner Class :public static class CubicCurve | |
| Method Summary | |
| static int | crossBound(double bound, int bc, double py1, double py2)
| | public static int | crossCubic(double x1, double y1, double cx1, double cy1, double cx2, double cy2, double x2, double y2, double x, double y)
| | public static int | crossLine(double x1, double y1, double x2, double y2, double x, double y)
Returns how many times ray from point (x,y) cross line. | | public static int | crossPath(PathIterator p, double x, double y)
| | public static int | crossQuad(double x1, double y1, double cx, double cy, double x2, double y2, double x, double y)
| | public static int | crossShape(Shape s, double x, double y)
| | static int | fixRoots(double res, int rc)
Excludes double roots. | | public static int | intersectCubic(double x1, double y1, double cx1, double cy1, double cx2, double cy2, double x2, double y2, double rx1, double ry1, double rx2, double ry2)
| | public static int | intersectLine(double x1, double y1, double x2, double y2, double rx1, double ry1, double rx2, double ry2)
| | public static int | intersectPath(PathIterator p, double x, double y, double w, double h)
| | public static int | intersectQuad(double x1, double y1, double cx, double cy, double x2, double y2, double rx1, double ry1, double rx2, double ry2)
| | public static int | intersectShape(Shape s, double x, double y, double w, double h)
| | public static boolean | isInsideEvenOdd(int cross)
| | public static boolean | isInsideNonZero(int cross)
| | public static boolean | isZero(double val)
| | public static int | solveCubic(double eqn, double res)
| | public static int | solveQuad(double eqn, double res)
| | static void | sortBound(double bound, int bc)
|
| CROSSING | | final public static int CROSSING(Code) | | Rectangle cross segment
|
| DELTA | | final static double DELTA(Code) | | Allowable tolerance for bounds comparison
|
| ROOT_DELTA | | final static double ROOT_DELTA(Code) | | If roots have distance less then ROOT_DELTA they are double
|
| UNKNOWN | | final static int UNKNOWN(Code) | | Unknown crossing result
|
| crossBound | | static int crossBound(double bound, int bc, double py1, double py2)(Code) | | Returns are bounds intersect or not intersect rectangle
|
| crossCubic | | public static int crossCubic(double x1, double y1, double cx1, double cy1, double cx2, double cy2, double x2, double y2, double x, double y)(Code) | | Returns how many times ray from point (x,y) cross cubic curve
|
| crossLine | | public static int crossLine(double x1, double y1, double x2, double y2, double x, double y)(Code) | | Returns how many times ray from point (x,y) cross line.
|
| crossPath | | public static int crossPath(PathIterator p, double x, double y)(Code) | | Returns how many times ray from point (x,y) cross path
|
| crossQuad | | public static int crossQuad(double x1, double y1, double cx, double cy, double x2, double y2, double x, double y)(Code) | | Returns how many times ray from point (x,y) cross quard curve
|
| crossShape | | public static int crossShape(Shape s, double x, double y)(Code) | | Returns how many times ray from point (x,y) cross shape
|
| fixRoots | | static int fixRoots(double res, int rc)(Code) | | Excludes double roots. Roots are double if they lies enough close with each other.
Parameters:
res - - the roots
Parameters:
rc - - the roots count new roots count |
| intersectCubic | | public static int intersectCubic(double x1, double y1, double cx1, double cy1, double cx2, double cy2, double x2, double y2, double rx1, double ry1, double rx2, double ry2)(Code) | | Returns how many times rectangle stripe cross cubic curve or the are intersect
|
| intersectLine | | public static int intersectLine(double x1, double y1, double x2, double y2, double rx1, double ry1, double rx2, double ry2)(Code) | | Returns how many times rectangle stripe cross line or the are intersect
|
| intersectPath | | public static int intersectPath(PathIterator p, double x, double y, double w, double h)(Code) | | Returns how many times rectangle stripe cross path or the are intersect
|
| intersectQuad | | public static int intersectQuad(double x1, double y1, double cx, double cy, double x2, double y2, double rx1, double ry1, double rx2, double ry2)(Code) | | Returns how many times rectangle stripe cross quad curve or the are intersect
|
| intersectShape | | public static int intersectShape(Shape s, double x, double y, double w, double h)(Code) | | Returns how many times rectangle stripe cross shape or the are intersect
|
| isInsideEvenOdd | | public static boolean isInsideEvenOdd(int cross)(Code) | | Returns true if cross count correspond inside location for even-odd path rule
|
| isInsideNonZero | | public static boolean isInsideNonZero(int cross)(Code) | | Returns true if cross count correspond inside location for non zero path rule
|
| isZero | | public static boolean isZero(double val)(Code) | | Returns true if value enough small
|
| solveCubic | | public static int solveCubic(double eqn, double res)(Code) | | Solves cubic equation
Parameters:
eqn - - the coefficients of the equation
Parameters:
res - - the roots of the equation a number of roots |
| solveQuad | | public static int solveQuad(double eqn, double res)(Code) | | Solves quadratic equation
Parameters:
eqn - - the coefficients of the equation
Parameters:
res - - the roots of the equation a number of roots |
| sortBound | | static void sortBound(double bound, int bc)(Code) | | Sort bound array
|
|
|