150         return splitAt(work, (work->fStartT + work->fEndT) * 0.5, heap);  in split()
156         return fStartT;  in startT()
184     double fStartT;  variable
363     result->fStartT = prior ? prior->fEndT : 0;  in addFollowing()
365     result->fEndT = next ? next->fStartT : 1;  in addFollowing()
416             result = test->fStartT;  in closestBoundedT()
446         if (between(work->fStartT, t, work->fEndT)) {  in contains()
524     fStartT = 0;  in init()
532     fPart = c.subDivide(fStartT, fEndT);  in initBounds()
654         if (between(test->fStartT, t, test->fEndT)) {  in oppT()
683                 foundStart |= between(test->fStartT, fCoinStart.perpT(), test->fEndT);  in removeBounded()
684                 foundEnd |= between(test->fStartT, fCoinEnd.perpT(), test->fEndT);  in removeBounded()
716     fStartT = t;  in splitAt()
718     if (fStartT == fEndT) {  in splitAt()
723     if (work->fStartT == work->fEndT) {  in splitAt()
758     SkASSERT(0 <= fStartT);  in validate()
760     SkASSERT(fStartT <= fEndT);  in validate()
795         if (between(overlap->fStartT, oppT, overlap->fEndT)) {  in validatePerpT()
851     double result = work.fStartT = work.fEndT = tStart;  in binarySearchCoin()
860         work.fStartT += tStep;  in binarySearchCoin()
873         work.fCoinStart.setPerp(fCurve, work.fStartT, last, opp);  in binarySearchCoin()
882                 SkASSERT(down ? result > work.fStartT : result < work.fStartT);  in binarySearchCoin()
883                 result = work.fStartT;  in binarySearchCoin()
950         if (between(test->fStartT, t, test->fEndT)) {  in coincidentHasT()
982                 work->fCoinStart.setPerp(fCurve, work->fStartT, work->fPart[0], opp);  in computePerpendiculars()
1022         if (next->fStartT > last->fEndT) {  in countConsecutiveSpans()
1067     double startT = first->fStartT;  in extractCoincident()
1079             && this->binarySearchCoin(sect2, startT, prev->fStartT - startT, &coinStart,  in extractCoincident()
1081             && prev->fStartT < coinStart && coinStart < startT  in extractCoincident()
1087         if (oppFirst->fStartT < oppStartT && oppStartT < oppFirst->fEndT) {  in extractCoincident()
1099         SkDEBUGCODE(coinStart = first->fStartT);  in extractCoincident()
1100         SkDEBUGCODE(oppStartT = oppMatched ? oppFirst->fStartT : oppFirst->fEndT);  in extractCoincident()
1107     SkDEBUGCODE(oppEndT = oppMatched ? oppLast->fEndT : oppLast->fStartT);  in extractCoincident()
1113     SkASSERT(coinStart == first->fStartT);  in extractCoincident()
1115     SkASSERT(oppStartT == oppFirst->fStartT);  in extractCoincident()
1126     first->fCoinStart.setPerp(fCurve, first->fStartT, first->fPart[0], sect2->fCurve);  in extractCoincident()
1134         oppFirst->fStartT = oppStartT;  in extractCoincident()
1203                     span->fEndT = span->fStartT;  in intersects()
1205                     span->fStartT = span->fEndT;  in intersects()
1213                     oppSpan->fEndT = oppSpan->fStartT;  in intersects()
1215                     oppSpan->fStartT = oppSpan->fEndT;  in intersects()
1232         span->fStartT = span->fEndT = i[0][0];  in intersects()
1233         oppSpan->fStartT = oppSpan->fEndT = i[1][0];  in intersects()
1266             if (!roughly_between(span->fStartT, oppRayI[0][index], span->fEndT)) {  in linesIntersect()
1270                 if (!roughly_between(oppSpan->fStartT, thisRayI[0][oIndex], oppSpan->fEndT)) {  in linesIntersect()
1286         if (between(span->fStartT, oppRayI[0][closeIndex], span->fEndT)  in linesIntersect()
1287                 && between(oppSpan->fStartT, thisRayI[0][oppCloseIndex], oppSpan->fEndT)  in linesIntersect()
1312     oCoinS.setPerp(opp->fCurve, oppSpan->fStartT, oppSpan->fPart[0], fCurve);  in linesIntersect()
1320     tStart = SkTMax(tStart, span->fStartT);  in linesIntersect()
1326     if (tStart == span->fStartT) {  in linesIntersect()
1328         coinS.setPerp(fCurve, span->fStartT, span->fPart[0], opp->fCurve);  in linesIntersect()
1410             if (test->fStartT < smallLimit) {  in mergeCoincidence()
1413             if (smaller && smaller->fEndT < test->fStartT) {  in mergeCoincidence()
1428             if (test->fStartT < smaller->fEndT) {  in mergeCoincidence()
1431             SkASSERT(test->fStartT != smaller->fEndT);  in mergeCoincidence()
1432             if (larger && larger->fStartT < test->fStartT) {  in mergeCoincidence()
1442         double midT = (smaller->fEndT + larger->fStartT) / 2;  in mergeCoincidence()
1478             while (*spanPtr && (*spanPtr)->fEndT <= deleted->fStartT) {  in recoverCollapsed()
1597     return test && test->fStartT <= t ? test : NULL;  in spanAtT()
1688             SkASSERT(span->fStartT >= last);  in validate()
1994             int index = intersections->insertCoincident(coincident->fStartT,  in BinarySearch()
2012     if (!(zeroOneSet & kZeroS1Set) && approximately_less_than_zero(head1->fStartT)) {  in BinarySearch()
2022     if (!(zeroOneSet & kZeroS2Set) && approximately_less_than_zero(head2->fStartT)) {  in BinarySearch()