| 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 "SkPathOpsPoint.h" | 8 #include "SkPathOpsPoint.h" |
| 8 #include "Test.h" | 9 #include "Test.h" |
| 9 | 10 |
| 10 static const SkDPoint tests[] = { | 11 static const SkDPoint tests[] = { |
| 11 {0, 0}, | 12 {0, 0}, |
| 12 {1, 0}, | 13 {1, 0}, |
| 13 {0, 1}, | 14 {0, 1}, |
| 14 {2, 1}, | 15 {2, 1}, |
| 15 {1, 2}, | 16 {1, 2}, |
| 16 {1, 1}, | 17 {1, 1}, |
| 17 {2, 2} | 18 {2, 2} |
| 18 }; | 19 }; |
| 19 | 20 |
| 20 static const size_t tests_count = SK_ARRAY_COUNT(tests); | 21 static const size_t tests_count = SK_ARRAY_COUNT(tests); |
| 21 | 22 |
| 22 static void PathOpsDVectorTest(skiatest::Reporter* reporter) { | 23 static void PathOpsDVectorTest(skiatest::Reporter* reporter) { |
| 23 for (size_t index = 0; index < tests_count - 1; ++index) { | 24 for (size_t index = 0; index < tests_count - 1; ++index) { |
| 24 SkDVector v1 = tests[index + 1] - tests[index]; | 25 SkDVector v1 = tests[index + 1] - tests[index]; |
| 26 SkASSERT(ValidVector(v1)); |
| 25 SkDVector v2 = tests[index] - tests[index + 1]; | 27 SkDVector v2 = tests[index] - tests[index + 1]; |
| 28 SkASSERT(ValidVector(v2)); |
| 26 v1 += v2; | 29 v1 += v2; |
| 27 REPORTER_ASSERT(reporter, v1.fX == 0 && v1.fY == 0); | 30 REPORTER_ASSERT(reporter, v1.fX == 0 && v1.fY == 0); |
| 28 SkDPoint p = tests[index + 1] + v2; | 31 SkDPoint p = tests[index + 1] + v2; |
| 29 REPORTER_ASSERT(reporter, p == tests[index]); | 32 REPORTER_ASSERT(reporter, p == tests[index]); |
| 30 v2 -= v2; | 33 v2 -= v2; |
| 31 REPORTER_ASSERT(reporter, v2.fX == 0 && v2.fY == 0); | 34 REPORTER_ASSERT(reporter, v2.fX == 0 && v2.fY == 0); |
| 32 v1 = tests[index + 1] - tests[index]; | 35 v1 = tests[index + 1] - tests[index]; |
| 33 v1 /= 2; | 36 v1 /= 2; |
| 34 v1 *= 2; | 37 v1 *= 2; |
| 35 v1 -= tests[index + 1] - tests[index]; | 38 v1 -= tests[index + 1] - tests[index]; |
| 36 REPORTER_ASSERT(reporter, v1.fX == 0 && v1.fY == 0); | 39 REPORTER_ASSERT(reporter, v1.fX == 0 && v1.fY == 0); |
| 37 SkVector sv = v1.asSkVector(); | 40 SkVector sv = v1.asSkVector(); |
| 38 REPORTER_ASSERT(reporter, sv.fX == 0 && sv.fY == 0); | 41 REPORTER_ASSERT(reporter, sv.fX == 0 && sv.fY == 0); |
| 39 v1 = tests[index + 1] - tests[index]; | 42 v1 = tests[index + 1] - tests[index]; |
| 40 double lenSq = v1.lengthSquared(); | 43 double lenSq = v1.lengthSquared(); |
| 41 double v1Dot = v1.dot(v1); | 44 double v1Dot = v1.dot(v1); |
| 42 REPORTER_ASSERT(reporter, lenSq == v1Dot); | 45 REPORTER_ASSERT(reporter, lenSq == v1Dot); |
| 43 REPORTER_ASSERT(reporter, approximately_equal(sqrt(lenSq), v1.length()))
; | 46 REPORTER_ASSERT(reporter, approximately_equal(sqrt(lenSq), v1.length()))
; |
| 44 double v1Cross = v1.cross(v1); | 47 double v1Cross = v1.cross(v1); |
| 45 REPORTER_ASSERT(reporter, v1Cross == 0); | 48 REPORTER_ASSERT(reporter, v1Cross == 0); |
| 46 } | 49 } |
| 47 } | 50 } |
| 48 | 51 |
| 49 #include "TestClassDef.h" | 52 #include "TestClassDef.h" |
| 50 DEFINE_TESTCLASS_SHORT(PathOpsDVectorTest) | 53 DEFINE_TESTCLASS_SHORT(PathOpsDVectorTest) |
| OLD | NEW |