@@ -872,7 +872,7 @@ mod tests {
872872 use std:: rand;
873873 use std:: rand:: Rng ;
874874
875- static bench_bits : uint = 1 << 14 ;
875+ static BENCH_BITS : uint = 1 << 14 ;
876876
877877 #[ test]
878878 fn test_to_str ( ) {
@@ -1452,19 +1452,19 @@ mod tests {
14521452 fn bench_big_bitv_big( b: & mut BenchHarness ) {
14531453 let mut r = rng( ) ;
14541454 let mut storage = ~[ ] ;
1455- storage. grow( bench_bits / uint:: bits, & 0 ) ;
1455+ storage. grow( BENCH_BITS / uint:: bits, & 0 ) ;
14561456 let mut bitv = BigBitv :: new( storage) ;
14571457 do b. iter {
1458- bitv. set( ( r. next( ) as uint) % bench_bits , true ) ;
1458+ bitv. set( ( r. next( ) as uint) % BENCH_BITS , true ) ;
14591459 }
14601460 }
14611461
14621462 #[ bench]
14631463 fn bench_bitv_big( b: & mut BenchHarness ) {
14641464 let mut r = rng( ) ;
1465- let mut bitv = Bitv :: new( bench_bits , false ) ;
1465+ let mut bitv = Bitv :: new( BENCH_BITS , false ) ;
14661466 do b. iter {
1467- bitv. set( ( r. next( ) as uint) % bench_bits , true ) ;
1467+ bitv. set( ( r. next( ) as uint) % BENCH_BITS , true ) ;
14681468 }
14691469 }
14701470
@@ -1491,14 +1491,14 @@ mod tests {
14911491 let mut r = rng( ) ;
14921492 let mut bitv = BitvSet :: new( ) ;
14931493 do b. iter {
1494- bitv. insert( ( r. next( ) as uint) % bench_bits ) ;
1494+ bitv. insert( ( r. next( ) as uint) % BENCH_BITS ) ;
14951495 }
14961496 }
14971497
14981498 #[ bench]
14991499 fn bench_bitv_big_union( b: & mut BenchHarness ) {
1500- let mut b1 = Bitv :: new( bench_bits , false ) ;
1501- let b2 = Bitv :: new( bench_bits , false ) ;
1500+ let mut b1 = Bitv :: new( BENCH_BITS , false ) ;
1501+ let b2 = Bitv :: new( BENCH_BITS , false ) ;
15021502 do b. iter {
15031503 b1. union ( & b2) ;
15041504 }
0 commit comments