@@ -143,7 +143,7 @@ pub use crate::indexes::{indices, indices_of};
143143pub use crate :: slice:: { Slice , SliceInfo , SliceNextDim , SliceOrIndex } ;
144144
145145use crate :: iterators:: Baseiter ;
146- use crate :: iterators:: { ElementsBase , ElementsBaseMut , Iter , IterMut , Lanes , LanesMut } ;
146+ use crate :: iterators:: { ElementsBase , ElementsBaseMut , Iter , IterMut , Lanes } ;
147147
148148pub use crate :: arraytraits:: AsArray ;
149149#[ cfg( feature = "std" ) ]
@@ -1544,22 +1544,6 @@ where
15441544 self . strides . clone ( )
15451545 }
15461546
1547- /// Apply closure `f` to each element in the array, in whatever
1548- /// order is the fastest to visit.
1549- fn unordered_foreach_mut < F > ( & mut self , mut f : F )
1550- where
1551- S : DataMut ,
1552- F : FnMut ( & mut A ) ,
1553- {
1554- if let Some ( slc) = self . as_slice_memory_order_mut ( ) {
1555- slc. iter_mut ( ) . for_each ( f) ;
1556- } else {
1557- for row in self . inner_rows_mut ( ) {
1558- row. into_iter_ ( ) . fold ( ( ) , |( ) , elt| f ( elt) ) ;
1559- }
1560- }
1561- }
1562-
15631547 /// Remove array axis `axis` and return the result.
15641548 fn try_remove_axis ( self , axis : Axis ) -> ArrayBase < S , D :: Smaller > {
15651549 let d = self . dim . try_remove_axis ( axis) ;
@@ -1577,15 +1561,6 @@ where
15771561 let n = self . ndim ( ) ;
15781562 Lanes :: new ( self . view ( ) , Axis ( n. saturating_sub ( 1 ) ) )
15791563 }
1580-
1581- /// n-d generalization of rows, just like inner iter
1582- fn inner_rows_mut ( & mut self ) -> iterators:: LanesMut < ' _ , A , D :: Smaller >
1583- where
1584- S : DataMut ,
1585- {
1586- let n = self . ndim ( ) ;
1587- LanesMut :: new ( self . view_mut ( ) , Axis ( n. saturating_sub ( 1 ) ) )
1588- }
15891564}
15901565
15911566// parallel methods
0 commit comments