cubicline intersection binary search

src/pathops/SkPathOpsTypes.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 "SkFloatBits.h"
 #include "SkPathOpsTypes.h"
 
 static bool arguments_denormalized(float a, float b, int epsilon) {
@@ skipping 84 matching lines @@
 bool AlmostPequalUlps(float a, float b) {
     const int UlpsEpsilon = 8;
     return equal_ulps(a, b, UlpsEpsilon, UlpsEpsilon);
 }
 
 bool AlmostDequalUlps(float a, float b) {
     const int UlpsEpsilon = 16;
     return d_equal_ulps(a, b, UlpsEpsilon);
 }
 
+bool AlmostDequalUlps(double a, double b) {
+    if (SkScalarIsFinite(a) || SkScalarIsFinite(b)) {
+        return AlmostDequalUlps(SkDoubleToScalar(a), SkDoubleToScalar(b));
+    }
+    return fabs(a - b) / SkTMax(fabs(a), fabs(b)) < FLT_EPSILON * 16;
+}
+
 bool AlmostEqualUlps(float a, float b) {
     const int UlpsEpsilon = 16;
     return equal_ulps(a, b, UlpsEpsilon, UlpsEpsilon);
 }
 
 bool NotAlmostEqualUlps(float a, float b) {
     const int UlpsEpsilon = 16;
     return not_equal_ulps(a, b, UlpsEpsilon);
 }
 
@@ skipping 69 matching lines @@
 double SkDCubeRoot(double x) {
     if (approximately_zero_cubed(x)) {
         return 0;
     }
     double result = halley_cbrt3d(fabs(x));
     if (x < 0) {
         result = -result;
     }
     return result;
 }