caryclark@google.com | ad65a3e | 2013-04-15 19:13:59 +0000 | [diff] [blame^] | 1 | /* |
| 2 | * Copyright 2013 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 "SkOpSegment.h" |
| 8 | #include "Test.h" |
| 9 | |
| 10 | static const SkPoint cubics[][4] = { |
| 11 | {{0, 1}, {2, 6}, {4, 2}, {5, 3}} |
| 12 | }; |
| 13 | |
| 14 | static const SkPoint lines[][2] = { |
| 15 | {{6, 2}, {2, 4}} |
| 16 | }; |
| 17 | |
| 18 | struct SortSet { |
| 19 | const SkPoint* ptData; |
| 20 | int ptCount; |
| 21 | double tStart; |
| 22 | double tEnd; |
| 23 | }; |
| 24 | |
| 25 | static const SortSet set1[] = { |
| 26 | {lines[0], 2, 0.54070336, 0.388888889}, |
| 27 | {cubics[0], 4, 0.666669871, 0.405037112}, |
| 28 | {lines[0], 2, 0.54070336, 0.9140625}, |
| 29 | {cubics[0], 4, 0.666669871, 0.875}, |
| 30 | }; |
| 31 | |
| 32 | static const SortSet set2[] = { |
| 33 | {lines[0], 2, 0.574074074, 0.388888889}, |
| 34 | {cubics[0], 4, 0.666666667, 0.405037112}, |
| 35 | {lines[0], 2, 0.574074074, 0.9140625}, |
| 36 | {cubics[0], 4, 0.666666667, 0.875}, |
| 37 | }; |
| 38 | |
| 39 | struct SortSetTests { |
| 40 | const SortSet* set; |
| 41 | size_t count; |
| 42 | }; |
| 43 | |
| 44 | static const SortSetTests tests[] = { |
| 45 | { set1, SK_ARRAY_COUNT(set1) }, |
| 46 | { set2, SK_ARRAY_COUNT(set2) } |
| 47 | }; |
| 48 | |
| 49 | static void setup(const SortSet* set, const size_t idx, SkPoint const ** data, |
| 50 | SkPoint* reverse, SkOpSegment* seg) { |
| 51 | SkPoint start, end; |
| 52 | if (set[idx].ptCount == 2) { |
| 53 | if (set[idx].tStart < set[idx].tEnd) { |
| 54 | *data = set[idx].ptData; |
| 55 | } else { |
| 56 | reverse[0] = set[idx].ptData[1]; |
| 57 | reverse[1] = set[idx].ptData[0]; |
| 58 | *data = reverse; |
| 59 | } |
| 60 | seg->addLine(*data, false, false); |
| 61 | SkDLine dLine; |
| 62 | dLine.set(set[idx].ptData); |
| 63 | start = dLine.xyAtT(set[idx].tStart).asSkPoint(); |
| 64 | end = dLine.xyAtT(set[idx].tEnd).asSkPoint(); |
| 65 | } else if (set[idx].ptCount == 4) { |
| 66 | if (set[idx].tStart < set[idx].tEnd) { |
| 67 | *data = set[idx].ptData; |
| 68 | } else { |
| 69 | reverse[0] = set[idx].ptData[3]; |
| 70 | reverse[1] = set[idx].ptData[2]; |
| 71 | reverse[2] = set[idx].ptData[1]; |
| 72 | reverse[3] = set[idx].ptData[0]; |
| 73 | *data = reverse; |
| 74 | } |
| 75 | seg->addCubic(*data, false, false); |
| 76 | SkDCubic dCubic; |
| 77 | dCubic.set(set[idx].ptData); |
| 78 | start = dCubic.xyAtT(set[idx].tStart).asSkPoint(); |
| 79 | end = dCubic.xyAtT(set[idx].tEnd).asSkPoint(); |
| 80 | } |
| 81 | seg->addT(NULL, start, set[idx].tStart); |
| 82 | seg->addT(NULL, end, set[idx].tEnd); |
| 83 | seg->addT(NULL, set[idx].ptData[0], 0); |
| 84 | seg->addT(NULL, set[idx].ptData[set[idx].ptCount - 1], 1); |
| 85 | } |
| 86 | |
| 87 | static void PathOpsAngleTest(skiatest::Reporter* reporter) { |
| 88 | for (size_t index = 0; index < SK_ARRAY_COUNT(tests); ++index) { |
| 89 | const SortSetTests& test = tests[index]; |
| 90 | for (size_t idxL = 0; idxL < test.count - 1; ++idxL) { |
| 91 | SkOpSegment lesser, greater; |
| 92 | SkPoint lesserReverse[4], greaterReverse[4]; |
| 93 | const SkPoint* lesserData, * greaterData; |
| 94 | const SortSet* set = test.set; |
| 95 | setup(set, idxL, &lesserData, lesserReverse, &lesser); |
| 96 | size_t idxG = idxL + 1; |
| 97 | setup(set, idxG, &greaterData, greaterReverse, &greater); |
| 98 | SkOpAngle first, second; |
| 99 | first.set(lesserData, (SkPath::Verb) (set[idxL].ptCount - 1), &lesser, |
| 100 | 0, 1, lesser.spans()); |
| 101 | first.setSpans(); |
| 102 | second.set(greaterData, (SkPath::Verb) (set[idxG].ptCount - 1), &greater, |
| 103 | 0, 1, greater.spans()); |
| 104 | second.setSpans(); |
| 105 | bool compare = first < second; |
| 106 | if (!compare) { |
| 107 | SkDebugf("%s test[%d]: lesser[%d] > greater[%d]\n", __FUNCTION__, |
| 108 | index, idxL, idxG); |
| 109 | } |
| 110 | REPORTER_ASSERT(reporter, compare); |
| 111 | } |
| 112 | } |
| 113 | } |
| 114 | |
| 115 | #include "TestClassDef.h" |
| 116 | DEFINE_TESTCLASS_SHORT(PathOpsAngleTest) |