commit 996d78b7cf9863a5b574fc1b64b1715cad4d0a23
author caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Thu Mar 14 16:24:30 2013 +0000
committer caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Thu Mar 14 16:24:30 2013 +0000
tree 653783d10c8f0b00902f6b4268886cd599aed2da
parent bda74d33f6947b91648a650cd89d53eee408214d

shape ops work in progress

cubic tests pass

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

experimental/Intersection/Simplify.cpp

diff --git a/experimental/Intersection/Simplify.cpp b/experimental/Intersection/Simplify.cpp
index 6b2ca98..d99cdf3 100644
--- a/experimental/Intersection/Simplify.cpp
+++ b/experimental/Intersection/Simplify.cpp
@@ -2907,7 +2907,17 @@
         SkASSERT(!done());
         int firstT = -1;
         /* SkPoint topPt = */ activeLeftTop(onlySortable, &firstT);
-        SkASSERT(firstT >= 0);
+        if (firstT < 0) {
+            unsortable = true;
+            firstT = 0;
+            while (fTs[firstT].fDone) {
+                SkASSERT(firstT < fTs.count());
+                ++firstT;
+            }
+            tIndex = firstT;
+            endIndex = nextExactSpan(firstT, 1);
+            return this;
+        }
         // sort the edges to find the leftmost
         int step = 1;
         int end = nextSpan(firstT, step);