Searched refs:fOther (Results 1 - 25 of 30) sorted by relevance

12

/external/chromium_org/third_party/skia/src/pathops/
H A DSkOpSpan.h18 double fOtherT; // value at fOther[fOtherIndex].fT
19 SkOpSegment* fOther; member in struct:SkOpSpan
H A DSkPathOpsDebug.cpp307 if (fTs[i].fT == t && fTs[i].fOther == &other && fTs[i].fOtherT == otherT) {
369 SkDebugf(" [o=%d", fTs[i].fOther->fID);
374 SkDebugf(",%d", fTs[i].fOther->fID);
426 const SkOpSegment* other = fTs[i].fOther;
447 SK_ALWAYSBREAK(&span == &span.fOther->fTs[span.fOtherIndex].fOther->
448 fTs[span.fOther->fTs[span.fOtherIndex].fOtherIndex]);
450 span.fT, span.fOther->fTs[span.fOtherIndex].fOtherIndex, pt.fX, pt.fY,
468 SK_ALWAYSBREAK(&span == &span.fOther->fTs[span.fOtherIndex].fOther
[all...]
H A DSkOpContour.cpp24 coincidence.fOther = other;
83 SkOpContour* otherContour = coincidence.fOther;
147 SkOpContour* otherContour = coincidence.fOther;
158 SkOpContour* innerOtherContour = innerCoin.fOther;
182 coincidence.fOther = other;
216 const SkOpContour* otherContour = coincidence.fOther;
302 SkOpContour* otherContour = coincidence.fOther;
313 SkOpContour* innerOtherContour = innerCoin.fOther;
327 SkASSERT((oneIdx ? this : oneCoin.fOther) == (twoIdx ? this : twoCoin.fOther));
[all...]
H A DSkOpSegment.cpp114 SkOpSegment* other = span->fOther;
307 if (span.fOther == other && span.fPt == startPt) {
469 other = span.fOther;
499 other = span.fOther;
597 span->fOther = other;
866 other = span->fOther;
926 SkOpSegment* other1 = span.fOther;
930 SkOpSegment* other2 = span2.fOther;
933 if (oSpan.fOther != other2) {
942 if (oSpan.fOther !
[all...]
H A DSkPathOpsOp.cpp16 const SkOpSpan& backPtr = span->fOther->span(span->fOtherIndex);
17 SkOpSegment* segment = backPtr.fOther;
211 last->fOther->span(last->fOtherIndex).fOther->debugID(), last->fWindSum,
H A DSkPathOpsSimplify.cpp87 last->fOther->span(last->fOtherIndex).fOther->debugID(), last->fWindSum,
H A DSkOpContour.h22 SkOpContour* fOther; member in struct:SkCoincidence
H A DSkPathOpsCommon.cpp141 const SkOpSpan& backPtr = span->fOther->span(span->fOtherIndex);
142 SkOpSegment* segment = backPtr.fOther;
H A DSkOpSegment.h389 SkOpSegment* fOther; member in struct:SkOpSegment::MissingSpan
/external/skia/src/pathops/
H A DSkOpSpan.h18 double fOtherT; // value at fOther[fOtherIndex].fT
19 SkOpSegment* fOther; member in struct:SkOpSpan
H A DSkPathOpsDebug.cpp306 if (fTs[i].fT == t && fTs[i].fOther == &other && fTs[i].fOtherT == otherT) {
368 SkDebugf(" [o=%d", fTs[i].fOther->fID);
373 SkDebugf(",%d", fTs[i].fOther->fID);
425 const SkOpSegment* other = fTs[i].fOther;
446 SK_ALWAYSBREAK(&span == &span.fOther->fTs[span.fOtherIndex].fOther->
447 fTs[span.fOther->fTs[span.fOtherIndex].fOtherIndex]);
449 span.fT, span.fOther->fTs[span.fOtherIndex].fOtherIndex, pt.fX, pt.fY,
467 SK_ALWAYSBREAK(&span == &span.fOther->fTs[span.fOtherIndex].fOther
[all...]
H A DSkOpContour.cpp24 coincidence.fOther = other;
68 SkOpContour* otherContour = coincidence.fOther;
139 SkOpContour* otherContour = coincidence.fOther;
150 SkOpContour* innerOtherContour = innerCoin.fOther;
174 coincidence.fOther = other;
208 const SkOpContour* otherContour = coincidence.fOther;
291 SkOpContour* otherContour = coincidence.fOther;
302 SkOpContour* innerOtherContour = innerCoin.fOther;
316 SkASSERT((oneIdx ? this : oneCoin.fOther) == (twoIdx ? this : twoCoin.fOther));
[all...]
H A DSkOpSegment.cpp114 SkOpSegment* other = span->fOther;
306 if (span.fOther == other && span.fPt == startPt) {
465 other = span.fOther;
495 other = span.fOther;
593 span->fOther = other;
848 SkOpSegment* other = span->fOther;
893 SkOpSegment* other1 = span.fOther;
897 SkOpSegment* other2 = span2.fOther;
900 if (oSpan.fOther != other2) {
909 if (oSpan.fOther !
[all...]
H A DSkPathOpsOp.cpp16 const SkOpSpan& backPtr = span->fOther->span(span->fOtherIndex);
17 SkOpSegment* segment = backPtr.fOther;
211 last->fOther->span(last->fOtherIndex).fOther->debugID(), last->fWindSum,
H A DSkPathOpsSimplify.cpp87 last->fOther->span(last->fOtherIndex).fOther->debugID(), last->fWindSum,
H A DSkOpContour.h22 SkOpContour* fOther; member in struct:SkCoincidence
H A DSkPathOpsCommon.cpp141 const SkOpSpan& backPtr = span->fOther->span(span->fOtherIndex);
142 SkOpSegment* segment = backPtr.fOther;
/external/skia/tests/
H A DPathOpsDebug.cpp158 const SkOpSegment& s2 = coin.fOther->fSegments[otherIndex];
489 const SkOpSpan& oSpan = span->fOther->span(span->fOtherIndex);
490 const SkOpSegment* segment = oSpan.fOther;
499 if (!fOther) {
502 int oppCount = fOther->count();
504 const SkOpSpan& otherSpan = fOther->span(index);
510 const SkOpSegment* candidate = otherSpan.fOther;
529 if (fOther) {
530 SkDebugf(" other.fID=%d", fOther->debugID());
/external/chromium_org/third_party/skia/tests/
H A DPathOpsDebug.cpp290 const SkOpSegment& s2 = coin.fOther->fSegments[otherIndex];
621 const SkOpSpan& oSpan = span->fOther->span(span->fOtherIndex);
622 const SkOpSegment* segment = oSpan.fOther;
631 if (!fOther) {
634 int oppCount = fOther->count();
636 const SkOpSpan& otherSpan = fOther->span(index);
642 const SkOpSegment* candidate = otherSpan.fOther;
661 if (fOther) {
662 SkDebugf(" other.fID=%d", fOther->debugID());
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DSimplify.cpp656 Segment* fOther; member in struct:Span
659 double fOtherT; // value at fOther[fOtherIndex].fT
726 if (cmp && (*fSpans)[fEnd].fOther != rh.fSegment // tangents not absolutely identical
727 && (*rh.fSpans)[rh.fEnd].fOther != fSegment) { // and not intersecting
1309 Segment* other = span->fOther;
1706 span->fOther = other;
2029 if (approximately_negative(span.fT - t) && span.fOther == &other
2099 while (--lesser >= 0 && (includeOpp || fTs[lesser].fOther->fOperand == fOperand)
2105 } while (++index < fTs.count() && (includeOpp || fTs[index].fOther->fOperand == fOperand)
2111 Segment* other = span->fOther;
[all...]
H A DShapeOps.cpp24 const Span& backPtr = span->fOther->span(span->fOtherIndex);
25 Segment* segment = backPtr.fOther;
H A DthingsToDo.txt195 if (minSpan.fOther == other) {
205 if (span.fOther != other) {
213 if (span.fOther != other) {
370 if (!span.fCoincident || span.fOther != other) {
403 if (span.fCoincident || span.fOther == other) {
415 Segment* oSegment = span.fOther;
451 Segment* other = fTs[start].fOther;
/external/skia/experimental/Intersection/
H A DSimplify.cpp656 Segment* fOther; member in struct:Span
659 double fOtherT; // value at fOther[fOtherIndex].fT
726 if (cmp && (*fSpans)[fEnd].fOther != rh.fSegment // tangents not absolutely identical
727 && (*rh.fSpans)[rh.fEnd].fOther != fSegment) { // and not intersecting
1309 Segment* other = span->fOther;
1706 span->fOther = other;
2029 if (approximately_negative(span.fT - t) && span.fOther == &other
2099 while (--lesser >= 0 && (includeOpp || fTs[lesser].fOther->fOperand == fOperand)
2105 } while (++index < fTs.count() && (includeOpp || fTs[index].fOther->fOperand == fOperand)
2111 Segment* other = span->fOther;
[all...]
H A DShapeOps.cpp24 const Span& backPtr = span->fOther->span(span->fOtherIndex);
25 Segment* segment = backPtr.fOther;
H A DthingsToDo.txt195 if (minSpan.fOther == other) {
205 if (span.fOther != other) {
213 if (span.fOther != other) {
370 if (!span.fCoincident || span.fOther != other) {
403 if (span.fCoincident || span.fOther == other) {
415 Segment* oSegment = span.fOther;
451 Segment* other = fTs[start].fOther;

Completed in 217 milliseconds

12