srenblad/nalgebra
1
0
Fork 0
forked from M-Labs/nalgebra
Code Pull Requests Activity

Replaced an uggly for by a bit less uggly while for the matrix inversion.

Browse Source
This commit is contained in:
Sébastien Crozet 2013-05-15 01:10:18 +00:00
parent 30d82f2408
commit cfe636c11b
1 changed files with 15 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
src/ndim/nmat.rs
View File

@ -107,23 +107,30 @@ Inv for NMat<D, T>
// FIXME: this is kind of uggly…
// … but we cannot use position_betwee since we are iterating on one
// columns
let mut n0 = dim; // index of a non-zero entry
let mut n0 = 0u; // index of a non-zero entry
for uint::range(k, dim) |i|
while (n0 != dim)
{
n0 = k;
if (cpy[(i, k)] != _0T)
if (cpy[(n0, k)] != _0T)
{ break; }
n0 += 1;
}
assert!(n0 != dim); // non inversible matrix
// swap pivot line
if (n0 != k)
{
for uint::range(0u, dim) |j|
{
swap(cpy.mij, NMat::offset::<D, T>(n0, j), NMat::offset::<D, T>(k, j));
swap(res.mij, NMat::offset::<D, T>(n0, j), NMat::offset::<D, T>(k, j));
swap(cpy.mij,
NMat::offset::<D, T>(n0, j),
NMat::offset::<D, T>(k, j));
swap(res.mij,
NMat::offset::<D, T>(n0, j),
NMat::offset::<D, T>(k, j));
}
}
let pivot = cpy[(k, k)];