100 int intersectRay(double roots[2]) {  in intersectRay()
102     solve by rotating line+quad so line is horizontal, then finding the roots  in intersectRay()
127     return quadraticRootsValidT(A, 2 * B, C, roots);  in intersectRay()
133     int roots = intersectRay(rootVals);  in intersect()  local
134     for (int index = 0; index < roots; ++index) {  in intersect()
146 int horizontalIntersect(double axisIntercept, double roots[2]) {  in horizontalIntersect()
153     return quadraticRootsValidT(D, 2 * E, F, roots);  in horizontalIntersect()
159     int roots = horizontalIntersect(axisIntercept, rootVals);  in horizontalIntersect()  local
160     for (int index = 0; index < roots; ++index) {  in horizontalIntersect()
175 int verticalIntersect(double axisIntercept, double roots[2]) {  in verticalIntersect()
182     return quadraticRootsValidT(D, 2 * E, F, roots);  in verticalIntersect()
188     int roots = verticalIntersect(axisIntercept, rootVals);  in verticalIntersect()  local
189     for (int index = 0; index < roots; ++index) {  in verticalIntersect()
261     int roots = intersections.fUsed;  in flip()  local
262     for (int index = 0; index < roots; ++index) {  in flip()
298     int roots = q.horizontalIntersect(pt.y, rootVals);  in horizontalIntersect()  local
299     for (int index = 0; index < roots; ++index) {  in horizontalIntersect()
313     int roots = q.verticalIntersect(pt.x, rootVals);  in verticalIntersect()  local
314     for (int index = 0; index < roots; ++index) {  in verticalIntersect()