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

  /external/chromium_org/third_party/skia/src/pathops/
SkOpContour.cpp 73 double startT = coincidence.fTs[0][0];
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
84 startT -= FLT_EPSILON;
85 SkASSERT(startT >= 0);
88 SkASSERT(!approximately_negative(endT - startT));
97 // make sure startT and endT have t entries
99 if (startT > 0 || oEndT < 1
100 || thisOne.isMissing(startT, startPt) || other.isMissing(oEndT, startPt))
    [all...]
SkOpSegment.cpp 713 double startT = fTs[index].fT;
714 while (index > 0 && fTs[index - 1].fT == startT) {
    [all...]
  /external/skia/src/pathops/
SkOpContour.cpp 73 double startT = coincidence.fTs[0][0];
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
84 startT -= FLT_EPSILON;
85 SkASSERT(startT >= 0);
88 SkASSERT(!approximately_negative(endT - startT));
97 // make sure startT and endT have t entries
99 if (startT > 0 || oEndT < 1
100 || thisOne.isMissing(startT, startPt) || other.isMissing(oEndT, startPt))
    [all...]
SkOpSegment.cpp 713 double startT = fTs[index].fT;
714 while (index > 0 && fTs[index - 1].fT == startT) {
    [all...]

Completed in 198 milliseconds