Lines Matching refs:fEndT
58 result->fStartT = prior ? prior->fEndT : 0; in addFollowing()
60 result->fEndT = next ? next->fStartT : 1; in addFollowing()
116 result = test->fEndT; in closestBoundedT()
140 if (between(work->fStartT, t, work->fEndT)) { in contains()
216 fEndT = 1; in init()
222 if (SkDoubleIsNaN(fStartT) || SkDoubleIsNaN(fEndT)) { in initBounds()
225 c.subDivide(fStartT, fEndT, fPart); in initBounds()
344 if (between(test->fStartT, t, test->fEndT)) { in oppT()
371 foundStart |= between(test->fStartT, fCoinStart.perpT(), test->fEndT); in removeBounded()
372 foundEnd |= between(test->fStartT, fCoinEnd.perpT(), test->fEndT); in removeBounded()
404 fEndT = work->fEndT; in splitAt()
405 if (fStartT == fEndT) { in splitAt()
409 work->fEndT = t; in splitAt()
410 if (work->fStartT == work->fEndT) { in splitAt()
451 SkASSERT(fEndT <= 1); in validate()
452 SkASSERT(fStartT <= fEndT); in validate()
486 if (precisely_between(overlap->fStartT, oppT, overlap->fEndT)) { in validatePerpT()
541 result->fStartT = result->fEndT = result->fBoundsMax = SK_ScalarNaN; in addOne()
550 double result = work.fStartT = work.fEndT = tStart; in binarySearchCoin()
684 first->fEndT = start1e; in coincidentForce()
696 oppFirst->fEndT = oppEndT; in coincidentForce()
709 if (between(test->fStartT, t, test->fEndT)) { in coincidentHasT()
752 work->fCoinEnd.setPerp(fCurve, work->fEndT, work->pointLast(), opp); in computePerpendiculars()
781 if (next->fStartT > last->fEndT) { in countConsecutiveSpans()
843 if (prev && prev->fEndT == startT in extractCoincident()
852 if (oppFirst->fStartT < oppStartT && oppStartT < oppFirst->fEndT) { in extractCoincident()
868 SkDEBUGCODE(oppStartT = oppMatched ? oppFirst->fStartT : oppFirst->fEndT); in extractCoincident()
874 SkDEBUGCODE(coinEnd = last->fEndT); in extractCoincident()
877 oppEndT = oppMatched ? oppLast->fEndT : oppLast->fStartT; in extractCoincident()
887 SkASSERT(coinEnd == last->fEndT); in extractCoincident()
889 SkOPASSERT(oppEndT == oppLast->fEndT); in extractCoincident()
905 first->fEndT = last->fEndT; in extractCoincident()
908 first->fCoinEnd.setPerp(fCurve, first->fEndT, first->pointLast(), sect2->fCurve); in extractCoincident()
917 oppFirst->fEndT = oppEndT; in extractCoincident()
992 span->fEndT = span->fStartT; in intersects()
994 span->fStartT = span->fEndT; in intersects()
1004 oppSpan->fEndT = oppSpan->fStartT; in intersects()
1006 oppSpan->fStartT = oppSpan->fEndT; in intersects()
1027 span->fStartT = span->fEndT = i[0][0]; in intersects()
1029 oppSpan->fStartT = oppSpan->fEndT = i[1][0]; in intersects()
1111 if (!roughly_between(span->fStartT, oppRayI[0][index], span->fEndT)) { in linesIntersect()
1115 if (!roughly_between(oppSpan->fStartT, thisRayI[0][oIndex], oppSpan->fEndT)) { in linesIntersect()
1131 if (between(span->fStartT, oppRayI[0][closeIndex], span->fEndT) in linesIntersect()
1132 && between(oppSpan->fStartT, thisRayI[0][oppCloseIndex], oppSpan->fEndT) in linesIntersect()
1158 oCoinE.setPerp(opp->fCurve, oppSpan->fEndT, oppSpan->pointLast(), fCurve); in linesIntersect()
1167 tEnd = SkTMin(tEnd, span->fEndT); in linesIntersect()
1181 if (tEnd == span->fEndT) { in linesIntersect()
1183 coinE.setPerp(fCurve, span->fEndT, span->pointLast(), opp->fCurve); in linesIntersect()
1206 if (coinW.isMatch() ? !between(oppSpan->fStartT, perpT, oppSpan->fEndT) : perpT < 0) { in linesIntersect()
1267 if (smaller && smaller->fEndT < test->fStartT) { in mergeCoincidence()
1275 smallLimit = smaller->fEndT; in mergeCoincidence()
1282 if (test->fStartT < smaller->fEndT) { in mergeCoincidence()
1285 SkOPASSERT(test->fStartT != smaller->fEndT); in mergeCoincidence()
1296 double midT = (smaller->fEndT + larger->fStartT) / 2; in mergeCoincidence()
1301 smaller->fEndT = larger->fEndT; in mergeCoincidence()
1331 while (*spanPtr && (*spanPtr)->fEndT <= deleted->fStartT) { in recoverCollapsed()
1403 if (1 == span->fEndT) { in removedEndCheck()
1461 while (test && test->fEndT < t) { in spanAtT()
1477 if (next->fEndT > result->fEndT) { in tail()
1525 if (next->fStartT > next->fEndT) { in unlinkSpan()
1565 last = span->fEndT; in validate()
1869 start1e = sect1->tail()->fEndT; in BinarySearch()
1943 if ((intersections->insertCoincident(coincident->fEndT, in BinarySearch()
2014 if (approximately_greater_than_one(tail1->fEndT)) { in BinarySearch()
2029 if (approximately_greater_than_one(tail2->fEndT)) { in BinarySearch()