Lines Matching defs:roots
121 int intersectRay(double roots[3]) {
131 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
133 SkDPoint calcPt = c.ptAtT(roots[index]);
141 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots);
154 int roots = intersectRay(rootVals);
155 for (int index = 0; index < roots; ++index) {
167 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) {
171 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
173 SkDPoint calcPt = c.ptAtT(roots[index]);
177 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots);
189 double roots[3];
190 int count = HorizontalIntersect(fCubic, axisIntercept, roots);
192 double cubicT = roots[index];
230 static int VerticalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) {
234 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
236 SkDPoint calcPt = c.ptAtT(roots[index]);
240 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kXAxis, roots);
252 double roots[3];
253 int count = VerticalIntersect(fCubic, axisIntercept, roots);
255 double cubicT = roots[index];
449 int SkDCubic::horizontalIntersect(double yIntercept, double roots[3]) const {
450 return LineCubicIntersections::HorizontalIntersect(*this, yIntercept, roots);
453 int SkDCubic::verticalIntersect(double xIntercept, double roots[3]) const {
454 return LineCubicIntersections::VerticalIntersect(*this, xIntercept, roots);