Lines Matching defs:SkRegion
9 #include "SkRegion.h"
12 static void Union(SkRegion* rgn, const SkIRect& rect) {
13 rgn->op(rect, SkRegion::kUnion_Op);
23 SkRegion r;
63 // These test SkRegion::contains(Rect) and SkRegion::contains(Region)
65 SkRegion container;
72 SkRegion rgn;
80 SkRegion valid(SkIRect::MakeWH(10, 10));
81 SkRegion empty, empty2;
109 static void randRgn(SkRandom& rand, SkRegion* rgn, int n) {
112 rgn->op(randRect(rand), SkRegion::kUnion_Op);
116 static bool slow_contains(const SkRegion& outer, const SkRegion& inner) {
117 SkRegion tmp;
118 tmp.op(outer, inner, SkRegion::kUnion_Op);
122 static bool slow_contains(const SkRegion& outer, const SkIRect& r) {
123 SkRegion tmp;
124 tmp.op(outer, SkRegion(r), SkRegion::kUnion_Op);
128 static bool slow_intersects(const SkRegion& outer, const SkRegion& inner) {
129 SkRegion tmp;
130 return tmp.op(outer, inner, SkRegion::kIntersect_Op);
133 static void test_contains_iter(skiatest::Reporter* reporter, const SkRegion& rgn) {
134 SkRegion::Iterator iter(rgn);
145 const SkRegion& a, const SkRegion& b) {
162 static void test_intersects_iter(skiatest::Reporter* reporter, const SkRegion& rgn) {
163 SkRegion::Iterator iter(rgn);
174 const SkRegion& a, const SkRegion& b) {
185 const SkRegion& a, const SkRegion&)) {
188 SkRegion outer;
190 SkRegion inner;
205 SkRegion rgn0, rgn1;
208 rgn0.op(rect[i], SkRegion::kUnion_Op);
242 SkRegion rgn0, rgn1;