| /external/skia/tests/ |
| H A D | PathOpsDLineTest.cpp | 31 REPORTER_ASSERT(reporter, approximately_equal((line[0].fX + line[1].fX) / 2, mid.fX));
32 REPORTER_ASSERT(reporter, approximately_equal((line[0].fY + line[1].fY) / 2, mid.fY));
|
| H A D | PathOpsDPointTest.cpp | 45 REPORTER_ASSERT(reporter, approximately_equal(pt.distance(p),
|
| H A D | PathOpsDVectorTest.cpp | 44 REPORTER_ASSERT(reporter, approximately_equal(sqrt(lenSq), v1.length()));
|
| H A D | PathOpsCubicReduceOrderTest.cpp | 40 return approximately_equal(cubic[maxX].fX, cubic[minX].fX)
41 && approximately_equal(cubic[maxY].fY, cubic[minY].fY);
|
| H A D | PathOpsTestCommon.cpp | 85 if (!approximately_equal(inflectT[start], inflectT[next])) {
|
| /external/skqp/tests/ |
| H A D | PathOpsDLineTest.cpp | 31 REPORTER_ASSERT(reporter, approximately_equal((line[0].fX + line[1].fX) / 2, mid.fX));
32 REPORTER_ASSERT(reporter, approximately_equal((line[0].fY + line[1].fY) / 2, mid.fY));
|
| H A D | PathOpsDPointTest.cpp | 45 REPORTER_ASSERT(reporter, approximately_equal(pt.distance(p),
|
| H A D | PathOpsDVectorTest.cpp | 44 REPORTER_ASSERT(reporter, approximately_equal(sqrt(lenSq), v1.length()));
|
| H A D | PathOpsCubicReduceOrderTest.cpp | 40 return approximately_equal(cubic[maxX].fX, cubic[minX].fX)
41 && approximately_equal(cubic[maxY].fY, cubic[minY].fY);
|
| H A D | PathOpsTestCommon.cpp | 85 if (!approximately_equal(inflectT[start], inflectT[next])) {
|
| /external/skia/src/utils/win/ |
| H A D | SkDWriteGeometrySink.cpp | 81 static bool approximately_equal(float a, float b) { function
95 //NOTE: !approximately_equal(midX - cubic[3].x, dx23 * 3 / 2)
97 if (!approximately_equal(midX, (dx23 * 3 / 2) + cubic[3].x)) {
103 if (!approximately_equal(midY, (dy23 * 3 / 2) + cubic[3].y)) {
|
| /external/skqp/src/utils/win/ |
| H A D | SkDWriteGeometrySink.cpp | 81 static bool approximately_equal(float a, float b) { function
95 //NOTE: !approximately_equal(midX - cubic[3].x, dx23 * 3 / 2)
97 if (!approximately_equal(midX, (dx23 * 3 / 2) + cubic[3].x)) {
103 if (!approximately_equal(midY, (dy23 * 3 / 2) + cubic[3].y)) {
|
| /external/skia/src/pathops/ |
| H A D | SkPathOpsPoint.h | 145 // return approximately_equal(a.fY, fY) && approximately_equal(a.fX, fX);
148 if (approximately_equal(fX, a.fX) && approximately_equal(fY, a.fY)) {
168 if (approximately_equal(fX, a.fX) && approximately_equal(fY, a.fY)) {
188 if (approximately_equal(a.fX, b.fX) && approximately_equal(a.fY, b.fY)) {
|
| H A D | SkPathOpsWinding.cpp | 109 if (!approximately_equal(baseXY, boundsXY) && (baseXY < boundsXY) == checkLessThan) {
126 if (!approximately_equal(baseXY, boundsXY) && (baseXY < boundsXY) == checkLessThan) {
134 if (base.fSpan->segment() == this && approximately_equal(base.fT, t)) {
143 } else if (approximately_equal(t, 1)) {
154 if (!approximately_equal(baseXY, ptXY) && (baseXY < ptXY) == checkLessThan) {
193 if (approximately_equal(tHit, next->t())) {
|
| H A D | SkOpCubicHull.cpp | 22 if (approximately_equal(cubic[side1].fY, cubic[zero].fY)) {
25 if (approximately_equal(cubic[side2].fY, cubic[zero].fY)) {
|
| H A D | SkDCubicLineIntersection.cpp | 174 if (!approximately_equal(calcPt.fY, axisIntercept)) {
237 if (!approximately_equal(calcPt.fX, axisIntercept)) {
403 if (gridPt == fCubic[0].asSkPoint() && approximately_equal(*cubicT, 0)) {
405 } else if (gridPt == fCubic[3].asSkPoint() && approximately_equal(*cubicT, 1)) {
|
| H A D | SkReduceOrder.cpp | 131 if (approximately_zero(sideAx) ? !approximately_equal(sideAx, sideBx)
140 if (approximately_zero(sideAy) ? !approximately_equal(sideAy, sideBy)
|
| H A D | SkPathOpsTypes.h | 392 inline bool approximately_equal(double x, double y) { function
417 return approximately_equal(x, y);
|
| H A D | SkPathOpsCubic.cpp | 74 } while (!approximately_equal(calcPos, axisIntercept));
381 if (approximately_equal(t[idx2], 1)) {
389 if (approximately_equal(t[idx2], 0)) {
|
| /external/skqp/src/pathops/ |
| H A D | SkPathOpsPoint.h | 145 // return approximately_equal(a.fY, fY) && approximately_equal(a.fX, fX);
148 if (approximately_equal(fX, a.fX) && approximately_equal(fY, a.fY)) {
168 if (approximately_equal(fX, a.fX) && approximately_equal(fY, a.fY)) {
188 if (approximately_equal(a.fX, b.fX) && approximately_equal(a.fY, b.fY)) {
|
| H A D | SkPathOpsWinding.cpp | 109 if (!approximately_equal(baseXY, boundsXY) && (baseXY < boundsXY) == checkLessThan) {
126 if (!approximately_equal(baseXY, boundsXY) && (baseXY < boundsXY) == checkLessThan) {
134 if (base.fSpan->segment() == this && approximately_equal(base.fT, t)) {
143 } else if (approximately_equal(t, 1)) {
154 if (!approximately_equal(baseXY, ptXY) && (baseXY < ptXY) == checkLessThan) {
193 if (approximately_equal(tHit, next->t())) {
|
| H A D | SkOpCubicHull.cpp | 22 if (approximately_equal(cubic[side1].fY, cubic[zero].fY)) {
25 if (approximately_equal(cubic[side2].fY, cubic[zero].fY)) {
|
| H A D | SkDCubicLineIntersection.cpp | 174 if (!approximately_equal(calcPt.fY, axisIntercept)) {
237 if (!approximately_equal(calcPt.fX, axisIntercept)) {
403 if (gridPt == fCubic[0].asSkPoint() && approximately_equal(*cubicT, 0)) {
405 } else if (gridPt == fCubic[3].asSkPoint() && approximately_equal(*cubicT, 1)) {
|
| H A D | SkReduceOrder.cpp | 131 if (approximately_zero(sideAx) ? !approximately_equal(sideAx, sideBx)
140 if (approximately_zero(sideAy) ? !approximately_equal(sideAy, sideBy)
|
| H A D | SkPathOpsTypes.h | 392 inline bool approximately_equal(double x, double y) { function
417 return approximately_equal(x, y);
|