@@ -277,21 +277,33 @@ impl<T: Clone> Iterator<Vec<T>> for Permutations<T> {
277
277
278
278
/// Extension methods for vector slices with cloneable elements
279
279
pub trait CloneableVector < T > {
280
- /// Copy `self` into a new owned vector
281
- fn to_owned ( & self ) -> Vec < T > ;
280
+ /// Copy `self` into a new vector
281
+ fn to_vec ( & self ) -> Vec < T > ;
282
+
283
+ /// Deprecated. Use `to_vec`
284
+ #[ deprecated = "Replaced by `to_vec`" ]
285
+ fn to_owned ( & self ) -> Vec < T > {
286
+ self . to_vec ( )
287
+ }
282
288
283
289
/// Convert `self` into an owned vector, not making a copy if possible.
284
- fn into_owned ( self ) -> Vec < T > ;
290
+ fn into_vec ( self ) -> Vec < T > ;
291
+
292
+ /// Deprecated. Use `into_vec`
293
+ #[ deprecated = "Replaced by `into_vec`" ]
294
+ fn into_owned ( self ) -> Vec < T > {
295
+ self . into_vec ( )
296
+ }
285
297
}
286
298
287
299
/// Extension methods for vector slices
288
300
impl < ' a , T : Clone > CloneableVector < T > for & ' a [ T ] {
289
301
/// Returns a copy of `v`.
290
302
#[ inline]
291
- fn to_owned ( & self ) -> Vec < T > { Vec :: from_slice ( * self ) }
303
+ fn to_vec ( & self ) -> Vec < T > { Vec :: from_slice ( * self ) }
292
304
293
305
#[ inline( always) ]
294
- fn into_owned ( self ) -> Vec < T > { self . to_owned ( ) }
306
+ fn into_vec ( self ) -> Vec < T > { self . to_vec ( ) }
295
307
}
296
308
297
309
/// Extension methods for vectors containing `Clone` elements.
@@ -325,7 +337,7 @@ impl<'a,T:Clone> ImmutableCloneableVector<T> for &'a [T] {
325
337
fn permutations ( self ) -> Permutations < T > {
326
338
Permutations {
327
339
swaps : ElementSwaps :: new ( self . len ( ) ) ,
328
- v : self . to_owned ( ) ,
340
+ v : self . to_vec ( ) ,
329
341
}
330
342
}
331
343
@@ -888,7 +900,7 @@ mod tests {
888
900
fn test_slice ( ) {
889
901
// Test fixed length vector.
890
902
let vec_fixed = [ 1 i, 2 , 3 , 4 ] ;
891
- let v_a = vec_fixed. slice ( 1 u, vec_fixed. len ( ) ) . to_owned ( ) ;
903
+ let v_a = vec_fixed. slice ( 1 u, vec_fixed. len ( ) ) . to_vec ( ) ;
892
904
assert_eq ! ( v_a. len( ) , 3 u) ;
893
905
let v_a = v_a. as_slice ( ) ;
894
906
assert_eq ! ( v_a[ 0 ] , 2 ) ;
@@ -897,15 +909,15 @@ mod tests {
897
909
898
910
// Test on stack.
899
911
let vec_stack = & [ 1 i, 2 , 3 ] ;
900
- let v_b = vec_stack. slice ( 1 u, 3 u) . to_owned ( ) ;
912
+ let v_b = vec_stack. slice ( 1 u, 3 u) . to_vec ( ) ;
901
913
assert_eq ! ( v_b. len( ) , 2 u) ;
902
914
let v_b = v_b. as_slice ( ) ;
903
915
assert_eq ! ( v_b[ 0 ] , 2 ) ;
904
916
assert_eq ! ( v_b[ 1 ] , 3 ) ;
905
917
906
918
// Test `Box<[T]>`
907
919
let vec_unique = vec ! [ 1 i, 2 , 3 , 4 , 5 , 6 ] ;
908
- let v_d = vec_unique. slice ( 1 u, 6 u) . to_owned ( ) ;
920
+ let v_d = vec_unique. slice ( 1 u, 6 u) . to_vec ( ) ;
909
921
assert_eq ! ( v_d. len( ) , 5 u) ;
910
922
let v_d = v_d. as_slice ( ) ;
911
923
assert_eq ! ( v_d[ 0 ] , 2 ) ;
@@ -1132,7 +1144,7 @@ mod tests {
1132
1144
let ( min_size, max_opt) = it. size_hint ( ) ;
1133
1145
assert_eq ! ( min_size, 1 ) ;
1134
1146
assert_eq ! ( max_opt. unwrap( ) , 1 ) ;
1135
- assert_eq ! ( it. next( ) , Some ( v. as_slice( ) . to_owned ( ) ) ) ;
1147
+ assert_eq ! ( it. next( ) , Some ( v. as_slice( ) . to_vec ( ) ) ) ;
1136
1148
assert_eq ! ( it. next( ) , None ) ;
1137
1149
}
1138
1150
{
@@ -1141,7 +1153,7 @@ mod tests {
1141
1153
let ( min_size, max_opt) = it. size_hint ( ) ;
1142
1154
assert_eq ! ( min_size, 1 ) ;
1143
1155
assert_eq ! ( max_opt. unwrap( ) , 1 ) ;
1144
- assert_eq ! ( it. next( ) , Some ( v. as_slice( ) . to_owned ( ) ) ) ;
1156
+ assert_eq ! ( it. next( ) , Some ( v. as_slice( ) . to_vec ( ) ) ) ;
1145
1157
assert_eq ! ( it. next( ) , None ) ;
1146
1158
}
1147
1159
{
0 commit comments