| Index: src/pathops/SkPathOpsCubic.cpp
|
| diff --git a/src/pathops/SkPathOpsCubic.cpp b/src/pathops/SkPathOpsCubic.cpp
|
| index 662219acf5145d44216dda62399e84ddc966e561..8e8ec47bf9765ad81cef8d5f6d5382ab96965091 100644
|
| --- a/src/pathops/SkPathOpsCubic.cpp
|
| +++ b/src/pathops/SkPathOpsCubic.cpp
|
| @@ -155,7 +155,7 @@ int SkDCubic::RootsReal(double A, double B, double C, double D, double s[3]) {
|
| if (approximately_zero(A + B + C + D)) { // 1 is one root
|
| int num = SkDQuad::RootsReal(A, A + B, -D, s);
|
| for (int i = 0; i < num; ++i) {
|
| - if (AlmostEqualUlps(s[i], 1)) {
|
| + if (AlmostDequalUlps(s[i], 1)) {
|
| return num;
|
| }
|
| }
|
| @@ -186,11 +186,11 @@ int SkDCubic::RootsReal(double A, double B, double C, double D, double s[3]) {
|
| *roots++ = r;
|
|
|
| r = neg2RootQ * cos((theta + 2 * PI) / 3) - adiv3;
|
| - if (!AlmostEqualUlps(s[0], r)) {
|
| + if (!AlmostDequalUlps(s[0], r)) {
|
| *roots++ = r;
|
| }
|
| r = neg2RootQ * cos((theta - 2 * PI) / 3) - adiv3;
|
| - if (!AlmostEqualUlps(s[0], r) && (roots - s == 1 || !AlmostEqualUlps(s[1], r))) {
|
| + if (!AlmostDequalUlps(s[0], r) && (roots - s == 1 || !AlmostDequalUlps(s[1], r))) {
|
| *roots++ = r;
|
| }
|
| } else { // we have 1 real root
|
| @@ -205,9 +205,9 @@ int SkDCubic::RootsReal(double A, double B, double C, double D, double s[3]) {
|
| }
|
| r = A - adiv3;
|
| *roots++ = r;
|
| - if (AlmostEqualUlps(R2, Q3)) {
|
| + if (AlmostDequalUlps(R2, Q3)) {
|
| r = -A / 2 - adiv3;
|
| - if (!AlmostEqualUlps(s[0], r)) {
|
| + if (!AlmostDequalUlps(s[0], r)) {
|
| *roots++ = r;
|
| }
|
| }
|
|
|