Lines Matching refs:convex
291 // not change the generation ID. For convex polygons, we check == so that more complex
294 (a.fShape.convex() &&
860 // Same convex path, by ==
861 run_test_case(r, TestCase::Build("same-convex", kDeviceBounds)
867 run_test_case(r, TestCase::Build("same-local-convex", kDeviceBounds)
1247 // Tests that a convex path element can contain a rect or round rect, allowing the stack to be
1257 run_test_case(r, TestCase::Build("convex+rect-intersect", kDeviceBounds)
1262 run_test_case(r, TestCase::Build("convex+rrect-intersect", kDeviceBounds)
1269 run_test_case(r, TestCase::Build("convex+rect-difference", kDeviceBounds)
1274 run_test_case(r, TestCase::Build("convex+rrect-difference", kDeviceBounds)
1282 run_test_case(r, TestCase::Build("convex-diff+rect-int", kDeviceBounds)
1287 run_test_case(r, TestCase::Build("convex-diff+rrect-int", kDeviceBounds)
1294 run_test_case(r, TestCase::Build("convex-int+rect-diff", kDeviceBounds)
1300 run_test_case(r, TestCase::Build("convex-int+rrect-diff", kDeviceBounds)
1500 SkPath convex = make_octagon(rect, 10.f, 10.f);
1511 run_test_case(r, TestCase::Build("convex-intersect", kDeviceBounds)
1512 .actual().intersect().path(convex).finishElements()
1525 run_test_case(r, TestCase::Build("convex-difference", kDeviceBounds)
1526 .actual().difference().path(convex).finishElements()
1637 // NOTE: We don't set any expectations here, since convex just calls