Lines Matching defs:end
210 static double radianSweep(double start, double end) {
211 double sweep = end - start;
220 static bool radianBetween(double start, double test, double end) {
221 double startToEnd = radianSweep(start, end);
223 double testToEnd = radianSweep(test, end);
236 SkTQSort<double>(t1Array.begin(), t1Array.end());
237 SkTQSort<double>(t2Array.begin(), t2Array.end());
473 // continue end point rays and see if they intersect the opposite curve
512 SkDVector end = rays[index][1] - origin;
513 if (ray.fX * end.fX < 0 || ray.fY * end.fY < 0) {
517 double endDist = end.length();
531 SkDVector end = rays[sIndex][1] - origin;
533 double endDist = end.length();
675 If the hulls overlap, and have the same general direction, then intersect the shorter end point ray