Lines Matching defs:to
20 * in the file COPYING-LGPL-2.1; if not, write to the Free Software
25 * The contents of this file are subject to the Mozilla Public License
60 PathInterval::PathInterval(PathTime const &from, PathTime const &to, bool cross_start, size_type path_size)
62 , _to(to)
65 , _reverse(cross_start ? to >= from : to < from)
206 PathInterval PathInterval::from_direction(PathTime const &from, PathTime const &to, bool reversed, size_type path_size)
210 result._to = to;
231 result._cross_start = from < to;
233 result._cross_start = to < from;
377 // pw<d2<>> is always open. so if path is closed, add closing segment as well to pwd2.
386 // so we need to create at least one segment manually
566 // preprocessing to remove duplicate intersections at endpoints
621 std::vector<double> Path::allNearestTimes(Point const &_point, double from, double to) const
623 // TODO from and to are not used anywhere.
624 // rewrite this to simplify.
627 if (from > to)
628 swap(from, to);
633 if (from < 0 || to > sz) {
634 THROW_RANGEERROR("[from,to] interval out of bounds");
637 double eif, et = modf(to, &eif);
760 void Path::appendPortionTo(Path &ret, double from, double to) const
762 if (!(from >= 0 && to >= 0)) {
763 THROW_RANGEERROR("from and to must be >=0 in Path::appendPortionTo");
765 if (to == 0)
766 to = size() + 0.999999;
767 if (from == to) {
771 double ff = modf(from, &fi), tf = modf(to, &ti);
777 if (fi == ti && from < to) {
786 if (from >= to) {
809 PathTime const &from = ival.from(), &to = ival.to();
815 if (!ival.crossesStart() && from.curve_index == to.curve_index) {
816 Curve *c = (*this)[from.curve_index].portion(from.t, to.t);
831 for (size_type i = (from.curve_index + s + di) % s; i != to.curve_index;
841 Curve *c_last = (*this)[to.curve_index].portion(reverse ? 1 : 0, to.t);
970 // if do_update replaces the closing segment, we have to regenerate it
972 if (first == last) return; // nothing to do
997 // not necessary to stitch in front