Lines Matching defs:radii
29 SkVector radii[4] = {
33 rr.setRectRadii(r, radii);
35 REPORTER_ASSERT(reporter, (double) rr.radii(SkRRect::kUpperRight_Corner).fY +
36 (double) rr.radii(SkRRect::kLowerRight_Corner).fY <=
70 static const SkVector radii[4] = { { 0, 1 }, { 2, 3 }, { 4, 5 }, { 6, 7 } };
91 r.setRectRadii(oooRects[i], radii);
113 r.setRectRadii(emptyRects[i], radii);
160 // This test doesn't hold if the radii will be rescaled by SkRRect
165 REPORTER_ASSERT(reporter, rquad[i] == rr.radii((SkRRect::Corner) i));
169 SkVector radii[4] = { { l, t }, { r, t }, { r, b }, { l, b } };
170 rr2.setRectRadii(rect, radii);
186 REPORTER_ASSERT(reporter, zeroPt == empty.radii((SkRRect::Corner) i));
199 REPORTER_ASSERT(reporter, zeroPt == rr1.radii((SkRRect::Corner) i));
219 SkPointPriv::EqualsWithinTolerance(rr2.radii((SkRRect::Corner) i),
240 REPORTER_ASSERT(reporter, p == rr3.radii((SkRRect::Corner) i));
273 REPORTER_ASSERT(reporter, radii2[i] == rr5.radii((SkRRect::Corner) i));
304 SkPoint radii[4] = { { 0, 0 }, { 0, 0 }, { 0, 0 }, { 0, 0 } };
307 rr2.setRectRadii(rect, radii);
344 SkPoint radii[4] = { { 0, 0 }, { 20, 20 }, { 50, 50 }, { 20, 50 } };
347 rr2.setRectRadii(rect, radii);
355 // When the radii exceed the base rect they are proportionally scaled down
358 SkPoint radii[4] = { { 50, 100 }, { 100, 50 }, { 50, 100 }, { 100, 50 } };
361 rr1.setRectRadii(rect, radii);
365 const SkPoint& p = rr1.radii(SkRRect::kUpperLeft_Corner);
370 // Negative radii should be capped at zero
376 const SkPoint& p2 = rr2.radii(SkRRect::kUpperLeft_Corner);
537 const SkVector& origUL = orig.radii(SkRRect::kUpperLeft_Corner); \
538 const SkVector& origUR = orig.radii(SkRRect::kUpperRight_Corner); \
539 const SkVector& origLR = orig.radii(SkRRect::kLowerRight_Corner); \
540 const SkVector& origLL = orig.radii(SkRRect::kLowerLeft_Corner); \
541 const SkVector& dstUL = dst.radii(SkRRect::kUpperLeft_Corner); \
542 const SkVector& dstUR = dst.radii(SkRRect::kUpperRight_Corner); \
543 const SkVector& dstLR = dst.radii(SkRRect::kLowerRight_Corner); \
544 const SkVector& dstLL = dst.radii(SkRRect::kLowerLeft_Corner)
590 orig.radii((SkRRect::Corner) i) == dst.radii((SkRRect::Corner) i));
680 REPORTER_ASSERT(reporter, SkScalarNearlyEqual(dst.radii((SkRRect::Corner) i).fX,
681 orig.radii((SkRRect::Corner) i).fX * xScale));
682 REPORTER_ASSERT(reporter, SkScalarNearlyEqual(dst.radii((SkRRect::Corner) i).fY,
683 orig.radii((SkRRect::Corner) i).fY * yScale));
918 SkVector radii[4] = { { 0, SkIntToScalar(1) },
922 rrect.setRectRadii(r, radii);
928 // further off into space - yielding numerical issues when the rect & radii
950 SkScalarNearlyEqual(dst.radii((SkRRect::Corner)i).fX, halfWidth));
952 SkScalarNearlyEqual(dst.radii((SkRRect::Corner)i).fY, halfHeight));
1000 // rrect should scale down the radii to make this legal
1054 // And vice versa with large y and small x radii
1069 SkVector radii[4] = {{rng.nextRangeF(0.f, maxRadiusX), rng.nextRangeF(0.f, maxRadiusY)},
1074 float maxLeft = std::max(radii[0].fX, radii[3].fX);
1075 float maxTop = std::max(radii[0].fY, radii[1].fY);
1076 float maxRight = std::max(radii[1].fX, radii[2].fX);
1077 float maxBottom = std::max(radii[2].fY, radii[3].fY);
1081 rr.setRectRadii(outer, radii);
1109 // their corner radii will be a one of A's, B's, or rectangular.
1123 SkVector radii[4] = {
1124 (tl == kA ? a : (tl == kB ? b : kRect)).radii(SkRRect::kUpperLeft_Corner),
1125 (tr == kA ? a : (tr == kB ? b : kRect)).radii(SkRRect::kUpperRight_Corner),
1126 (br == kA ? a : (br == kB ? b : kRect)).radii(SkRRect::kLowerRight_Corner),
1127 (bl == kA ? a : (bl == kB ? b : kRect)).radii(SkRRect::kLowerLeft_Corner)
1130 expected.setRectRadii(expectedBounds, radii);
1190 // in check_success, so all we have to specify are the expected corner radii
1205 // An inset is contained inside the original (note that SkRRect::inset modifies radii too) so
1210 // A rectangle exactly matching the corners of the rrect bounds keeps the rrect radii,
1263 // all corners having radii = r.