commit f839c0359c308fd06895d9f73fc12c4f3869e399
author caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Fri Oct 26 21:03:50 2012 +0000
committer caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Fri Oct 26 21:03:50 2012 +0000
tree 0c5821437bb8d2eefc6a2e7f9c476b1b865f783f
parent 0c5f3762e863411798b1d6c55157d24c69d5bc25

shape ops work in progress

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

experimental/Intersection/SimplifyFindTop_Test.cpp

diff --git a/experimental/Intersection/SimplifyFindTop_Test.cpp b/experimental/Intersection/SimplifyFindTop_Test.cpp
index 11b083f..0c30b2e 100644
--- a/experimental/Intersection/SimplifyFindTop_Test.cpp
+++ b/experimental/Intersection/SimplifyFindTop_Test.cpp
@@ -32,7 +32,9 @@
     const SimplifyFindTopTest::Segment* topSegment = topStart->findTop(index,
             end);
 #else
-    const SimplifyFindTopTest::Segment* topSegment = findSortableTop(contourList, index, end);
+    SkPoint bestXY = {SK_ScalarMin, SK_ScalarMin};
+    const SimplifyFindTopTest::Segment* topSegment =
+            findSortableTop(contourList, index, end, bestXY);
 #endif
     return topSegment;
 }