OLD | NEW |
(Empty) | |
| 1 /* |
| 2 * Copyright 2012 Google Inc. |
| 3 * |
| 4 * Use of this source code is governed by a BSD-style license that can be |
| 5 * found in the LICENSE file. |
| 6 */ |
| 7 #include "SkPathOpsTriangle.h" |
| 8 #include "Test.h" |
| 9 |
| 10 static const SkDTriangle tests[] = { |
| 11 {{{2, 0}, {3, 1}, {2, 2}}}, |
| 12 {{{3, 1}, {2, 2}, {1, 1}}}, |
| 13 {{{3, 0}, {2, 1}, {3, 2}}}, |
| 14 }; |
| 15 |
| 16 static const SkDPoint inPoint[] = { |
| 17 {2.5, 1}, |
| 18 {2, 1.5}, |
| 19 {2.5, 1}, |
| 20 }; |
| 21 |
| 22 static const SkDPoint outPoint[] = { |
| 23 {3, 0}, |
| 24 {2.5, 2}, |
| 25 {2.5, 2}, |
| 26 }; |
| 27 |
| 28 static const size_t tests_count = sizeof(tests) / sizeof(tests[0]); |
| 29 |
| 30 static void TriangleUtilitiesTest(skiatest::Reporter* reporter) { |
| 31 for (size_t index = 0; index < tests_count; ++index) { |
| 32 const SkDTriangle& triangle = tests[index]; |
| 33 bool result = triangle.contains(inPoint[index]); |
| 34 if (!result) { |
| 35 SkDebugf("%s [%d] expected point in triangle\n", __FUNCTION__, index
); |
| 36 REPORTER_ASSERT(reporter, 0); |
| 37 } |
| 38 result = triangle.contains(outPoint[index]); |
| 39 if (result) { |
| 40 SkDebugf("%s [%d] expected point outside triangle\n", __FUNCTION__,
index); |
| 41 REPORTER_ASSERT(reporter, 0); |
| 42 } |
| 43 } |
| 44 } |
| 45 |
| 46 #include "TestClassDef.h" |
| 47 DEFINE_TESTCLASS("PathOpsTriangleUtilities", PathOpsTriangleUtilitiesClass, Tria
ngleUtilitiesTest) |
OLD | NEW |