11use criterion:: { criterion_group, criterion_main, BenchmarkId , Criterion , Throughput } ;
2- use rand:: { distributions :: Uniform , Rng } ;
2+ use rand:: { distr :: Uniform , Rng } ;
33use raphtory:: core:: entities:: nodes:: structure:: adjset:: AdjSet ;
44use sorted_vector_map:: SortedVectorSet ;
55use std:: collections:: BTreeSet ;
@@ -10,7 +10,7 @@ fn btree_set_u64(c: &mut Criterion) {
1010 group. throughput ( Throughput :: Elements ( * size as u64 ) ) ;
1111
1212 let mut rng = rand:: rng ( ) ;
13- let range = Uniform :: new ( u64:: MIN , u64:: MAX ) ;
13+ let range = Uniform :: new ( u64:: MIN , u64:: MAX ) . unwrap ( ) ;
1414 let init_vals: Vec < u64 > = ( & mut rng) . sample_iter ( & range) . take ( * size) . collect ( ) ;
1515
1616 group. bench_with_input (
@@ -50,7 +50,8 @@ fn bm_tadjset(c: &mut Criterion) {
5050 group. throughput ( Throughput :: Elements ( * size as u64 ) ) ;
5151
5252 let mut rng = rand:: rng ( ) ;
53- let range = Uniform :: new ( 0 , size * 10 ) ;
53+ let range = Uniform :: new ( 0 , size * 10 ) . unwrap ( ) ;
54+
5455 let init_srcs: Vec < usize > = ( & mut rng)
5556 . sample_iter ( & range)
5657 . take ( * size as usize )
@@ -59,7 +60,7 @@ fn bm_tadjset(c: &mut Criterion) {
5960 . sample_iter ( & range)
6061 . take ( * size as usize )
6162 . collect ( ) ;
62- let t_range = Uniform :: new ( 1646838523i64 , 1678374523 ) ;
63+ let t_range = Uniform :: new ( 1646838523i64 , 1678374523 ) . unwrap ( ) ;
6364 let init_time: Vec < i64 > = ( & mut rng)
6465 . sample_iter ( & t_range)
6566 . take ( * size as usize )
0 commit comments