path ops near exact

tests/PathOpsQuadLineIntersectionTest.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "PathOpsExtendedTest.h"
 #include "SkIntersections.h"
 #include "SkPathOpsLine.h"
 #include "SkPathOpsQuad.h"
@@ skipping 40 matching lines @@
         intersections.intersect(quad, line);
         result = intersections.used();
     }
     return result;
 }
 
 static struct oneLineQuad {
     SkDQuad quad;
     SkDLine line;
 } oneOffs[] = {
+    {{{{1101, 10}, {1101, 8.3431453704833984}, {1099.828857421875, 7.1711997985839844}}},
+        {{{1099.828857421875,7.1711711883544922}, {1099.121337890625,7.8786783218383789}}}},
     {{{{973, 507}, {973, 508.24264526367187}, {972.12158203125, 509.12161254882812}}},
         {{{930, 467}, {973, 510}}}},
     {{{{369.848602, 145.680267}, {382.360413, 121.298294}, {406.207703, 121.298294}}},
-        {{{406.207703, 121.298294}, {348.781738, 123.864815}}}}
-    };
+        {{{406.207703, 121.298294}, {348.781738, 123.864815}}}},
+};
 
 static size_t oneOffs_count = SK_ARRAY_COUNT(oneOffs);
 
 static void testOneOffs(skiatest::Reporter* reporter) {
     bool flipped = false;
     for (size_t index = 0; index < oneOffs_count; ++index) {
         const SkDQuad& quad = oneOffs[index].quad;
         const SkDLine& line = oneOffs[index].line;
         SkIntersections intersections;
         int result = doIntersect(intersections, quad, line, flipped);
         for (int inner = 0; inner < result; ++inner) {
             double quadT = intersections[0][inner];
             SkDPoint quadXY = quad.xyAtT(quadT);
             double lineT = intersections[1][inner];
             SkDPoint lineXY = line.xyAtT(lineT);
             REPORTER_ASSERT(reporter, quadXY.approximatelyEqual(lineXY));
         }
     }
 }
 
+static void PathOpsQuadLineIntersectionTestOne(skiatest::Reporter* reporter) {
+    testOneOffs(reporter);
+}
+
 static void PathOpsQuadLineIntersectionTest(skiatest::Reporter* reporter) {
-    testOneOffs(reporter);
     for (size_t index = 0; index < lineQuadTests_count; ++index) {
         int iIndex = static_cast<int>(index);
         const SkDQuad& quad = lineQuadTests[index].quad;
         const SkDLine& line = lineQuadTests[index].line;
         SkReduceOrder reducer1, reducer2;
         int order1 = reducer1.reduce(quad, SkReduceOrder::kFill_Style);
         int order2 = reducer2.reduce(line);
         if (order1 < 3) {
             SkDebugf("%s [%d] quad order=%d\n", __FUNCTION__, iIndex, order1);
             REPORTER_ASSERT(reporter, 0);
@@ skipping 26 matching lines @@
                     || !t1.approximatelyEqual(lineQuadTests[index].expected[1]))) {
                 SkDebugf("%s t1=(%1.9g,%1.9g)\n", __FUNCTION__, t1.fX, t1.fY);
                 REPORTER_ASSERT(reporter, 0);
             }
         }
     }
 }
 
 #include "TestClassDef.h"
 DEFINE_TESTCLASS_SHORT(PathOpsQuadLineIntersectionTest)
+
+DEFINE_TESTCLASS_SHORT(PathOpsQuadLineIntersectionTestOne)