Lines Matching defs:other
103 SkOpSegment* other = oPtT->segment();
105 return other->activeAngleInner(oSpan, startPtr, endPtr, done);
426 // and one has winding computed, transfer to the other
545 SkOpSegment* other = this->isSimple(nextStart, &step); // advances nextStart
546 if ((*simple = other)) {
548 // spans with the same T value (but not 'other' spans)
558 return other;
651 SkOpSegment* other = this->isSimple(nextStart, &step); // advances nextStart
652 if (other) {
654 // spans with the same T value (but not 'other' spans)
664 return other;
747 SkOpSegment* other = this->isSimple(nextStart, &step); // advances nextStart
748 if (other) {
750 // spans with the same T value (but not 'other' spans)
760 return other;
864 SkOpSegment* other = this;
868 while ((other = other->nextChase(&start, &step, &minSpan, &last))) {
872 if (other->done()) {
882 other->markDone(minSpan);
898 SkOpSegment* other = this;
900 while ((other = other->nextChase(&start, &step, &spanStart, &last))) {
909 (void) other->markWinding(spanStart, winding);
923 SkOpSegment* other = this;
925 while ((other = other->nextChase(&start, &step, &spanStart, &last))) {
930 if (this->operand() == other->operand()) {
942 if (this->operand() == other->operand()) {
943 (void) other->markWinding(spanStart, winding, oppWinding);
945 (void) other->markWinding(spanStart, oppWinding, winding);
1080 SkOpSegment* other;
1086 other = otherPtT->segment();
1106 other = next->segment();
1130 return other;
1264 // if a span has more than one intersection, merge the other segments' span as needed
1507 // on the other hand, the below check is relatively inexpensive