}
void
-scale (Array<Offset>* array, Real x, Real y)
+scale (Array<Offset> *array, Real x, Real y)
{
for (int i = 0; i < array->size (); i++)
{
- (*array)[i][X_AXIS] = x* (*array)[i][X_AXIS];
- (*array)[i][Y_AXIS] = y* (*array)[i][Y_AXIS];
+ (*array)[i][X_AXIS] = x * (*array)[i][X_AXIS];
+ (*array)[i][Y_AXIS] = y * (*array)[i][Y_AXIS];
}
}
void
-rotate (Array<Offset>* array, Real phi)
+rotate (Array<Offset> *array, Real phi)
{
Offset rot (complex_exp (Offset (0, phi)));
for (int i = 0; i < array->size (); i++)
}
void
-translate (Array<Offset>* array, Offset o)
+translate (Array<Offset> *array, Offset o)
{
for (int i = 0; i < array->size (); i++)
(*array)[i] += o;
if (ts.size () == 0)
{
- programming_error ("No solution found for Bezier intersection.");
+ programming_error ("no solution found for Bezier intersection");
return 0.0;
}
Offset c = curve_point (ts[0]);
if (fabs (c[a] - x) > 1e-8)
- programming_error ("Bezier intersection not correct?");
+ programming_error ("bezier intersection not correct?");
return c[other];
}
Bezier::curve_point (Real t) const
{
Real tj = 1;
- Real one_min_tj = (1 - t)* (1 - t)* (1 - t);
+ Real one_min_tj = (1 - t) * (1 - t) * (1 - t);
Offset o;
for (int j = 0; j < 4; j++)
}
#ifdef PARANOID
- assert (fabs (o[X_AXIS] - polynomial (X_AXIS).eval (t))< 1e-8);
- assert (fabs (o[Y_AXIS] - polynomial (Y_AXIS).eval (t))< 1e-8);
+ assert (fabs (o[X_AXIS] - polynomial (X_AXIS).eval (t)) < 1e-8);
+ assert (fabs (o[Y_AXIS] - polynomial (Y_AXIS).eval (t)) < 1e-8);
#endif
return o;
filter_solutions (Array<Real> sol)
{
for (int i = sol.size (); i--;)
- if (sol[i] < 0 || sol[i] >1)
+ if (sol[i] < 0 || sol[i] > 1)
sol.del (i);
return sol;
}
{
int o = (a + 1)%NO_AXES;
Offset d;
- d[Axis (o)] =1.0;
+ d[Axis (o)] = 1.0;
Interval iv;
Array<Real> sols (solve_derivative (d));
sols.push (1.0);