@@ -397,23 +397,23 @@ mod test {
397
397
fn test_iterator ( ) {
398
398
let mut e1: EnumSet < Foo > = EnumSet :: new ( ) ;
399
399
400
- let elems: Vec < Foo > = e1. iter ( ) . collect ( ) ;
400
+ let elems: :: vec :: Vec < Foo > = e1. iter ( ) . collect ( ) ;
401
401
assert ! ( elems. is_empty( ) )
402
402
403
403
e1. insert ( A ) ;
404
- let elems = e1. iter ( ) . collect ( ) ;
404
+ let elems: :: vec :: Vec < _ > = e1. iter ( ) . collect ( ) ;
405
405
assert_eq ! ( vec![ A ] , elems)
406
406
407
407
e1. insert ( C ) ;
408
- let elems = e1. iter ( ) . collect ( ) ;
408
+ let elems: :: vec :: Vec < _ > = e1. iter ( ) . collect ( ) ;
409
409
assert_eq ! ( vec![ A , C ] , elems)
410
410
411
411
e1. insert ( C ) ;
412
- let elems = e1. iter ( ) . collect ( ) ;
412
+ let elems: :: vec :: Vec < _ > = e1. iter ( ) . collect ( ) ;
413
413
assert_eq ! ( vec![ A , C ] , elems)
414
414
415
415
e1. insert ( B ) ;
416
- let elems = e1. iter ( ) . collect ( ) ;
416
+ let elems: :: vec :: Vec < _ > = e1. iter ( ) . collect ( ) ;
417
417
assert_eq ! ( vec![ A , B , C ] , elems)
418
418
}
419
419
@@ -431,35 +431,35 @@ mod test {
431
431
e2. insert ( C ) ;
432
432
433
433
let e_union = e1 | e2;
434
- let elems = e_union. iter ( ) . collect ( ) ;
434
+ let elems: :: vec :: Vec < _ > = e_union. iter ( ) . collect ( ) ;
435
435
assert_eq ! ( vec![ A , B , C ] , elems)
436
436
437
437
let e_intersection = e1 & e2;
438
- let elems = e_intersection. iter ( ) . collect ( ) ;
438
+ let elems: :: vec :: Vec < _ > = e_intersection. iter ( ) . collect ( ) ;
439
439
assert_eq ! ( vec![ C ] , elems)
440
440
441
441
// Another way to express intersection
442
442
let e_intersection = e1 - ( e1 - e2) ;
443
- let elems = e_intersection. iter ( ) . collect ( ) ;
443
+ let elems: :: vec :: Vec < _ > = e_intersection. iter ( ) . collect ( ) ;
444
444
assert_eq ! ( vec![ C ] , elems)
445
445
446
446
let e_subtract = e1 - e2;
447
- let elems = e_subtract. iter ( ) . collect ( ) ;
447
+ let elems: :: vec :: Vec < _ > = e_subtract. iter ( ) . collect ( ) ;
448
448
assert_eq ! ( vec![ A ] , elems)
449
449
450
450
// Bitwise XOR of two sets, aka symmetric difference
451
451
let e_symmetric_diff = e1 ^ e2;
452
- let elems = e_symmetric_diff. iter ( ) . collect ( ) ;
452
+ let elems: :: vec :: Vec < _ > = e_symmetric_diff. iter ( ) . collect ( ) ;
453
453
assert_eq ! ( vec![ A , B ] , elems)
454
454
455
455
// Another way to express symmetric difference
456
456
let e_symmetric_diff = ( e1 - e2) | ( e2 - e1) ;
457
- let elems = e_symmetric_diff. iter ( ) . collect ( ) ;
457
+ let elems: :: vec :: Vec < _ > = e_symmetric_diff. iter ( ) . collect ( ) ;
458
458
assert_eq ! ( vec![ A , B ] , elems)
459
459
460
460
// Yet another way to express symmetric difference
461
461
let e_symmetric_diff = ( e1 | e2) - ( e1 & e2) ;
462
- let elems = e_symmetric_diff. iter ( ) . collect ( ) ;
462
+ let elems: :: vec :: Vec < _ > = e_symmetric_diff. iter ( ) . collect ( ) ;
463
463
assert_eq ! ( vec![ A , B ] , elems)
464
464
}
465
465
0 commit comments