diff options
author | 2013-04-22 19:55:19 +0000 | |
---|---|---|
committer | 2013-04-22 19:55:19 +0000 | |
commit | b76d3b677713693137936ff813b92c4be48af173 (patch) | |
tree | 5650fd2fd30fcc678aff98d03a47c9a2702e566a /src/pathops/SkDQuadIntersection.cpp | |
parent | da2cd7b1880ac7c8836bcd74ec946bf28c0ee9fd (diff) |
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
Diffstat (limited to 'src/pathops/SkDQuadIntersection.cpp')
-rw-r--r-- | src/pathops/SkDQuadIntersection.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/pathops/SkDQuadIntersection.cpp b/src/pathops/SkDQuadIntersection.cpp index 0344680b6d..5abbbdcd82 100644 --- a/src/pathops/SkDQuadIntersection.cpp +++ b/src/pathops/SkDQuadIntersection.cpp @@ -10,7 +10,7 @@ #include "SkPathOpsLine.h" #include "SkQuarticRoot.h" #include "SkTDArray.h" -#include "TSearch.h" +#include "SkTSort.h" /* given the implicit form 0 = Ax^2 + Bxy + Cy^2 + Dx + Ey + F * and given x = at^2 + bt + c (the parameterized form) @@ -169,7 +169,7 @@ static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkD if (tCount == 1) { tMin = tMax = tsFound[0]; } else if (tCount > 1) { - QSort<double>(tsFound.begin(), tsFound.end() - 1); + SkTQSort<double>(tsFound.begin(), tsFound.end() - 1); tMin = tsFound[0]; tMax = tsFound[tsFound.count() - 1]; } |