Lines Matching defs:ti
202 cp.ti = times[k].first + ii;
218 if (cp.i == i) cuts[cp.ti] = k;
223 if ( ((*this)[m->second].i == i) && ((*this)[m->second].ti == m->first) ){
245 cp.ti = input[n++];
266 result.push_back(double(cp.ti));
419 double ti = crossing_points[p].ti;
424 t = modf(ti, &curveidx);
443 std::swap(ti, tj);
459 Interval hidden = findShadowedTime(gpaths[i0], flag_j, ti, width/2);
573 // std::cout<<old_crdata[toto].ti<<",";
588 // std::cout<<crossing_points[toto].ti<<",";