commit d0deb4fa612a44adb941025af52c5179c5d11cd7
author caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Mon Dec 17 13:58:08 2012 +0000
committer caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Mon Dec 17 13:58:08 2012 +0000
tree e3d35ba94895485a5cc1c3437e31ed5b90ecd72f
parent ec93bf92339d923dbf5964f7844b9f8366eeba13

shape ops work in progress

git-svn-id: http://skia.googlecode.com/svn/trunk@6837 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 057687c..d29325c 100644
--- a/experimental/Intersection/SimplifyFindTop_Test.cpp
+++ b/experimental/Intersection/SimplifyFindTop_Test.cpp
@@ -35,7 +35,7 @@
     SkPoint bestXY = {SK_ScalarMin, SK_ScalarMin};
     bool unsortable = false;
     const SimplifyFindTopTest::Segment* topSegment =
-            findSortableTop(contourList, index, end, bestXY, unsortable, true, true);
+            findSortableTop(contourList, index, end, bestXY, unsortable, true);
 #endif
     return topSegment;
 }