commit fa0588ff672564af1c235a63589573829035a60b
author caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Thu Apr 26 21:01:06 2012 +0000
committer caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Thu Apr 26 21:01:06 2012 +0000
tree e62a5152abd641fa2435951327ecfe3697ce3883
parent 8e124a2454543e17e69d5f383c1a63c3d034001a

work in progress
in the middle of switching to sortless version

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

experimental/Intersection/ActiveEdge_Test.cpp

diff --git a/experimental/Intersection/ActiveEdge_Test.cpp b/experimental/Intersection/ActiveEdge_Test.cpp
index fe7d664..03cb595 100755
--- a/experimental/Intersection/ActiveEdge_Test.cpp
+++ b/experimental/Intersection/ActiveEdge_Test.cpp
@@ -74,9 +74,9 @@
     right.fWorkEdge.fEdge = &rightIn;
     for (size_t x = 0; x < leftRightCount; ++x) {
         left.fAbove = leftRight[x][0];
-        left.fBelow = leftRight[x][1]; 
+        left.fTangent = left.fBelow = leftRight[x][1]; 
         right.fAbove = leftRight[x][2];
-        right.fBelow = leftRight[x][3];
+        right.fTangent = right.fBelow = leftRight[x][3];
         SkASSERT(left < right);
         SkASSERT(operator_less_than(left, right));
         SkASSERT(!(right < left));