Lines Matching defs:fPts
214 SkPoint fPts[N];
221 fPts[i].fX = 20 + rand.nextUScalar1() * 640;
222 fPts[i].fY = 20 + rand.nextUScalar1() * 480;
260 path->moveTo(fPts[0]);
262 path->lineTo(fPts[i]);
270 canvas->drawPoints(SkCanvas::kPoints_PointMode, N, fPts, fPtsPaint);
286 if (r.intersects(SkRect::MakeXYWH(fPts[i].fX, fPts[i].fY, 1, 1))) {
288 fPts[i] = c->fCurr;
312 SkPoint fPts[N];
319 fPts[i].fX = 20 + rand.nextUScalar1() * 640;
320 fPts[i].fY = 20 + rand.nextUScalar1() * 480;
369 path->moveTo(fPts[0]);
372 path->quadTo(fPts[i], (fPts[i+1] + fPts[i]) * 0.5f);
374 path->quadTo(fPts[N-2], fPts[N-1]);
377 path->lineTo(fPts[i]);
406 canvas->drawPoints(SkCanvas::kPoints_PointMode, N, fPts, fPtsPaint);
413 if (r.intersects(SkRect::MakeXYWH(fPts[i].fX, fPts[i].fY, 1, 1))) {
415 fPts[i] = c->fCurr;
454 SkPoint fPts[N];
459 fPts[i].fX = 20 + rand.nextUScalar1() * 640;
460 fPts[i].fY = 20 + rand.nextUScalar1() * 480;
473 path.moveTo(fPts[0]);
474 path.cubicTo(fPts[1], fPts[2], fPts[3]);
482 int n = compute_parallel_to_base(fPts, t);
486 SkEvalCubicAt(fPts, t[i], &loc, &tan, nullptr);
491 canvas->drawLine(fPts[0], fPts[3], paint);
495 SkEvalCubicAt(fPts, 0.5f, &loc, nullptr, nullptr);
499 SkEvalCubicAt(fPts, 1.0f/3, &loc, nullptr, nullptr);
501 SkEvalCubicAt(fPts, 2.0f/3, &loc, nullptr, nullptr);
504 // n = SkFindCubicInflections(fPts, t);
511 for (SkPoint p : fPts) {
521 if (r.intersects(SkRect::MakeXYWH(fPts[i].fX, fPts[i].fY, 1, 1))) {
523 fPts[i] = c->fCurr;
560 SkPoint fPts[N];
561 SkPoint* fQuad = fPts + 4;
569 fPts[0] = { 90, 300 };
570 fPts[1] = { 30, 60 };
571 fPts[2] = { 250, 30 };
572 fPts[3] = { 350, 200 };
574 fQuad[0] = fPts[0] + SkVector{ 300, 0};
575 fQuad[1] = fPts[1] + SkVector{ 300, 0};
576 fQuad[2] = fPts[2] + SkVector{ 300, 0};
633 canvas->drawLine(fPts[0], fPts[3], paint);
644 SkVector v0 = (fPts[0] - fPts[1] - fPts[1] + fPts[2]) * fScale;
645 SkVector v1 = (fPts[1] - fPts[2] - fPts[2] + fPts[3]) * fScale;
650 int n = find_max_deviation_cubic(fPts, ts);
652 SkEvalCubicAt(fPts, ts[0], &anchor, nullptr, nullptr);
656 SkEvalCubicAt(fPts, ts[1], &anchor, nullptr, nullptr);
674 SkPoint p0 = SkEvalQuadAt(&fPts[0], fT),
675 p1 = SkEvalQuadAt(&fPts[1], fT),
678 draw_quad(fPts[0], fPts[1], fPts[2], SK_ColorRED);
681 draw_quad(fPts[1], fPts[2], fPts[3], SK_ColorBLUE);
698 path.moveTo(fPts[0]);
699 path.cubicTo(fPts[1], fPts[2], fPts[3]);
708 this->showFrame(canvas, fPts, 3, paint);
727 canvas->drawPath(SkPathBuilder().addPolygon(fPts, 4, false).detach(), paint);
730 for (SkPoint p : fPts) {
736 int n = SkFindCubicInflections(fPts, ts);
739 SkEvalCubicAt(fPts, ts[i], &p, nullptr, nullptr);
750 if (r.intersects(SkRect::MakeXYWH(fPts[i].fX, fPts[i].fY, 1, 1))) {
752 fPts[i] = c->fCurr;