Lines Matching full:roots
109 int intersectRay(double roots[2]) {
111 solve by rotating line+quad so line is horizontal, then finding the roots
136 return SkDQuad::RootsValidT(A, 2 * B, C, roots);
148 int roots = intersectRay(rootVals);
149 for (int index = 0; index < roots; ++index) {
161 int horizontalIntersect(double axisIntercept, double roots[2]) {
168 return SkDQuad::RootsValidT(D, 2 * E, F, roots);
177 int roots = horizontalIntersect(axisIntercept, rootVals);
178 for (int index = 0; index < roots; ++index) {
192 int verticalIntersect(double axisIntercept, double roots[2]) {
199 return SkDQuad::RootsValidT(D, 2 * E, F, roots);
208 int roots = verticalIntersect(axisIntercept, rootVals);
209 for (int index = 0; index < roots; ++index) {
353 int roots = q.horizontalIntersect(pt.fY, rootVals);
354 for (int index = 0; index < roots; ++index) {
368 int roots = q.verticalIntersect(pt.fX, rootVals);
369 for (int index = 0; index < roots; ++index) {
