| /external/skia/src/pathops/ |
| D | SkDCubicLineIntersection.cpp | 167 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { in HorizontalIntersect() argument
170 D -= axisIntercept; in HorizontalIntersect()
174 if (!approximately_equal(calcPt.fY, axisIntercept)) { in HorizontalIntersect()
177 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots); in HorizontalIntersect()
184 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { in horizontalIntersect() argument
185 addExactHorizontalEndPoints(left, right, axisIntercept); in horizontalIntersect()
187 addNearHorizontalEndPoints(left, right, axisIntercept); in horizontalIntersect()
190 int count = HorizontalIntersect(fCubic, axisIntercept, roots); in horizontalIntersect()
193 SkDPoint pt = { fCubic.ptAtT(cubicT).fX, axisIntercept }; in horizontalIntersect()
230 static int VerticalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { in VerticalIntersect() argument
[all …]
|
| D | SkDConicLineIntersection.cpp | 67 int horizontalIntersect(double axisIntercept, double roots[2]) { in horizontalIntersect() argument
69 return this->validT(conicVals, axisIntercept, roots); in horizontalIntersect()
72 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { in horizontalIntersect() argument
73 this->addExactHorizontalEndPoints(left, right, axisIntercept); in horizontalIntersect()
75 this->addNearHorizontalEndPoints(left, right, axisIntercept); in horizontalIntersect()
78 int count = this->horizontalIntersect(axisIntercept, roots); in horizontalIntersect()
83 SkOPOBJASSERT(fIntersections, close_to(pt.fY, axisIntercept, conicVals)); in horizontalIntersect()
135 int validT(double r[3], double axisIntercept, double roots[2]) { in validT() argument
137 double B = r[1] * fConic.fWeight - axisIntercept * fConic.fWeight + axisIntercept; in validT()
141 C -= axisIntercept; in validT()
[all …]
|
| D | SkDQuadLineIntersection.cpp | 188 int horizontalIntersect(double axisIntercept, double roots[2]) { in horizontalIntersect() argument
194 F -= axisIntercept; in horizontalIntersect()
198 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { in horizontalIntersect() argument
199 addExactHorizontalEndPoints(left, right, axisIntercept); in horizontalIntersect()
201 addNearHorizontalEndPoints(left, right, axisIntercept); in horizontalIntersect()
204 int roots = horizontalIntersect(axisIntercept, rootVals); in horizontalIntersect()
244 int verticalIntersect(double axisIntercept, double roots[2]) { in verticalIntersect() argument
250 F -= axisIntercept; in verticalIntersect()
254 int verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) { in verticalIntersect() argument
255 addExactVerticalEndPoints(top, bottom, axisIntercept); in verticalIntersect()
[all …]
|
| D | SkPathOpsCubic.cpp | 30 double SkDCubic::binarySearch(double min, double max, double axisIntercept, in binarySearch() argument
36 double calcDist = calcPos - axisIntercept; in binarySearch()
45 double lessDist = (&lessPt.fX)[xAxis] - axisIntercept; in binarySearch()
64 double moreDist = (&morePt.fX)[xAxis] - axisIntercept; in binarySearch()
73 calcDist = calcPos - axisIntercept; in binarySearch()
74 } while (!approximately_equal(calcPos, axisIntercept)); in binarySearch()
350 int SkDCubic::searchRoots(double extremeTs[6], int extrema, double axisIntercept, in searchRoots() argument
364 double newT = binarySearch(min, max, axisIntercept, xAxis); in searchRoots()
|
| D | SkPathOpsCubic.h | 46 double binarySearch(double min, double max, double axisIntercept, SearchAxis xAxis) const;
90 int searchRoots(double extremes[6], int extrema, double axisIntercept,
|