Lines Matching refs:fPt
223 } while (startPt != fTs[tIndex].fPt && tIndex < tCount);
227 } while (endPt != other->fTs[oIndex].fPt && oIndex < oCount);
231 nextPt = &fTs[++tIndex].fPt;
237 oNextPt = &other->fTs[++oIndex].fPt;
258 fTs[tIndexStart].fPt);
267 addTPair(fTs[tIndex].fT, other, other->fTs[oIndexStart].fT, false, fTs[tIndex].fPt);
301 } while (startPt != fTs[tIndex].fPt);
304 } while (startPt != other->fTs[oIndex].fPt);
312 workPt = &fTs[++tIndex].fPt;
315 workPt = &other->fTs[++oIndex].fPt;
435 if (pt == span.fPt) {
439 if ((pt == firstPt && newT == 0) || (span.fPt == lastPt && newT == 1)) {
454 span->fPt = pt;
473 while (&span[less + 1] - fTs.begin() > 0 && AlmostEqualUlps(span[less].fPt, span->fPt)) {
489 bool tiny = span[less].fPt == span->fPt;
511 while (fTs.end() - &span[more - 1] > 1 && AlmostEqualUlps(span[more].fPt, span->fPt)) {
531 bool tiny = span[more].fPt == span->fPt;
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) {
597 const SkPoint& testPt = test->fPt;
599 const SkPoint& oTestPt = oTest->fPt;
613 } while (testPt == test->fPt || testT == test->fT);
631 } while (oTestPt == oTest->fPt || oTestT == oTest->fT);
632 } while (endPt != test->fPt && test->fT < 1);
664 const SkPoint& oStartPt = oTest.fPt;
670 } while ((end->fPt == test->fPt || end->fT == test->fT) && end->fT < 1);
683 const SkPoint& startPt = test.fPt;
684 const SkPoint& oStartPt = oTest->fPt;
686 if (oStartPt == oEnd->fPt || oStartT == oEnd->fT) {
689 while (oStartPt == oEnd->fPt || oStartT == oEnd->fT) {
709 while (startPt != fTs[index].fPt) {
718 while (startPt != other->fTs[oIndex].fPt) {
729 const SkPoint* testPt = &test->fPt;
732 const SkPoint* oTestPt = &oTest->fPt;
750 } while (*testPt == fTs[index].fPt);
758 } while (*oTestPt == other->fTs[oIndex].fPt);
769 testPt = &test->fPt;
775 oTestPt = &oTest->fPt;
792 testPt = &test->fPt;
868 const SkPoint& referencePt = fTs[index].fPt;
886 if (!precisely_negative(fTs[index].fT - referenceT) && fTs[index].fPt == referencePt) {
1275 if (match->betweenPoints(midT, tSpan.fPt, peekSpan.fPt)) {
1285 SkASSERT(lastMissing.fPt == peekSpan.fPt);
1291 __FUNCTION__, fID, t, match->fID, matchT, peekSpan.fPt.fX, peekSpan.fPt.fY);
1301 missing.fPt = peekSpan.fPt;
1316 fPt);
1355 SkASSERT(thisSpan->fPt == nextSpan->fPt);
1372 if (oSpan.fPt != nSpan.fPt) {
1394 missing.fPt = thisSpan->fPt;
1404 missing.fSegment->addTPair(missing.fT, missing.fOther, missing.fOtherT, false, missing.fPt);
1419 const SkPoint& refPt = otherSpan->fPt;
1435 // draw ray from endSpan.fPt perpendicular to end tangent and measure distance
1441 ray.fPts[0].set(startSpan.fPt);
1444 ray.fPts[0].set(endSpan.fPt);
1459 *startPt = startSpan.fPt;
1460 *endPt = endSpan.fPt;
1473 } while (otherSpan->fT == refT || otherSpan->fPt == refPt);
2070 if (approximately_zero(startT - span.fT) && pt == span.fPt) {
2709 edge[0] = fTs[start].fPt;
2711 edge[points] = fTs[end].fPt;
2749 (*result)[0].set(fTs[start].fPt);
2751 (*result)[points].set(fTs[end].fPt);
3284 SkASSERT(otherSpan.fPt == span.fPt);
