Lines Matching defs:from
157 // in case we encounter an order-1 curve created from a vector
220 Coord BezierCurve::nearestTime(Point const &p, Coord from, Coord to) const
222 return nearest_time(p, inner, from, to);
281 Coord BezierCurveN<1>::nearestTime(Point const& p, Coord from, Coord to) const
285 if ( from > to ) swap(from, to);
286 Point ip = pointAt(from);
292 if ( t <= 0 ) return from;
294 else return from + t*(to-from);
369 * 0.5 * tolerance from their arithmetic mean. When it's larger, we recursively