path ops -- use standard SkTQSort

src/pathops/SkDCubicToQuads.cpp

 /*
 http://stackoverflow.com/questions/2009160/how-do-i-convert-the-2-control-points-of-a-cubic-curve-to-the-single-control-poi
 */
 
 /*
 Let's call the control points of the cubic Q0..Q3 and the control points of the quadratic P0..P2.
 Then for degree elevation, the equations are:
 
 Q0 = P0
 Q1 = 1/3 P0 + 2/3 P1
@@ skipping 32 matching lines @@
 // maybe in turn derived from  http://www.cccg.ca/proceedings/2004/36.pdf
 // also stored at http://www.cis.usouthal.edu/~hain/general/Publications/Bezier/bezier%20cccg04%20paper.pdf
 
 */
 
 #include "SkPathOpsCubic.h"
 #include "SkPathOpsLine.h"
 #include "SkPathOpsQuad.h"
 #include "SkReduceOrder.h"
 #include "SkTDArray.h"
-#include "TSearch.h"
+#include "SkTSort.h"
 
 #define USE_CUBIC_END_POINTS 1
 
 static double calc_t_div(const SkDCubic& cubic, double precision, double start) {
     const double adjust = sqrt(3.) / 36;
     SkDCubic sub;
     const SkDCubic* cPtr;
     if (start == 0) {
         cPtr = &cubic;
     } else {
@@ skipping 58 matching lines @@
     if (order < 3) {
         return;
     }
     double inflectT[5];
     int inflections = findInflections(inflectT);
     SkASSERT(inflections <= 2);
     if (!endsAreExtremaInXOrY()) {
         inflections += findMaxCurvature(&inflectT[inflections]);
         SkASSERT(inflections <= 5);
     }
-    QSort<double>(inflectT, &inflectT[inflections - 1]);
+    SkTQSort<double>(inflectT, &inflectT[inflections - 1]);
     // OPTIMIZATION: is this filtering common enough that it needs to be pulled out into its
     // own subroutine?
     while (inflections && approximately_less_than_zero(inflectT[0])) {
         memmove(inflectT, &inflectT[1], sizeof(inflectT[0]) * --inflections);
     }
     int start = 0;
     do {
         int next = start + 1;
         if (next >= inflections) {
             break;
@@ skipping 38 matching lines @@
         for (int idx = 0; idx < last; ++idx) {
             part = subDivide(inflectT[idx], inflectT[idx + 1]);
             addTs(part, precision, inflectT[idx], inflectT[idx + 1], ts);
         }
         part = subDivide(inflectT[last], 1);
         addTs(part, precision, inflectT[last], 1, ts);
         return;
     }
     addTs(*this, precision, 0, 1, ts);
 }