Searched refs:fTiny (Results 1 - 12 of 12) sorted by relevance
| /external/chromium_org/third_party/skia/src/pathops/ |
| H A D | SkOpSpan.h | 34 bool fTiny; // if set, consecutive points are equal but consecutive ts are not precisely equal member in struct:SkOpSpan
|
| H A D | 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) {
|
| H A D | 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
[all...] |
| H A D | SkOpSegment.h | 98 return fTiny;
547 bool fTiny; // set if some span is tiny member in class:SkOpSegment
|
| /external/skia/src/pathops/ |
| H A D | SkOpSpan.h | 34 bool fTiny; // if set, consecutive points are equal but consecutive ts are not precisely equal member in struct:SkOpSpan
|
| H A D | SkPathOpsDebug.cpp | 543 // SK_ALWAYSBREAK(!last->fTiny || !tsPreciselyEqual || span.fTiny || tinyTFound);
544 SK_ALWAYSBREAK(last->fTiny || tsPreciselyEqual || !pointsEqual || hasLoop);
545 SK_ALWAYSBREAK(!last->fTiny || pointsEqual);
546 SK_ALWAYSBREAK(!last->fTiny || last->fDone);
549 // SK_ALWAYSBREAK(!last->fSmall || last->fTiny);
550 // SK_ALWAYSBREAK(last->fTiny || !pointsEqual || last->fDone == span.fDone);
551 if (last->fTiny) {
|
| H A D | SkOpSegment.cpp | 49 && (precisely_negative(referenceT - fTs[lesser].fT) || fTs[lesser].fTiny)) {
61 if (fTs[index - 1].fTiny) {
410 while (fTs[startIndex].fT == 1 || fTs[startIndex].fTiny) {
612 span->fTiny = false;
659 fTiny |= span[index].fTiny = tiny;
830 SkASSERT(!fTs[0].fTiny && fTs[1].fT > 0);
844 SkASSERT(!fTs[index - 1].fTiny && fTs[index - 1].fT < 1);
855 SkASSERT(!oPrior.fTiny && oPrior.fT < 1);
862 SkASSERT(!oSpan.fTiny
[all...] |
| H A D | SkOpSegment.h | 98 return fTiny;
545 bool fTiny; // set if some span is tiny member in class:SkOpSegment
|
| /external/skia/tests/ |
| H A D | PathOpsDebug.cpp | 77 if (mSpan.fTiny) {
573 if (fTiny) {
|
| /external/chromium_org/third_party/skia/tests/ |
| H A D | PathOpsDebug.cpp | 209 if (mSpan.fTiny) {
705 if (fTiny) {
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| H A D | Simplify.cpp | 668 bool fTiny; // if set, span may still be considered once for edge following member in struct:Span
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)) {
1454 if (angles.count() > 1 && !fTs[start].fTiny) {
1712 span->fTiny = false;
1737 span[less].fTiny = true;
1790 span[more - 1].fTiny = true;
2990 SkASSERT(!leftSegment->fTs[SkMin32(tIndex, endIndex)].fTiny);
3880 return mSpan.fTiny;
[all...] |
| /external/skia/experimental/Intersection/ |
| H A D | Simplify.cpp | 668 bool fTiny; // if set, span may still be considered once for edge following member in struct:Span
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)) {
1454 if (angles.count() > 1 && !fTs[start].fTiny) {
1712 span->fTiny = false;
1737 span[less].fTiny = true;
1790 span[more - 1].fTiny = true;
2990 SkASSERT(!leftSegment->fTs[SkMin32(tIndex, endIndex)].fTiny);
3880 return mSpan.fTiny;
[all...] |
Completed in 242 milliseconds