caryclark@google.com | 9e49fb6 | 2012-08-27 14:11:33 +0000 | [diff] [blame] | 1 | /* |
| 2 | * Copyright 2012 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 | */ |
caryclark@google.com | c682590 | 2012-02-03 22:07:47 +0000 | [diff] [blame] | 7 | #include "CurveIntersection.h" |
caryclark@google.com | 27accef | 2012-01-25 18:57:23 +0000 | [diff] [blame] | 8 | #include "Intersection_Tests.h" |
| 9 | #include "QuadraticIntersection_TestData.h" |
caryclark@google.com | 639df89 | 2012-01-10 21:46:10 +0000 | [diff] [blame] | 10 | |
caryclark@google.com | b45a1b4 | 2012-05-18 20:50:33 +0000 | [diff] [blame] | 11 | static const Quadratic testSet[] = { |
caryclark@google.com | a7e483d | 2012-08-28 20:44:43 +0000 | [diff] [blame] | 12 | // data for oneOffTest |
caryclark@google.com | b45a1b4 | 2012-05-18 20:50:33 +0000 | [diff] [blame] | 13 | {{8.0000000000000071, 8.0000000000000071}, |
| 14 | {8.7289570079366854, 8.7289570079366889}, |
| 15 | {9.3914917259458743, 9.0593802763083691}}, |
| 16 | {{8.0000000000000142, 8.0000000000000142}, |
| 17 | {8.1250000000000107, 8.1250000000000071}, |
caryclark@google.com | a7e483d | 2012-08-28 20:44:43 +0000 | [diff] [blame] | 18 | {8.2500000000000071, 8.2187500000000053}}, |
| 19 | // data for oneAtEndTest |
| 20 | {{0.91292418204644155, 0.41931201426549197}, |
| 21 | {0.70491388044579517, 0.64754305977710236}, |
| 22 | {0, 1 }}, |
| 23 | {{0.21875, 0.765625 }, |
| 24 | {0.125, 0.875 }, |
| 25 | {0, 1 }} |
caryclark@google.com | b45a1b4 | 2012-05-18 20:50:33 +0000 | [diff] [blame] | 26 | }; |
| 27 | |
caryclark@google.com | a7e483d | 2012-08-28 20:44:43 +0000 | [diff] [blame] | 28 | static void oneAtEndTest() { |
| 29 | const Quadratic& quad1 = testSet[2]; |
| 30 | const Quadratic& quad2 = testSet[3]; |
| 31 | double minT = 0; |
| 32 | double maxT = 1; |
| 33 | bezier_clip(quad1, quad2, minT, maxT); |
| 34 | } |
| 35 | |
| 36 | |
caryclark@google.com | b45a1b4 | 2012-05-18 20:50:33 +0000 | [diff] [blame] | 37 | static void oneOffTest() { |
| 38 | const Quadratic& quad1 = testSet[0]; |
| 39 | const Quadratic& quad2 = testSet[1]; |
| 40 | double minT = 0; |
| 41 | double maxT = 1; |
| 42 | bezier_clip(quad1, quad2, minT, maxT); |
| 43 | } |
| 44 | |
caryclark@google.com | a3f05fa | 2012-06-01 17:44:28 +0000 | [diff] [blame] | 45 | static void standardTestCases() { |
caryclark@google.com | 27accef | 2012-01-25 18:57:23 +0000 | [diff] [blame] | 46 | for (size_t index = 0; index < quadraticTests_count; ++index) { |
| 47 | const Quadratic& quad1 = quadraticTests[index][0]; |
| 48 | const Quadratic& quad2 = quadraticTests[index][1]; |
| 49 | Quadratic reduce1, reduce2; |
caryclark@google.com | 47d73da | 2013-02-17 01:41:25 +0000 | [diff] [blame] | 50 | int order1 = reduceOrder(quad1, reduce1, kReduceOrder_TreatAsFill); |
| 51 | int order2 = reduceOrder(quad2, reduce2, kReduceOrder_TreatAsFill); |
caryclark@google.com | 27accef | 2012-01-25 18:57:23 +0000 | [diff] [blame] | 52 | if (order1 < 3) { |
caryclark@google.com | aa35831 | 2013-01-29 20:28:49 +0000 | [diff] [blame] | 53 | SkDebugf("%s [%d] quad1 order=%d\n", __FUNCTION__, (int)index, order1); |
caryclark@google.com | 27accef | 2012-01-25 18:57:23 +0000 | [diff] [blame] | 54 | } |
| 55 | if (order2 < 3) { |
caryclark@google.com | aa35831 | 2013-01-29 20:28:49 +0000 | [diff] [blame] | 56 | SkDebugf("%s [%d] quad2 order=%d\n", __FUNCTION__, (int)index, order2); |
caryclark@google.com | 27accef | 2012-01-25 18:57:23 +0000 | [diff] [blame] | 57 | } |
| 58 | if (order1 == 3 && order2 == 3) { |
| 59 | double minT = 0; |
| 60 | double maxT = 1; |
| 61 | bezier_clip(reduce1, reduce2, minT, maxT); |
| 62 | } |
| 63 | } |
| 64 | } |
caryclark@google.com | b45a1b4 | 2012-05-18 20:50:33 +0000 | [diff] [blame] | 65 | |
| 66 | void QuadraticBezierClip_Test() { |
caryclark@google.com | a7e483d | 2012-08-28 20:44:43 +0000 | [diff] [blame] | 67 | oneAtEndTest(); |
caryclark@google.com | b45a1b4 | 2012-05-18 20:50:33 +0000 | [diff] [blame] | 68 | oneOffTest(); |
| 69 | standardTestCases(); |
| 70 | } |