Cross Reference: /inkscape/src/2geom/bezier.cpp

Lines Matching refs:c_
54         d_[i] = c_[i];
75         left->c_.resize(size());
77             right->c_.resize(size());
78             casteljau_subdivision<double>(t, &const_cast<std::valarray<Coord>&>(c_)[0],
79                 &left->c_[0], &right->c_[0], order());
81             casteljau_subdivision<double>(t, &const_cast<std::valarray<Coord>&>(c_)[0],
82                 &left->c_[0], NULL, order());
85         right->c_.resize(size());
86         casteljau_subdivision<double>(t, &const_cast<std::valarray<Coord>&>(c_)[0],
87             NULL, &right->c_[0], order());
109     find_bernstein_roots(&const_cast<std::valarray<Coord>&>(c_)[0], order(), solutions, 0, ivl.min(), ivl.max());
122             fd[i] += (((j)&1)?-c_[j]:c_[j])*choose<double>(n, j-i);
132     ed[0] = c_[0];
133     ed[n] = c_[n-1];
135         ed[i] = (i*c_[i-1] + (n - i)*c_[i])/(n);
145     ed[0] = c_[0];
146     ed[n-1] = c_[n]; // ensure exact endpoints
149         ed[i] = (n*c_[i] - i*ed[i-1])/(n-i);
152         ed[i] = (n*c_[i] - i*ed[n-i])/(i);
172         b[i] = (n*c_[i+1])/(i+1);
182     //return bezier_to_sbasis(&c_[0], order());
187     if (c_.size() > other.size()) {
188         c_ += other.elevate_to_degree(degree()).c_;
189     } else if (c_.size() < other.size()) {
191         c_ += other.c_;
193         c_ += other.c_;
200     if (c_.size() > other.size()) {
201         c_ -= other.elevate_to_degree(degree()).c_;
202     } else if (c_.size() < other.size()) {
204         c_ -= other.c_;
206         c_ -= other.c_;
247             casteljau_subdivision<double>(to, &ret.c_[0], &ret.c_[0], NULL, ret.order());
250         casteljau_subdivision<double>(from, &ret.c_[0], NULL, &ret.c_[0], ret.order());
252         casteljau_subdivision<double>((to - from) / (1 - from), &ret.c_[0], &ret.c_[0], NULL, ret.order());
255         ret.c_[ret.order()] = a.valueAt(to);
259         std::reverse(&ret.c_[0], &ret.c_[0] + ret.c_.size());
267     if(a.order() == 1) return Bezier(a.c_[1]-a.c_[0]);
271         der.c_[i] = a.order()*(a.c_[i+1] - a.c_[i]);
289     OptInterval ret = Interval::from_array(&const_cast<Bezier&>(b).c_[0], b.size());