path ops work in progress

src/pathops/SkPathOpsPoint.h

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #ifndef SkPathOpsPoint_DEFINED
 #define SkPathOpsPoint_DEFINED
 
 #include "SkPathOpsTypes.h"
@@ skipping 93 matching lines @@
                 SkTMax(fabs(a.fX), fabs(a.fY))));
         if (denom == 0) {
             return true;
         }
         double inv = 1 / denom;
         return approximately_equal(fX * inv, a.fX * inv)
                 && approximately_equal(fY * inv, a.fY * inv);
     }
 
     bool approximatelyEqual(const SkPoint& a) const {
-        double denom = SkTMax(fabs(fX), SkTMax(fabs(fY),
-                SkScalarToDouble(SkTMax(fabsf(a.fX), fabsf(a.fY)))));
-        if (denom == 0) {
-            return true;
-        }
-        double inv = 1 / denom;
-        return approximately_equal_double(fX * inv, a.fX * inv)
-                && approximately_equal_double(fY * inv, a.fY * inv);
+        return AlmostEqualUlps(SkDoubleToScalar(fX), a.fX)
+                && AlmostEqualUlps(SkDoubleToScalar(fY), a.fY);
     }
 
     bool approximatelyEqualHalf(const SkDPoint& a) const {
         double denom = SkTMax(fabs(fX), SkTMax(fabs(fY),
                 SkTMax(fabs(a.fX), fabs(a.fY))));
         if (denom == 0) {
             return true;
         }
         double inv = 1 / denom;
         return approximately_equal_half(fX * inv, a.fX * inv)
@@ skipping 29 matching lines @@
     double moreRoughlyEqual(const SkDPoint& a) const {
         return more_roughly_equal(a.fY, fY) && more_roughly_equal(a.fX, fX);
     }
 
     double roughlyEqual(const SkDPoint& a) const {
         return roughly_equal(a.fY, fY) && roughly_equal(a.fX, fX);
     }
 };
 
 #endif