Lines Matching refs:startT
713 double startT = fTs[index].fT;
714 while (index > 0 && fTs[index - 1].fT == startT) {
1510 double startT = other->fTs[*nextStart].fT;
1514 } while (precisely_zero(startT - other->fTs[*nextEnd].fT));
1641 double startT = other->fTs[*nextStart].fT;
1645 } while (precisely_zero(startT - other->fTs[*nextEnd].fT));
1759 double startT = other->fTs[*nextStart].fT;
1762 if ((approximately_less_than_zero(startT) && step < 0)
1763 || (approximately_greater_than_one(startT) && step > 0)) {
1771 } while (precisely_zero(startT - other->fTs[*nextEnd].fT));
2066 bool SkOpSegment::isMissing(double startT, const SkPoint& pt) const {
2070 if (approximately_zero(startT - span.fT) && pt == span.fPt) {
2715 double startT = fTs[start].fT;
2717 if ((startT == 0 || endT == 0) && (startT == 1 || endT == 1)) {
2735 edge[1] = SkDQuad::SubDivide(fPts, sub[0], sub[1], startT, endT).asSkPoint();
2739 SkDCubic::SubDivide(fPts, sub[0], sub[1], startT, endT, ctrl);
2755 double startT = fTs[start].fT;
2757 if ((startT == 0 || endT == 0) && (startT == 1 || endT == 1)) {
2774 (*result)[1] = SkDQuad::SubDivide(fPts, (*result)[0], (*result)[2], startT, endT);
2777 SkDCubic::SubDivide(fPts, (*result)[0], (*result)[3], startT, endT, &(*result)[1]);
2814 double startT = fTs[index].fT;
2815 while (approximately_negative(fTs[++index].fT - startT))
