@@ -173,7 +173,7 @@ fn test_slice_array_fixed() {
173
173
arr. slice ( info) ;
174
174
arr. slice_mut ( info) ;
175
175
arr. view ( ) . slice_move ( info) ;
176
- arr. view ( ) . slice_inplace ( info) ;
176
+ arr. view ( ) . slice_collapse ( info) ;
177
177
}
178
178
179
179
#[ test]
@@ -183,7 +183,7 @@ fn test_slice_dyninput_array_fixed() {
183
183
arr. slice ( info) ;
184
184
arr. slice_mut ( info) ;
185
185
arr. view ( ) . slice_move ( info) ;
186
- arr. view ( ) . slice_inplace ( info. as_ref ( ) ) ;
186
+ arr. view ( ) . slice_collapse ( info. as_ref ( ) ) ;
187
187
}
188
188
189
189
#[ test]
@@ -197,7 +197,7 @@ fn test_slice_array_dyn() {
197
197
arr. slice ( info) ;
198
198
arr. slice_mut ( info) ;
199
199
arr. view ( ) . slice_move ( info) ;
200
- arr. view ( ) . slice_inplace ( info) ;
200
+ arr. view ( ) . slice_collapse ( info) ;
201
201
}
202
202
203
203
#[ test]
@@ -211,7 +211,7 @@ fn test_slice_dyninput_array_dyn() {
211
211
arr. slice ( info) ;
212
212
arr. slice_mut ( info) ;
213
213
arr. view ( ) . slice_move ( info) ;
214
- arr. view ( ) . slice_inplace ( info. as_ref ( ) ) ;
214
+ arr. view ( ) . slice_collapse ( info. as_ref ( ) ) ;
215
215
}
216
216
217
217
#[ test]
@@ -225,7 +225,7 @@ fn test_slice_dyninput_vec_fixed() {
225
225
arr. slice ( info. as_ref ( ) ) ;
226
226
arr. slice_mut ( info. as_ref ( ) ) ;
227
227
arr. view ( ) . slice_move ( info. as_ref ( ) ) ;
228
- arr. view ( ) . slice_inplace ( info. as_ref ( ) ) ;
228
+ arr. view ( ) . slice_collapse ( info. as_ref ( ) ) ;
229
229
}
230
230
231
231
#[ test]
@@ -239,7 +239,7 @@ fn test_slice_dyninput_vec_dyn() {
239
239
arr. slice ( info. as_ref ( ) ) ;
240
240
arr. slice_mut ( info. as_ref ( ) ) ;
241
241
arr. view ( ) . slice_move ( info. as_ref ( ) ) ;
242
- arr. view ( ) . slice_inplace ( info. as_ref ( ) ) ;
242
+ arr. view ( ) . slice_collapse ( info. as_ref ( ) ) ;
243
243
}
244
244
245
245
#[ test]
@@ -276,15 +276,15 @@ fn test_slice_with_subview() {
276
276
}
277
277
278
278
#[ test]
279
- fn test_slice_inplace_with_indices ( ) {
279
+ fn test_slice_collapse_with_indices ( ) {
280
280
let mut arr = RcArray :: < usize , _ > :: zeros ( ( 3 , 5 , 4 ) ) ;
281
281
for ( i, elt) in arr. iter_mut ( ) . enumerate ( ) {
282
282
* elt = i;
283
283
}
284
284
285
285
{
286
286
let mut vi = arr. view ( ) ;
287
- vi. slice_inplace ( s ! [ 1 .., 2 , ..; 2 ] ) ;
287
+ vi. slice_collapse ( s ! [ 1 .., 2 , ..; 2 ] ) ;
288
288
assert_eq ! ( vi. shape( ) , & [ 2 , 1 , 2 ] ) ;
289
289
assert ! (
290
290
vi. iter( )
@@ -293,7 +293,7 @@ fn test_slice_inplace_with_indices() {
293
293
) ;
294
294
295
295
let mut vi = arr. view ( ) ;
296
- vi. slice_inplace ( s ! [ 1 , 2 , ..; 2 ] ) ;
296
+ vi. slice_collapse ( s ! [ 1 , 2 , ..; 2 ] ) ;
297
297
assert_eq ! ( vi. shape( ) , & [ 1 , 1 , 2 ] ) ;
298
298
assert ! (
299
299
vi. iter( )
@@ -302,15 +302,15 @@ fn test_slice_inplace_with_indices() {
302
302
) ;
303
303
304
304
let mut vi = arr. view ( ) ;
305
- vi. slice_inplace ( s ! [ 1 , 2 , 3 ] ) ;
305
+ vi. slice_collapse ( s ! [ 1 , 2 , 3 ] ) ;
306
306
assert_eq ! ( vi. shape( ) , & [ 1 , 1 , 1 ] ) ;
307
307
assert_eq ! ( vi, Array3 :: from_elem( ( 1 , 1 , 1 ) , arr[ ( 1 , 2 , 3 ) ] ) ) ;
308
308
}
309
309
310
310
// Do it to the RcArray itself
311
311
let elem = arr[ ( 1 , 2 , 3 ) ] ;
312
312
let mut vi = arr;
313
- vi. slice_inplace ( s ! [ 1 , 2 , 3 ] ) ;
313
+ vi. slice_collapse ( s ! [ 1 , 2 , 3 ] ) ;
314
314
assert_eq ! ( vi. shape( ) , & [ 1 , 1 , 1 ] ) ;
315
315
assert_eq ! ( vi, Array3 :: from_elem( ( 1 , 1 , 1 ) , elem) ) ;
316
316
}
@@ -458,7 +458,7 @@ fn test_cow()
458
458
assert_eq ! ( n[ [ 0 , 1 ] ] , 0 ) ;
459
459
assert_eq ! ( n. get( ( 0 , 1 ) ) , Some ( & 0 ) ) ;
460
460
let mut rev = mat. reshape ( 4 ) ;
461
- rev. slice_inplace ( s ! [ ..; -1 ] ) ;
461
+ rev. slice_collapse ( s ! [ ..; -1 ] ) ;
462
462
assert_eq ! ( rev[ 0 ] , 4 ) ;
463
463
assert_eq ! ( rev[ 1 ] , 3 ) ;
464
464
assert_eq ! ( rev[ 2 ] , 2 ) ;
@@ -483,7 +483,7 @@ fn test_cow_shrink()
483
483
// mutation shrinks the array and gives it different strides
484
484
//
485
485
let mut mat = RcArray :: zeros ( ( 2 , 3 ) ) ;
486
- //mat.slice_inplace (s![.., ..;2]);
486
+ //mat.slice_collapse (s![.., ..;2]);
487
487
mat[ [ 0 , 0 ] ] = 1 ;
488
488
let n = mat. clone ( ) ;
489
489
mat[ [ 0 , 1 ] ] = 2 ;
@@ -498,7 +498,7 @@ fn test_cow_shrink()
498
498
assert_eq ! ( n. get( ( 0 , 1 ) ) , Some ( & 0 ) ) ;
499
499
// small has non-C strides this way
500
500
let mut small = mat. reshape ( 6 ) ;
501
- small. slice_inplace ( s ! [ 4 ..; -1 ] ) ;
501
+ small. slice_collapse ( s ! [ 4 ..; -1 ] ) ;
502
502
assert_eq ! ( small[ 0 ] , 6 ) ;
503
503
assert_eq ! ( small[ 1 ] , 5 ) ;
504
504
let before = small. clone ( ) ;
@@ -678,7 +678,7 @@ fn assign()
678
678
let mut a = arr2 ( & [ [ 1 , 2 ] , [ 3 , 4 ] ] ) ;
679
679
{
680
680
let mut v = a. view_mut ( ) ;
681
- v. slice_inplace ( s ! [ ..1 , ..] ) ;
681
+ v. slice_collapse ( s ! [ ..1 , ..] ) ;
682
682
v. fill ( 0 ) ;
683
683
}
684
684
assert_eq ! ( a, arr2( & [ [ 0 , 0 ] , [ 3 , 4 ] ] ) ) ;
@@ -995,7 +995,7 @@ fn owned_array_discontiguous_drop() {
995
995
let v: Vec < _ > = ( 0 ..12 ) . map ( |x| InsertOnDrop ( set. clone ( ) , Some ( x) ) ) . collect ( ) ;
996
996
let mut a = Array :: from_shape_vec ( ( 2 , 6 ) , v) . unwrap ( ) ;
997
997
// discontiguous and non-zero offset
998
- a. slice_inplace ( s ! [ .., 1 ..] ) ;
998
+ a. slice_collapse ( s ! [ .., 1 ..] ) ;
999
999
}
1000
1000
// each item was dropped exactly once
1001
1001
itertools:: assert_equal ( set. borrow ( ) . iter ( ) . cloned ( ) , 0 ..12 ) ;
@@ -1561,7 +1561,7 @@ fn to_owned_memory_order() {
1561
1561
fn to_owned_neg_stride ( ) {
1562
1562
let mut c = arr2 ( & [ [ 1 , 2 , 3 ] ,
1563
1563
[ 4 , 5 , 6 ] ] ) ;
1564
- c. slice_inplace ( s ! [ .., ..; -1 ] ) ;
1564
+ c. slice_collapse ( s ! [ .., ..; -1 ] ) ;
1565
1565
let co = c. to_owned ( ) ;
1566
1566
assert_eq ! ( c, co) ;
1567
1567
}
@@ -1570,7 +1570,7 @@ fn to_owned_neg_stride() {
1570
1570
fn discontiguous_owned_to_owned ( ) {
1571
1571
let mut c = arr2 ( & [ [ 1 , 2 , 3 ] ,
1572
1572
[ 4 , 5 , 6 ] ] ) ;
1573
- c. slice_inplace ( s ! [ .., ..; 2 ] ) ;
1573
+ c. slice_collapse ( s ! [ .., ..; 2 ] ) ;
1574
1574
1575
1575
let co = c. to_owned ( ) ;
1576
1576
assert_eq ! ( c. strides( ) , & [ 3 , 2 ] ) ;
@@ -1738,10 +1738,10 @@ fn test_to_vec() {
1738
1738
[ 7 , 8 , 9 ] ,
1739
1739
[ 10 , 11 , 12 ] ] ) ;
1740
1740
1741
- a. slice_inplace ( s ! [ ..; -1 , ..] ) ;
1741
+ a. slice_collapse ( s ! [ ..; -1 , ..] ) ;
1742
1742
assert_eq ! ( a. row( 3 ) . to_vec( ) , vec![ 1 , 2 , 3 ] ) ;
1743
1743
assert_eq ! ( a. column( 2 ) . to_vec( ) , vec![ 12 , 9 , 6 , 3 ] ) ;
1744
- a. slice_inplace ( s ! [ .., ..; -1 ] ) ;
1744
+ a. slice_collapse ( s ! [ .., ..; -1 ] ) ;
1745
1745
assert_eq ! ( a. row( 3 ) . to_vec( ) , vec![ 3 , 2 , 1 ] ) ;
1746
1746
}
1747
1747
@@ -1757,7 +1757,7 @@ fn test_array_clone_unalias() {
1757
1757
#[ test]
1758
1758
fn test_array_clone_same_view ( ) {
1759
1759
let mut a = Array :: from_iter ( 0 ..9 ) . into_shape ( ( 3 , 3 ) ) . unwrap ( ) ;
1760
- a. slice_inplace ( s ! [ ..; -1 , ..; -1 ] ) ;
1760
+ a. slice_collapse ( s ! [ ..; -1 , ..; -1 ] ) ;
1761
1761
let b = a. clone ( ) ;
1762
1762
assert_eq ! ( a, b) ;
1763
1763
}
0 commit comments