Lines Matching refs:more
13 // A Path contains one of more Contours
1687 // OPTIMIZATION: if there are three or more identical Ts, then
1772 int more = 1;
1773 while (fTs.end() - &span[more - 1] > 1 && xyAtT(&span[more]) == xyAtT(span)) {
1775 if (span[more - 1].fDone) {
1778 double tEndInterval = span[more].fT - newT;
1790 span[more - 1].fTiny = true;
1791 span[more - 1].fDone = true;
1792 if (approximately_negative(span[more].fT - newT)) {
1793 if (approximately_greater_than_one(span[more].fT)) {
1794 span[more + 1].fUnsortableStart = true;
1795 span[more].fUnsortableEnd = true;
1798 span[more].fUnsortableStart = true;
1799 span[more - 1].fUnsortableEnd = true;
1804 double tEndInterval = span[more].fT - newT;
1816 SkASSERT(span[more - 1].fDone == span[more].fDone);
1818 setSpanT(more, 0);
1820 span->fT = newT = span[more].fT;
1823 ++more;
2436 // more than one viable candidate -- measure angles to find best
2558 // more than one viable candidate -- measure angles to find best
2902 // and use more concise logic like the old edge walker code?
2929 // if the topmost T is not on end, or is three-way or more, find left
3306 // wastes time, it shouldn't do any more than spin through the T spans.
3636 // return span if when chasing, two or more radiating spans are not done
3640 // or this code could be more complicated in detecting this case. Worth it?
4475 SkTDArray<Span> fTs; // two or more (always includes t=0 t=1)
