Mercurial > hg > octave-nkf
diff liboctave/dMatrix.cc @ 4593:77566be8b9e9
[project @ 2003-11-11 17:25:42 by jwe]
author | jwe |
---|---|
date | Tue, 11 Nov 2003 17:25:42 +0000 |
parents | 7b957b442818 |
children | 79fe96966ca0 |
line wrap: on
line diff
--- a/liboctave/dMatrix.cc +++ b/liboctave/dMatrix.cc @@ -1863,32 +1863,32 @@ OCTAVE_QUIT; // construct balancing permutation vector - Array<int> ipermute (nc); + Array<int> iperm (nc); for (int i = 0; i < nc; i++) - ipermute(i) = i; // identity permutation + iperm(i) = i; // identity permutation // leading permutations in forward order for (int i = 0; i < (ilo-1); i++) { int swapidx = static_cast<int> (dpermute(i)) - 1; - int tmp = ipermute(i); - ipermute(i) = ipermute (swapidx); - ipermute(swapidx) = tmp; + int tmp = iperm(i); + iperm(i) = iperm (swapidx); + iperm(swapidx) = tmp; } // trailing permutations must be done in reverse order for (int i = nc - 1; i >= ihi; i--) { int swapidx = static_cast<int> (dpermute(i)) - 1; - int tmp = ipermute(i); - ipermute(i) = ipermute(swapidx); - ipermute(swapidx) = tmp; + int tmp = iperm(i); + iperm(i) = iperm(swapidx); + iperm(swapidx) = tmp; } // construct inverse balancing permutation vector Array<int> invpvec (nc); for (int i = 0; i < nc; i++) - invpvec(ipermute(i)) = i; // Thanks to R. A. Lippert for this method + invpvec(iperm(i)) = i; // Thanks to R. A. Lippert for this method OCTAVE_QUIT;