path ops -- use standard SkTQSort

src/pathops/SkOpAngle.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 "SkIntersections.h"
 #include "SkOpAngle.h"
 #include "SkPathOpsCurve.h"
-#include "TSearch.h"
+#include "SkTSort.h"
 
 // FIXME: this is bogus for quads and cubics
 // if the quads and cubics' line from end pt to ctrl pt are coincident,
 // there's no obvious way to determine the curve ordering from the
 // derivatives alone. In particular, if one quadratic's coincident tangent
 // is longer than the other curve, the final control point can place the
 // longer curve on either side of the shorter one.
 // Using Bezier curve focus http://cagd.cs.byu.edu/~tom/papers/bezclip.pdf
 // may provide some help, but nothing has been figured out yet.
 
@@ skipping 193 matching lines @@
         int testCount = SkDCubic::FindInflections(fPts, testTs);
         double limitT = endT;
         int index;
         for (index = 0; index < testCount; ++index) {
             if (!between(startT, testTs[index], limitT)) {
                 testTs[index] = -1;
             }
         }
         testTs[testCount++] = startT;
         testTs[testCount++] = endT;
-        QSort<double>(testTs, &testTs[testCount - 1]);
+        SkTQSort<double>(testTs, &testTs[testCount - 1]);
         double bestSide = 0;
         int testCases = (testCount << 1) - 1;
         index = 0;
         while (testTs[index] < 0) {
             ++index;
         }
         index <<= 1;
         for (; index < testCases; ++index) {
             int testIndex = index >> 1;
             double testT = testTs[testIndex];
@@ skipping 45 matching lines @@
 #if 1
 #if DEBUG_UNSORTABLE
     SkPoint iPt = (*CurvePointAtT[fVerb])(fPts, startT);
     SkPoint ePt = (*CurvePointAtT[fVerb])(fPts, endT);
     SkDebugf("%s all tiny unsortable [%d] (%1.9g,%1.9g) [%d] (%1.9g,%1.9g)\n", __FUNCTION__,
         fStart, iPt.fX, iPt.fY, fEnd, ePt.fX, ePt.fY);
 #endif
     fUnsortable = true;
 #endif
 }