@@ -133,21 +133,12 @@ impl<A> Matrix for Array<A, Ix2>
133
133
}
134
134
fn lu ( self ) -> Result < ( Self :: Permutator , Self , Self ) , LinalgError > {
135
135
let ( n, m) = self . size ( ) ;
136
- println ! ( "n={}, m={}" , n, m) ;
137
136
let k = min ( n, m) ;
138
- let ( p, mut a) = match self . layout ( ) ? {
139
- Layout :: ColumnMajor => {
140
- println ! ( "ColumnMajor" ) ;
141
- let ( p, l) = ImplSolve :: lu ( self . layout ( ) ?, n, m, self . clone ( ) . into_raw_vec ( ) ) ?;
142
- ( p, Array :: from_vec ( l) . into_shape ( ( m, n) ) . unwrap ( ) . reversed_axes ( ) )
143
- }
144
- Layout :: RowMajor => {
145
- println ! ( "RowMajor" ) ;
146
- let ( p, l) = ImplSolve :: lu ( self . layout ( ) ?, n, m, self . clone ( ) . into_raw_vec ( ) ) ?;
147
- ( p, Array :: from_vec ( l) . into_shape ( ( n, m) ) . unwrap ( ) )
148
- }
137
+ let ( p, l) = ImplSolve :: lu ( self . layout ( ) ?, n, m, self . clone ( ) . into_raw_vec ( ) ) ?;
138
+ let mut a = match self . layout ( ) ? {
139
+ Layout :: ColumnMajor => Array :: from_vec ( l) . into_shape ( ( m, n) ) . unwrap ( ) . reversed_axes ( ) ,
140
+ Layout :: RowMajor => Array :: from_vec ( l) . into_shape ( ( n, m) ) . unwrap ( ) ,
149
141
} ;
150
- println ! ( "a (after LU) = \n {:?}" , & a) ;
151
142
let mut lm = Array :: zeros ( ( n, k) ) ;
152
143
for ( ( i, j) , val) in lm. indexed_iter_mut ( ) {
153
144
if i > j {
@@ -166,7 +157,6 @@ impl<A> Matrix for Array<A, Ix2>
166
157
} else {
167
158
a
168
159
} ;
169
- println ! ( "am = \n {:?}" , am) ;
170
160
Ok ( ( p, lm, am) )
171
161
}
172
162
fn permutate ( & mut self , ipiv : & Self :: Permutator ) {
0 commit comments