Lines Matching full:sorted

24 horizontal values when sorted. When equal to or greater than fRight, Rect is empty.
30 vertical values when sorted. When equal to or greater than fBottom, Rect is empty.
36 horizontal values when sorted. When equal to or less than fLeft, Rect is empty.
42 vertical values when sorted. When equal to or less than fTop, Rect is empty.
264         SkDebugf("sorted: {%g, %g, %g, %g} is" "%s empty\n", rect.left(), rect.top(), rect.right(),
269 sorted: {10, 40, 20, 50} is not empty
271 sorted: {20, 40, 20, 50} is empty
290         SkDebugf("rect: {%g, %g, %g, %g} is" "%s sorted\n", rect.left(), rect.top(), rect.right(),
293         SkDebugf("sorted: {%g, %g, %g, %g} is" "%s sorted\n", rect.left(), rect.top(), rect.right(),
297 rect: {20, 40, 10, 50} is not sorted
298 sorted: {10, 40, 20, 50} is sorted
299 rect: {20, 40, 20, 50} is sorted
300 sorted: {20, 40, 20, 50} is sorted
344     SkRect sorted = unsorted.makeSorted();
345     SkDebugf("sorted.fLeft: %g sorted.x(): %g\n", sorted.fLeft, sorted.x());
348 sorted.fLeft: 10 sorted.x(): 10
367     SkRect sorted = unsorted.makeSorted();
368     SkDebugf("sorted.fTop: %g sorted.y(): %g\n", sorted.fTop, sorted.y());
371 sorted.fTop: 5 sorted.y(): 5
384 #Line # returns smaller bounds in x, if sorted ##
390     SkRect sorted = unsorted.makeSorted();
391     SkDebugf("sorted.fLeft: %g sorted.left(): %g\n", sorted.fLeft, sorted.left());
394 sorted.fLeft: 10 sorted.left(): 10
407 #Line # returns smaller bounds in y, if sorted ##
413     SkRect sorted = unsorted.makeSorted();
414     SkDebugf("sorted.fTop: %g sorted.top(): %g\n", sorted.fTop, sorted.top());
417 sorted.fTop: 5 sorted.top(): 5
430 #Line # returns larger bounds in x, if sorted ##
436     SkRect sorted = unsorted.makeSorted();
437     SkDebugf("sorted.fRight: %g sorted.right(): %g\n", sorted.fRight, sorted.right());
440 sorted.fRight: 15 sorted.right(): 15
453 #Line # returns larger bounds in y, if sorted ##
459     SkRect sorted = unsorted.makeSorted();
460     SkDebugf("sorted.fBottom: %g sorted.bottom(): %g\n", sorted.fBottom, sorted.bottom());
463 sorted.fBottom: 25 sorted.bottom(): 25
1495 Since Rect is not sorted, first result is copy of toJoin.
1498     SkRect sorted = rect.makeSorted();
1502     sorted.joinNonEmptyArg(toJoin);
1503     SkDebugf("sorted: %g, %g, %g, %g\n", sorted.fLeft, sorted.fTop, sorted.fRight, sorted.fBottom);
1506 sorted: 10, 0, 55, 100
1524 Since Rect is not sorted, first result is not useful.
1527     SkRect sorted = rect.makeSorted();
1531     sorted.joinPossiblyEmptyRect(toJoin);
1532     SkDebugf("sorted: %g, %g, %g, %g\n", sorted.fLeft, sorted.fTop, sorted.fRight, sorted.fBottom);
1535 sorted: 10, 0, 55, 100
1718     SkDebugf("sorted: %g, %g, %g, %g\n", rect.fLeft, rect.fTop, rect.fRight, rect.fBottom);
1721 sorted: 20.5, 10.5, 30.5, 50.5
1742     SkDebugf("sorted: %g, %g, %g, %g\n", sort.fLeft, sort.fTop, sort.fRight, sort.fBottom);
1745 sorted: 20.5, 10.5, 30.5, 50.5