Lines Matching full:roots
22 static int findRoots(const SkDQuadImplicit& i, const SkDQuad& quad, double roots[4],
52 int rootCount = SkReducedQuarticRoots(t4, t3, t2, t1, t0, oneHint, roots);
54 rootCount = SkQuarticRootsReal(firstCubicRoot, t4, t3, t2, t1, t0, roots);
58 roots[index] = 1 - roots[index];
64 static int addValidRoots(const double roots[4], const int count, double valid[4]) {
68 if (!approximately_zero_or_more(roots[index]) || !approximately_one_or_less(roots[index])) {
71 double t = 1 - roots[index];
131 int roots = rootTs.intersect(q1, line);
132 if (roots == 0) {
138 if (roots == 2) {
159 int roots = rootTs.intersect(q2, *testLines[index]);
160 for (int idx2 = 0; idx2 < roots; ++idx2) {
468 // OPTIMIZATION: could short circuit here if all roots are < 0 or > 1
