commit b76d3b677713693137936ff813b92c4be48af173
author commit-bot@chromium.org <commit-bot@chromium.org@2bbb7eff-a529-9590-31e7-b0007b416f81> Mon Apr 22 19:55:19 2013 +0000
committer commit-bot@chromium.org <commit-bot@chromium.org@2bbb7eff-a529-9590-31e7-b0007b416f81> Mon Apr 22 19:55:19 2013 +0000
tree 5650fd2fd30fcc678aff98d03a47c9a2702e566a
parent da2cd7b1880ac7c8836bcd74ec946bf28c0ee9fd

path ops -- use standard SkTQSort

thanks to bungeman for the contextual sort

R=bungeman@google.com

Author: caryclark@google.com

Review URL: https://chromiumcodereview.appspot.com/14034014

git-svn-id: http://skia.googlecode.com/svn/trunk@8810 2bbb7eff-a529-9590-31e7-b0007b416f81

src/pathops/SkOpContour.cpp

diff --git a/src/pathops/SkOpContour.cpp b/src/pathops/SkOpContour.cpp
index 54eecfa..1aee405 100644
--- a/src/pathops/SkOpContour.cpp
+++ b/src/pathops/SkOpContour.cpp
@@ -7,7 +7,7 @@
 #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) {
@@ -159,7 +159,7 @@
     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;
 }