path ops work in progress

src/pathops/SkPathOpsQuad.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "SkIntersections.h"
 #include "SkLineParameters.h"
 #include "SkPathOpsCubic.h"
 #include "SkPathOpsQuad.h"
@@ skipping 104 matching lines @@
     if (approximately_zero(A) && (approximately_zero_inverse(p) || approximately_zero_inverse(q))) {
         if (approximately_zero(B)) {
             s[0] = 0;
             return C == 0;
         }
         s[0] = -C / B;
         return 1;
     }
     /* normal form: x^2 + px + q = 0 */
     const double p2 = p * p;
-    if (!AlmostEqualUlps(p2, q) && p2 < q) {
+    if (!AlmostDequalUlps(p2, q) && p2 < q) {
         return 0;
     }
     double sqrt_D = 0;
     if (p2 > q) {
         sqrt_D = sqrt(p2 - q);
     }
     s[0] = sqrt_D - p;
     s[1] = -sqrt_D - p;
-    return 1 + !AlmostEqualUlps(s[0], s[1]);
+    return 1 + !AlmostDequalUlps(s[0], s[1]);
 }
 
 bool SkDQuad::isLinear(int startIndex, int endIndex) const {
     SkLineParameters lineParameters;
     lineParameters.quadEndPoints(*this, startIndex, endIndex);
     // FIXME: maybe it's possible to avoid this and compare non-normalized
     lineParameters.normalize();
     double distance = lineParameters.controlPtDistance(*this);
     return approximately_zero(distance);
 }
@@ skipping 201 matching lines @@
     SkDebugf("{{");
     int index = 0;
     do {
         fPts[index].dump();
         SkDebugf(", ");
     } while (++index < 2);
     fPts[index].dump();
     SkDebugf("}}\n");
 }
 #endif