path ops -- use standard SkTQSort

src/pathops/SkOpContour.cpp

 /*
 * Copyright 2013 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 "SkOpContour.h"
 #include "SkPathWriter.h"
-#include "TSearch.h"
+#include "SkTSort.h"
 
 void SkOpContour::addCoincident(int index, SkOpContour* other, int otherIndex,
         const SkIntersections& ts, bool swap) {
     SkCoincidence& coincidence = *fCoincidences.append();
     coincidence.fContours[0] = this;  // FIXME: no need to store
     coincidence.fContours[1] = other;
     coincidence.fSegments[0] = index;
     coincidence.fSegments[1] = otherIndex;
     coincidence.fTs[swap][0] = ts[0][0];
     coincidence.fTs[swap][1] = ts[0][1];
@@ skipping 131 matching lines @@
     #endif
     }
 }
 
 void SkOpContour::sortSegments() {
     int segmentCount = fSegments.count();
     fSortedSegments.setReserve(segmentCount);
     for (int test = 0; test < segmentCount; ++test) {
         *fSortedSegments.append() = &fSegments[test];
     }
-    QSort<SkOpSegment>(fSortedSegments.begin(), fSortedSegments.end() - 1);
+    SkTQSort<SkOpSegment>(fSortedSegments.begin(), fSortedSegments.end() - 1);
     fFirstSorted = 0;
 }
 
 void SkOpContour::toPath(SkPathWriter* path) const {
     int segmentCount = fSegments.count();
     const SkPoint& pt = fSegments.front().pts()[0];
     path->deferredMove(pt);
     for (int test = 0; test < segmentCount; ++test) {
         fSegments[test].addCurveTo(0, 1, path, true);
     }
@@ skipping 82 matching lines @@
         SkDebugf("%s empty contour\n", __FUNCTION__);
         SkASSERT(0);
         // FIXME: delete empty contour?
         return;
     }
     fBounds = fSegments.front().bounds();
     for (int index = 1; index < count; ++index) {
         fBounds.add(fSegments[index].bounds());
     }
 }