orx-split-vec 3.23.0

An efficient dynamic capacity vector with pinned element guarantees.
Documentation 
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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160

use criterion::{
    BenchmarkGroup, BenchmarkId, Criterion, criterion_group, criterion_main, measurement::WallTime,
};
use orx_split_vec::*;
use std::hint::black_box;

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]) -> T {
    let mut sum = T::default();
    for x in vec {
        sum = add(sum, x);
    }
    sum
}
fn calc_split_vec<T: Default, F: Fn(T, &T) -> T, G: Growth>(add: F, vec: &SplitVec<T, G>) -> T {
    let mut sum = T::default();
    for x in vec.iter() {
        sum = add(sum, x);
    }
    sum
}
fn calc_split_vec_iter_mut<T: Default, F: Fn(T, &T) -> T, G: Growth>(
    add: F,
    vec: &mut SplitVec<T, G>,
) -> T {
    let mut sum = T::default();
    for x in vec.iter_mut() {
        sum = add(sum, x);
    }
    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);

        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))
        });

        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))
            },
        );

        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))
            },
        );

        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))
            },
        );

        group.bench_with_input(
            BenchmarkId::new("split_vec_linear - 2^10 - iter_mut", &treatment),
            n,
            |b, _| {
                let mut vec = split_vec_linear(black_box(*n), value, 10);
                b.iter(|| calc_split_vec_iter_mut(add, &mut vec))
            },
        );

        group.bench_with_input(
            BenchmarkId::new("split_vec_doubling - iter_mut", &treatment),
            n,
            |b, _| {
                let mut vec = split_vec_doubling(black_box(*n), value);
                b.iter(|| calc_split_vec_iter_mut(add, &mut vec))
            },
        );

        group.bench_with_input(
            BenchmarkId::new("split_vec_recursive - iter_mut", &treatment),
            n,
            |b, _| {
                let mut vec: SplitVec<_, Recursive> =
                    split_vec_doubling(black_box(*n), value).into();
                b.iter(|| calc_split_vec_iter_mut(add, &mut vec))
            },
        );
    }
}

fn bench(c: &mut Criterion) {
    let treatments = vec![1_024, 16_384, 262_144, 4_194_304];

    let mut group = c.benchmark_group("serial_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);