@@ -49,7 +49,7 @@ fn test_facts(all_facts: &AllFacts, algorithms: &[Algorithm]) {
49
49
for ( naive_point, naive_origins) in & naive. subset_errors {
50
50
// Potential location-insensitive errors don't have a meaningful location, and use 0
51
51
// as a default when debugging.
52
- match insensitive. subset_errors . get ( & 0 . into ( ) ) {
52
+ match insensitive. subset_errors . get ( & 0u32 . into ( ) ) {
53
53
Some ( insensitive_origins) => {
54
54
for & ( origin1, origin2) in naive_origins {
55
55
if !insensitive_origins. contains ( & ( origin1, origin2) ) {
@@ -152,8 +152,8 @@ fn test_insensitive_errors() -> Result<(), Box<dyn Error>> {
152
152
let insensitive = Output :: compute ( & all_facts, Algorithm :: LocationInsensitive , false ) ;
153
153
154
154
let mut expected = FxHashMap :: default ( ) ;
155
- expected. insert ( Point :: from ( 24 ) , vec ! [ Loan :: from( 1 ) ] ) ;
156
- expected. insert ( Point :: from ( 50 ) , vec ! [ Loan :: from( 2 ) ] ) ;
155
+ expected. insert ( Point :: from ( 24u32 ) , vec ! [ Loan :: from( 1u32 ) ] ) ;
156
+ expected. insert ( Point :: from ( 50u32 ) , vec ! [ Loan :: from( 2u32 ) ] ) ;
157
157
158
158
assert_equal ( & insensitive. errors , & expected) ;
159
159
Ok ( ( ) )
@@ -441,7 +441,7 @@ fn var_live_in_successor_propagates_to_predecessor() {
441
441
assert_eq ! ( variables. len( ) , 1 ) ;
442
442
}
443
443
444
- assert ! ( !liveness. get( & 0 . into( ) ) . unwrap( ) . is_empty( ) ) ;
444
+ assert ! ( !liveness. get( & 0u32 . into( ) ) . unwrap( ) . is_empty( ) ) ;
445
445
}
446
446
447
447
#[ test]
@@ -475,7 +475,7 @@ fn var_live_in_successor_killed_by_reassignment() {
475
475
let liveness = result. var_live_on_entry ;
476
476
println ! ( "CFG: {:#?}" , facts. cfg_edge) ;
477
477
478
- let first_defined: Point = 3 . into ( ) ; // Mid(B1[0])
478
+ let first_defined: Point = 3u32 . into ( ) ; // Mid(B1[0])
479
479
480
480
for ( & point, variables) in liveness. iter ( ) {
481
481
println ! (
@@ -486,10 +486,10 @@ fn var_live_in_successor_killed_by_reassignment() {
486
486
) ;
487
487
}
488
488
489
- let live_at_start = liveness. get ( & 0 . into ( ) ) ;
489
+ let live_at_start = liveness. get ( & 0u32 . into ( ) ) ;
490
490
491
491
assert_eq ! (
492
- liveness. get( & 0 . into( ) ) ,
492
+ liveness. get( & 0u32 . into( ) ) ,
493
493
None ,
494
494
"{:?} were live at start!" ,
495
495
live_at_start. and_then( |var| Some ( tables. variables. untern_vec( var) ) ) ,
@@ -535,7 +535,7 @@ fn var_drop_used_simple() {
535
535
println ! ( "result: {:#?}" , result) ;
536
536
let liveness = result. var_drop_live_on_entry ;
537
537
println ! ( "CFG: {:#?}" , facts. cfg_edge) ;
538
- let first_defined: Point = 3 . into ( ) ; // Mid(B1[0])
538
+ let first_defined: Point = 3u32 . into ( ) ; // Mid(B1[0])
539
539
540
540
for ( & point, variables) in liveness. iter ( ) {
541
541
println ! (
@@ -546,10 +546,10 @@ fn var_drop_used_simple() {
546
546
) ;
547
547
}
548
548
549
- let live_at_start = liveness. get ( & 0 . into ( ) ) ;
549
+ let live_at_start = liveness. get ( & 0u32 . into ( ) ) ;
550
550
551
551
assert_eq ! (
552
- liveness. get( & 0 . into( ) ) ,
552
+ liveness. get( & 0u32 . into( ) ) ,
553
553
None ,
554
554
"{:?} were live at start!" ,
555
555
live_at_start. and_then( |var| Some ( tables. variables. untern_vec( var) ) ) ,
@@ -752,10 +752,10 @@ fn errors_in_subset_relations_dataset() {
752
752
753
753
let expected_subset_error = {
754
754
// in this dataset, `'a` is interned as `'1`
755
- let origin_a = Origin :: from ( 1 ) ;
755
+ let origin_a = Origin :: from ( 1u32 ) ;
756
756
757
757
// `'b` is interned as `'2`
758
- let origin_b = Origin :: from ( 2 ) ;
758
+ let origin_b = Origin :: from ( 2u32 ) ;
759
759
760
760
// and `'b` should flow into `'a`
761
761
( origin_b, origin_a)
0 commit comments