| /external/skia/src/pathops/ |
| D | SkPathOpsPoint.h | 148 if (approximately_equal(fX, a.fX) && approximately_equal(fY, a.fY)) { in approximatelyDEqual()
168 if (approximately_equal(fX, a.fX) && approximately_equal(fY, a.fY)) { in approximatelyEqual()
188 if (approximately_equal(a.fX, b.fX) && approximately_equal(a.fY, b.fY)) { in ApproximatelyEqual()
|
| D | SkPathOpsWinding.cpp | 109 if (!approximately_equal(baseXY, boundsXY) && (baseXY < boundsXY) == checkLessThan) { in rayCheck()
126 if (!approximately_equal(baseXY, boundsXY) && (baseXY < boundsXY) == checkLessThan) { in rayCheck()
134 if (base.fSpan->segment() == this && approximately_equal(base.fT, t)) { in rayCheck()
143 } else if (approximately_equal(t, 1)) { in rayCheck()
154 if (!approximately_equal(baseXY, ptXY) && (baseXY < ptXY) == checkLessThan) { in rayCheck()
193 if (approximately_equal(tHit, next->t())) { in windingSpanAtT()
|
| D | SkOpCubicHull.cpp | 22 if (approximately_equal(cubic[side1].fY, cubic[zero].fY)) { in rotate()
25 if (approximately_equal(cubic[side2].fY, cubic[zero].fY)) { in rotate()
|
| D | SkDCubicLineIntersection.cpp | 174 if (!approximately_equal(calcPt.fY, axisIntercept)) { in HorizontalIntersect()
237 if (!approximately_equal(calcPt.fX, axisIntercept)) { in VerticalIntersect()
403 if (gridPt == fCubic[0].asSkPoint() && approximately_equal(*cubicT, 0)) { in pinTs()
405 } else if (gridPt == fCubic[3].asSkPoint() && approximately_equal(*cubicT, 1)) { in pinTs()
|
| D | SkReduceOrder.cpp | 131 if (approximately_zero(sideAx) ? !approximately_equal(sideAx, sideBx) in check_quadratic()
140 if (approximately_zero(sideAy) ? !approximately_equal(sideAy, sideBy) in check_quadratic()
|
| D | SkPathOpsTypes.h | 392 inline bool approximately_equal(double x, double y) { in approximately_equal() function
417 return approximately_equal(x, y); in approximately_equal_squared()
|
| D | SkPathOpsCubic.cpp | 74 } while (!approximately_equal(calcPos, axisIntercept)); in binarySearch()
381 if (approximately_equal(t[idx2], 1)) { in RootsValidT()
389 if (approximately_equal(t[idx2], 0)) { in RootsValidT()
|
| D | SkDLineIntersection.cpp | 17 if ((!startMatch && !endMatch) || approximately_equal(fT[0][0], fT[0][1])) { in cleanUpParallelLines()
|
| D | SkPathOpsQuad.cpp | 117 if (approximately_equal(t[idx2], tValue)) { in AddValidTs()
|
| D | SkDQuadLineIntersection.cpp | 403 if (fIntersections->used() > 0 && approximately_equal((*fIntersections)[1][0], *lineT)) { in pinTs()
|
| D | SkDConicLineIntersection.cpp | 303 if (fIntersections->used() > 0 && approximately_equal((*fIntersections)[1][0], *lineT)) { in pinTs()
|
| D | SkOpAngle.cpp | 331 if (!approximately_equal(oSpan->t(), checkEnd->t())) { in computeSector()
|
| /external/skia/tests/ |
| D | PathOpsDLineTest.cpp | 31 REPORTER_ASSERT(reporter, approximately_equal((line[0].fX + line[1].fX) / 2, mid.fX)); in DEF_TEST()
32 REPORTER_ASSERT(reporter, approximately_equal((line[0].fY + line[1].fY) / 2, mid.fY)); in DEF_TEST()
|
| D | PathOpsDVectorTest.cpp | 44 REPORTER_ASSERT(reporter, approximately_equal(sqrt(lenSq), v1.length())); in DEF_TEST()
|
| D | PathOpsDPointTest.cpp | 45 REPORTER_ASSERT(reporter, approximately_equal(pt.distance(p), in DEF_TEST()
|
| D | PathOpsCubicReduceOrderTest.cpp | 40 return approximately_equal(cubic[maxX].fX, cubic[minX].fX)
41 && approximately_equal(cubic[maxY].fY, cubic[minY].fY);
|
| D | PathOpsTestCommon.cpp | 85 if (!approximately_equal(inflectT[start], inflectT[next])) { in toQuadraticTs()
|
| D | PathOpsAngleIdeas.cpp | 97 if (approximately_equal(t, matchT)) { in orderQuads()
242 if (approximately_equal(a1, a2)) { in orderTRange()
|
| /external/skia/src/utils/win/ |
| D | SkDWriteGeometrySink.cpp | 81 static bool approximately_equal(float a, float b) { in approximately_equal() function
97 if (!approximately_equal(midX, (dx23 * 3 / 2) + cubic[3].x)) { in check_quadratic()
103 if (!approximately_equal(midY, (dy23 * 3 / 2) + cubic[3].y)) { in check_quadratic()
|