@@ -252,7 +252,7 @@ pub fn inplace_normalize(x: &mut [I32F32]) {
252252 if x_sum == I32F32 :: from_num ( 0.0_f32 ) {
253253 return ;
254254 }
255- x. into_iter ( )
255+ x. iter_mut ( )
256256 . for_each ( |value| * value = value. saturating_div ( x_sum) ) ;
257257}
258258
@@ -262,7 +262,7 @@ pub fn inplace_normalize_using_sum(x: &mut [I32F32], x_sum: I32F32) {
262262 if x_sum == I32F32 :: from_num ( 0.0_f32 ) {
263263 return ;
264264 }
265- x. into_iter ( )
265+ x. iter_mut ( )
266266 . for_each ( |value| * value = value. saturating_div ( x_sum) ) ;
267267}
268268
@@ -273,7 +273,7 @@ pub fn inplace_normalize_64(x: &mut [I64F64]) {
273273 if x_sum == I64F64 :: from_num ( 0 ) {
274274 return ;
275275 }
276- x. into_iter ( )
276+ x. iter_mut ( )
277277 . for_each ( |value| * value = value. saturating_div ( x_sum) ) ;
278278}
279279
@@ -311,7 +311,7 @@ pub fn inplace_row_normalize(x: &mut [Vec<I32F32>]) {
311311 for row in x {
312312 let row_sum: I32F32 = row. iter ( ) . sum ( ) ;
313313 if row_sum > I32F32 :: from_num ( 0.0_f32 ) {
314- row. into_iter ( )
314+ row. iter_mut ( )
315315 . for_each ( |x_ij : & mut I32F32 | * x_ij = x_ij. saturating_div ( row_sum) ) ;
316316 }
317317 }
@@ -622,7 +622,7 @@ pub fn row_hadamard(matrix: &[Vec<I32F32>], vector: &[I32F32]) -> Vec<Vec<I32F32
622622 . iter ( )
623623 . zip ( vector)
624624 . map ( |( row, vec_val) | {
625- row. into_iter ( )
625+ row. iter ( )
626626 . map ( |m_val| vec_val. saturating_mul ( * m_val) )
627627 . collect ( )
628628 } )
@@ -640,7 +640,7 @@ pub fn row_hadamard_sparse(
640640 . zip ( vector)
641641 . map ( |( sparse_row, vec_val) | {
642642 sparse_row
643- . into_iter ( )
643+ . iter ( )
644644 . map ( |( j, value) | ( * j, value. saturating_mul ( * vec_val) ) )
645645 . collect ( )
646646 } )
0 commit comments