Lines Matching refs:curves
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;
1118 curves = new float[8 * INIT_SIZE];
1129 if (end + n >= curves.length) {
1131 curves = Arrays.copyOf(curves, newSize);
1148 curves[end++] = x2; curves[end++] = y2;
1149 curves[end++] = x1; curves[end++] = y1;
1150 curves[end++] = x0; curves[end++] = y0;
1159 curves[end++] = x1; curves[end++] = y1;
1160 curves[end++] = x0; curves[end++] = y0;
1167 curves[end++] = x; curves[end++] = y;
1175 System.arraycopy(curves, end, pts, 0, ret - 2);
1185 io.curveTo(curves[end+0], curves[end+1],
1186 curves[end+2], curves[end+3],
1187 curves[end+4], curves[end+5]);
1190 io.quadTo(curves[end+0], curves[end+1],
1191 curves[end+2], curves[end+3]);
1194 io.lineTo(curves[end], curves[end+1]);
1218 ret += Arrays.toString(Arrays.copyOfRange(curves, end, end+type-2)) + "\n";