Cross Reference: /inkscape/src/2geom/nearest-time.cpp

Lines Matching defs:to
18  * in the file COPYING-LGPL-2.1; if not, write to the Free Software
23  * The contents of this file are subject to the Mozilla Public License
40 Coord nearest_time(Point const &p, D2<Bezier> const &input, Coord from, Coord to)
42     Interval domain(from, to);
46         THROW_RANGEERROR("[from,to] interval out of bounds");
98  * related to the interval [from, to], to the point "p".
100  * The function return the first nearest time value to "p" that is found.
106                     double from, double to )
108     if ( from > to ) std::swap(from, to);
109     if ( from < 0 || to > 1 )
111         THROW_RANGEERROR("[from,to] interval out of bounds");
129     if ( min_dist_sq > L2sq( c(to) - p ) )
130         closest = to;
137  * the curve "c", related to the interval [from, to], to the point "p".
145                   double from, double to)
147     if (from > to) {
148         std::swap(from, to);
150     if (from < 0 || to > 1) {
151         THROW_RANGEERROR("[from,to] interval out of bounds");
165     candidates.push_back(to);
194                     double from, double to)
196     if (from > to) std::swap(from, to);
197     if (from < c.cuts[0] || to > c.cuts[c.size()]) {
198         THROW_RANGEERROR("[from,to] interval out of bounds");
202     unsigned ei = c.segN(to);
205             nearest_time(p, c[si], c.segT(from, si), c.segT(to, si));
231         t = nearest_time(p, c[ei], 0, c.segT(to, ei));
244                   double from, double to)
246     if (from > to) {
247         std::swap(from, to);
249     if (from < c.cuts[0] || to > c.cuts[c.size()]) {
250         THROW_RANGEERROR("[from,to] interval out of bounds");
254     unsigned ei = c.segN(to);
258             all_nearest_times(p, c[si], c.segT(from, si), c.segT(to, si));
297         all_t = all_nearest_times(p, c[ei], 0, c.segT(to, ei));