Lines Matching defs:roots
139 int intersectRay(double roots[2]) {
141 solve by rotating line+quad so line is horizontal, then finding the roots
166 return SkDQuad::RootsValidT(A, 2 * B, C, roots);
175 int roots = intersectRay(rootVals);
176 for (int index = 0; index < roots; ++index) {
188 int horizontalIntersect(double axisIntercept, double roots[2]) {
195 return SkDQuad::RootsValidT(D, 2 * E, F, roots);
204 int roots = horizontalIntersect(axisIntercept, rootVals);
205 for (int index = 0; index < roots; ++index) {
244 int verticalIntersect(double axisIntercept, double roots[2]) {
251 return SkDQuad::RootsValidT(D, 2 * E, F, roots);
260 int roots = verticalIntersect(axisIntercept, rootVals);
261 for (int index = 0; index < roots; ++index) {
452 int SkIntersections::HorizontalIntercept(const SkDQuad& quad, SkScalar y, double* roots) {
454 return q.horizontalIntersect(y, roots);
457 int SkIntersections::VerticalIntercept(const SkDQuad& quad, SkScalar x, double* roots) {
459 return q.verticalIntersect(x, roots);
464 int SkDQuad::horizontalIntersect(double yIntercept, double roots[2]) const {
465 return SkIntersections::HorizontalIntercept(*this, yIntercept, roots);
468 int SkDQuad::verticalIntersect(double xIntercept, double roots[2]) const {
469 return SkIntersections::VerticalIntercept(*this, xIntercept, roots);