Home | Trees | Indices | Help |
|
---|
|
A 2-by-2 matrix. Stored in column-major order.
|
|||
b2Mat22 |
|
||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|
|||
thisown The membership flag |
|||
col1 b2Mat22_col1_get(b2Mat22 self) -> b2Vec2 |
|||
col2 b2Mat22_col2_get(b2Mat22 self) -> b2Vec2 |
|
__init__(self, b2Vec2 c1, b2Vec2 c2) -> b2Mat22 __init__(self, float32 a11, float32 a12, float32 a21, float32 a22) -> b2Mat22 __init__(self, float32 angle) -> b2Mat22 Construct this matrix using an angle. This matrix becomes an orthonormal rotation matrix.
|
|
Returns a dictionary representation of self, with dict(var=value [, ...]) additional_ignore can be specified to ignore certain properties. |
Set(b2Vec2 c1, b2Vec2 c2) b2Mat22_Set(b2Mat22 self, float32 angle) Initialize this matrix using an angle. This matrix becomes an orthonormal rotation matrix. |
b2Mat22_SetIdentity(b2Mat22 self) Set this to the identity matrix. |
b2Mat22_SetZero(b2Mat22 self) Set this matrix to all zeros. |
b2Mat22_GetAngle(b2Mat22 self) -> float32 Extract the angle from this matrix (assumed to be a rotation matrix). |
b2Mat22_Solve(b2Mat22 self, b2Vec2 b) -> b2Vec2 Solve A * x = b, where b is a column vector. This is more efficient than computing the inverse in one-shot cases. |
|
thisownThe membership flag |
col1b2Mat22_col1_get(b2Mat22 self) -> b2Vec2 |
col2b2Mat22_col2_get(b2Mat22 self) -> b2Vec2 |
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Tue Feb 24 18:39:58 2009 | http://epydoc.sourceforge.net |