dynamization 0.4.0

Fast insertion for static containers.
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
161
162
163
164
165
166
167
168
169
170

use criterion::{
    criterion_group, criterion_main, Criterion, BenchmarkId, BatchSize
};


pub fn insertion(c: &mut Criterion) {
    use rand::{ Rng, SeedableRng };

    let mut rng = rand::rngs::StdRng::seed_from_u64(42);

    let mut group = c.benchmark_group("insertion");

    for size in &[10, 100, 1_000, 10_000, 100_000, 1_000_000] {
        let size = *size;

        let mut vec = Vec::<i32>::new();
        
        for _ in 0..size {
            vec.push(rng.gen());
        }
       
        group.bench_with_input(BenchmarkId::new("bin_heap", size), &vec, |b, v| {
            b.iter(|| {
                use std::collections::BinaryHeap;

                let mut bin_heap = BinaryHeap::<i32>::new();

                for x in v {
                    bin_heap.push(*x);
                }
            });
        });

        
        group.bench_with_input(BenchmarkId::new("svqueue", size), &vec, |b, v| {
            b.iter(|| {
                use dynamization::sorted_vec::SVQueue;

                let mut q = SVQueue::<i32>::new();

                for x in v {
                    q.push(*x);
                }
            });
        });
        

        group.bench_with_input(BenchmarkId::new("svqueue_simple", size), &vec, |b, v| {
            b.iter(|| {
                use dynamization::sorted_vec::SVQueue;
                use dynamization::strategy::SimpleBinary;

                let mut q = SVQueue::<i32>::with_strategy::<SimpleBinary>();

                for x in v {
                    q.push(*x);
                }
            });
        });
        
        group.bench_with_input(BenchmarkId::new("svqueue_skew", size), &vec, |b, v| {
            b.iter(|| {
                use dynamization::sorted_vec::SVQueue;
                use dynamization::strategy::SkewBinary;

                let mut q = SVQueue::<i32>::with_strategy::<SkewBinary>();

                for x in v {
                    q.push(*x);
                }
            });
        });
    }

    group.finish();
}


pub fn deletion(c: &mut Criterion) {
    use rand::{ Rng, SeedableRng };

    let mut rng = rand::rngs::StdRng::seed_from_u64(42);

    let mut group = c.benchmark_group("deletion");

    for size in &[10, 100, 1_000, 10_000, 100_000, 1_000_000] {
        let size = *size;

        let mut vec = Vec::<i32>::new();
        
        for _ in 0..size {
            vec.push(rng.gen());
        }
       
        group.bench_with_input(BenchmarkId::new("bin_heap", size), &vec, |b, v| {
            b.iter_batched(|| {
                use std::collections::BinaryHeap;

                let mut bin_heap = BinaryHeap::<i32>::new();

                for x in v {
                    bin_heap.push(*x);
                }

                bin_heap
            }, |mut bin_heap| {
                while let Some(_) = bin_heap.pop() {}
            }, BatchSize::SmallInput);
        });

        
        group.bench_with_input(BenchmarkId::new("svqueue", size), &vec, |b, v| {
            b.iter_batched(|| {
                use dynamization::sorted_vec::SVQueue;

                let mut q = SVQueue::<i32>::new();

                for x in v {
                    q.push(*x);
                }
                
                q
            }, |mut q| {
                while let Some(_) = q.pop() {}
            }, BatchSize::SmallInput);
        });
        

        group.bench_with_input(BenchmarkId::new("svqueue_simple", size), &vec, |b, v| {
            b.iter_batched(|| {
                use dynamization::sorted_vec::SVQueue;
                use dynamization::strategy::SimpleBinary;

                let mut q = SVQueue::<i32>::with_strategy::<SimpleBinary>();

                for x in v {
                    q.push(*x);
                }
                
                q
            }, |mut q| {
                while let Some(_) = q.pop() {}
            }, BatchSize::SmallInput);
        });
        
        group.bench_with_input(BenchmarkId::new("svqueue_skew", size), &vec, |b, v| {
            b.iter_batched(|| {
                use dynamization::sorted_vec::SVQueue;
                use dynamization::strategy::SkewBinary;

                let mut q = SVQueue::<i32>::with_strategy::<SkewBinary>();

                for x in v {
                    q.push(*x);
                }
                
                q
            }, |mut q| {
                while let Some(_) = q.pop() {}
            }, BatchSize::SmallInput);
        });
    }

    group.finish();
}


criterion_group!(benches, insertion, deletion);
criterion_main!(benches);