blob: d64197df9dae9884ef781bdfe60251c7bea4362d [file] [log] [blame]
caryclark@google.com07393ca2013-04-08 11:47:37 +00001/*
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
10static 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
16static const SkDPoint inPoint[] = {
17 {2.5, 1},
18 {2, 1.5},
19 {2.5, 1},
20};
21
22static const SkDPoint outPoint[] = {
23 {3, 0},
24 {2.5, 2},
25 {2.5, 2},
26};
27
caryclark@google.comad65a3e2013-04-15 19:13:59 +000028static const size_t tests_count = SK_ARRAY_COUNT(tests);
caryclark@google.com07393ca2013-04-08 11:47:37 +000029
caryclark@google.comad65a3e2013-04-15 19:13:59 +000030static void PathOpsTriangleUtilitiesTest(skiatest::Reporter* reporter) {
caryclark@google.com07393ca2013-04-08 11:47:37 +000031 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"
caryclark@google.comad65a3e2013-04-15 19:13:59 +000047DEFINE_TESTCLASS_SHORT(PathOpsTriangleUtilitiesTest)