Lines Matching full:roots
120 int intersectRay(double roots[3]) { in intersectRay()
129 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in intersectRay()
131 SkDPoint calcPt = c.ptAtT(roots[index]); in intersectRay()
139 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots); in intersectRay()
152 int roots = intersectRay(rootVals); in intersect() local
153 for (int index = 0; index < roots; ++index) { in intersect()
165 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { in HorizontalIntersect()
169 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in HorizontalIntersect()
171 SkDPoint calcPt = c.ptAtT(roots[index]); in HorizontalIntersect()
175 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots); in HorizontalIntersect()
187 double roots[3]; in horizontalIntersect() local
188 int count = HorizontalIntersect(fCubic, axisIntercept, roots); in horizontalIntersect()
190 double cubicT = roots[index]; in horizontalIntersect()
228 static int VerticalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { in VerticalIntersect()
232 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in VerticalIntersect()
234 SkDPoint calcPt = c.ptAtT(roots[index]); in VerticalIntersect()
238 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kXAxis, roots); in VerticalIntersect()
250 double roots[3]; in verticalIntersect() local
251 int count = VerticalIntersect(fCubic, axisIntercept, roots); in verticalIntersect()
253 double cubicT = roots[index]; in verticalIntersect()
431 int SkDCubic::horizontalIntersect(double yIntercept, double roots[3]) const { in horizontalIntersect()
432 return LineCubicIntersections::HorizontalIntersect(*this, yIntercept, roots); in horizontalIntersect()
435 int SkDCubic::verticalIntersect(double xIntercept, double roots[3]) const { in verticalIntersect()
436 return LineCubicIntersections::VerticalIntersect(*this, xIntercept, roots); in verticalIntersect()