@@ -269,20 +269,20 @@ fn map_seq_par_equivalence_existing_empty_extend_empty() {
269
269
let mut map_seq = MAP_EXISTING_EMPTY . clone ( ) ;
270
270
let mut map_par = MAP_EXISTING_EMPTY . clone ( ) ;
271
271
272
- map_seq. extend ( MAP_EXTENSION_EMPTY . iter ( ) . cloned ( ) ) ;
273
- map_par. par_extend ( MAP_EXTENSION_EMPTY . par_iter ( ) . cloned ( ) ) ;
272
+ map_seq. extend ( MAP_EXTENSION_EMPTY . iter ( ) . copied ( ) ) ;
273
+ map_par. par_extend ( MAP_EXTENSION_EMPTY . par_iter ( ) . copied ( ) ) ;
274
274
275
275
assert_eq3 ! ( map_seq, map_par, expected) ;
276
276
}
277
277
278
278
#[ test]
279
279
fn map_seq_par_equivalence_existing_empty_extend ( ) {
280
- let expected = MAP_EXTENSION . iter ( ) . cloned ( ) . collect :: < HashMap < _ , _ > > ( ) ;
280
+ let expected = MAP_EXTENSION . iter ( ) . copied ( ) . collect :: < HashMap < _ , _ > > ( ) ;
281
281
let mut map_seq = MAP_EXISTING_EMPTY . clone ( ) ;
282
282
let mut map_par = MAP_EXISTING_EMPTY . clone ( ) ;
283
283
284
- map_seq. extend ( MAP_EXTENSION . iter ( ) . cloned ( ) ) ;
285
- map_par. par_extend ( MAP_EXTENSION . par_iter ( ) . cloned ( ) ) ;
284
+ map_seq. extend ( MAP_EXTENSION . iter ( ) . copied ( ) ) ;
285
+ map_par. par_extend ( MAP_EXTENSION . par_iter ( ) . copied ( ) ) ;
286
286
287
287
assert_eq3 ! ( map_seq, map_par, expected) ;
288
288
}
@@ -293,8 +293,8 @@ fn map_seq_par_equivalence_existing_extend_empty() {
293
293
let mut map_seq = MAP_EXISTING . clone ( ) ;
294
294
let mut map_par = MAP_EXISTING . clone ( ) ;
295
295
296
- map_seq. extend ( MAP_EXTENSION_EMPTY . iter ( ) . cloned ( ) ) ;
297
- map_par. par_extend ( MAP_EXTENSION_EMPTY . par_iter ( ) . cloned ( ) ) ;
296
+ map_seq. extend ( MAP_EXTENSION_EMPTY . iter ( ) . copied ( ) ) ;
297
+ map_par. par_extend ( MAP_EXTENSION_EMPTY . par_iter ( ) . copied ( ) ) ;
298
298
299
299
assert_eq3 ! ( map_seq, map_par, expected) ;
300
300
}
@@ -305,8 +305,8 @@ fn map_seq_par_equivalence_existing_extend() {
305
305
let mut map_seq = MAP_EXISTING . clone ( ) ;
306
306
let mut map_par = MAP_EXISTING . clone ( ) ;
307
307
308
- map_seq. extend ( MAP_EXTENSION . iter ( ) . cloned ( ) ) ;
309
- map_par. par_extend ( MAP_EXTENSION . par_iter ( ) . cloned ( ) ) ;
308
+ map_seq. extend ( MAP_EXTENSION . iter ( ) . copied ( ) ) ;
309
+ map_par. par_extend ( MAP_EXTENSION . par_iter ( ) . copied ( ) ) ;
310
310
311
311
assert_eq3 ! ( map_seq, map_par, expected) ;
312
312
}
@@ -423,20 +423,20 @@ fn set_seq_par_equivalence_existing_empty_extend_empty() {
423
423
let mut set_seq = SET_EXISTING_EMPTY . clone ( ) ;
424
424
let mut set_par = SET_EXISTING_EMPTY . clone ( ) ;
425
425
426
- set_seq. extend ( SET_EXTENSION_EMPTY . iter ( ) . cloned ( ) ) ;
427
- set_par. par_extend ( SET_EXTENSION_EMPTY . par_iter ( ) . cloned ( ) ) ;
426
+ set_seq. extend ( SET_EXTENSION_EMPTY . iter ( ) . copied ( ) ) ;
427
+ set_par. par_extend ( SET_EXTENSION_EMPTY . par_iter ( ) . copied ( ) ) ;
428
428
429
429
assert_eq3 ! ( set_seq, set_par, expected) ;
430
430
}
431
431
432
432
#[ test]
433
433
fn set_seq_par_equivalence_existing_empty_extend ( ) {
434
- let expected = SET_EXTENSION . iter ( ) . cloned ( ) . collect :: < HashSet < _ > > ( ) ;
434
+ let expected = SET_EXTENSION . iter ( ) . copied ( ) . collect :: < HashSet < _ > > ( ) ;
435
435
let mut set_seq = SET_EXISTING_EMPTY . clone ( ) ;
436
436
let mut set_par = SET_EXISTING_EMPTY . clone ( ) ;
437
437
438
- set_seq. extend ( SET_EXTENSION . iter ( ) . cloned ( ) ) ;
439
- set_par. par_extend ( SET_EXTENSION . par_iter ( ) . cloned ( ) ) ;
438
+ set_seq. extend ( SET_EXTENSION . iter ( ) . copied ( ) ) ;
439
+ set_par. par_extend ( SET_EXTENSION . par_iter ( ) . copied ( ) ) ;
440
440
441
441
assert_eq3 ! ( set_seq, set_par, expected) ;
442
442
}
@@ -447,8 +447,8 @@ fn set_seq_par_equivalence_existing_extend_empty() {
447
447
let mut set_seq = SET_EXISTING . clone ( ) ;
448
448
let mut set_par = SET_EXISTING . clone ( ) ;
449
449
450
- set_seq. extend ( SET_EXTENSION_EMPTY . iter ( ) . cloned ( ) ) ;
451
- set_par. par_extend ( SET_EXTENSION_EMPTY . par_iter ( ) . cloned ( ) ) ;
450
+ set_seq. extend ( SET_EXTENSION_EMPTY . iter ( ) . copied ( ) ) ;
451
+ set_par. par_extend ( SET_EXTENSION_EMPTY . par_iter ( ) . copied ( ) ) ;
452
452
453
453
assert_eq3 ! ( set_seq, set_par, expected) ;
454
454
}
@@ -459,37 +459,37 @@ fn set_seq_par_equivalence_existing_extend() {
459
459
let mut set_seq = SET_EXISTING . clone ( ) ;
460
460
let mut set_par = SET_EXISTING . clone ( ) ;
461
461
462
- set_seq. extend ( SET_EXTENSION . iter ( ) . cloned ( ) ) ;
463
- set_par. par_extend ( SET_EXTENSION . par_iter ( ) . cloned ( ) ) ;
462
+ set_seq. extend ( SET_EXTENSION . iter ( ) . copied ( ) ) ;
463
+ set_par. par_extend ( SET_EXTENSION . par_iter ( ) . copied ( ) ) ;
464
464
465
465
assert_eq3 ! ( set_seq, set_par, expected) ;
466
466
}
467
467
468
468
lazy_static ! {
469
- static ref SET_A : HashSet <char > = [ 'a' , 'b' , 'c' , 'd' ] . iter( ) . cloned ( ) . collect( ) ;
470
- static ref SET_B : HashSet <char > = [ 'a' , 'b' , 'e' , 'f' ] . iter( ) . cloned ( ) . collect( ) ;
471
- static ref SET_DIFF_AB : HashSet <char > = [ 'c' , 'd' ] . iter( ) . cloned ( ) . collect( ) ;
472
- static ref SET_DIFF_BA : HashSet <char > = [ 'e' , 'f' ] . iter( ) . cloned ( ) . collect( ) ;
473
- static ref SET_SYMM_DIFF_AB : HashSet <char > = [ 'c' , 'd' , 'e' , 'f' ] . iter( ) . cloned ( ) . collect( ) ;
474
- static ref SET_INTERSECTION_AB : HashSet <char > = [ 'a' , 'b' ] . iter( ) . cloned ( ) . collect( ) ;
469
+ static ref SET_A : HashSet <char > = [ 'a' , 'b' , 'c' , 'd' ] . iter( ) . copied ( ) . collect( ) ;
470
+ static ref SET_B : HashSet <char > = [ 'a' , 'b' , 'e' , 'f' ] . iter( ) . copied ( ) . collect( ) ;
471
+ static ref SET_DIFF_AB : HashSet <char > = [ 'c' , 'd' ] . iter( ) . copied ( ) . collect( ) ;
472
+ static ref SET_DIFF_BA : HashSet <char > = [ 'e' , 'f' ] . iter( ) . copied ( ) . collect( ) ;
473
+ static ref SET_SYMM_DIFF_AB : HashSet <char > = [ 'c' , 'd' , 'e' , 'f' ] . iter( ) . copied ( ) . collect( ) ;
474
+ static ref SET_INTERSECTION_AB : HashSet <char > = [ 'a' , 'b' ] . iter( ) . copied ( ) . collect( ) ;
475
475
static ref SET_UNION_AB : HashSet <char > =
476
- [ 'a' , 'b' , 'c' , 'd' , 'e' , 'f' ] . iter( ) . cloned ( ) . collect( ) ;
476
+ [ 'a' , 'b' , 'c' , 'd' , 'e' , 'f' ] . iter( ) . copied ( ) . collect( ) ;
477
477
}
478
478
479
479
#[ test]
480
480
fn set_seq_par_equivalence_difference ( ) {
481
- let diff_ab_seq = SET_A . difference ( & * SET_B ) . cloned ( ) . collect :: < HashSet < _ > > ( ) ;
481
+ let diff_ab_seq = SET_A . difference ( & * SET_B ) . copied ( ) . collect :: < HashSet < _ > > ( ) ;
482
482
let diff_ab_par = SET_A
483
483
. par_difference ( & * SET_B )
484
- . cloned ( )
484
+ . copied ( )
485
485
. collect :: < HashSet < _ > > ( ) ;
486
486
487
487
assert_eq3 ! ( diff_ab_seq, diff_ab_par, * SET_DIFF_AB ) ;
488
488
489
- let diff_ba_seq = SET_B . difference ( & * SET_A ) . cloned ( ) . collect :: < HashSet < _ > > ( ) ;
489
+ let diff_ba_seq = SET_B . difference ( & * SET_A ) . copied ( ) . collect :: < HashSet < _ > > ( ) ;
490
490
let diff_ba_par = SET_B
491
491
. par_difference ( & * SET_A )
492
- . cloned ( )
492
+ . copied ( )
493
493
. collect :: < HashSet < _ > > ( ) ;
494
494
495
495
assert_eq3 ! ( diff_ba_seq, diff_ba_par, * SET_DIFF_BA ) ;
@@ -499,22 +499,22 @@ fn set_seq_par_equivalence_difference() {
499
499
fn set_seq_par_equivalence_symmetric_difference ( ) {
500
500
let symm_diff_ab_seq = SET_A
501
501
. symmetric_difference ( & * SET_B )
502
- . cloned ( )
502
+ . copied ( )
503
503
. collect :: < HashSet < _ > > ( ) ;
504
504
let symm_diff_ab_par = SET_A
505
505
. par_symmetric_difference ( & * SET_B )
506
- . cloned ( )
506
+ . copied ( )
507
507
. collect :: < HashSet < _ > > ( ) ;
508
508
509
509
assert_eq3 ! ( symm_diff_ab_seq, symm_diff_ab_par, * SET_SYMM_DIFF_AB ) ;
510
510
}
511
511
512
512
#[ test]
513
513
fn set_seq_par_equivalence_intersection ( ) {
514
- let intersection_ab_seq = SET_A . intersection ( & * SET_B ) . cloned ( ) . collect :: < HashSet < _ > > ( ) ;
514
+ let intersection_ab_seq = SET_A . intersection ( & * SET_B ) . copied ( ) . collect :: < HashSet < _ > > ( ) ;
515
515
let intersection_ab_par = SET_A
516
516
. par_intersection ( & * SET_B )
517
- . cloned ( )
517
+ . copied ( )
518
518
. collect :: < HashSet < _ > > ( ) ;
519
519
520
520
assert_eq3 ! (
@@ -526,8 +526,8 @@ fn set_seq_par_equivalence_intersection() {
526
526
527
527
#[ test]
528
528
fn set_seq_par_equivalence_union ( ) {
529
- let union_ab_seq = SET_A . union ( & * SET_B ) . cloned ( ) . collect :: < HashSet < _ > > ( ) ;
530
- let union_ab_par = SET_A . par_union ( & * SET_B ) . cloned ( ) . collect :: < HashSet < _ > > ( ) ;
529
+ let union_ab_seq = SET_A . union ( & * SET_B ) . copied ( ) . collect :: < HashSet < _ > > ( ) ;
530
+ let union_ab_par = SET_A . par_union ( & * SET_B ) . copied ( ) . collect :: < HashSet < _ > > ( ) ;
531
531
532
532
assert_eq3 ! ( union_ab_seq, union_ab_par, * SET_UNION_AB ) ;
533
533
}
0 commit comments