commit 73ca6243b31e225e9fd5b75a96cbc82d62557de6
author caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Thu Jan 17 21:02:47 2013 +0000
committer caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Thu Jan 17 21:02:47 2013 +0000
tree f23c55585c47e26f28afdd7b8635b7065a81f06b
parent 148a3961b1c82a891012f2feb2a875cea2593170

shape ops work in progress

mostly working on cubic/cubic intersect

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

experimental/Intersection/LineCubicIntersection_Test.cpp

diff --git a/experimental/Intersection/LineCubicIntersection_Test.cpp b/experimental/Intersection/LineCubicIntersection_Test.cpp
index 48754dd..b81a87e 100644
--- a/experimental/Intersection/LineCubicIntersection_Test.cpp
+++ b/experimental/Intersection/LineCubicIntersection_Test.cpp
@@ -36,8 +36,10 @@
             printf("[%d] line order=%d\n", (int) index, order2);
         }
         if (order1 == 4 && order2 == 2) {
-            double range1[2], range2[2];
-            int roots = intersect(reduce1, reduce2, range1, range2);
+            Intersections i;
+            double* range1 = i.fT[0];
+            double* range2 = i.fT[1];
+            int roots = intersect(reduce1, reduce2, i);
             for (int pt = 0; pt < roots; ++pt) {
                 double tt1 = range1[pt];
                 double tx1, ty1;