Lines Matching refs:more
562 // OPTIMIZATION: if there are three or more identical Ts, then
630 int more = 1;
631 while (fTs.end() - &span[more - 1] > 1 && AlmostEqualUlps(span[more].fPt, pt)) {
633 double tEndInterval = span[more].fT - newT;
640 ++more;
643 --more;
644 while (more - 1 > less && span[more].fPt == span[more - 1].fPt
645 && span[more].fT == span[more - 1].fT) {
646 --more;
648 if (less == more) {
651 if (precisely_negative(span[more].fT - span[less].fT)) {
655 bool tiny = span[less].fPt == span[more].fPt;
664 } while (++index < more);
678 // have three or more coincident edges. Shouldn't this subtract the difference
1331 // look ahead to see if zeroing more spans will allows us to catch up
1932 // see if spans with two or more intersections have the same number on the other end
2152 // OPTIMIZATION: this may fix indices more than once. Build an array of unique segments to
2180 // see if spans with two or more intersections all agree on common t and point values
2292 SkASSERT(!other->fLoop); // FIXME: we need more complicated logic for pair of loops
2365 // OPTIMIZATION: this may fix indices more than once. Build an array of unique segments to
2713 // more than one viable candidate -- measure angles to find best
2842 // more than one viable candidate -- measure angles to find best
3085 // if the topmost T is not on end, or is three-way or more, find left
3511 // wastes time, it shouldn't do any more than spin through the T spans.
