Lines Matching refs:left
75 * @param left Output polynomial corresponding to \f$[0, t]\f$
80 inline T casteljau_subdivision(double t, T const *v, T *left, T *right, unsigned order) {
85 if (!left && !right) {
90 if (left != v) {
91 std::copy(v, v + order + 1, left);
95 left[j] = lerp(t, left[j-1], left[j]);
98 left[order] = val;
99 return left[order];
106 if (left) {
107 left[i-1] = right[0];
114 if (left) {
115 left[order] = right[0];
275 void subdivide(Coord t, Bezier *left, Bezier *right) const;