Home | Trees | Indices | Help |
|
---|
|
A 3-by-3 matrix. Stored in column-major order.
|
|||
b2Mat33 |
|
||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|
|||
thisown The membership flag |
|||
col1 b2Mat33_col1_get(b2Mat33 self) -> b2Vec3 |
|||
col2 b2Mat33_col2_get(b2Mat33 self) -> b2Vec3 |
|||
col3 b2Mat33_col3_get(b2Mat33 self) -> b2Vec3 |
|
__init__(self, b2Vec3 c1, b2Vec3 c2, b2Vec3 c3) -> b2Mat33 Construct this matrix using columns.
|
|
Returns a dictionary representation of self, with dict(var=value [, ...]) additional_ignore can be specified to ignore certain properties. |
b2Mat33_SetZero(b2Mat33 self) Set this matrix to all zeros. |
b2Mat33_Solve33(b2Mat33 self, b2Vec3 b) -> b2Vec3 Solve A * x = b, where b is a column vector. This is more efficient than computing the inverse in one-shot cases. Solve A * x = b, where b is a column vector. This is more efficient than computing the inverse in one-shot cases. |
b2Mat33_Solve22(b2Mat33 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. Solve only the upper 2-by-2 matrix equation. 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 |
col1b2Mat33_col1_get(b2Mat33 self) -> b2Vec3 |
col2b2Mat33_col2_get(b2Mat33 self) -> b2Vec3 |
col3b2Mat33_col3_get(b2Mat33 self) -> b2Vec3 |
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Tue Feb 24 18:39:58 2009 | http://epydoc.sourceforge.net |