update pathops to circle sort

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 "PathOpsTestCommon.h"
 #include "SkIntersections.h"
 #include "SkPathOpsLine.h"
@@ skipping 41 matching lines @@
         intersections.intersect(quad, line);
         result = intersections.used();
     }
     return result;
 }
 
 static struct oneLineQuad {
     SkDQuad quad;
     SkDLine line;
 } oneOffs[] = {
+    {{{{97.9337616,100}, {88,112.94265}, {88,130}}},
+     {{{88.919838,120}, {107.058823,120}}}},
     {{{{447.96701049804687, 894.4381103515625}, {448.007080078125, 894.4239501953125},
        {448.0140380859375, 894.4215087890625}}},
      {{{490.43548583984375, 879.40740966796875}, {405.59262084960937, 909.435546875}}}},
     {{{{142.589081, 102.283646}, {149.821579, 100}, {158, 100}}},
         {{{90, 230}, {160, 60}}}},
     {{{{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}}},
@@ skipping 68 matching lines @@
             }
             if (!t1.approximatelyEqual(lineQuadTests[index].expected[0])
                     && (lineQuadTests[index].result == 1
                     || !t1.approximatelyEqual(lineQuadTests[index].expected[1]))) {
                 SkDebugf("%s t1=(%1.9g,%1.9g)\n", __FUNCTION__, t1.fX, t1.fY);
                 REPORTER_ASSERT(reporter, 0);
             }
         }
     }
 }