-
-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathrandom_access.rs
More file actions
137 lines (124 loc) · 3.63 KB
/
random_access.rs
File metadata and controls
137 lines (124 loc) · 3.63 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
use criterion::{
BenchmarkGroup, BenchmarkId, Criterion, criterion_group, criterion_main, measurement::WallTime,
};
use orx_split_vec::*;
use rand::prelude::*;
use rand_chacha::ChaCha8Rng;
use std::hint::black_box;
fn get_indices(n: usize) -> Vec<usize> {
let mut rng = ChaCha8Rng::seed_from_u64(7541);
let mut vec = Vec::with_capacity(n);
for _ in 0..n {
vec.push(rng.random_range(0..n));
}
vec
}
fn get_value<const N: usize>(i: usize) -> [u64; N] {
let modulo = i % 3;
if modulo == 0 {
[i as u64; N]
} else if modulo == 1 {
[(i + 1) as u64; N]
} else {
[(i + 2) as u64; N]
}
}
fn add<const N: usize>(a: [u64; N], b: &[u64; N]) -> [u64; N] {
let mut sum = [0u64; N];
for i in 0..N {
sum[i] = a[i] + b[i];
}
sum
}
fn std_vec_with_capacity<T, F: Fn(usize) -> T>(n: usize, value: F) -> Vec<T> {
let mut vec = Vec::with_capacity(n);
for i in 0..n {
vec.push(value(i))
}
vec
}
fn split_vec_linear<T, F: Fn(usize) -> T>(
n: usize,
value: F,
constant_fragment_capacity_power: usize,
) -> SplitVec<T, Linear> {
let mut vec = SplitVec::with_linear_growth(constant_fragment_capacity_power);
for i in 0..n {
vec.push(value(i))
}
vec
}
fn split_vec_doubling<T, F: Fn(usize) -> T>(n: usize, value: F) -> SplitVec<T, Doubling> {
let mut vec = SplitVec::with_doubling_growth();
for i in 0..n {
vec.push(value(i))
}
vec
}
fn calc_std_vec<T: Default, F: Fn(T, &T) -> T>(add: F, vec: &[T], indices: &[usize]) -> T {
let mut sum = T::default();
for i in indices {
sum = add(sum, &vec[*i]);
}
sum
}
fn calc_split_vec<T: Default, F: Fn(T, &T) -> T, G: Growth>(
add: F,
vec: &SplitVec<T, G>,
indices: &[usize],
) -> T {
let mut sum = T::default();
for i in indices {
sum = add(sum, &vec[*i]);
}
sum
}
fn test_for_type<T: Default>(
group: &mut BenchmarkGroup<'_, WallTime>,
num_u64s: usize,
treatments: &[usize],
value: fn(usize) -> T,
add: fn(T, &T) -> T,
) {
for n in treatments {
let treatment = format!("n={},elem-type=[u64;{}]", n, num_u64s);
let indices = get_indices(*n);
group.bench_with_input(BenchmarkId::new("std_vec", &treatment), n, |b, _| {
let vec = std_vec_with_capacity(black_box(*n), value);
b.iter(|| calc_std_vec(add, &vec, &indices))
});
group.bench_with_input(
BenchmarkId::new("split_vec_linear - 2^10", &treatment),
n,
|b, _| {
let vec = split_vec_linear(black_box(*n), value, 10);
b.iter(|| calc_split_vec(add, &vec, &indices))
},
);
group.bench_with_input(
BenchmarkId::new("split_vec_doubling", &treatment),
n,
|b, _| {
let vec = split_vec_doubling(black_box(*n), value);
b.iter(|| calc_split_vec(add, &vec, &indices))
},
);
group.bench_with_input(
BenchmarkId::new("split_vec_recursive", &treatment),
n,
|b, _| {
let vec: SplitVec<_, Recursive> = split_vec_doubling(black_box(*n), value).into();
b.iter(|| calc_split_vec(add, &vec, &indices))
},
);
}
}
fn bench(c: &mut Criterion) {
let treatments = vec![1_024, 16_384, 262_144, 4_194_304];
let mut group = c.benchmark_group("random_access");
const N: usize = 16;
test_for_type::<[u64; N]>(&mut group, N, &treatments, get_value, add);
group.finish();
}
criterion_group!(benches, bench);
criterion_main!(benches);