Home
last modified time | relevance | path

Searched refs:distanceSquared (Results 1 – 15 of 15) sorted by relevance

/external/skqp/src/pathops/
DSkOpCubicHull.cpp101 double dist1_0 = fPts[1].distanceSquared(fPts[0]); in convexHull()
102 double dist1_3 = fPts[1].distanceSquared(fPts[3]); in convexHull()
103 double dist2_0 = fPts[2].distanceSquared(fPts[0]); in convexHull()
104 double dist2_3 = fPts[2].distanceSquared(fPts[3]); in convexHull()
DSkIntersections.cpp19 double dist = testPt.distanceSquared(iPt); in closestTo()
DSkPathOpsPoint.h221 double distanceSquared(const SkDPoint& a) const { in distanceSquared() function
DSkPathOpsTSect.cpp108 double startDist = test->pointFirst().distanceSquared(pt); in closestBoundedT()
113 double endDist = test->pointLast().distanceSquared(pt); in closestBoundedT()
1118 double distSq = thisRayI.pt(index).distanceSquared(oppRayI.pt(oIndex)); in linesIntersect()
1137 double distSq = oppIPt.distanceSquared(iPt); in linesIntersect()
1664 double dist = c1[c1Index].distanceSquared(c2[c2Index]); in findEnd()
DSkPathOpsDebug.cpp1266 double testLenSq = testStartPt.distanceSquared(testEndPt); in debugCheckNearCoincidence()
1276 double distSq = testStartPt.distanceSquared(nextStartPt); in debugCheckNearCoincidence()
1288 double nextLenSq = nextStartPt.distanceSquared(nextEndPt); in debugCheckNearCoincidence()
DSkOpSegment.cpp522 double testDistSq = testPt.distanceSquared(i.pt(index)); in distSq()
/external/skia/src/pathops/
DSkOpCubicHull.cpp101 double dist1_0 = fPts[1].distanceSquared(fPts[0]); in convexHull()
102 double dist1_3 = fPts[1].distanceSquared(fPts[3]); in convexHull()
103 double dist2_0 = fPts[2].distanceSquared(fPts[0]); in convexHull()
104 double dist2_3 = fPts[2].distanceSquared(fPts[3]); in convexHull()
DSkIntersections.cpp19 double dist = testPt.distanceSquared(iPt); in closestTo()
DSkPathOpsTSect.cpp109 double startDist = test->pointFirst().distanceSquared(pt); in closestBoundedT()
114 double endDist = test->pointLast().distanceSquared(pt); in closestBoundedT()
1119 double distSq = thisRayI.pt(index).distanceSquared(oppRayI.pt(oIndex)); in linesIntersect()
1138 double distSq = oppIPt.distanceSquared(iPt); in linesIntersect()
1665 double dist = c1[c1Index].distanceSquared(c2[c2Index]); in findEnd()
DSkPathOpsPoint.h227 double distanceSquared(const SkDPoint& a) const { in distanceSquared() function
DSkPathOpsDebug.cpp1243 double testLenSq = testStartPt.distanceSquared(testEndPt); in debugCheckNearCoincidence()
1253 double distSq = testStartPt.distanceSquared(nextStartPt); in debugCheckNearCoincidence()
1265 double nextLenSq = nextStartPt.distanceSquared(nextEndPt); in debugCheckNearCoincidence()
DSkOpSegment.cpp522 double testDistSq = testPt.distanceSquared(i.pt(index)); in distSq()
/external/skqp/tests/
DPathOpsDPointTest.cpp44 REPORTER_ASSERT(reporter, pt.distanceSquared(p) == pt.fX * pt.fX + pt.fY * pt.fY); in DEF_TEST()
/external/skia/tests/
DPathOpsDPointTest.cpp44 REPORTER_ASSERT(reporter, pt.distanceSquared(p) == pt.fX * pt.fX + pt.fY * pt.fY); in DEF_TEST()
/external/skia/src/gpu/
DGrDistanceFieldGenFromVector.cpp590 dist = (float)xformPt.distanceSquared(x); in distance_to_segment()
592 const float distToB0T = (float)xformPt.distanceSquared(segment.fP0T); in distance_to_segment()
593 const float distToB2T = (float)xformPt.distanceSquared(segment.fP2T); in distance_to_segment()