path ops -- use standard SkTQSort

src/pathops/SkDCubicIntersection.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 "SkPathOpsCubic.h"
 #include "SkPathOpsLine.h"
 #include "SkPathOpsPoint.h"
 #include "SkPathOpsQuad.h"
 #include "SkPathOpsRect.h"
 #include "SkReduceOrder.h"
 #include "SkTDArray.h"
-#include "TSearch.h"
+#include "SkTSort.h"
 
 #if ONE_OFF_DEBUG
 static const double tLimits1[2][2] = {{0.36, 0.37}, {0.63, 0.64}};
 static const double tLimits2[2][2] = {{-0.865211397, -0.865215212}, {-0.865207696, -0.865208078}};
 #endif
 
 #define DEBUG_QUAD_PART 0
 #define SWAP_TOP_DEBUG 0
 
 static int quadPart(const SkDCubic& cubic, double tStart, double tEnd, SkReduceOrder* reducer) {
@@ skipping 308 matching lines @@
                     i.insert(start ? 0 : 1, foundT, line[0]);
                 }
             } else {
                 *tVals.append() = local[0][idx2];
             }
         }
     }
     if (tVals.count() == 0) {
         return;
     }
-    QSort<double>(tVals.begin(), tVals.end() - 1);
+    SkTQSort<double>(tVals.begin(), tVals.end() - 1);
     double tMin1 = start ? 0 : 1 - LINE_FRACTION;
     double tMax1 = start ? LINE_FRACTION : 1;
     int tIdx = 0;
     do {
         int tLast = tIdx;
         while (tLast + 1 < tVals.count() && roughly_equal(tVals[tLast + 1], tVals[tIdx])) {
             ++tLast;
         }
         double tMin2 = SkTMax<double>(tVals[tIdx] - LINE_FRACTION, 0.0);
         double tMax2 = SkTMin<double>(tVals[tLast] + LINE_FRACTION, 1.0);
@@ skipping 84 matching lines @@
     }
     (void) intersect(c, c);
     if (used() > 0) {
         SkASSERT(used() == 1);
         if (fT[0][0] > fT[1][0]) {
             swapPts();
         }
     }
     return used();
 }