Lines Matching full:startpt
215 void SkOpSegment::addCancelOutsides(const SkPoint& startPt, const SkPoint& endPt,
223 } while (startPt != fTs[tIndex].fPt && tIndex < tCount);
232 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt);
233 } while (startPt == *nextPt);
292 void SkOpSegment::addCoinOutsides(const SkPoint& startPt, const SkPoint& endPt,
294 // walk this to startPt
295 // walk other to startPt
301 } while (startPt != fTs[tIndex].fPt);
304 } while (startPt != other->fTs[oIndex].fPt);
306 addTPair(fTs[tIndex].fT, other, other->fTs[oIndex].fT, false, startPt);
308 SkPoint nextPt = startPt;
566 startPt endPt test/oTest first pos test/oTest final pos
568 void SkOpSegment::addTCancel(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other) {
571 while (startPt != fTs[index].fPt) {
579 while (startPt != other->fTs[--oIndex].fPt) { // look for startPt match
584 while (startPt == other->fTs[--oIndex].fPt || oStartT == other->fTs[oIndex].fT) {
683 const SkPoint& startPt = test.fPt;
687 TrackOutside(oOutsidePts, startPt);
705 void SkOpSegment::addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT,
709 while (startPt != fTs[index].fPt) {
718 while (startPt != other->fTs[oIndex].fPt) {
1414 int oEnd, int step, SkPoint* startPt, SkPoint* endPt, double* endT) const {
1459 *startPt = startSpan.fPt;
2125 SkPoint startPt, endPt;
2127 if (findCoincidentMatch(test, other, otherTIndex, next, step, &startPt, &endPt, &endT)) {
2130 match->addTCancel(startPt, endPt, other);
2132 match->addTCoincident(startPt, endPt, endT, other);
2789 const SkPoint& startPt) {
2793 outsidePts->push_back(startPt);
2797 void SkOpSegment::TrackOutside(SkTArray<SkPoint, true>* outsidePts, const SkPoint& startPt) {
2799 if (outCount == 0 || startPt != (*outsidePts)[outCount - 1]) {
2800 outsidePts->push_back(startPt);
