Lines Matching defs:si
201 unsigned si = c.segN(from);
203 if (si == ei) {
205 nearest_time(p, c[si], c.segT(from, si), c.segT(to, si));
206 return c.mapToDomain(nearest, si);
210 double nearest = nearest_time(p, c[si], c.segT(from, si));
211 unsigned int ni = si;
213 double mindistsq = distanceSq(p, c[si](nearest));
215 for (unsigned i = si + 1; i < ei; ++i) {
253 unsigned si = c.segN(from);
255 if ( si == ei )
258 all_nearest_times(p, c[si], c.segT(from, si), c.segT(to, si));
261 all_nearest[i] = c.mapToDomain(all_nearest[i], si);
267 all_np.push_back( all_nearest_times(p, c[si], c.segT(from, si)) );
269 ni.push_back(si);
271 double mindistsq = distanceSq( p, c[si](all_np.front().front()) );
274 for (unsigned i = si + 1; i < ei; ++i) {