HomeSort by relevance Sort by last modified time
    Searched refs:fTiny (Results 1 - 6 of 6) sorted by null

  /external/chromium_org/third_party/skia/src/pathops/
SkOpSpan.h 34 bool fTiny; // if set, consecutive points are equal but consecutive ts are not precisely equal
SkPathOpsDebug.cpp 544 // SK_ALWAYSBREAK(!last->fTiny || !tsPreciselyEqual || span.fTiny || tinyTFound);
545 SK_ALWAYSBREAK(last->fTiny || tsPreciselyEqual || !pointsEqual || hasLoop);
546 SK_ALWAYSBREAK(!last->fTiny || pointsEqual);
547 SK_ALWAYSBREAK(!last->fTiny || last->fDone);
550 // SK_ALWAYSBREAK(!last->fSmall || last->fTiny);
551 // SK_ALWAYSBREAK(last->fTiny || !pointsEqual || last->fDone == span.fDone);
552 if (last->fTiny) {
SkOpSegment.cpp 49 && (precisely_negative(referenceT - fTs[lesser].fT) || fTs[lesser].fTiny)) {
61 if (fTs[index - 1].fTiny) {
409 SkASSERT(span(endIndex).fT == 1 || (span(endIndex).fTiny
414 while (fTs[startIndex].fT == 1 || fTs[startIndex].fTiny) {
616 span->fTiny = false;
665 fTiny |= span[index].fTiny = tiny;
840 SkASSERT(!fTs[0].fTiny && fTs[idx].fT > 0);
856 SkASSERT(!fTs[idx].fTiny && fTs[idx].fT < 1);
888 SkASSERT(!oPrior.fTiny && oPrior.fT < 1)
    [all...]
SkOpSegment.h 98 return fTiny;
547 bool fTiny; // set if some span is tiny
  /external/chromium_org/third_party/skia/tests/
PathOpsDebug.cpp 209 if (mSpan.fTiny) {
705 if (fTiny) {
  /external/chromium_org/third_party/skia/experimental/Intersection/
Simplify.cpp 668 bool fTiny; // if set, span may still be considered once for edge following
751 if ((*rh.fSpans)[SkMin32(rh.fStart, rh.fEnd)].fTiny
752 || (*fSpans)[SkMin32(fStart, fEnd)].fTiny) {
917 if (thisSpan.fTiny || precisely_equal(thisSpan.fT, nextSpan.fT)) {
    [all...]

Completed in 67 milliseconds