Lines Matching defs:fPrev
136 * in Y) using the same fPrev/fNext pointers that were used for the contours, to avoid
145 : fPoint(point), fPrev(nullptr), fNext(nullptr)
156 Vertex* fPrev; // Linked list of contours, then Y-sorted vertices.
242 list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &fHead, &fTail);
253 list.fHead->fPrev = fTail;
263 list_remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, &fHead, &fTail);
268 fHead->fPrev = fTail;
476 , fPrev(nullptr)
483 MonotonePoly* fPrev;
517 SkASSERT(v && v->fPrev && v->fNext);
518 Vertex* prev = v->fPrev;
530 v->fPrev->fNext = v->fNext;
531 v->fNext->fPrev = v->fPrev;
533 if (v->fPrev == first) {
536 v = v->fPrev;
579 m->fPrev = fTail;
1097 nextV = nextV->fPrev;
1102 Vertex* prevV = nextV->fPrev;
1115 v->fPrev = prevV;
1118 nextV->fPrev = v;
1156 if (c.sweep_lt(v->fPoint, v->fPrev->fPoint)) {
1157 v->fPoint = v->fPrev->fPoint;
1159 if (coincident(v->fPrev->fPoint, v->fPoint)) {
1160 merge_vertices(v->fPrev, v, mesh, c, alloc);
1240 front.fTail->fNext = back.fHead->fPrev = nullptr;