Index: tests/PathOpsDTriangleTest.cpp |
=================================================================== |
--- tests/PathOpsDTriangleTest.cpp (revision 0) |
+++ tests/PathOpsDTriangleTest.cpp (revision 0) |
@@ -0,0 +1,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 = sizeof(tests) / sizeof(tests[0]); |
+ |
+static void TriangleUtilitiesTest(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("PathOpsTriangleUtilities", PathOpsTriangleUtilitiesClass, TriangleUtilitiesTest) |