Searched refs:crossings (Results 1 - 5 of 5) sorted by relevance

/openjdk7/jdk/src/share/classes/sun/awt/geom/
H A DCurve.java114 * then no crossings are counted for that intersection.
117 * The return value is the sum of all crossings for every segment in
141 int crossings = 0;
146 crossings += pointCrossingsForLine(px, py,
156 crossings += pointCrossingsForLine(px, py,
165 crossings += pointCrossingsForQuad(px, py,
175 crossings += pointCrossingsForCubic(px, py,
185 crossings += pointCrossingsForLine(px, py,
196 crossings += pointCrossingsForLine(px, py,
200 return crossings;
481 rectCrossingsForLine(int crossings, double rxmin, double rymin, double rxmax, double rymax, double x0, double y0, double x1, double y1) argument
555 rectCrossingsForQuad(int crossings, double rxmin, double rymin, double rxmax, double rymax, double x0, double y0, double xc, double yc, double x1, double y1, int level) argument
631 rectCrossingsForCubic(int crossings, double rxmin, double rymin, double rxmax, double rymax, double x0, double y0, double xc0, double yc0, double xc1, double yc1, double x1, double y1, int level) argument
[all...]
/openjdk7/jdk/src/share/classes/java/awt/geom/
H A DPath2D.java480 int crossings = 0;
486 crossings +=
495 crossings +=
504 crossings +=
516 crossings +=
531 crossings +=
542 crossings +=
547 return crossings;
557 int crossings = 0;
560 crossings !
[all...]
H A DArea.java559 int crossings = 0;
562 crossings += c.crossingsFor(x, y);
564 return ((crossings & 1) == 1);
H A DCubicCurve2D.java1413 // We count the "Y" crossings to determine if the point is
1419 int crossings =
1426 return ((crossings & 1) == 1);
1478 int crossings = 0;
1480 crossings = Curve.rectCrossingsForLine(crossings,
1485 if (crossings == Curve.RECT_INTERSECTS) {
1486 return crossings;
1491 return Curve.rectCrossingsForCubic(crossings,
/openjdk7/jdk/src/share/classes/sun/java2d/pisces/
H A DRenderer.java34 private int[] crossings; field in class:Renderer.ScanlineIterator
37 // at minY, for example, might have no crossings). The x bounds will
38 // be accumulated as crossings are computed.
55 crossings = new int[INIT_CROSSINGS_SIZE];
89 int xings[] = this.crossings;
91 this.crossings = xings = new int[ptrs.length];
169 // X0, Y0, D*[X|Y], COUNT; not variables used for computing scanline crossings).
451 int[] crossings = it.crossings;
455 int lowx = crossings[
[all...]

Completed in 45 milliseconds