From 80a83adaf2f8db849bfae288e31b7c789dafabf5 Mon Sep 17 00:00:00 2001 From: caryclark Date: Tue, 12 Aug 2014 05:49:37 -0700 Subject: relax quadratic binary search test Extreme implicit quartic equations solve to roots that are different enough that they appear to have failed. In this case, fall back on binary searching to find an intersection. Relax the condition when this happens; don't give up just because the computed implicit root points aren't remotely the same. TBR=reed BUG=skia:2808 Author: caryclark@google.com Review URL: https://codereview.chromium.org/456383003 --- tests/PathOpsQuadIntersectionTest.cpp | 3 +++ 1 file changed, 3 insertions(+) (limited to 'tests/PathOpsQuadIntersectionTest.cpp') diff --git a/tests/PathOpsQuadIntersectionTest.cpp b/tests/PathOpsQuadIntersectionTest.cpp index ffa00edee1..1ddbbcc51e 100644 --- a/tests/PathOpsQuadIntersectionTest.cpp +++ b/tests/PathOpsQuadIntersectionTest.cpp @@ -53,6 +53,9 @@ static void standardTestCases(skiatest::Reporter* reporter) { } static const SkDQuad testSet[] = { +{{{441.853149, 308.209106}, {434.672272, 315.389984}, {424.516998, 315.389984}}}, +{{{385.207275, 334.241272}, {406.481598, 312.96698}, {436.567993, 312.96698}}}, + {{{-708.00779269310044, -154.36998607290101}, {-707.90560262312511, -154.36998607290101}, {-707.8333433370193, -154.44224536635932}}}, {{{-708.00779269310044, -154.61669472244046}, {-701.04513225634582, -128.85970734043804}, {505.58447265625, -504.9130859375}}}, -- cgit v1.2.3