99
99
//! let between = Range::new(-1f64, 1.);
100
100
//! let mut rng = rand::thread_rng();
101
101
//!
102
- //! let total = 1_000_000u ;
103
- //! let mut in_circle = 0u ;
102
+ //! let total = 1_000_000 ;
103
+ //! let mut in_circle = 0 ;
104
104
//!
105
- //! for _ in range(0u , total) {
105
+ //! for _ in range(0 , total) {
106
106
//! let a = between.ind_sample(&mut rng);
107
107
//! let b = between.ind_sample(&mut rng);
108
108
//! if a*a + b*b <= 1. {
176
176
//! }
177
177
//!
178
178
//! fn free_doors(blocked: &[uint]) -> Vec<uint> {
179
- //! range(0u , 3).filter(|x| !blocked.contains(x)).collect()
179
+ //! range(0 , 3).filter(|x| !blocked.contains(x)).collect()
180
180
//! }
181
181
//!
182
182
//! fn main() {
183
183
//! // The estimation will be more accurate with more simulations
184
- //! let num_simulations = 10000u ;
184
+ //! let num_simulations = 10000 ;
185
185
//!
186
186
//! let mut rng = rand::thread_rng();
187
- //! let random_door = Range::new(0u , 3);
187
+ //! let random_door = Range::new(0 , 3);
188
188
//!
189
- //! let (mut switch_wins, mut switch_losses) = (0u, 0u );
190
- //! let (mut keep_wins, mut keep_losses) = (0u, 0u );
189
+ //! let (mut switch_wins, mut switch_losses) = (0, 0 );
190
+ //! let (mut keep_wins, mut keep_losses) = (0, 0 );
191
191
//!
192
192
//! println!("Running {} simulations...", num_simulations);
193
193
//! for _ in range(0, num_simulations) {
@@ -279,14 +279,14 @@ impl Rng for StdRng {
279
279
}
280
280
}
281
281
282
- impl < ' a > SeedableRng < & ' a [ uint ] > for StdRng {
283
- fn reseed ( & mut self , seed : & ' a [ uint ] ) {
282
+ impl < ' a > SeedableRng < & ' a [ usize ] > for StdRng {
283
+ fn reseed ( & mut self , seed : & ' a [ usize ] ) {
284
284
// the internal RNG can just be seeded from the above
285
285
// randomness.
286
286
self . rng . reseed ( unsafe { mem:: transmute ( seed) } )
287
287
}
288
288
289
- fn from_seed ( seed : & ' a [ uint ] ) -> StdRng {
289
+ fn from_seed ( seed : & ' a [ usize ] ) -> StdRng {
290
290
StdRng { rng : SeedableRng :: from_seed ( unsafe { mem:: transmute ( seed) } ) }
291
291
}
292
292
}
@@ -318,7 +318,7 @@ impl reseeding::Reseeder<StdRng> for ThreadRngReseeder {
318
318
}
319
319
}
320
320
}
321
- static THREAD_RNG_RESEED_THRESHOLD : uint = 32_768 ;
321
+ static THREAD_RNG_RESEED_THRESHOLD : usize = 32_768 ;
322
322
type ThreadRngInner = reseeding:: ReseedingRng < StdRng , ThreadRngReseeder > ;
323
323
324
324
/// The thread-local RNG.
@@ -384,7 +384,7 @@ impl Rng for ThreadRng {
384
384
/// use std::rand;
385
385
///
386
386
/// let x = rand::random();
387
- /// println!("{}", 2u * x);
387
+ /// println!("{}", 2u8 * x);
388
388
///
389
389
/// let y = rand::random::<f64>();
390
390
/// println!("{}", y);
@@ -432,7 +432,7 @@ pub fn random<T: Rand>() -> T {
432
432
/// ```
433
433
pub fn sample < T , I : Iterator < Item =T > , R : Rng > ( rng : & mut R ,
434
434
mut iter : I ,
435
- amount : uint ) -> Vec < T > {
435
+ amount : usize ) -> Vec < T > {
436
436
let mut reservoir: Vec < T > = iter. by_ref ( ) . take ( amount) . collect ( ) ;
437
437
for ( i, elem) in iter. enumerate ( ) {
438
438
let k = rng. gen_range ( 0 , i + 1 + amount) ;
@@ -480,18 +480,18 @@ mod test {
480
480
#[ test]
481
481
fn test_gen_range ( ) {
482
482
let mut r = thread_rng ( ) ;
483
- for _ in range ( 0 u , 1000 ) {
483
+ for _ in range ( 0 , 1000 ) {
484
484
let a = r. gen_range ( -3 i, 42 ) ;
485
485
assert ! ( a >= -3 && a < 42 ) ;
486
486
assert_eq ! ( r. gen_range( 0 i, 1 ) , 0 ) ;
487
487
assert_eq ! ( r. gen_range( -12 i, -11 ) , -12 ) ;
488
488
}
489
489
490
- for _ in range ( 0 u , 1000 ) {
490
+ for _ in range ( 0 , 1000 ) {
491
491
let a = r. gen_range ( 10 i, 42 ) ;
492
492
assert ! ( a >= 10 && a < 42 ) ;
493
493
assert_eq ! ( r. gen_range( 0 i, 1 ) , 0 ) ;
494
- assert_eq ! ( r. gen_range( 3_000_000 u , 3_000_001 ) , 3_000_000 ) ;
494
+ assert_eq ! ( r. gen_range( 3_000_000 , 3_000_001 ) , 3_000_000 ) ;
495
495
}
496
496
497
497
}
@@ -507,7 +507,7 @@ mod test {
507
507
#[ should_fail]
508
508
fn test_gen_range_panic_uint ( ) {
509
509
let mut r = thread_rng ( ) ;
510
- r. gen_range ( 5 u , 2 u ) ;
510
+ r. gen_range ( 5 us , 2 us ) ;
511
511
}
512
512
513
513
#[ test]
@@ -521,24 +521,24 @@ mod test {
521
521
#[ test]
522
522
fn test_gen_weighted_bool ( ) {
523
523
let mut r = thread_rng ( ) ;
524
- assert_eq ! ( r. gen_weighted_bool( 0 u ) , true ) ;
525
- assert_eq ! ( r. gen_weighted_bool( 1 u ) , true ) ;
524
+ assert_eq ! ( r. gen_weighted_bool( 0 ) , true ) ;
525
+ assert_eq ! ( r. gen_weighted_bool( 1 ) , true ) ;
526
526
}
527
527
528
528
#[ test]
529
529
fn test_gen_ascii_str ( ) {
530
530
let mut r = thread_rng ( ) ;
531
- assert_eq ! ( r. gen_ascii_chars( ) . take( 0 ) . count( ) , 0 u ) ;
532
- assert_eq ! ( r. gen_ascii_chars( ) . take( 10 ) . count( ) , 10 u ) ;
533
- assert_eq ! ( r. gen_ascii_chars( ) . take( 16 ) . count( ) , 16 u ) ;
531
+ assert_eq ! ( r. gen_ascii_chars( ) . take( 0 ) . count( ) , 0 ) ;
532
+ assert_eq ! ( r. gen_ascii_chars( ) . take( 10 ) . count( ) , 10 ) ;
533
+ assert_eq ! ( r. gen_ascii_chars( ) . take( 16 ) . count( ) , 16 ) ;
534
534
}
535
535
536
536
#[ test]
537
537
fn test_gen_vec ( ) {
538
538
let mut r = thread_rng ( ) ;
539
- assert_eq ! ( r. gen_iter:: <u8 >( ) . take( 0 ) . count( ) , 0 u ) ;
540
- assert_eq ! ( r. gen_iter:: <u8 >( ) . take( 10 ) . count( ) , 10 u ) ;
541
- assert_eq ! ( r. gen_iter:: <f64 >( ) . take( 16 ) . count( ) , 16 u ) ;
539
+ assert_eq ! ( r. gen_iter:: <u8 >( ) . take( 0 ) . count( ) , 0 ) ;
540
+ assert_eq ! ( r. gen_iter:: <u8 >( ) . take( 10 ) . count( ) , 10 ) ;
541
+ assert_eq ! ( r. gen_iter:: <f64 >( ) . take( 16 ) . count( ) , 16 ) ;
542
542
}
543
543
544
544
#[ test]
@@ -578,7 +578,7 @@ mod test {
578
578
r. shuffle ( & mut v) ;
579
579
let b: & [ _ ] = & [ 1 , 1 , 1 ] ;
580
580
assert_eq ! ( v, b) ;
581
- assert_eq ! ( r. gen_range( 0 u , 1 u ) , 0 u ) ;
581
+ assert_eq ! ( r. gen_range( 0 , 1 ) , 0 ) ;
582
582
}
583
583
584
584
#[ test]
0 commit comments