HomeSort by relevance Sort by last modified time
    Searched refs:fPt (Results 1 - 25 of 38) sorted by null

1 2

  /external/skia/src/pathops/
SkIntersections.cpp 18 const SkDPoint& iPt = fPt[index];
56 fPt[index] = pt;
61 if (pt.roughlyEqual(fPt[index])) {
77 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining);
84 fPt[index] = pt;
94 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt));
127 fPt[0] = a.fPt[aIndex]
    [all...]
SkPathWriter.cpp 37 pt1.fX, pt1.fY, pt2->fPt.fX, pt2->fPt.fY, weight);
39 fCurrent.conicTo(pt1, pt2->fPt, weight);
46 pt1.fX, pt1.fY, pt2.fX, pt2.fY, pt3->fPt.fX, pt3->fPt.fY);
48 fCurrent.cubicTo(pt1, pt2, pt3->fPt);
120 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1]->fPt.fX, fDefer[1]->fPt.fY);
122 fCurrent.lineTo(fDefer[1]->fPt);
140 SkDebugf("path.moveTo(%1.9g,%1.9g);\n", fFirstPtT->fPt.fX, fFirstPtT->fPt.fY)
    [all...]
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...]
SkDLineIntersection.cpp 33 fPt[0] = line.ptAtT(fT[0][0]);
35 fPt[1] = line.ptAtT(fT[0][1]);
232 fPt[0].fX = xIntercept;
233 fPt[0].fY = y;
308 fPt[0].fX = x;
309 fPt[0].fY = yIntercept;
SkIntersections.h 25 sk_bzero(fPt, sizeof(fPt));
161 return fPt[index];
203 SkASSERT(max <= (int) SK_ARRAY_COUNT(fPt));
311 SkDPoint fPt[13]; // FIXME: since scans store points as SkPoint, this should also
SkOpSpan.cpp 48 if (ptT->fPt == pt && ptT->segment() == segment) {
101 fPt = pt;
121 if (this->fPt == check->fPt) {
SkOpSegment.cpp 212 if (loop->segment() == this && loop->fT == t && loop->fPt == pt) {
235 newPtT->fPt = this->ptAtT(newT);
    [all...]
SkOpSegment.h 323 return ptsDisjoint(span.fT, span.fPt, test.fT, test.fPt);
328 return ptsDisjoint(span.fT, span.fPt, t, pt);
SkOpSpan.h 167 SkPoint fPt; // cache of point value at this t
302 return fPtT.fPt;
SkPathOpsDebug.cpp 91 SkPoint fPt;
116 glitch->fPt = { SK_ScalarNaN, SK_ScalarNaN };
152 glitch->fPt = pt;
160 glitch->fPt = pt;
419 if (!SkScalarIsNaN(glitch.fPt.fX) || !SkScalarIsNaN(glitch.fPt.fY)) {
420 SkDebugf(" pt=%g,%g", glitch.fPt.fX, glitch.fPt.fY);
    [all...]
  /external/skqp/src/pathops/
SkIntersections.cpp 18 const SkDPoint& iPt = fPt[index];
56 fPt[index] = pt;
61 if (pt.roughlyEqual(fPt[index])) {
77 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining);
84 fPt[index] = pt;
94 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt));
127 fPt[0] = a.fPt[aIndex]
    [all...]
SkPathWriter.cpp 37 pt1.fX, pt1.fY, pt2->fPt.fX, pt2->fPt.fY, weight);
39 fCurrent.conicTo(pt1, pt2->fPt, weight);
46 pt1.fX, pt1.fY, pt2.fX, pt2.fY, pt3->fPt.fX, pt3->fPt.fY);
48 fCurrent.cubicTo(pt1, pt2, pt3->fPt);
120 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1]->fPt.fX, fDefer[1]->fPt.fY);
122 fCurrent.lineTo(fDefer[1]->fPt);
140 SkDebugf("path.moveTo(%1.9g,%1.9g);\n", fFirstPtT->fPt.fX, fFirstPtT->fPt.fY)
    [all...]
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...]
SkDLineIntersection.cpp 33 fPt[0] = line.ptAtT(fT[0][0]);
35 fPt[1] = line.ptAtT(fT[0][1]);
232 fPt[0].fX = xIntercept;
233 fPt[0].fY = y;
308 fPt[0].fX = x;
309 fPt[0].fY = yIntercept;
SkIntersections.h 25 sk_bzero(fPt, sizeof(fPt));
161 return fPt[index];
203 SkASSERT(max <= (int) SK_ARRAY_COUNT(fPt));
311 SkDPoint fPt[13]; // FIXME: since scans store points as SkPoint, this should also
SkOpSpan.cpp 48 if (ptT->fPt == pt && ptT->segment() == segment) {
101 fPt = pt;
121 if (this->fPt == check->fPt) {
SkOpSegment.cpp 212 if (loop->segment() == this && loop->fT == t && loop->fPt == pt) {
235 newPtT->fPt = this->ptAtT(newT);
    [all...]
SkOpSegment.h 323 return ptsDisjoint(span.fT, span.fPt, test.fT, test.fPt);
328 return ptsDisjoint(span.fT, span.fPt, t, pt);
SkOpSpan.h 167 SkPoint fPt; // cache of point value at this t
302 return fPtT.fPt;
  /external/skia/src/gpu/ops/
GrAAConvexTessellator.h 76 const SkPoint& lastPoint() const { return fPts.top().fPt; }
77 const SkPoint& firstPoint() const { return fPts[0].fPt; }
78 const SkPoint& point(int index) const { return fPts[index].fPt; }
86 pt->fPt = newPt;
118 SkPoint fPt;
  /external/skqp/src/gpu/ops/
GrAAConvexTessellator.h 76 const SkPoint& lastPoint() const { return fPts.top().fPt; }
77 const SkPoint& firstPoint() const { return fPts[0].fPt; }
78 const SkPoint& point(int index) const { return fPts[index].fPt; }
86 pt->fPt = newPt;
118 SkPoint fPt;
  /external/skia/gm/
simple_magnification.cpp 28 SkPoint fPt;
39 canvas->drawPoints(SkCanvas::kPoints_PointMode, 1, &r.fPt, paint);
  /external/skqp/gm/
simple_magnification.cpp 27 SkPoint fPt;
38 canvas->drawPoints(SkCanvas::kPoints_PointMode, 1, &r.fPt, paint);
  /external/skia/samplecode/
SamplePathClip.cpp 242 SkPoint* fPt;
244 VertClick(SkView* view, SkPoint* pt) : MyClick(view), fPt(pt) {}
245 void handleMove() override { *fPt = snap(fCurr); }
  /external/skqp/samplecode/
SamplePathClip.cpp 242 SkPoint* fPt;
244 VertClick(SkView* view, SkPoint* pt) : MyClick(view), fPt(pt) {}
245 void handleMove() override { *fPt = snap(fCurr); }

Completed in 460 milliseconds

1 2