@@ -78,7 +78,7 @@ namespace agg
78
78
//
79
79
// The affine matrix is all you need to perform any linear transformation,
80
80
// but all transformations have origin point (0,0). It means that we need to
81
- // use 2 translations if we want to rotate something around (100,100):
81
+ // use 2 translations if we want to rotate someting around (100,100):
82
82
//
83
83
// m *= agg::trans_affine_translation(-100.0, -100.0); // move to (0,0)
84
84
// m *= agg::trans_affine_rotation(30.0 * 3.1415926 / 180.0); // rotate
@@ -125,7 +125,7 @@ namespace agg
125
125
parl_to_parl (src, dst);
126
126
}
127
127
128
- // ---------------------------------- Parallelogram transformations
128
+ // ---------------------------------- Parellelogram transformations
129
129
// transform a parallelogram to another one. Src and dst are
130
130
// pointers to arrays of three points (double[6], x1,y1,...) that
131
131
// identify three corners of the parallelograms assuming implicit
@@ -210,14 +210,14 @@ namespace agg
210
210
}
211
211
212
212
// Multiply the matrix by another one and return
213
- // the result in a separate matrix.
213
+ // the result in a separete matrix.
214
214
trans_affine operator * (const trans_affine& m) const
215
215
{
216
216
return trans_affine (*this ).multiply (m);
217
217
}
218
218
219
219
// Multiply the matrix by inverse of another one
220
- // and return the result in a separate matrix.
220
+ // and return the result in a separete matrix.
221
221
trans_affine operator / (const trans_affine& m) const
222
222
{
223
223
return trans_affine (*this ).multiply_inv (m);
0 commit comments