| /openjdk7/jdk/src/share/classes/sun/awt/geom/ |
| H A D | AreaOp.java | 99 // Note: the right curves should be an empty set with this op...
121 // Note: the right curves should be an empty set with this op...
136 /* Constants to tag the left and right curves in the edge list */
171 private static void addEdges(Vector edges, Vector curves, int curvetag) { argument
172 Enumeration enum_ = curves.elements();
285 // If the curves are equal, mark them to be
367 System.out.println("num curves = "+(right-left));
374 System.out.println("no more curves");
450 throw new InternalError("Odd number of new curves!");
|
| H A D | Crossings.java | 80 public static Crossings findCrossings(Vector curves, argument
85 Enumeration enum_ = curves.elements();
111 // two subdivided quadratic curves (2+4+4=10)
117 // three subdivided cubic curves (2+6+6+6=20)
|
| H A D | Order2.java | 50 public static void insert(Vector curves, double tmp[], argument
60 addInstance(curves, x0, y0, cx0, cy0, x1, y1, direction);
71 addInstance(curves, tmp[i0], tmp[i0 + 1], tmp[i0 + 2], tmp[i0 + 3],
73 addInstance(curves, tmp[i1], tmp[i1 + 1], tmp[i1 + 2], tmp[i1 + 3],
77 public static void addInstance(Vector curves, argument
83 curves.add(new Order2(x1, y1, cx0, cy0, x0, y0, -direction));
85 curves.add(new Order2(x0, y0, cx0, cy0, x1, y1, direction));
108 * Completely horizontal curves need to be eliminated by other
308 * First, remember that these curves are constructed to be monotonic
309 * in Y and totally horizontal curves hav
[all...] |
| H A D | Order3.java | 56 public static void insert(Vector curves, double tmp[], argument
67 addInstance(curves, x0, y0, cx0, cy0, cx1, cy1, x1, y1, direction);
93 addInstance(curves,
108 public static void addInstance(Vector curves, argument
115 curves.add(new Order3(x1, y1, cx1, cy1, cx0, cy0, x0, y0,
118 curves.add(new Order3(x0, y0, cx0, cy0, cx1, cy1, x1, y1,
158 * Completely horizontal curves need to be eliminated by other
582 * coalesces chains of curves into subpaths. The
|
| H A D | Curve.java | 41 public static void insertMove(Vector curves, double x, double y) { argument
42 curves.add(new Order0(x, y));
45 public static void insertLine(Vector curves, argument
50 curves.add(new Order1(x0, y0,
54 curves.add(new Order1(x1, y1,
62 public static void insertQuad(Vector curves, argument
68 Order2.insert(curves, coords,
77 Order2.insert(curves, coords,
85 public static void insertCubic(Vector curves, argument
91 Order3.insert(curves, coord
[all...] |
| /openjdk7/jdk/src/share/classes/java/awt/geom/ |
| H A D | Area.java | 102 private Vector curves; field in class:Area
109 curves = EmptyCurves;
124 curves = ((Area) s).curves;
126 curves = pathToCurves(s.getPathIterator(null));
131 Vector curves = new Vector();
136 // two subdivided quadratic curves (2+4+4=10)
142 // three subdivided cubic curves (2+6+6+6=20)
154 Curve.insertLine(curves, curx, cury, movx, movy);
157 Curve.insertMove(curves, mov
661 private Vector curves; field in class:AreaIterator
666 AreaIterator(Vector curves, AffineTransform at) argument
[all...] |
| /openjdk7/jdk/src/share/classes/sun/java2d/pisces/ |
| H A D | Stroker.java | 768 // enough room to store 2 curves: one for the current subdivision, the
883 // to get good offset curves a distance of w away from the middle curve.
921 // curves are monotonic in x and y.
926 // quadratic curves can't have inflection points
930 // now we must subdivide at points where one of the offset curves will have
1107 // a stack of polynomial curves where each curve shares endpoints with
1110 float[] curves; field in class:Stroker.PolyStack
1118 curves = new float[8 * INIT_SIZE];
1129 if (end + n >= curves.length) {
1131 curves
[all...] |