| /external/skia/src/core/ |
| D | SkDistanceFieldGen.cpp | 200 float distSq = check->fDistSq - 2.0f*(distVec.fX + distVec.fY - 1.0f); in F1() local
201 if (distSq < curr->fDistSq) { in F1()
204 curr->fDistSq = distSq; in F1()
211 distSq = check->fDistSq - 2.0f*distVec.fY + 1.0f; in F1()
212 if (distSq < curr->fDistSq) { in F1()
214 curr->fDistSq = distSq; in F1()
221 distSq = check->fDistSq + 2.0f*(distVec.fX - distVec.fY + 1.0f); in F1()
222 if (distSq < curr->fDistSq) { in F1()
225 curr->fDistSq = distSq; in F1()
232 distSq = check->fDistSq - 2.0f*distVec.fX + 1.0f; in F1()
[all …]
|
| /external/skia/tests/ |
| D | PathOpsLineParametetersTest.cpp | 52 double distSq = denormalizedDistance[inner]; in DEF_TEST() local
53 distSq *= distSq; in DEF_TEST()
56 if (AlmostEqualUlps(distSq, normalSquared * answersSq)) { in DEF_TEST()
63 distSq, answersSq, normalSquared); in DEF_TEST()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsLine.cpp | 105 double distSq = distU.fX * distU.fX + distU.fY * distU.fY; in NearPointH() local
106 double dist = sqrt(distSq); // OPTIMIZATION: can we compare against distSq instead ? in NearPointH()
140 double distSq = distU.fX * distU.fX + distU.fY * distU.fY; in NearPointV() local
141 double dist = sqrt(distSq); // OPTIMIZATION: can we compare against distSq instead ? in NearPointV()
|
| D | SkPathOpsDebug.cpp | 978 double testMidDistSq = testSegment->distSq(testMidT, next); in debugCheckNearCoincidence()
979 double testEndDistSq = testSegment->distSq(testEndT, next); in debugCheckNearCoincidence()
982 double distSq = testStartPt.distanceSquared(nextStartPt); in debugCheckNearCoincidence() local
985 double nextMidDistSq = nextSegment->distSq(nextMidT, test); in debugCheckNearCoincidence()
986 double nextEndDistSq = nextSegment->distSq(nextEndT, test); in debugCheckNearCoincidence()
987 SkDebugf("%s distSq=%1.9g testId=%d nextId=%d\n", __FUNCTION__, distSq, in debugCheckNearCoincidence()
|
| D | SkPathOpsTSect.h | 349 double distSq = (fPerpPt - cPt).lengthSquared(); in setPerp() local
351 if (dist2Sq < distSq) { in setPerp()
1384 double distSq = thisRayI.pt(index).distanceSquared(oppRayI.pt(oIndex)); in linesIntersect() local
1385 if (closest > distSq) { in linesIntersect()
1386 closest = distSq; in linesIntersect()
1403 double distSq = oppIPt.distanceSquared(iPt); in linesIntersect() local
1404 if (bestDistSq < distSq || ++loopCount > 5) { in linesIntersect()
1407 bestDistSq = distSq; in linesIntersect()
|
| D | SkOpSegment.h | 177 double distSq(double t, const SkOpAngle* opp) const;
|
| D | SkOpSegment.cpp | 582 double SkOpSegment::distSq(double t, const SkOpAngle* oppAngle) const { in distSq() function in SkOpSegment
|
| /external/skia/src/effects/ |
| D | GrCircleBlurFragmentProcessor.cpp | 116 float distSq = x*x + y*y; in disk() local
117 if (distSq <= (radius-0.5f)*(radius-0.5f)) { in disk()
119 } else if (distSq >= (radius+0.5f)*(radius+0.5f)) { in disk()
122 float ramp = radius + 0.5f - sqrtf(distSq); in disk()
|
| /external/opencv3/modules/imgproc/src/ |
| D | lsd.cpp | 80 inline double distSq(const double x1, const double y1, in distSq() function
89 return sqrt(distSq(x1, y1, x2, y2)); in dist()
838 double radSq1 = distSq(xc, yc, rec.x1, rec.y1); in reduce_region_radius()
839 double radSq2 = distSq(xc, yc, rec.x2, rec.y2); in reduce_region_radius()
848 if(distSq(xc, yc, double(reg[i].x), double(reg[i].y)) > radSq) in reduce_region_radius()
|
| /external/skia/src/gpu/batches/ |
| D | GrAAConvexTessellator.cpp | 49 SkScalar distSq = p0.distanceToSqd(p1); in duplicate_pt() local
50 return distSq < kCloseSqd; in duplicate_pt()
|
| /external/opencv3/modules/calib3d/src/ |
| D | rho.cpp | 1403 float distSq = arg.maxD*arg.maxD; in evaluateModelSPRT() local
1439 isInlier = reprojDist <= distSq; in evaluateModelSPRT()
|