caryclark@google.com | d88e089 | 2012-03-27 13:23:51 +0000 | [diff] [blame] | 1 | #include "CurveIntersection.h" |
caryclark@google.com | a576423 | 2012-03-28 16:20:21 +0000 | [diff] [blame] | 2 | #include "Intersections.h" |
caryclark@google.com | d88e089 | 2012-03-27 13:23:51 +0000 | [diff] [blame] | 3 | #include "LineIntersection.h" |
| 4 | #include "SkPath.h" |
| 5 | #include "SkRect.h" |
| 6 | #include "SkTArray.h" |
| 7 | #include "SkTDArray.h" |
caryclark@google.com | a576423 | 2012-03-28 16:20:21 +0000 | [diff] [blame] | 8 | #include "ShapeOps.h" |
caryclark@google.com | d88e089 | 2012-03-27 13:23:51 +0000 | [diff] [blame] | 9 | #include "TSearch.h" |
| 10 | |
| 11 | namespace UnitTest { |
| 12 | |
| 13 | #include "EdgeWalker.cpp" |
| 14 | |
| 15 | } // end of UnitTest namespace |
| 16 | |
| 17 | #include "Intersection_Tests.h" |
| 18 | |
| 19 | SkPoint leftRight[][4] = { |
| 20 | // equal length |
| 21 | {{10, 10}, {10, 50}, {20, 10}, {20, 50}}, |
| 22 | {{10, 10}, {10, 50}, {10, 10}, {20, 50}}, |
| 23 | {{10, 10}, {10, 50}, {20, 10}, {10, 50}}, |
| 24 | // left top higher |
| 25 | {{10, 0}, {10, 50}, {20, 10}, {20, 50}}, |
| 26 | {{10, 0}, {10, 50}, {10, 10}, {20, 50}}, |
| 27 | {{10, 0}, {10, 50}, {20, 10}, {10, 50}}, |
caryclark@google.com | b45a1b4 | 2012-05-18 20:50:33 +0000 | [diff] [blame^] | 28 | {{10, 0}, {10, 50}, {20, 10}, {10 + 0.000001f, 40}}, |
caryclark@google.com | d88e089 | 2012-03-27 13:23:51 +0000 | [diff] [blame] | 29 | // left top lower |
| 30 | {{10, 20}, {10, 50}, {20, 10}, {20, 50}}, |
| 31 | {{10, 20}, {10, 50}, {10, 10}, {20, 50}}, |
| 32 | {{10, 20}, {10, 50}, {20, 10}, {10, 50}}, |
caryclark@google.com | b45a1b4 | 2012-05-18 20:50:33 +0000 | [diff] [blame^] | 33 | {{10, 20}, {10, 50}, {20, 10}, {10 + 0.000001f, 40}}, |
caryclark@google.com | d88e089 | 2012-03-27 13:23:51 +0000 | [diff] [blame] | 34 | {{10, 20}, {10, 50}, { 0, 0}, {50, 50}}, |
| 35 | // left bottom higher |
| 36 | {{10, 10}, {10, 40}, {20, 10}, {20, 50}}, |
| 37 | {{10, 10}, {10, 40}, {10, 10}, {20, 50}}, |
| 38 | {{10, 10}, {10, 40}, {20, 10}, {10, 50}}, |
caryclark@google.com | b45a1b4 | 2012-05-18 20:50:33 +0000 | [diff] [blame^] | 39 | {{10, 10}, {10, 40}, {20, 10}, { 0 + 0.000001f, 70}}, |
caryclark@google.com | d88e089 | 2012-03-27 13:23:51 +0000 | [diff] [blame] | 40 | // left bottom lower |
| 41 | {{10, 10}, {10, 60}, {20, 10}, {20, 50}}, |
| 42 | {{10, 10}, {10, 60}, {10, 10}, {20, 50}}, |
caryclark@google.com | b45a1b4 | 2012-05-18 20:50:33 +0000 | [diff] [blame^] | 43 | {{10, 10}, {10, 60}, {20, 10}, {10 + 0.000001f, 50}}, |
| 44 | {{10, 10}, {10, 60}, {20, 10}, {10 + 0.000001f, 40}}, |
| 45 | {{10, 10}, {10, 60}, { 0, 0}, {20 + 0.000001f, 20}}, |
caryclark@google.com | d88e089 | 2012-03-27 13:23:51 +0000 | [diff] [blame] | 46 | }; |
| 47 | |
| 48 | size_t leftRightCount = sizeof(leftRight) / sizeof(leftRight[0]); |
| 49 | |
caryclark@google.com | 78e1713 | 2012-04-17 11:40:34 +0000 | [diff] [blame] | 50 | // older code that worked mostly |
| 51 | static bool operator_less_than(const UnitTest::ActiveEdge& lh, |
| 52 | const UnitTest::ActiveEdge& rh) { |
| 53 | if (rh.fAbove.fY - lh.fAbove.fY > lh.fBelow.fY - rh.fAbove.fY |
| 54 | && lh.fBelow.fY < rh.fBelow.fY |
| 55 | || lh.fAbove.fY - rh.fAbove.fY < rh.fBelow.fY - lh.fAbove.fY |
| 56 | && rh.fBelow.fY < lh.fBelow.fY) { |
| 57 | const SkPoint& check = rh.fBelow.fY <= lh.fBelow.fY |
| 58 | && lh.fBelow != rh.fBelow ? rh.fBelow : |
| 59 | rh.fAbove; |
| 60 | return (check.fY - lh.fAbove.fY) * (lh.fBelow.fX - lh.fAbove.fX) |
| 61 | < (lh.fBelow.fY - lh.fAbove.fY) * (check.fX - lh.fAbove.fX); |
| 62 | } |
| 63 | const SkPoint& check = lh.fBelow.fY <= rh.fBelow.fY |
| 64 | && lh.fBelow != rh.fBelow ? lh.fBelow : lh.fAbove; |
| 65 | return (rh.fBelow.fY - rh.fAbove.fY) * (check.fX - rh.fAbove.fX) |
| 66 | < (check.fY - rh.fAbove.fY) * (rh.fBelow.fX - rh.fAbove.fX); |
| 67 | } |
| 68 | |
| 69 | |
caryclark@google.com | d88e089 | 2012-03-27 13:23:51 +0000 | [diff] [blame] | 70 | void ActiveEdge_Test() { |
| 71 | UnitTest::InEdge leftIn, rightIn; |
| 72 | UnitTest::ActiveEdge left, right; |
| 73 | left.fWorkEdge.fEdge = &leftIn; |
| 74 | right.fWorkEdge.fEdge = &rightIn; |
| 75 | for (size_t x = 0; x < leftRightCount; ++x) { |
| 76 | left.fAbove = leftRight[x][0]; |
caryclark@google.com | fa0588f | 2012-04-26 21:01:06 +0000 | [diff] [blame] | 77 | left.fTangent = left.fBelow = leftRight[x][1]; |
caryclark@google.com | d88e089 | 2012-03-27 13:23:51 +0000 | [diff] [blame] | 78 | right.fAbove = leftRight[x][2]; |
caryclark@google.com | fa0588f | 2012-04-26 21:01:06 +0000 | [diff] [blame] | 79 | right.fTangent = right.fBelow = leftRight[x][3]; |
caryclark@google.com | d88e089 | 2012-03-27 13:23:51 +0000 | [diff] [blame] | 80 | SkASSERT(left < right); |
caryclark@google.com | 78e1713 | 2012-04-17 11:40:34 +0000 | [diff] [blame] | 81 | SkASSERT(operator_less_than(left, right)); |
caryclark@google.com | d88e089 | 2012-03-27 13:23:51 +0000 | [diff] [blame] | 82 | SkASSERT(!(right < left)); |
caryclark@google.com | 78e1713 | 2012-04-17 11:40:34 +0000 | [diff] [blame] | 83 | SkASSERT(!operator_less_than(right, left)); |
caryclark@google.com | d88e089 | 2012-03-27 13:23:51 +0000 | [diff] [blame] | 84 | } |
| 85 | } |
| 86 | |
| 87 | |
| 88 | |
| 89 | |