Lines Matching defs:right
76 * @param right Output polynomial corresponding to \f$[t, 1]\f$
80 inline T casteljau_subdivision(double t, T const *v, T *left, T *right, unsigned order) {
85 if (!left && !right) {
89 if (!right) {
102 if (right != v) {
103 std::copy(v, v + order + 1, right);
107 left[i-1] = right[0];
110 right[j-1] = lerp(t, right[j-1], right[j]);
113 right[0] = val;
115 left[order] = right[0];
117 return right[0];
275 void subdivide(Coord t, Bezier *left, Bezier *right) const;