HomeSort by relevance Sort by last modified time
    Searched defs:endT (Results 1 - 4 of 4) sorted by null

  /external/chromium_org/third_party/skia/src/pathops/
SkOpContour.cpp 66 double endT = coincidence.fTs[0][1];
68 if ((cancelers = startSwapped = startT > endT)) {
69 SkTSwap(startT, endT);
71 SkASSERT(!approximately_negative(endT - startT));
80 // make sure startT and endT have t entries
85 if (oStartT > 0 || endT < 1
86 || thisOne.isMissing(endT) || other.isMissing(oStartT)) {
87 other.addTPair(oStartT, &thisOne, endT, true, coincidence.fPts[oStartSwapped]);
94 if (endT < 1 || oEndT < 1
95 || thisOne.isMissing(endT) || other.isMissing(oEndT))
    [all...]
SkPathOpsCommon.cpp 53 double endT = current->t(endIndex);
54 double newMid = (testHit - baseT) / (endT - baseT);
64 baseT + mid * (endT - baseT), midXY.fX, midXY.fY,
65 baseT + newMid * (endT - baseT), newXY.fX, newXY.fY,
66 endT, current->xAtT(endIndex), current->yAtT(endIndex));
95 double endT = current->t(endIndex);
96 *bestHit = baseT + mid * (endT - baseT);
  /external/skia/src/pathops/
SkOpContour.cpp 66 double endT = coincidence.fTs[0][1];
68 if ((cancelers = startSwapped = startT > endT)) {
69 SkTSwap(startT, endT);
71 SkASSERT(!approximately_negative(endT - startT));
80 // make sure startT and endT have t entries
85 if (oStartT > 0 || endT < 1
86 || thisOne.isMissing(endT) || other.isMissing(oStartT)) {
87 other.addTPair(oStartT, &thisOne, endT, true, coincidence.fPts[oStartSwapped]);
94 if (endT < 1 || oEndT < 1
95 || thisOne.isMissing(endT) || other.isMissing(oEndT))
    [all...]
SkPathOpsCommon.cpp 53 double endT = current->t(endIndex);
54 double newMid = (testHit - baseT) / (endT - baseT);
64 baseT + mid * (endT - baseT), midXY.fX, midXY.fY,
65 baseT + newMid * (endT - baseT), newXY.fX, newXY.fY,
66 endT, current->xAtT(endIndex), current->yAtT(endIndex));
95 double endT = current->t(endIndex);
96 *bestHit = baseT + mid * (endT - baseT);

Completed in 69 milliseconds