HomeSort by relevance Sort by last modified time
    Searched refs:fOther (Results 1 - 25 of 34) sorted by null

1 2

  /external/chromium_org/third_party/skia/src/pathops/
SkOpSpan.h 18 double fOtherT; // value at fOther[fOtherIndex].fT
19 SkOpSegment* fOther;
SkPathOpsDebug.cpp 306 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...]
SkOpContour.cpp 24 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...]
SkOpSegment.cpp 114 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 != other2)
    [all...]
SkPathOpsOp.cpp 16 const SkOpSpan& backPtr = span->fOther->span(span->fOtherIndex);
17 SkOpSegment* segment = backPtr.fOther;
211 last->fOther->span(last->fOtherIndex).fOther->debugID(), last->fWindSum,
SkPathOpsSimplify.cpp 87 last->fOther->span(last->fOtherIndex).fOther->debugID(), last->fWindSum,
SkOpContour.h 22 SkOpContour* fOther;
SkPathOpsCommon.cpp 141 const SkOpSpan& backPtr = span->fOther->span(span->fOtherIndex);
142 SkOpSegment* segment = backPtr.fOther;
SkOpSegment.h 387 SkOpSegment* fOther;
  /external/skia/src/pathops/
SkOpSpan.h 18 double fOtherT; // value at fOther[fOtherIndex].fT
19 SkOpSegment* fOther;
SkPathOpsDebug.cpp 306 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...]
SkOpContour.cpp 24 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...]
SkOpSegment.cpp 114 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 != other2)
    [all...]
SkPathOpsOp.cpp 16 const SkOpSpan& backPtr = span->fOther->span(span->fOtherIndex);
17 SkOpSegment* segment = backPtr.fOther;
211 last->fOther->span(last->fOtherIndex).fOther->debugID(), last->fWindSum,
SkPathOpsSimplify.cpp 87 last->fOther->span(last->fOtherIndex).fOther->debugID(), last->fWindSum,
SkOpContour.h 22 SkOpContour* fOther;
SkPathOpsCommon.cpp 141 const SkOpSpan& backPtr = span->fOther->span(span->fOtherIndex);
142 SkOpSegment* segment = backPtr.fOther;
  /external/chromium_org/third_party/skia/tests/
PathOpsDebug.cpp 158 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/skia/tests/
PathOpsDebug.cpp 158 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/experimental/Intersection/
Simplify.cpp 656 Segment* fOther;
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
    [all...]
ShapeOps.cpp 24 const Span& backPtr = span->fOther->span(span->fOtherIndex);
25 Segment* segment = backPtr.fOther;
thingsToDo.txt 195 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/
Simplify.cpp 656 Segment* fOther;
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
    [all...]
ShapeOps.cpp 24 const Span& backPtr = span->fOther->span(span->fOtherIndex);
25 Segment* segment = backPtr.fOther;
thingsToDo.txt 195 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 417 milliseconds

1 2