Searched refs:approximately_zero (Results 1 - 25 of 28) sorted by relevance

12

/external/skia/src/pathops/
H A DSkOpCubicHull.cpp12 if (approximately_zero(dy)) {
13 if (approximately_zero(dx)) {
107 if (approximately_zero(SkTMin(smallest1distSq, smallest2distSq))) {
H A DSkPathOpsQuad.cpp56 if (approximately_zero(sign)) {
155 if (!A || (approximately_zero(A) && (approximately_zero_inverse(p)
157 if (approximately_zero(B)) {
H A DSkPathOpsTypes.h330 inline bool approximately_zero(double x) { function
342 inline bool approximately_zero(float x) { function
393 return approximately_zero(x - y);
H A DSkLineParameters.h127 if (approximately_zero(normal)) {
H A DSkPathOpsPoint.h206 return approximately_zero(fX) && approximately_zero(fY);
H A DSkReduceOrder.cpp131 if (approximately_zero(sideAx) ? !approximately_equal(sideAx, sideBx)
140 if (approximately_zero(sideAy) ? !approximately_equal(sideAy, sideBy)
H A DSkPathOpsCubic.cpp173 if (approximately_zero(sign)) {
175 if (approximately_zero(sign)) {
416 if (approximately_zero(A)
427 if (approximately_zero(s[i])) {
434 if (approximately_zero(A + B + C + D)) { // 1 is one root
H A DSkDCubicLineIntersection.cpp134 if (!approximately_zero(calcPt.fX)) {
H A DSkDLineIntersection.cpp51 if (!approximately_zero(denom)) {
H A DSkPathOpsWinding.cpp141 if (approximately_zero(t)) {
297 // SkASSERT(!approximately_zero(hit->fT) || !hit->fValid);
/external/skqp/src/pathops/
H A DSkOpCubicHull.cpp12 if (approximately_zero(dy)) {
13 if (approximately_zero(dx)) {
107 if (approximately_zero(SkTMin(smallest1distSq, smallest2distSq))) {
H A DSkPathOpsQuad.cpp53 if (approximately_zero(sign)) {
152 if (!A || (approximately_zero(A) && (approximately_zero_inverse(p)
154 if (approximately_zero(B)) {
H A DSkPathOpsTypes.h330 inline bool approximately_zero(double x) { function
342 inline bool approximately_zero(float x) { function
393 return approximately_zero(x - y);
H A DSkLineParameters.h127 if (approximately_zero(normal)) {
H A DSkPathOpsPoint.h206 return approximately_zero(fX) && approximately_zero(fY);
H A DSkReduceOrder.cpp131 if (approximately_zero(sideAx) ? !approximately_equal(sideAx, sideBx)
140 if (approximately_zero(sideAy) ? !approximately_equal(sideAy, sideBy)
H A DSkPathOpsCubic.cpp173 if (approximately_zero(sign)) {
175 if (approximately_zero(sign)) {
416 if (approximately_zero(A)
427 if (approximately_zero(s[i])) {
434 if (approximately_zero(A + B + C + D)) { // 1 is one root
H A DSkDCubicLineIntersection.cpp134 if (!approximately_zero(calcPt.fX)) {
H A DSkDLineIntersection.cpp51 if (!approximately_zero(denom)) {
/external/skia/tests/
H A DPathOpsQuadIntersectionTest.cpp473 while (!approximately_zero(t1Step)) {
479 while (!approximately_zero(t1Step)) {
484 while (!approximately_zero(t2Step)) {
490 while (!approximately_zero(t2Step)) {
H A DPathOpsCubicIntersectionTest.cpp582 while (!approximately_zero(t1Step)) {
588 while (!approximately_zero(t1Step)) {
593 while (!approximately_zero(t2Step)) {
599 while (!approximately_zero(t2Step)) {
H A DPathOpsCubicLineIntersectionIdeas.cpp101 if (approximately_zero(A)
112 if (approximately_zero(A + B + C + D)) { // 1 is one root
/external/skqp/tests/
H A DPathOpsQuadIntersectionTest.cpp473 while (!approximately_zero(t1Step)) {
479 while (!approximately_zero(t1Step)) {
484 while (!approximately_zero(t2Step)) {
490 while (!approximately_zero(t2Step)) {
H A DPathOpsCubicIntersectionTest.cpp581 while (!approximately_zero(t1Step)) {
587 while (!approximately_zero(t1Step)) {
592 while (!approximately_zero(t2Step)) {
598 while (!approximately_zero(t2Step)) {
H A DPathOpsCubicLineIntersectionIdeas.cpp101 if (approximately_zero(A)
112 if (approximately_zero(A + B + C + D)) { // 1 is one root

Completed in 688 milliseconds

12