Lines Matching refs:fPt
220 } while (startPt != fTs[tIndex].fPt && tIndex < tCount); in addCancelOutsides()
224 } while (endPt != other->fTs[oIndex].fPt && oIndex < oCount); in addCancelOutsides()
228 nextPt = &fTs[++tIndex].fPt; in addCancelOutsides()
234 oNextPt = &other->fTs[++oIndex].fPt; in addCancelOutsides()
255 fTs[tIndexStart].fPt); in addCancelOutsides()
264 addTPair(fTs[tIndex].fT, other, other->fTs[oIndexStart].fT, false, fTs[tIndex].fPt); in addCancelOutsides()
298 } while (startPt != fTs[tIndex].fPt); in addCoinOutsides()
303 if (startPt != span.fPt) { in addCoinOutsides()
306 if (span.fOther == other && span.fPt == startPt) { in addCoinOutsides()
313 } while (startPt != other->fTs[oIndex].fPt); in addCoinOutsides()
319 if (startPt != oSpan.fPt) { in addCoinOutsides()
335 workPt = &fTs[++tIndex].fPt; in addCoinOutsides()
339 oWorkPt = &other->fTs[++oIndex].fPt; in addCoinOutsides()
574 if (pt == span.fPt) { in addT()
578 if ((pt == firstPt && newT == 0) || (span.fPt == lastPt && newT == 1)) { in addT()
594 span->fPt = pt; in addT()
619 while (&span[less + 1] - fTs.begin() > 0 && AlmostEqualUlps(span[less].fPt, pt)) { in addT()
631 while (fTs.end() - &span[more - 1] > 1 && AlmostEqualUlps(span[more].fPt, pt)) { in addT()
644 while (more - 1 > less && span[more].fPt == span[more - 1].fPt in addT()
655 bool tiny = span[less].fPt == span[more].fPt; in addT()
689 while (startPt != fTs[index].fPt) { in addTCancel()
698 while (startPt != other->fTs[--oIndex].fPt) { // look for startPt match in addTCancel()
703 while (startPt == other->fTs[--oIndex].fPt || precisely_equal(oStartT, other->fTs[oIndex].fT)) { in addTCancel()
720 testPt = &test->fPt; in addTCancel()
722 oTestPt = &oTest->fPt; in addTCancel()
736 } while (*testPt == test->fPt || precisely_equal(testT, test->fT)); in addTCancel()
753 oFoundEnd |= endPt == oTest->fPt; in addTCancel()
755 } while (*oTestPt == oTest->fPt || precisely_equal(oTestT, oTest->fT)); in addTCancel()
756 } while (endPt != test->fPt && test->fT < 1); in addTCancel()
767 if (endPt == other->fTs[oIdx2].fPt) { in addTCancel()
786 oFoundEnd |= endPt == oTest->fPt; in addTCancel()
787 } while (!oFoundEnd || endPt == oTest->fPt); in addTCancel()
891 const SkPoint& thisPt = span.fPt; in alignMultiples()
903 if (oSpan.fPt == thisPt) { in alignMultiples()
912 if (SkDPoint::RoughlyEqual(oSpan.fPt, thisPt)) { in alignMultiples()
944 aligned->fOldPt = oSpan->fPt; in alignSpan()
945 aligned->fPt = newPt; in alignSpan()
951 SkASSERT(SkDPoint::RoughlyEqual(oSpan->fPt, newPt)); in alignSpan()
952 oSpan->fPt = newPt; in alignSpan()
970 if (span->fPt != thisPt) { in alignSpan()
971 span->fPt = thisPt; in alignSpan()
972 oSpan->fPt = thisPt; in alignSpan()
984 while (oSpan->fPt == thisPt && oSpan->fT != 1) { in alignSpan()
994 if (oSpan->fPt != thisPt) { in alignSpan()
999 if (oNextSpan->fT != oT || oNextSpan->fPt != thisPt) { in alignSpan()
1191 const SkPoint& oStartPt = oTest.fPt; in bumpCoincidentThis()
1197 } while ((end->fPt == test->fPt || precisely_equal(end->fT, test->fT)) && end->fT < 1); in bumpCoincidentThis()
1216 const SkPoint& oStartPt = oTest->fPt; in bumpCoincidentOther()
1219 const SkPoint& startPt = test.fPt; in bumpCoincidentOther()
1221 if (oStartPt == oEnd->fPt || precisely_equal(oStartT, oEnd->fT)) { in bumpCoincidentOther()
1225 while (oStartPt == oEnd->fPt || precisely_equal(oStartT, oEnd->fT)) { in bumpCoincidentOther()
1245 while (startPt != fTs[index].fPt) { in addTCoincident()
1254 while (startPt != other->fTs[oIndex].fPt) { in addTCoincident()
1265 const SkPoint* testPt = &test->fPt; in addTCoincident()
1268 const SkPoint* oTestPt = &oTest->fPt; in addTCoincident()
1284 } while (*testPt == fTs[index].fPt); in addTCoincident()
1292 } while (*oTestPt == other->fTs[oIndex].fPt); in addTCoincident()
1303 testPt = &test->fPt; in addTCoincident()
1306 oTestPt = &oTest->fPt; in addTCoincident()
1327 testPt = &test->fPt; in addTCoincident()
1342 } while (endPt != oPeek->fPt); in addTCoincident()
1352 } while (endPt == oPeek->fPt); in addTCoincident()
1362 oTestPt = &oTest->fPt; in addTCoincident()
1477 if (!SkDPoint::ApproximatelyEqual(lastSpan->fPt, span->fPt)) { in calcAngles()
1666 if (span.fPt == pt) { in containsPt()
1668 return span.fT == endSpan.fT && pt != endSpan.fPt; in containsPt()
1694 return SkDPoint::ApproximatelyEqual(span.fPt, otherPt); in containsT()
1826 const SkPoint& testPt = thisSpan.fPt; in firstSpan()
1827 while (firstSpan > beginSpan && firstSpan[-1].fPt == testPt) { in firstSpan()
1836 const SkPoint& testPt = thisSpan.fPt; in lastSpan()
1837 while (lastSpan < endSpan && lastSpan[1].fPt == testPt) { in lastSpan()
1967 missing.fPt = thisSpan->fPt; in checkDuplicates()
2018 if (missing.fSegment->coincidentSmall(missing.fPt, missing.fT, missingOther) in checkDuplicates()
2019 && missingOther->coincidentSmall(missing.fPt, missing.fOtherT, missing.fSegment)) { in checkDuplicates()
2023 missing.fOtherT, false, missing.fPt); in checkDuplicates()
2106 if (match->betweenPoints(midT, tSpan.fPt, peekSpan.fPt)) { in checkEnds()
2116 SkASSERT(lastMissing.fPt == peekSpan.fPt); in checkEnds()
2122 __FUNCTION__, fID, t, match->fID, matchT, peekSpan.fPt.fX, peekSpan.fPt.fY); in checkEnds()
2132 missing.fPt = peekSpan.fPt; in checkEnds()
2148 addTPair(missing.fT, missing.fOther, missing.fOtherT, false, missing.fPt); in checkEnds()
2171 while (test > first && (--test)->fPt == base->fPt) { in checkLinks()
2175 while (test < last && (++test)->fPt == base->fPt) { in checkLinks()
2199 const SkPoint& thisPt = span.fPt; in checkMultiples()
2216 SkASSERT(oSpan->fPt == test->fPt); in CheckOneLink()
2218 while (oTest > oFirst && (--oTest)->fPt == test->fPt) { in CheckOneLink()
2224 while (oTest < oLast && (++oTest)->fPt == test->fPt) { in CheckOneLink()
2275 const SkPoint& testPt = firstSpan.fPt; in checkSmall()
2319 missing.fPt = testPt; in checkSmall()
2343 missing.fPt)) { in checkSmall()
2346 int otherTIndex = missingOther->findT(missing.fOtherT, missing.fPt, missing.fSegment); in checkSmall()
2353 missing.fSegment->addTCoincident(missing.fPt, nextSpan->fPt, nextSpan->fT, in checkSmall()
2361 missing.fSegment->addTCancel(missing.fPt, priorSpan->fPt, missingOther); in checkSmall()
2399 if (test->fPt != next->fPt || !precisely_equal(test->fT, next->fT)) { in checkSmallCoincidence()
2425 addTCoincident(span.fPt, next->fPt, next->fT, other); in checkSmallCoincidence()
2427 addTCancel(span.fPt, next->fPt, other); in checkSmallCoincidence()
2445 if (oTest->fPt != oSpan.fPt || !precisely_equal(oTest->fT, oSpan.fT)) { in checkSmallCoincidence()
2453 if (tTest->fPt != span.fPt) { in checkSmallCoincidence()
2470 addTCoincident(span.fPt, next->fPt, next->fT, testOther); in checkSmallCoincidence()
2472 addTCancel(span.fPt, next->fPt, testOther); in checkSmallCoincidence()
2482 if (oTest->fPt != oSpan.fPt || !precisely_equal(oTest->fT, oSpan.fT)) { in checkSmallCoincidence()
2507 SkASSERT(thisSpan->fPt == nextSpan->fPt); in checkTiny()
2524 if (oSpan.fPt != nSpan.fPt) { in checkTiny()
2546 missing.fPt = thisSpan->fPt; in checkTiny()
2558 missing.fPt); in checkTiny()
2576 if (span.fPt == pt) { in coincidentSmall()
2579 if (!AlmostEqualUlps(span.fPt, pt)) { in coincidentSmall()
2599 const SkPoint& refPt = otherSpan->fPt; in findCoincidentMatch()
2621 ray.fPts[0].set(startSpan.fPt); in findCoincidentMatch()
2624 ray.fPts[0].set(endSpan.fPt); in findCoincidentMatch()
2639 *startPt = startSpan.fPt; in findCoincidentMatch()
2640 *endPt = endSpan.fPt; in findCoincidentMatch()
2653 } while (otherSpan->fT == refT || otherSpan->fPt == refPt); in findCoincidentMatch()
2659 const SkPoint& lastPt = span->fPt; in findEndSpan()
2663 } while (SkDPoint::ApproximatelyEqual(span->fPt, lastPt) && (span->fT == endT || span->fTiny)); in findEndSpan()
3004 const SkPoint& firstPt = span->fPt; in findStartSpan()
3010 } while (SkDPoint::ApproximatelyEqual(span->fPt, firstPt) in findStartSpan()
3051 if (span.fPt == pt && span.fOther == match) { in findT()
3299 if (approximately_zero(startT - span.fT) && pt == span.fPt) { in isMissing()
3964 if ((startPt == span.fPt || endPt == span.fPt) && other == span.fOther) { in setCoincidentRange()
4101 edge[0] = fTs[start].fPt; in subDivide()
4103 edge[points] = fTs[end].fPt; in subDivide()
4141 (*result)[0].set(fTs[start].fPt); in subDivide()
4143 (*result)[points].set(fTs[end].fPt); in subDivide()