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