@@ -3099,7 +3099,13 @@ impl<A, D: Dimension> ArrayRef<A, D>
3099
3099
Zip :: from ( self . lanes_mut ( axis) ) . map_collect ( mapping)
3100
3100
}
3101
3101
}
3102
+ }
3102
3103
3104
+ impl < A , S , D > ArrayBase < S , D >
3105
+ where
3106
+ S : DataOwned < Elem = A > + DataMut ,
3107
+ D : Dimension ,
3108
+ {
3103
3109
/// Remove the `index`th elements along `axis` and shift down elements from higher indexes.
3104
3110
///
3105
3111
/// Note that this "removes" the elements by swapping them around to the end of the axis and
@@ -3112,7 +3118,6 @@ impl<A, D: Dimension> ArrayRef<A, D>
3112
3118
/// ***Panics*** if `axis` is out of bounds<br>
3113
3119
/// ***Panics*** if not `index < self.len_of(axis)`.
3114
3120
pub fn remove_index ( & mut self , axis : Axis , index : usize )
3115
- // TODO: Check whether this needed to be DataOwned
3116
3121
{
3117
3122
assert ! ( index < self . len_of( axis) , "index {} must be less than length of Axis({})" ,
3118
3123
index, axis. index( ) ) ;
@@ -3122,7 +3127,10 @@ impl<A, D: Dimension> ArrayRef<A, D>
3122
3127
// then slice the axis in place to cut out the removed final element
3123
3128
self . slice_axis_inplace ( axis, Slice :: new ( 0 , Some ( -1 ) , 1 ) ) ;
3124
3129
}
3130
+ }
3125
3131
3132
+ impl < A , D : Dimension > ArrayRef < A , D >
3133
+ {
3126
3134
/// Iterates over pairs of consecutive elements along the axis.
3127
3135
///
3128
3136
/// The first argument to the closure is an element, and the second
0 commit comments