commit 5c286d32869cb4a648cc048b6f522847cfe277c3
author caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Fri Jul 13 11:57:28 2012 +0000
committer caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Fri Jul 13 11:57:28 2012 +0000
tree f75f48f67b9893e1318b365a7423ba85d9b2de44
parent c665832fbf636a73a2fd59c5970abec7e4109d4a

shape ops work in progress
Review URL: https://codereview.appspot.com/6392058

git-svn-id: http://skia.googlecode.com/svn/trunk@4591 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 4edc532..8ae35d2 100644
--- a/experimental/Intersection/SimplifyFindNext_Test.cpp
+++ b/experimental/Intersection/SimplifyFindNext_Test.cpp
@@ -35,7 +35,7 @@
     int nextStart, nextEnd, flipped = 1;
     SkTDArray<SimplifyFindNextTest::Span*> chaseArray;
     SimplifyFindNextTest::Segment* next = segment.findNext(chaseArray, winding,
-            startIndex, endIndex, nextStart, nextEnd, flipped, true);
+            startIndex, endIndex, nextStart, nextEnd, flipped, true, true);
     pts[1] = next->xyAtT(&next->span(nextStart));
     SkASSERT(pts[0] == pts[1]);
     return next;