Lines Matching refs:fStartT
58 result->fStartT = prior ? prior->fEndT : 0; in addFollowing()
60 result->fEndT = next ? next->fStartT : 1; in addFollowing()
111 result = test->fStartT; in closestBoundedT()
140 if (between(work->fStartT, t, work->fEndT)) { in contains()
215 fStartT = 0; 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()
403 fStartT = t; in splitAt()
405 if (fStartT == fEndT) { in splitAt()
410 if (work->fStartT == work->fEndT) { in splitAt()
450 SkASSERT(0 <= fStartT); 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()
560 work.fStartT += tStep; in binarySearchCoin()
573 work.fCoinStart.setPerp(fCurve, work.fStartT, last, opp); in binarySearchCoin()
583 if (down ? result <= work.fStartT : result >= work.fStartT) { in binarySearchCoin()
587 result = work.fStartT; in binarySearchCoin()
683 first->fStartT = start1s; in coincidentForce()
695 oppFirst->fStartT = oppStartT; in coincidentForce()
709 if (between(test->fStartT, t, test->fEndT)) { in coincidentHasT()
742 work->fCoinStart.setPerp(fCurve, work->fStartT, work->pointFirst(), opp); in computePerpendiculars()
781 if (next->fStartT > last->fEndT) { in countConsecutiveSpans()
832 double startT = first->fStartT; in extractCoincident()
844 && this->binarySearchCoin(sect2, startT, prev->fStartT - startT, &coinStart, in extractCoincident()
846 && prev->fStartT < coinStart && coinStart < startT in extractCoincident()
852 if (oppFirst->fStartT < oppStartT && oppStartT < oppFirst->fEndT) { in extractCoincident()
867 SkDEBUGCODE(coinStart = first->fStartT); in extractCoincident()
868 SkDEBUGCODE(oppStartT = oppMatched ? oppFirst->fStartT : oppFirst->fEndT); in extractCoincident()
877 oppEndT = oppMatched ? oppLast->fEndT : oppLast->fStartT; in extractCoincident()
886 SkASSERT(coinStart == first->fStartT); in extractCoincident()
892 SkOPASSERT(oppStartT == oppFirst->fStartT); in extractCoincident()
907 first->fCoinStart.setPerp(fCurve, first->fStartT, first->pointFirst(), sect2->fCurve); in extractCoincident()
916 oppFirst->fStartT = oppStartT; 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()
1157 oCoinS.setPerp(opp->fCurve, oppSpan->fStartT, oppSpan->pointFirst(), fCurve); in linesIntersect()
1166 tStart = SkTMax(tStart, span->fStartT); in linesIntersect()
1172 if (tStart == span->fStartT) { in linesIntersect()
1174 coinS.setPerp(fCurve, span->fStartT, span->pointFirst(), opp->fCurve); in linesIntersect()
1206 if (coinW.isMatch() ? !between(oppSpan->fStartT, perpT, oppSpan->fEndT) : perpT < 0) { in linesIntersect()
1264 if (test->fStartT < smallLimit) { in mergeCoincidence()
1267 if (smaller && smaller->fEndT < test->fStartT) { in mergeCoincidence()
1282 if (test->fStartT < smaller->fEndT) { in mergeCoincidence()
1285 SkOPASSERT(test->fStartT != smaller->fEndT); in mergeCoincidence()
1286 if (larger && larger->fStartT < test->fStartT) { in mergeCoincidence()
1296 double midT = (smaller->fEndT + larger->fStartT) / 2; in mergeCoincidence()
1331 while (*spanPtr && (*spanPtr)->fEndT <= deleted->fStartT) { in recoverCollapsed()
1400 if (!span->fStartT) { in removedEndCheck()
1466 return test && test->fStartT <= t ? test : nullptr; in spanAtT()
1525 if (next->fStartT > next->fEndT) { in unlinkSpan()
1564 SkASSERT(span->fStartT >= last); in validate()
1868 start1s = sect1->fHead->fStartT; in BinarySearch()
1941 int index = intersections->insertCoincident(coincident->fStartT, in BinarySearch()
1990 if (!(zeroOneSet & kZeroS1Set) && approximately_less_than_zero(head1->fStartT)) { in BinarySearch()
2000 if (!(zeroOneSet & kZeroS2Set) && approximately_less_than_zero(head2->fStartT)) { in BinarySearch()