OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2012 Google Inc. | 2 * Copyright 2012 Google Inc. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
6 */ | 6 */ |
7 #include "PathOpsQuadIntersectionTestData.h" | 7 #include "PathOpsQuadIntersectionTestData.h" |
8 #include "PathOpsTestCommon.h" | 8 #include "PathOpsTestCommon.h" |
9 #include "SkIntersections.h" | 9 #include "SkIntersections.h" |
10 #include "SkPathOpsRect.h" | 10 #include "SkPathOpsRect.h" |
11 #include "SkReduceOrder.h" | 11 #include "SkReduceOrder.h" |
12 #include "Test.h" | 12 #include "Test.h" |
13 #include "TestClassDef.h" | |
14 | 13 |
15 static void standardTestCases(skiatest::Reporter* reporter) { | 14 static void standardTestCases(skiatest::Reporter* reporter) { |
16 bool showSkipped = false; | 15 bool showSkipped = false; |
17 for (size_t index = 0; index < quadraticTests_count; ++index) { | 16 for (size_t index = 0; index < quadraticTests_count; ++index) { |
18 const SkDQuad& quad1 = quadraticTests[index][0]; | 17 const SkDQuad& quad1 = quadraticTests[index][0]; |
19 SkASSERT(ValidQuad(quad1)); | 18 SkASSERT(ValidQuad(quad1)); |
20 const SkDQuad& quad2 = quadraticTests[index][1]; | 19 const SkDQuad& quad2 = quadraticTests[index][1]; |
21 SkASSERT(ValidQuad(quad2)); | 20 SkASSERT(ValidQuad(quad2)); |
22 SkReduceOrder reduce1, reduce2; | 21 SkReduceOrder reduce1, reduce2; |
23 int order1 = reduce1.reduce(quad1); | 22 int order1 = reduce1.reduce(quad1); |
(...skipping 476 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
500 intersectionFinder(0, 1); | 499 intersectionFinder(0, 1); |
501 } | 500 } |
502 | 501 |
503 DEF_TEST(PathOpsQuadIntersection, reporter) { | 502 DEF_TEST(PathOpsQuadIntersection, reporter) { |
504 oneOffTests(reporter); | 503 oneOffTests(reporter); |
505 coincidentTest(reporter); | 504 coincidentTest(reporter); |
506 standardTestCases(reporter); | 505 standardTestCases(reporter); |
507 if (false) QuadraticIntersection_IntersectionFinder(); | 506 if (false) QuadraticIntersection_IntersectionFinder(); |
508 if (false) QuadraticIntersection_PointFinder(); | 507 if (false) QuadraticIntersection_PointFinder(); |
509 } | 508 } |
OLD | NEW |