epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 1 | |
| 2 | /* |
| 3 | * Copyright 2011 Google Inc. |
| 4 | * |
| 5 | * Use of this source code is governed by a BSD-style license that can be |
| 6 | * found in the LICENSE file. |
| 7 | */ |
reed@android.com | a3d9010 | 2009-11-30 12:48:33 +0000 | [diff] [blame] | 8 | #include "Test.h" |
| 9 | #include "SkPath.h" |
| 10 | #include "SkLineClipper.h" |
| 11 | #include "SkEdgeClipper.h" |
| 12 | |
| 13 | static void test_intersectline(skiatest::Reporter* reporter) { |
| 14 | static const SkScalar L = 0; |
| 15 | static const SkScalar T = 0; |
| 16 | static const SkScalar R = SkIntToScalar(100); |
| 17 | static const SkScalar B = SkIntToScalar(100); |
| 18 | static const SkScalar CX = SkScalarHalf(L + R); |
| 19 | static const SkScalar CY = SkScalarHalf(T + B); |
| 20 | static const SkRect gR = { L, T, R, B }; |
| 21 | |
| 22 | size_t i; |
| 23 | SkPoint dst[2]; |
| 24 | |
| 25 | static const SkPoint gEmpty[] = { |
| 26 | // sides |
| 27 | { L, CY }, { L - 10, CY }, |
| 28 | { R, CY }, { R + 10, CY }, |
| 29 | { CX, T }, { CX, T - 10 }, |
| 30 | { CX, B }, { CX, B + 10 }, |
| 31 | // corners |
| 32 | { L, T }, { L - 10, T - 10 }, |
| 33 | { L, B }, { L - 10, B + 10 }, |
| 34 | { R, T }, { R + 10, T - 10 }, |
| 35 | { R, B }, { R + 10, B + 10 }, |
| 36 | }; |
| 37 | for (i = 0; i < SK_ARRAY_COUNT(gEmpty); i += 2) { |
| 38 | bool valid = SkLineClipper::IntersectLine(&gEmpty[i], gR, dst); |
| 39 | if (valid) { |
| 40 | SkDebugf("----- [%d] %g %g -> %g %g\n", i/2, dst[0].fX, dst[0].fY, dst[1].fX, dst[1].fY); |
| 41 | } |
| 42 | REPORTER_ASSERT(reporter, !valid); |
| 43 | } |
| 44 | |
| 45 | static const SkPoint gFull[] = { |
| 46 | // diagonals, chords |
| 47 | { L, T }, { R, B }, |
| 48 | { L, B }, { R, T }, |
| 49 | { CX, T }, { CX, B }, |
| 50 | { L, CY }, { R, CY }, |
| 51 | { CX, T }, { R, CY }, |
| 52 | { CX, T }, { L, CY }, |
| 53 | { L, CY }, { CX, B }, |
| 54 | { R, CY }, { CX, B }, |
| 55 | // edges |
| 56 | { L, T }, { L, B }, |
| 57 | { R, T }, { R, B }, |
| 58 | { L, T }, { R, T }, |
| 59 | { L, B }, { R, B }, |
| 60 | }; |
| 61 | for (i = 0; i < SK_ARRAY_COUNT(gFull); i += 2) { |
| 62 | bool valid = SkLineClipper::IntersectLine(&gFull[i], gR, dst); |
| 63 | if (!valid || memcmp(&gFull[i], dst, sizeof(dst))) { |
| 64 | SkDebugf("++++ [%d] %g %g -> %g %g\n", i/2, dst[0].fX, dst[0].fY, dst[1].fX, dst[1].fY); |
| 65 | } |
| 66 | REPORTER_ASSERT(reporter, valid && !memcmp(&gFull[i], dst, sizeof(dst))); |
| 67 | } |
| 68 | |
| 69 | static const SkPoint gPartial[] = { |
| 70 | { L - 10, CY }, { CX, CY }, { L, CY }, { CX, CY }, |
| 71 | { CX, T - 10 }, { CX, CY }, { CX, T }, { CX, CY }, |
| 72 | { R + 10, CY }, { CX, CY }, { R, CY }, { CX, CY }, |
| 73 | { CX, B + 10 }, { CX, CY }, { CX, B }, { CX, CY }, |
| 74 | // extended edges |
| 75 | { L, T - 10 }, { L, B + 10 }, { L, T }, { L, B }, |
| 76 | { R, T - 10 }, { R, B + 10 }, { R, T }, { R, B }, |
| 77 | { L - 10, T }, { R + 10, T }, { L, T }, { R, T }, |
| 78 | { L - 10, B }, { R + 10, B }, { L, B }, { R, B }, |
| 79 | }; |
| 80 | for (i = 0; i < SK_ARRAY_COUNT(gPartial); i += 4) { |
| 81 | bool valid = SkLineClipper::IntersectLine(&gPartial[i], gR, dst); |
| 82 | if (!valid || memcmp(&gPartial[i+2], dst, sizeof(dst))) { |
| 83 | SkDebugf("++++ [%d] %g %g -> %g %g\n", i/2, dst[0].fX, dst[0].fY, dst[1].fX, dst[1].fY); |
| 84 | } |
| 85 | REPORTER_ASSERT(reporter, valid && |
| 86 | !memcmp(&gPartial[i+2], dst, sizeof(dst))); |
| 87 | } |
| 88 | |
| 89 | } |
| 90 | |
| 91 | void TestClipper(skiatest::Reporter* reporter) { |
| 92 | test_intersectline(reporter); |
| 93 | } |
| 94 | |
| 95 | #include "TestClassDef.h" |
| 96 | DEFINE_TESTCLASS("Clipper", TestClipperClass, TestClipper) |