HomeSort by relevance Sort by last modified time
    Searched defs:fPt (Results 1 - 6 of 6) sorted by null

  /external/skia/samplecode/
SamplePathClip.cpp 246 SkPoint* fPt;
248 VertClick(SkView* view, SkPoint* pt) : MyClick(view), fPt(pt) {}
249 void handleMove() override { *fPt = snap(fCurr); }
  /external/skia/src/gpu/batches/
GrAAConvexTessellator.h 73 const SkPoint& lastPoint() const { return fPts.top().fPt; }
74 const SkPoint& firstPoint() const { return fPts[0].fPt; }
75 const SkPoint& point(int index) const { return fPts[index].fPt; }
83 pt->fPt = newPt;
115 SkPoint fPt;
  /external/skia/src/pathops/
SkIntersections.h 24 sk_bzero(fPt, sizeof(fPt));
151 return fPt[index];
194 SkASSERT(max <= (int) SK_ARRAY_COUNT(fPt));
302 SkDPoint fPt[12]; // FIXME: since scans store points as SkPoint, this should also
SkPathOpsWinding.cpp 90 fPt = segment->ptAtT(fT);
97 SkPoint fPt;
106 SkScalar baseXY = pt_xy(base.fPt, dir);
120 if (!sideways_overlap(fBounds, base.fPt, dir)) {
123 SkScalar baseXY = pt_xy(base.fPt, dir);
130 SkScalar baseYX = pt_yx(base.fPt, dir);
148 if (SkDPoint::ApproximatelyEqual(pt, base.fPt)) {
160 && SkDPoint::RoughlyEqual(pt, base.fPt)) {
179 newHit->fPt = pt;
204 return a->fPt.fX < b->fPt.fX
    [all...]
SkOpSpan.h 148 SkPoint fPt; // cache of point value at this t
261 return fPtT.fPt;
SkPathOpsDebug.cpp 87 SkPoint fPt;
104 glitch->fPt = { SK_ScalarNaN, SK_ScalarNaN };
129 glitch->fPt = pt;
137 glitch->fPt = pt;
417 const SkPoint& newPt = endPtT.fPt;
685 coincident = (SkDPoint::ApproximatelyEqual(priorPtT->fPt, oppStart->fPt) ||
686 SkDPoint::ApproximatelyEqual(priorPtT->fPt, oppEnd->fPt)) &&
687 (SkDPoint::ApproximatelyEqual(ptT->fPt, oppStart->fPt) |
    [all...]

Completed in 1256 milliseconds