| /external/skqp/src/pathops/ |
| D | SkOpCubicHull.cpp | 12 if (approximately_zero(dy)) { in rotate()
13 if (approximately_zero(dx)) { in rotate()
107 if (approximately_zero(SkTMin(smallest1distSq, smallest2distSq))) { in convexHull()
|
| D | SkPathOpsQuad.cpp | 57 if (approximately_zero(sign)) { in hullIntersects()
146 if (approximately_zero(B)) { in handle_zero()
168 if (approximately_zero(A) && (approximately_zero_inverse(p) || approximately_zero_inverse(q))) { in RootsReal()
|
| D | SkPathOpsTypes.h | 330 inline bool approximately_zero(double x) { in approximately_zero() function
342 inline bool approximately_zero(float x) { in approximately_zero() function
393 return approximately_zero(x - y); in approximately_equal()
|
| 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 | SkPathOpsCubic.cpp | 172 if (approximately_zero(sign)) { in hullIntersects()
174 if (approximately_zero(sign)) { in hullIntersects()
413 if (approximately_zero(A) in RootsReal()
424 if (approximately_zero(s[i])) { in RootsReal()
431 if (approximately_zero(A + B + C + D)) { // 1 is one root in RootsReal()
|
| D | SkPathOpsPoint.h | 208 return approximately_zero(fX) && approximately_zero(fY); in approximatelyZero()
|
| D | SkLineParameters.h | 127 if (approximately_zero(normal)) { in normalize()
|
| D | SkDLineIntersection.cpp | 53 if (!approximately_zero(denom)) { in intersectRay()
|
| D | SkPathOpsWinding.cpp | 143 if (approximately_zero(t)) { in rayCheck()
|
| /external/skia/src/pathops/ |
| D | SkOpCubicHull.cpp | 12 if (approximately_zero(dy)) { in rotate()
13 if (approximately_zero(dx)) { in rotate()
107 if (approximately_zero(SkTMin(smallest1distSq, smallest2distSq))) { in convexHull()
|
| D | SkPathOpsQuad.cpp | 57 if (approximately_zero(sign)) { in hullIntersects()
146 if (approximately_zero(B)) { in handle_zero()
168 if (approximately_zero(A) && (approximately_zero_inverse(p) || approximately_zero_inverse(q))) { in RootsReal()
|
| D | SkPathOpsTypes.h | 330 inline bool approximately_zero(double x) { in approximately_zero() function
342 inline bool approximately_zero(float x) { in approximately_zero() function
393 return approximately_zero(x - y); in approximately_equal()
|
| 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 | SkPathOpsCubic.cpp | 172 if (approximately_zero(sign)) { in hullIntersects()
174 if (approximately_zero(sign)) { in hullIntersects()
413 if (approximately_zero(A) in RootsReal()
424 if (approximately_zero(s[i])) { in RootsReal()
431 if (approximately_zero(A + B + C + D)) { // 1 is one root in RootsReal()
|
| D | SkPathOpsPoint.h | 208 return approximately_zero(fX) && approximately_zero(fY); in approximatelyZero()
|
| D | SkLineParameters.h | 127 if (approximately_zero(normal)) { in normalize()
|
| D | SkDLineIntersection.cpp | 53 if (!approximately_zero(denom)) { in intersectRay()
|
| D | SkDCubicLineIntersection.cpp | 134 if (!approximately_zero(calcPt.fX)) { in intersectRay()
|
| D | SkPathOpsWinding.cpp | 143 if (approximately_zero(t)) { in rayCheck()
|
| /external/skia/tests/ |
| D | PathOpsQuadIntersectionTest.cpp | 473 while (!approximately_zero(t1Step)) { in intersectionFinder()
479 while (!approximately_zero(t1Step)) { in intersectionFinder()
484 while (!approximately_zero(t2Step)) { in intersectionFinder()
490 while (!approximately_zero(t2Step)) { in intersectionFinder()
|
| D | PathOpsCubicIntersectionTest.cpp | 582 while (!approximately_zero(t1Step)) { in intersectionFinder()
588 while (!approximately_zero(t1Step)) { in intersectionFinder()
593 while (!approximately_zero(t2Step)) { in intersectionFinder()
599 while (!approximately_zero(t2Step)) { in intersectionFinder()
|
| D | PathOpsCubicLineIntersectionIdeas.cpp | 101 if (approximately_zero(A)
112 if (approximately_zero(A + B + C + D)) { // 1 is one root
|
| /external/skqp/tests/ |
| D | PathOpsQuadIntersectionTest.cpp | 473 while (!approximately_zero(t1Step)) { in intersectionFinder()
479 while (!approximately_zero(t1Step)) { in intersectionFinder()
484 while (!approximately_zero(t2Step)) { in intersectionFinder()
490 while (!approximately_zero(t2Step)) { in intersectionFinder()
|
| D | PathOpsCubicIntersectionTest.cpp | 582 while (!approximately_zero(t1Step)) { in intersectionFinder()
588 while (!approximately_zero(t1Step)) { in intersectionFinder()
593 while (!approximately_zero(t2Step)) { in intersectionFinder()
599 while (!approximately_zero(t2Step)) { in intersectionFinder()
|
| D | PathOpsCubicLineIntersectionIdeas.cpp | 101 if (approximately_zero(A)
112 if (approximately_zero(A + B + C + D)) { // 1 is one root
|