fix pathops fuzz failures

tests/PathOpsCubicIntersectionTest.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 "PathOpsCubicIntersectionTestData.h"
 #include "PathOpsTestCommon.h"
 #include "SkGeometry.h"
 #include "SkIntersections.h"
@@ skipping 635 matching lines @@
 }
 
 static void cubicIntersectionSelfTest(skiatest::Reporter* reporter) {
     int firstFail = 0;
     for (int index = firstFail; index < selfSetCount; ++index) {
         selfOneOff(reporter, index);
     }
 }
 
 static const SkDCubic coinSet[] = {
+    {{{297.04998779296875, 43.928997039794922}, {297.04998779296875, 43.928997039794922},
+        {300.69699096679688, 45.391998291015625}, {306.92498779296875, 43.08599853515625}}},
+    {{{297.04998779296875, 43.928997039794922}, {297.04998779296875, 43.928997039794922},
+        {300.69699096679688, 45.391998291015625}, {306.92498779296875, 43.08599853515625}}},
+
     {{{2, 3}, {0, 4}, {3, 2}, {5, 3}}},
     {{{2, 3}, {0, 4}, {3, 2}, {5, 3}}},
 
     {{{317, 711}, {322.52285766601562, 711}, {327, 715.4771728515625}, {327, 721}}},
     {{{324.07107543945312, 713.928955078125}, {324.4051513671875, 714.26300048828125},
             {324.71566772460937, 714.62060546875}, {325, 714.9990234375}}},
 };
 
 static int coinSetCount = (int) SK_ARRAY_COUNT(coinSet);
 
@@ skipping 23 matching lines @@
 }
 
 DEF_TEST(PathOpsCubicIntersection, reporter) {
     oneOffTests(reporter);
     cubicIntersectionSelfTest(reporter);
     cubicIntersectionCoinTest(reporter);
     standardTestCases(reporter);
     if (false) CubicIntersection_IntersectionFinder();
     if (false) CubicIntersection_RandTest(reporter);
 }