commit c91dfe417a51f73c28ecf2708df1e0bee942c6ea
author caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Tue Oct 16 12:06:27 2012 +0000
committer caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Tue Oct 16 12:06:27 2012 +0000
tree 65ce0d94f9bceb32e7a903e82d30d225f7cab24c
parent f94dd182e63428182ae0845ca2b3f46bfa72425f

shape ops work in progress

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

experimental/Intersection/SimplifyFindNext_Test.cpp

diff --git a/experimental/Intersection/SimplifyFindNext_Test.cpp b/experimental/Intersection/SimplifyFindNext_Test.cpp
index 199ba1d..b6f5d1e 100644
--- a/experimental/Intersection/SimplifyFindNext_Test.cpp
+++ b/experimental/Intersection/SimplifyFindNext_Test.cpp
@@ -35,8 +35,10 @@
     int nextStart = startIndex;
     int nextEnd = endIndex;
     SkTDArray<SimplifyFindNextTest::Span*> chaseArray;
+    bool unsortable = false;
     SimplifyFindNextTest::Segment* next = segment.findNextWinding(chaseArray,
-            true, nextStart, nextEnd, contourWinding, spanWinding);
+            true, nextStart, nextEnd, contourWinding, spanWinding,
+            unsortable);
     pts[1] = next->xyAtT(&next->span(nextStart));
     SkASSERT(pts[0] == pts[1]);
     return next;