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 "PathOpsTestCommon.h" |
7 #include "SkPathOpsLine.h" | 8 #include "SkPathOpsLine.h" |
8 #include "Test.h" | 9 #include "Test.h" |
9 | 10 |
10 static const SkDLine tests[] = { | 11 static const SkDLine tests[] = { |
11 {{{2, 1}, {2, 1}}}, | 12 {{{2, 1}, {2, 1}}}, |
12 {{{2, 1}, {1, 1}}}, | 13 {{{2, 1}, {1, 1}}}, |
13 {{{2, 1}, {2, 2}}}, | 14 {{{2, 1}, {2, 2}}}, |
14 {{{1, 1}, {2, 2}}}, | 15 {{{1, 1}, {2, 2}}}, |
15 {{{3, 0}, {2, 1}}}, | 16 {{{3, 0}, {2, 1}}}, |
16 {{{3, 2}, {1, 1}}}, | 17 {{{3, 2}, {1, 1}}}, |
17 }; | 18 }; |
18 | 19 |
19 static const SkDPoint left[] = { | 20 static const SkDPoint left[] = { |
20 {2, 1}, | 21 {2, 1}, |
21 {1, 0}, | 22 {1, 0}, |
22 {1, 1}, | 23 {1, 1}, |
23 {1, 2}, | 24 {1, 2}, |
24 {2, 0}, | 25 {2, 0}, |
25 {2, 1} | 26 {2, 1} |
26 }; | 27 }; |
27 | 28 |
28 static const size_t tests_count = SK_ARRAY_COUNT(tests); | 29 static const size_t tests_count = SK_ARRAY_COUNT(tests); |
29 | 30 |
30 static void PathOpsLineUtilitiesTest(skiatest::Reporter* reporter) { | 31 static void PathOpsLineUtilitiesTest(skiatest::Reporter* reporter) { |
31 for (size_t index = 0; index < tests_count; ++index) { | 32 for (size_t index = 0; index < tests_count; ++index) { |
32 const SkDLine& line = tests[index]; | 33 const SkDLine& line = tests[index]; |
| 34 SkASSERT(ValidLine(line)); |
33 SkDLine line2; | 35 SkDLine line2; |
34 SkPoint pts[2] = {line[0].asSkPoint(), line[1].asSkPoint()}; | 36 SkPoint pts[2] = {line[0].asSkPoint(), line[1].asSkPoint()}; |
35 line2.set(pts); | 37 line2.set(pts); |
36 REPORTER_ASSERT(reporter, line[0] == line2[0] && line[1] == line2[1]); | 38 REPORTER_ASSERT(reporter, line[0] == line2[0] && line[1] == line2[1]); |
37 const SkDPoint& pt = left[index]; | 39 const SkDPoint& pt = left[index]; |
| 40 SkASSERT(ValidPoint(pt)); |
38 double result = line.isLeft(pt); | 41 double result = line.isLeft(pt); |
39 if ((result <= 0 && index >= 1) || (result < 0 && index == 0)) { | 42 if ((result <= 0 && index >= 1) || (result < 0 && index == 0)) { |
40 SkDebugf("%s [%d] expected left\n", __FUNCTION__, index); | 43 SkDebugf("%s [%d] expected left\n", __FUNCTION__, index); |
41 REPORTER_ASSERT(reporter, 0); | 44 REPORTER_ASSERT(reporter, 0); |
42 } | 45 } |
43 line2 = line.subDivide(1, 0); | 46 line2 = line.subDivide(1, 0); |
44 REPORTER_ASSERT(reporter, line[0] == line2[1] && line[1] == line2[0]); | 47 REPORTER_ASSERT(reporter, line[0] == line2[1] && line[1] == line2[0]); |
45 line2 = SkDLine::SubDivide(pts, 1, 0); | 48 line2 = SkDLine::SubDivide(pts, 1, 0); |
46 REPORTER_ASSERT(reporter, line[0] == line2[1] && line[1] == line2[0]); | 49 REPORTER_ASSERT(reporter, line[0] == line2[1] && line[1] == line2[0]); |
47 SkDPoint mid = line.xyAtT(.5); | 50 SkDPoint mid = line.xyAtT(.5); |
48 REPORTER_ASSERT(reporter, approximately_equal((line[0].fX + line[1].fX)
/ 2, mid.fX)); | 51 REPORTER_ASSERT(reporter, approximately_equal((line[0].fX + line[1].fX)
/ 2, mid.fX)); |
49 REPORTER_ASSERT(reporter, approximately_equal((line[0].fY + line[1].fY)
/ 2, mid.fY)); | 52 REPORTER_ASSERT(reporter, approximately_equal((line[0].fY + line[1].fY)
/ 2, mid.fY)); |
50 } | 53 } |
51 } | 54 } |
52 | 55 |
53 #include "TestClassDef.h" | 56 #include "TestClassDef.h" |
54 DEFINE_TESTCLASS_SHORT(PathOpsLineUtilitiesTest) | 57 DEFINE_TESTCLASS_SHORT(PathOpsLineUtilitiesTest) |
OLD | NEW |