Searched refs:approximately_zero (Results 1 – 14 of 14) sorted by relevance
12 if (approximately_zero(dy)) { in rotate()13 if (approximately_zero(dx)) { in rotate()107 if (approximately_zero(SkTMin(smallest1distSq, smallest2distSq))) { in convexHull()
53 if (approximately_zero(sign)) { in hullIntersects()152 if (!A || (approximately_zero(A) && (approximately_zero_inverse(p) in RootsReal()154 if (approximately_zero(B)) { in RootsReal()
330 inline bool approximately_zero(double x) { in approximately_zero() function342 inline bool approximately_zero(float x) { in approximately_zero() function393 return approximately_zero(x - y); in approximately_equal()
131 if (approximately_zero(sideAx) ? !approximately_equal(sideAx, sideBx) in check_quadratic()140 if (approximately_zero(sideAy) ? !approximately_equal(sideAy, sideBy) in check_quadratic()
173 if (approximately_zero(sign)) { in hullIntersects()175 if (approximately_zero(sign)) { in hullIntersects()416 if (approximately_zero(A) in RootsReal()427 if (approximately_zero(s[i])) { in RootsReal()434 if (approximately_zero(A + B + C + D)) { // 1 is one root in RootsReal()
206 return approximately_zero(fX) && approximately_zero(fY); in approximatelyZero()
127 if (approximately_zero(normal)) { in normalize()
56 if (!approximately_zero(denom)) { in intersectRay()
134 if (!approximately_zero(calcPt.fX)) { in intersectRay()
141 if (approximately_zero(t)) { in rayCheck()
819 if (fUnorderable || approximately_zero(rh->fSide)) { in orderable()826 if (rh->fUnorderable || approximately_zero(fSide)) { in orderable()
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()
581 while (!approximately_zero(t1Step)) { in intersectionFinder()587 while (!approximately_zero(t1Step)) { in intersectionFinder()592 while (!approximately_zero(t2Step)) { in intersectionFinder()598 while (!approximately_zero(t2Step)) { in intersectionFinder()
101 if (approximately_zero(A)112 if (approximately_zero(A + B + C + D)) { // 1 is one root