2 * Copyright 2012 Google Inc.
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
7 #include "PathOpsTestCommon.h"
8 #include "SkPathOpsTriangle.h"
11 static const SkDTriangle tests[] = {
12 {{{2, 0}, {3, 1}, {2, 2}}},
13 {{{3, 1}, {2, 2}, {1, 1}}},
14 {{{3, 0}, {2, 1}, {3, 2}}},
17 static const SkDPoint inPoint[] = {
23 static const SkDPoint outPoint[] = {
29 static const size_t tests_count = SK_ARRAY_COUNT(tests);
31 DEF_TEST(PathOpsTriangleUtilities, reporter) {
32 for (size_t index = 0; index < tests_count; ++index) {
33 const SkDTriangle& triangle = tests[index];
34 SkASSERT(ValidTriangle(triangle));
35 bool result = triangle.contains(inPoint[index]);
37 SkDebugf("%s [%d] expected point in triangle\n", __FUNCTION__, index);
38 REPORTER_ASSERT(reporter, 0);
40 result = triangle.contains(outPoint[index]);
42 SkDebugf("%s [%d] expected point outside triangle\n", __FUNCTION__, index);
43 REPORTER_ASSERT(reporter, 0);
48 static const SkDTriangle oneOff[] = {
49 {{{271.03291625750461, 5.0402503630087025e-05}, {275.21652430019037, 3.6997300650817753},
50 {279.25839233398438, 7.7416000366210938}}},
52 {{{271.03291625750461, 5.0402503617874572e-05}, {275.21652430019037, 3.6997300650817877},
53 {279.25839233398438, 7.7416000366210938}}}
56 static const size_t oneOff_count = SK_ARRAY_COUNT(oneOff);
58 DEF_TEST(PathOpsTriangleOneOff, reporter) {
59 for (size_t index = 0; index < oneOff_count; ++index) {
60 const SkDTriangle& triangle = oneOff[index];
61 SkASSERT(ValidTriangle(triangle));
62 for (int inner = 0; inner < 3; ++inner) {
63 bool result = triangle.contains(triangle.fPts[inner]);
65 SkDebugf("%s [%d][%d] point on triangle is not in\n", __FUNCTION__, index, inner);
66 REPORTER_ASSERT(reporter, 0);