Lines Matching refs:stroke
48 stroke has more than the optimal number of quadratics and lines */
118 struct SkQuadConstruct { // The state of the quad stroke under construction.
214 kSplit_ResultType, // the caller should split the quad stroke in two
216 kQuad_ResultType, // the caller should (continue to try to) add a quad stroke
272 ResultType strokeCloseEnough(const SkPoint stroke[3], const SkPoint ray[2],
725 /* If the stroke consists of a moveTo followed by a degenerate curve, treat it
763 /* If the stroke consists of a moveTo followed by a degenerate curve, treat it
904 // Find the intersection of the stroke tangents to construct a stroke quad.
905 // Return whether the stroke is a degenerate (a line), a quad, or must be split.
961 // Given a cubic and a t-range, determine if the stroke can be described by a quadratic.
1025 SkPathStroker::ResultType SkPathStroker::strokeCloseEnough(const SkPoint stroke[3],
1027 SkPoint strokeMid = SkEvalQuadAt(stroke, SK_ScalarHalf);
1028 // measure the distance from the curve to the quad-stroke midpoint, compare to radius
1043 if (!ptInQuadBounds(stroke, ray[0])) { // if far, subdivide
1045 "!pt_in_quad_bounds(stroke=(%g,%g %g,%g %g,%g), ray[0]=%g,%g)",
1046 stroke[0].fX, stroke[0].fY, stroke[1].fX, stroke[1].fY, stroke[2].fX, stroke[2].fY,
1049 // measure the curve ray distance to the quad-stroke
1051 int rootCount = intersect_quad_ray(ray, stroke, roots);
1056 SkPoint quadPt = SkEvalQuadAt(stroke, roots[0]);
1076 // get the quadratic approximation of the stroke
1083 // project a ray from the curve to the stroke
1092 // get the quadratic approximation of the stroke
1099 // project a ray from the curve to the stroke
1108 // get the quadratic approximation of the stroke
1126 // project a ray from the curve to the stroke
1165 const SkPoint* stroke = quadPts->fQuad;
1166 path->quadTo(stroke[1].fX, stroke[1].fY, stroke[2].fX, stroke[2].fY);
1216 const SkPoint* stroke = quadPts->fQuad;
1218 path->quadTo(stroke[1].fX, stroke[1].fY, stroke[2].fX, stroke[2].fY);
1248 const SkPoint* stroke = quadPts->fQuad;
1250 path->quadTo(stroke[1].fX, stroke[1].fY, stroke[2].fX, stroke[2].fY);
1284 /* If the stroke consists of a moveTo followed by a degenerate curve, treat it
1332 // emit the join even if one stroke succeeded but the last one failed
1333 // this avoids reversing an inner stroke with a partial path followed by another moveto
1393 // If src==dst, then we use a tmp path to record the stroke, and then swap
1446 // We can always ignore centers for stroke and fill convex line-only paths
1481 /* If the stroke consists of a moveTo followed by a close, treat it
1488 /* If the stroke consists of a moveTo followed by one or more zero-length
1514 // a convex stroke, but testing has proved otherwise.
1518 // this test results in a non-convex stroke :(