Lines Matching defs:fPts
51 int numPts() const { return fPts.count(); }
54 const SkPoint& lastPoint() const { return fPts.top(); }
55 const SkPoint& point(int index) const { return fPts[index]; }
71 void setReserve(int numPts) { fPts.setReserve(numPts); }
72 void rewind() { fPts.rewind(); }
74 int numPts() const { return fPts.count(); }
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; }
80 int originatingIdx(int index) const { return fPts[index].fOriginatingIdx; }
81 int origEdge(int index) const { return fPts[index].fOrigEdgeId; }
82 bool needsToBeNew(int index) const { return fPts[index].fNeedsToBeNew; }
85 struct PointData* pt = fPts.push();
90 return fPts.count() - 1;
94 fPts.top().fOrigEdgeId = origEdgeId;
95 fPts.top().fOriginatingIdx = -1;
96 fPts.top().fNeedsToBeNew = true;
97 return fPts.count() - 1;
101 fPts[0].fOriginatingIdx = -1;
102 fPts[0].fNeedsToBeNew = true;
107 if (fPts.count() > 1) {
108 fPts.pop();
111 fPts[0].fOriginatingIdx = -1;
112 fPts[0].fNeedsToBeNew = true;
124 SkTDArray<struct PointData> fPts;
131 void setReserve(int numPts) { fPts.setReserve(numPts); }
132 void rewind() { fPts.rewind(); }
134 int numPts() const { return fPts.count(); }
137 struct PointData* pt = fPts.push();
144 for (int i = 0; i < fPts.count(); ++i) {
145 fPts[i].fOrigEdgeId = fPts[i].fIndex;
153 const SkPoint& norm(int index) const { return fPts[index].fNorm; }
154 const SkPoint& bisector(int index) const { return fPts[index].fBisector; }
155 int index(int index) const { return fPts[index].fIndex; }
156 int origEdgeID(int index) const { return fPts[index].fOrigEdgeId; }
157 void setOrigEdgeId(int index, int id) { fPts[index].fOrigEdgeId = id; }
176 SkTDArray<PointData> fPts;
205 fPts.setReserve(count);
250 // fPts, fCoverages, fMovable & fCurveState should always have the same # of elements
251 SkTDArray<SkPoint> fPts;
