update pathops to circle sort

tests/PathOpsQuadLineIntersectionThreadedTest.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 "PathOpsThreadedCommon.h"
 #include "SkIntersections.h"
 #include "SkPathOpsLine.h"
@@ skipping 47 matching lines @@
         SkDPoint quadXY = quad.ptAtT(quadT);
         double lineT = intersections[1][index];
         SkDPoint lineXY = line.ptAtT(lineT);
         if (quadXY.approximatelyEqual(lineXY)) {
             found = true;
         }
     }
     REPORTER_ASSERT(reporter, found);
 }
 
-
 // find a point on a quad by choosing a t from 0 to 1
 // create a vertical span above and below the point
 // verify that intersecting the vertical span and the quad returns t
 // verify that a vertical span starting at quad[0] intersects at t=0
 // verify that a vertical span starting at quad[2] intersects at t=1
 static void testQuadLineIntersectMain(PathOpsThreadState* data)
 {
     PathOpsThreadState& state = *data;
     REPORTER_ASSERT(state.fReporter, data);
     int ax = state.fA & 0x03;
@@ skipping 40 matching lines @@
             for (int c = 0 ; c < 16; ++c) {
                     *testRunner.fRunnables.append() = SkNEW_ARGS(PathOpsThreadedRunnable,
                             (&testQuadLineIntersectMain, a, b, c, 0, &testRunner));
             }
             if (!reporter->allowExtendedTest()) goto finish;
         }
     }
 finish:
     testRunner.render();
 }