|
| 1 | +use criterion::{ |
| 2 | + BenchmarkGroup, BenchmarkId, Criterion, criterion_group, criterion_main, measurement::WallTime, |
| 3 | +}; |
| 4 | +use orx_split_vec::{Doubling, Linear, Recursive, SplitVec}; |
| 5 | +use std::hint::black_box; |
| 6 | + |
| 7 | +fn get_value<const N: usize>(i: usize) -> [u64; N] { |
| 8 | + let modulo = i % 3; |
| 9 | + if modulo == 0 { |
| 10 | + [i as u64; N] |
| 11 | + } else if modulo == 1 { |
| 12 | + [(i + 1) as u64; N] |
| 13 | + } else { |
| 14 | + [(i + 2) as u64; N] |
| 15 | + } |
| 16 | +} |
| 17 | + |
| 18 | +fn doubling_from_std_vec<T: Clone, F: Fn(usize) -> T>(n: usize, value: F) -> SplitVec<T, Doubling> { |
| 19 | + let mut std_vec = Vec::new(); |
| 20 | + for i in 0..n { |
| 21 | + std_vec.push(value(i)); |
| 22 | + } |
| 23 | + SplitVec::from(std_vec) |
| 24 | +} |
| 25 | + |
| 26 | +fn linear_from_std_vec<T, F: Fn(usize) -> T>(n: usize, value: F) -> SplitVec<T, Linear> { |
| 27 | + let mut std_vec = Vec::new(); |
| 28 | + for i in 0..n { |
| 29 | + std_vec.push(value(i)); |
| 30 | + } |
| 31 | + SplitVec::from(std_vec) |
| 32 | +} |
| 33 | + |
| 34 | +fn recursive_from_std_vec<T: Clone, F: Fn(usize) -> T>( |
| 35 | + n: usize, |
| 36 | + value: F, |
| 37 | +) -> SplitVec<T, Recursive> { |
| 38 | + let mut std_vec = Vec::new(); |
| 39 | + for i in 0..n { |
| 40 | + std_vec.push(value(i)); |
| 41 | + } |
| 42 | + SplitVec::from(std_vec) |
| 43 | +} |
| 44 | + |
| 45 | +fn test_for_type<T: Clone>( |
| 46 | + group: &mut BenchmarkGroup<'_, WallTime>, |
| 47 | + num_u64s: usize, |
| 48 | + treatments: &[usize], |
| 49 | + value: fn(usize) -> T, |
| 50 | +) { |
| 51 | + for n in treatments { |
| 52 | + let treatment = format!("n={},elem-type=[u64;{}]", n, num_u64s); |
| 53 | + |
| 54 | + group.bench_with_input( |
| 55 | + BenchmarkId::new("doubling_from_std_vec", &treatment), |
| 56 | + n, |
| 57 | + |b, _| b.iter(|| doubling_from_std_vec(black_box(*n), value)), |
| 58 | + ); |
| 59 | + |
| 60 | + group.bench_with_input( |
| 61 | + BenchmarkId::new("linear_from_std_vec", &treatment), |
| 62 | + n, |
| 63 | + |b, _| b.iter(|| linear_from_std_vec(black_box(*n), value)), |
| 64 | + ); |
| 65 | + group.bench_with_input( |
| 66 | + BenchmarkId::new("recursive_from_std_vec", &treatment), |
| 67 | + n, |
| 68 | + |b, _| b.iter(|| recursive_from_std_vec(black_box(*n), value)), |
| 69 | + ); |
| 70 | + } |
| 71 | +} |
| 72 | + |
| 73 | +fn bench_from(c: &mut Criterion) { |
| 74 | + let treatments = vec![1_024, 16_384, 262_144, 4_194_304]; |
| 75 | + |
| 76 | + let mut group = c.benchmark_group("from"); |
| 77 | + |
| 78 | + const N: usize = 16; |
| 79 | + |
| 80 | + test_for_type(&mut group, N, &treatments, get_value::<N>); |
| 81 | + |
| 82 | + group.finish(); |
| 83 | +} |
| 84 | + |
| 85 | +criterion_group!(benches, bench_from); |
| 86 | +criterion_main!(benches); |
0 commit comments