@@ -171,7 +171,7 @@ pub fn table_name<T: BenchTable>(style: IndexStrategy) -> TableName {
171171#[ derive( Clone ) ]
172172pub struct XorShiftLite ( pub u64 ) ;
173173impl XorShiftLite {
174- fn gen ( & mut self ) -> u64 {
174+ fn r# gen( & mut self ) -> u64 {
175175 let old = self . 0 ;
176176 self . 0 ^= self . 0 << 13 ;
177177 self . 0 ^= self . 0 >> 7 ;
@@ -189,36 +189,36 @@ pub trait RandomTable {
189189 /// Then in the filter benchmarks, `mean_result_count = table_size / buckets`.
190190 ///
191191 /// Currently the same number of buckets is used for all attributes.
192- fn gen ( id : u32 , rng : & mut XorShiftLite , buckets : u64 ) -> Self ;
192+ fn r# gen( id : u32 , rng : & mut XorShiftLite , buckets : u64 ) -> Self ;
193193}
194194
195195impl RandomTable for u32_u64_str {
196- fn gen ( id : u32 , rng : & mut XorShiftLite , buckets : u64 ) -> Self {
197- let name = nth_name ( rng. gen ( ) % buckets) . into ( ) ;
198- let age = rng. gen ( ) % buckets;
196+ fn r# gen( id : u32 , rng : & mut XorShiftLite , buckets : u64 ) -> Self {
197+ let name = nth_name ( rng. r# gen( ) % buckets) . into ( ) ;
198+ let age = rng. r# gen( ) % buckets;
199199 u32_u64_str { id, name, age }
200200 }
201201}
202202
203203impl RandomTable for u32_u64_u64 {
204- fn gen ( id : u32 , rng : & mut XorShiftLite , buckets : u64 ) -> Self {
205- let x = rng. gen ( ) % buckets;
206- let y = rng. gen ( ) % buckets;
204+ fn r# gen( id : u32 , rng : & mut XorShiftLite , buckets : u64 ) -> Self {
205+ let x = rng. r# gen( ) % buckets;
206+ let y = rng. r# gen( ) % buckets;
207207 u32_u64_u64 { id, x, y }
208208 }
209209}
210210
211211impl RandomTable for u64_u64_u32 {
212- fn gen ( id : u32 , rng : & mut XorShiftLite , buckets : u64 ) -> Self {
213- let x = rng. gen ( ) % buckets;
214- let y = rng. gen ( ) % buckets;
212+ fn r# gen( id : u32 , rng : & mut XorShiftLite , buckets : u64 ) -> Self {
213+ let x = rng. r# gen( ) % buckets;
214+ let y = rng. r# gen( ) % buckets;
215215 u64_u64_u32 { x, y, id }
216216 }
217217}
218218
219219pub fn create_sequential < T : RandomTable > ( seed : u64 , count : u32 , buckets : u64 ) -> Vec < T > {
220220 let mut rng = XorShiftLite ( seed) ;
221- ( 0 ..count) . map ( |id| T :: gen ( id, & mut rng, buckets) ) . collect ( )
221+ ( 0 ..count) . map ( |id| T :: r# gen( id, & mut rng, buckets) ) . collect ( )
222222}
223223
224224/// Create a table whose first `identical` rows are identical except for their `id` column.
@@ -237,13 +237,13 @@ pub fn create_partly_identical<T: RandomTable>(seed: u64, identical: u64, total:
237237 for _ in 0 ..identical {
238238 // clone to preserve rng state
239239 let mut rng_ = rng. clone ( ) ;
240- result. push ( T :: gen ( id as u32 , & mut rng_, buckets) ) ;
240+ result. push ( T :: r# gen( id as u32 , & mut rng_, buckets) ) ;
241241 id += 1 ;
242242 }
243243 // advance rng
244- drop ( T :: gen ( id as u32 , & mut rng, buckets) ) ;
244+ drop ( T :: r# gen( id as u32 , & mut rng, buckets) ) ;
245245 for _ in identical..total {
246- result. push ( T :: gen ( id as u32 , & mut rng, buckets) ) ;
246+ result. push ( T :: r# gen( id as u32 , & mut rng, buckets) ) ;
247247 id += 1 ;
248248 }
249249 result
@@ -254,8 +254,8 @@ pub fn create_random<T: RandomTable>(seed: u64, count: u32, buckets: u64) -> Vec
254254 let mut rng = XorShiftLite ( seed) ;
255255 ( 0 ..count)
256256 . map ( |_| {
257- let id = ( rng. gen ( ) % ( u32:: MAX as u64 ) ) as u32 ;
258- T :: gen ( id, & mut rng, buckets)
257+ let id = ( rng. r# gen( ) % ( u32:: MAX as u64 ) ) as u32 ;
258+ T :: r# gen( id, & mut rng, buckets)
259259 } )
260260 . collect ( )
261261}
@@ -362,7 +362,7 @@ mod tests {
362362 }
363363 // sample some earlier names to make sure we haven't overlapped
364364 for _ in 0 ..30 {
365- let prev = rng. gen ( ) % n;
365+ let prev = rng. r# gen( ) % n;
366366 assert ! (
367367 name != nth_name( prev) ,
368368 "names should not repeat, but {}->{} and {}->{}" ,
0 commit comments