Home
last modified time | relevance | path

Searched refs:nearPoint (Results 1 – 6 of 6) sorted by relevance

/external/skia/src/pathops/
DSkDLineIntersection.cpp138 aNearB[index] = t = b.nearPoint(a[index], &aNotB[index]); in intersect()
140 bNearA[index] = t = a.nearPoint(b[index], &bNotA[index]); in intersect()
238 if ((t = line.nearPoint(leftPt, nullptr)) >= 0) { in horizontal()
243 if ((t = line.nearPoint(rightPt, nullptr)) >= 0) { in horizontal()
314 if ((t = line.nearPoint(topPt, nullptr)) >= 0) { in vertical()
319 if ((t = line.nearPoint(bottomPt, nullptr)) >= 0) { in vertical()
DSkPathOpsLine.h28 double nearPoint(const SkDPoint& xy, bool* unequal) const;
DSkDQuadLineIntersection.cpp120 double t = fLine->nearPoint(quadMidPt, nullptr); in checkCoincident()
294 double lineT = fLine->nearPoint(fQuad[qIndex], nullptr); in addNearEndPoints()
DSkDCubicLineIntersection.cpp101 double t = fLine.nearPoint(cubicMidPt, nullptr); in checkCoincident()
288 double lineT = fLine.nearPoint(fCubic[cIndex], nullptr); in addNearEndPoints()
DSkDConicLineIntersection.cpp42 double t = fLine->nearPoint(conicMidPt, nullptr); in checkCoincident()
189 double lineT = fLine->nearPoint(fConic[cIndex], nullptr); in addNearEndPoints()
DSkPathOpsLine.cpp31 double SkDLine::nearPoint(const SkDPoint& xy, bool* unequal) const { in nearPoint() function in SkDLine