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