Lines Matching defs:endT
74 double endT = coincidence.fTs[0][1];
76 if ((cancelers = startSwapped = startT > endT)) {
77 SkTSwap(startT, endT);
79 if (startT == endT) { // if one is very large the smaller may have collapsed to nothing
80 if (endT <= 1 - FLT_EPSILON) {
81 endT += FLT_EPSILON;
82 SkASSERT(endT <= 1);
88 SkASSERT(!approximately_negative(endT - startT));
97 // make sure startT and endT have t entries
104 if (oStartT > 0 || endT < 1
105 || thisOne.isMissing(endT, oStartPt) || other.isMissing(oStartT, oStartPt)) {
106 other.addTPair(oStartT, &thisOne, endT, true, oStartPt);
115 if (endT < 1 || oEndT < 1
116 || thisOne.isMissing(endT, oEndPt) || other.isMissing(oEndT, oEndPt)) {
117 other.addTPair(oEndT, &thisOne, endT, true, oEndPt);
193 double endT = coincidence.fTs[0][1];
194 if (startT == endT) { // this can happen in very large compares
202 bool swapStart = startT > endT;
205 SkTSwap<double>(startT, endT);
222 if (partial ? endT != 1 || oMatchEnd != 1 : (endT == 1) != (oMatchEnd == 1)) {
224 if (cancel && endT != 1 && !added) {
225 (void) other.joinCoincidence(&thisOne, endT, -step, cancel);
244 double endT = coincidence.fTs[0][1];
248 if ((cancelers = startT > endT)) {
249 SkTSwap<double>(startT, endT);
252 if (startT == endT) { // if span is very large, the smaller may have collapsed to nothing
253 if (endT <= 1 - FLT_EPSILON) {
254 endT += FLT_EPSILON;
255 SkASSERT(endT <= 1);
261 SkASSERT(!approximately_negative(endT - startT));
272 thisOne.addTCoincident(*startPt, *endPt, endT, &other);
