Lines Matching defs:endT
80 double endT = coincidence.fTs[0][1];
82 if ((cancelers = startSwapped = startT > endT)) {
83 SkTSwap(startT, endT);
85 if (startT == endT) { // if one is very large the smaller may have collapsed to nothing
86 if (endT <= 1 - FLT_EPSILON) {
87 endT += FLT_EPSILON;
88 SkASSERT(endT <= 1);
94 SkASSERT(!approximately_negative(endT - startT));
104 // make sure startT and endT have t entries
111 if (oStartT > 0 || endT < 1
112 || thisOne.isMissing(endT, oStartPt) || other.isMissing(oStartT, oStartPt)) {
113 other.addTPair(oStartT, &thisOne, endT, true, oStartPt,
123 if (endT < 1 || oEndT < 1
124 || thisOne.isMissing(endT, oEndPt) || other.isMissing(oEndT, oEndPt)) {
125 other.addTPair(oEndT, &thisOne, endT, true, oEndPt,
490 double endT = coincidence.fTs[0][1];
491 if (startT == endT) { // this can happen in very large compares
499 bool swapStart = startT > endT;
504 SkTSwap(startT, endT);
523 if (partial ? endT != 1 || oMatchEnd != 1 : (endT == 1) != (oMatchEnd == 1)) {
525 if (cancel && endT != 1 && !added) {
526 (void) other.joinCoincidence(&thisOne, endT, *endPt, -step, cancel);
548 double endT = coincidence.fTs[0][1];
552 if ((cancelers = startT > endT)) {
553 SkTSwap<double>(startT, endT);
556 if (startT == endT) { // if span is very large, the smaller may have collapsed to nothing
557 if (endT <= 1 - FLT_EPSILON) {
558 endT += FLT_EPSILON;
559 SkASSERT(endT <= 1);
565 SkASSERT(!approximately_negative(endT - startT));
576 thisOne.addTCoincident(*startPt, *endPt, endT, &other);
605 double endT = coincidence.fTs[0][1];
607 if ((cancelers = startT > endT)) {
608 SkTSwap<double>(startT, endT);
610 if (startT == endT) { // if span is very large, the smaller may have collapsed to nothing
611 if (endT <= 1 - FLT_EPSILON) {
612 endT += FLT_EPSILON;
613 SkASSERT(endT <= 1);
619 SkASSERT(!approximately_negative(endT - startT));
