commit 5e0500fb5f17fe14db42fc3e0aad08e6b41ccc5f
author caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Wed Feb 20 12:51:37 2013 +0000
committer caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Wed Feb 20 12:51:37 2013 +0000
tree 44dc49df87ca6ee505c59bdb24ee5d43a02481dd
parent 76bf70d38fd109a09ee44d074cfd392e1884afff

shape ops work in progress

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

experimental/Intersection/QuadraticBezierClip.cpp

diff --git a/experimental/Intersection/QuadraticBezierClip.cpp b/experimental/Intersection/QuadraticBezierClip.cpp
index 0e948a0..5b15fe5 100644
--- a/experimental/Intersection/QuadraticBezierClip.cpp
+++ b/experimental/Intersection/QuadraticBezierClip.cpp
@@ -41,17 +41,17 @@
     endLine.quadDistanceY(q2, distance2y);
 
     int flags = 0;
-    if (approximately_lesser(distance2y[0].y, top)) {
+    if (approximately_lesser_or_equal(distance2y[0].y, top)) {
         flags |= kFindTopMin;
-    } else if (approximately_greater(distance2y[0].y, bottom)) {
+    } else if (approximately_greater_or_equal(distance2y[0].y, bottom)) {
         flags |= kFindBottomMin;
     } else {
         minT = 0;
     }
 
-    if (approximately_lesser(distance2y[2].y, top)) {
+    if (approximately_lesser_or_equal(distance2y[2].y, top)) {
         flags |= kFindTopMax;
-    } else if (approximately_greater(distance2y[2].y, bottom)) {
+    } else if (approximately_greater_or_equal(distance2y[2].y, bottom)) {
         flags |= kFindBottomMax;
     } else {
         maxT = 1;