| Index: src/pathops/SkPathOpsCubic.cpp
|
| diff --git a/src/pathops/SkPathOpsCubic.cpp b/src/pathops/SkPathOpsCubic.cpp
|
| index 8e8ec47bf9765ad81cef8d5f6d5382ab96965091..fda42a314044428897072747fc2e8566f7f7d75c 100644
|
| --- a/src/pathops/SkPathOpsCubic.cpp
|
| +++ b/src/pathops/SkPathOpsCubic.cpp
|
| @@ -455,16 +455,16 @@ void SkDCubic::subDivide(const SkDPoint& a, const SkDPoint& d,
|
| if (t1 == 1 || t2 == 1) {
|
| align(3, 2, t1 == 1 ? &dst[0] : &dst[1]);
|
| }
|
| - if (precisely_subdivide_equal(dst[0].fX, a.fX)) {
|
| + if (AlmostBequalUlps(dst[0].fX, a.fX)) {
|
| dst[0].fX = a.fX;
|
| }
|
| - if (precisely_subdivide_equal(dst[0].fY, a.fY)) {
|
| + if (AlmostBequalUlps(dst[0].fY, a.fY)) {
|
| dst[0].fY = a.fY;
|
| }
|
| - if (precisely_subdivide_equal(dst[1].fX, d.fX)) {
|
| + if (AlmostBequalUlps(dst[1].fX, d.fX)) {
|
| dst[1].fX = d.fX;
|
| }
|
| - if (precisely_subdivide_equal(dst[1].fY, d.fY)) {
|
| + if (AlmostBequalUlps(dst[1].fY, d.fY)) {
|
| dst[1].fY = d.fY;
|
| }
|
| }
|
| @@ -508,16 +508,3 @@ SkDCubicPair SkDCubic::chopAt(double t) const {
|
| interp_cubic_coords(&fPts[0].fY, &dst.pts[0].fY, t);
|
| return dst;
|
| }
|
| -
|
| -#ifdef SK_DEBUG
|
| -void SkDCubic::dump() {
|
| - SkDebugf("{{");
|
| - int index = 0;
|
| - do {
|
| - fPts[index].dump();
|
| - SkDebugf(", ");
|
| - } while (++index < 3);
|
| - fPts[index].dump();
|
| - SkDebugf("}}\n");
|
| -}
|
| -#endif
|
|
|