alloc: Apply keyword_idents_2024

Author: ehuss

library/alloc/benches/btree/map.rs

@@ -15,13 +15,13 @@ macro_rules! map_insert_rand_bench {
             let mut rng = crate::bench_rng();
 
             for _ in 0..n {
-                let i = rng.gen::<usize>() % n;
+                let i = rng.r#gen::<usize>() % n;
                 map.insert(i, i);
             }
 
             // measure
             b.iter(|| {
-                let k = rng.gen::<usize>() % n;
+                let k = rng.r#gen::<usize>() % n;
                 map.insert(k, k);
                 map.remove(&k);
             });
@@ -63,7 +63,7 @@ macro_rules! map_from_iter_rand_bench {
             let mut vec = Vec::with_capacity(n);
 
             for _ in 0..n {
-                let i = rng.gen::<usize>() % n;
+                let i = rng.r#gen::<usize>() % n;
                 vec.push((i, i));
             }
 
@@ -106,7 +106,7 @@ macro_rules! map_find_rand_bench {
 
             // setup
             let mut rng = crate::bench_rng();
-            let mut keys: Vec<_> = (0..n).map(|_| rng.gen::<usize>() % n).collect();
+            let mut keys: Vec<_> = (0..n).map(|_| rng.r#gen::<usize>() % n).collect();
 
             for &k in &keys {
                 map.insert(k, k);
@@ -171,7 +171,7 @@ fn bench_iteration(b: &mut Bencher, size: i32) {
     let mut rng = crate::bench_rng();
 
     for _ in 0..size {
-        map.insert(rng.gen(), rng.gen());
+        map.insert(rng.r#gen(), rng.r#gen());
     }
 
     b.iter(|| {
@@ -201,7 +201,7 @@ fn bench_iteration_mut(b: &mut Bencher, size: i32) {
     let mut rng = crate::bench_rng();
 
     for _ in 0..size {
-        map.insert(rng.gen(), rng.gen());
+        map.insert(rng.r#gen(), rng.r#gen());
     }
 
     b.iter(|| {

library/alloc/benches/btree/set.rs

@@ -7,7 +7,7 @@ fn random(n: usize) -> BTreeSet<usize> {
     let mut rng = crate::bench_rng();
     let mut set = BTreeSet::new();
     while set.len() < n {
-        set.insert(rng.gen());
+        set.insert(rng.r#gen());
     }
     assert_eq!(set.len(), n);
     set

library/alloc/benches/slice.rs

@@ -156,7 +156,7 @@ fn random_inserts(b: &mut Bencher) {
         let mut v = vec![(0, 0); 30];
         for _ in 0..100 {
             let l = v.len();
-            v.insert(rng.gen::<usize>() % (l + 1), (1, 1));
+            v.insert(rng.r#gen::<usize>() % (l + 1), (1, 1));
         }
     })
 }
@@ -168,7 +168,7 @@ fn random_removes(b: &mut Bencher) {
         let mut v = vec![(0, 0); 130];
         for _ in 0..100 {
             let l = v.len();
-            v.remove(rng.gen::<usize>() % l);
+            v.remove(rng.r#gen::<usize>() % l);
         }
     })
 }
@@ -195,8 +195,8 @@ fn gen_mostly_ascending(len: usize) -> Vec<u64> {
     let mut rng = crate::bench_rng();
     let mut v = gen_ascending(len);
     for _ in (0usize..).take_while(|x| x * x <= len) {
-        let x = rng.gen::<usize>() % len;
-        let y = rng.gen::<usize>() % len;
+        let x = rng.r#gen::<usize>() % len;
+        let y = rng.r#gen::<usize>() % len;
         v.swap(x, y);
     }
     v
@@ -206,8 +206,8 @@ fn gen_mostly_descending(len: usize) -> Vec<u64> {
     let mut rng = crate::bench_rng();
     let mut v = gen_descending(len);
     for _ in (0usize..).take_while(|x| x * x <= len) {
-        let x = rng.gen::<usize>() % len;
-        let y = rng.gen::<usize>() % len;
+        let x = rng.r#gen::<usize>() % len;
+        let y = rng.r#gen::<usize>() % len;
         v.swap(x, y);
     }
     v
@@ -217,7 +217,7 @@ fn gen_strings(len: usize) -> Vec<String> {
     let mut rng = crate::bench_rng();
     let mut v = vec![];
     for _ in 0..len {
-        let n = rng.gen::<usize>() % 20 + 1;
+        let n = rng.r#gen::<usize>() % 20 + 1;
         v.push(Alphanumeric.sample_string(&mut rng, n));
     }
     v

library/alloc/tests/sort/patterns.rs

@@ -207,5 +207,5 @@ fn rand_root_seed() -> u64 {
 
 fn random_vec(len: usize) -> Vec<i32> {
     let mut rng: XorShiftRng = rand::SeedableRng::seed_from_u64(get_or_init_rand_seed());
-    (0..len).map(|_| rng.gen::<i32>()).collect()
+    (0..len).map(|_| rng.r#gen::<i32>()).collect()
 }

library/alloc/tests/sort/zipf.rs

@@ -80,7 +80,7 @@ impl ZipfDistribution {
 
         loop {
             use std::cmp;
-            let u: f64 = hnum + rng.gen::<f64>() * (self.h_integral_x1 - hnum);
+            let u: f64 = hnum + rng.r#gen::<f64>() * (self.h_integral_x1 - hnum);
             // u is uniformly distributed in (h_integral_x1, h_integral_num_elements]
 
             let x: f64 = ZipfDistribution::h_integral_inv(u, self.exponent);