Lines Matching refs:fCandidateVerts
151 fCandidateVerts.rewind();
482 fCandidateVerts.setReserve(this->numPts());
685 fCandidateVerts.rewind();
740 dst[0] = fCandidateVerts.addNewPt(newPt,
753 if (!duplicate_pt(newPt, fCandidateVerts.lastPoint())) {
754 dst[cur] = fCandidateVerts.addNewPt(newPt,
758 dst[cur] = fCandidateVerts.fuseWithPrior(lastRing.origEdgeID(cur));
771 bool dupPrev = duplicate_pt(newPt, fCandidateVerts.lastPoint());
772 bool dupNext = duplicate_pt(newPt, fCandidateVerts.firstPoint());
775 dst[cur] = fCandidateVerts.addNewPt(newPt,
779 dst[cur] = fCandidateVerts.fuseWithPrior(lastRing.origEdgeID(cur));
781 dst[cur] = fCandidateVerts.fuseWithNext();
783 bool dupPrevVsNext = duplicate_pt(fCandidateVerts.firstPoint(), fCandidateVerts.lastPoint());
786 dst[cur] = fCandidateVerts.fuseWithPrior(lastRing.origEdgeID(cur));
788 const int fused = fCandidateVerts.fuseWithBoth();
798 for (int i = 0; i < fCandidateVerts.numPts(); ++i) {
800 if (fCandidateVerts.needsToBeNew(i) || forceNew) {
805 newIdx = this->addPt(fCandidateVerts.point(i), depth, coverage,
806 fCandidateVerts.originatingIdx(i) != -1, kSharp_CurveState);
808 SkASSERT(fCandidateVerts.originatingIdx(i) != -1);
809 this->updatePt(fCandidateVerts.originatingIdx(i), fCandidateVerts.point(i), depth,
811 newIdx = fCandidateVerts.originatingIdx(i);
814 nextRing->addIdx(newIdx, fCandidateVerts.origEdge(i));