@@ -70,9 +70,9 @@ macro_rules! impl_least_squares_work_c {
70
70
& n,
71
71
& nrhs,
72
72
std:: ptr:: null_mut( ) ,
73
- & a_layout . lda ( ) ,
73
+ & m ,
74
74
std:: ptr:: null_mut( ) ,
75
- & b_layout . lda ( ) ,
75
+ & m_ ,
76
76
AsPtr :: as_mut_ptr( & mut singular_values) ,
77
77
& rcond,
78
78
& mut rank,
@@ -116,7 +116,7 @@ macro_rules! impl_least_squares_work_c {
116
116
117
117
// Transpose if a is C-continuous
118
118
let mut a_t = None ;
119
- let a_layout = match self . a_layout {
119
+ let _ = match self . a_layout {
120
120
MatrixLayout :: C { .. } => {
121
121
let ( layout, t) = transpose( self . a_layout, a) ;
122
122
a_t = Some ( t) ;
@@ -146,9 +146,9 @@ macro_rules! impl_least_squares_work_c {
146
146
& n,
147
147
& nrhs,
148
148
AsPtr :: as_mut_ptr( a_t. as_mut( ) . map( |v| v. as_mut_slice( ) ) . unwrap_or( a) ) ,
149
- & a_layout . lda ( ) ,
149
+ & m ,
150
150
AsPtr :: as_mut_ptr( b_t. as_mut( ) . map( |v| v. as_mut_slice( ) ) . unwrap_or( b) ) ,
151
- & b_layout . lda ( ) ,
151
+ & m_ ,
152
152
AsPtr :: as_mut_ptr( & mut self . singular_values) ,
153
153
& rcond,
154
154
& mut rank,
@@ -218,9 +218,9 @@ macro_rules! impl_least_squares_work_r {
218
218
& n,
219
219
& nrhs,
220
220
std:: ptr:: null_mut( ) ,
221
- & a_layout . lda ( ) ,
221
+ & m ,
222
222
std:: ptr:: null_mut( ) ,
223
- & b_layout . lda ( ) ,
223
+ & m_ ,
224
224
AsPtr :: as_mut_ptr( & mut singular_values) ,
225
225
& rcond,
226
226
& mut rank,
@@ -261,7 +261,7 @@ macro_rules! impl_least_squares_work_r {
261
261
262
262
// Transpose if a is C-continuous
263
263
let mut a_t = None ;
264
- let a_layout = match self . a_layout {
264
+ let _ = match self . a_layout {
265
265
MatrixLayout :: C { .. } => {
266
266
let ( layout, t) = transpose( self . a_layout, a) ;
267
267
a_t = Some ( t) ;
@@ -291,9 +291,9 @@ macro_rules! impl_least_squares_work_r {
291
291
& n,
292
292
& nrhs,
293
293
AsPtr :: as_mut_ptr( a_t. as_mut( ) . map( |v| v. as_mut_slice( ) ) . unwrap_or( a) ) ,
294
- & a_layout . lda ( ) ,
294
+ & m ,
295
295
AsPtr :: as_mut_ptr( b_t. as_mut( ) . map( |v| v. as_mut_slice( ) ) . unwrap_or( b) ) ,
296
- & b_layout . lda ( ) ,
296
+ & m_ ,
297
297
AsPtr :: as_mut_ptr( & mut self . singular_values) ,
298
298
& rcond,
299
299
& mut rank,
0 commit comments