3 use rand::distributions::{Alphanumeric, Standard};
5 use test::{black_box, Bencher};
8 fn iterator(b: &mut Bencher) {
9 // peculiar numbers to stop LLVM from optimising the summation
11 let v: Vec<_> = (0..100).map(|i| i ^ (i << 1) ^ (i >> 1)).collect();
18 // sum == 11806, to stop dead code elimination.
26 fn mut_iterator(b: &mut Bencher) {
27 let mut v = vec![0; 100];
39 fn concat(b: &mut Bencher) {
40 let xss: Vec<Vec<i32>> = (0..100).map(|i| (0..i).collect()).collect();
47 fn join(b: &mut Bencher) {
48 let xss: Vec<Vec<i32>> = (0..100).map(|i| (0..i).collect()).collect();
49 b.iter(|| xss.join(&0));
53 fn push(b: &mut Bencher) {
54 let mut vec = Vec::<i32>::new();
62 fn starts_with_same_vector(b: &mut Bencher) {
63 let vec: Vec<_> = (0..100).collect();
64 b.iter(|| vec.starts_with(&vec))
68 fn starts_with_single_element(b: &mut Bencher) {
69 let vec: Vec<_> = vec![0];
70 b.iter(|| vec.starts_with(&vec))
74 fn starts_with_diff_one_element_at_end(b: &mut Bencher) {
75 let vec: Vec<_> = (0..100).collect();
76 let mut match_vec: Vec<_> = (0..99).collect();
78 b.iter(|| vec.starts_with(&match_vec))
82 fn ends_with_same_vector(b: &mut Bencher) {
83 let vec: Vec<_> = (0..100).collect();
84 b.iter(|| vec.ends_with(&vec))
88 fn ends_with_single_element(b: &mut Bencher) {
89 let vec: Vec<_> = vec![0];
90 b.iter(|| vec.ends_with(&vec))
94 fn ends_with_diff_one_element_at_beginning(b: &mut Bencher) {
95 let vec: Vec<_> = (0..100).collect();
96 let mut match_vec: Vec<_> = (0..100).collect();
98 b.iter(|| vec.starts_with(&match_vec))
102 fn contains_last_element(b: &mut Bencher) {
103 let vec: Vec<_> = (0..100).collect();
104 b.iter(|| vec.contains(&99))
108 fn zero_1kb_from_elem(b: &mut Bencher) {
109 b.iter(|| vec![0u8; 1024]);
113 fn zero_1kb_set_memory(b: &mut Bencher) {
115 let mut v = Vec::<u8>::with_capacity(1024);
117 let vp = v.as_mut_ptr();
118 ptr::write_bytes(vp, 0, 1024);
126 fn zero_1kb_loop_set(b: &mut Bencher) {
128 let mut v = Vec::<u8>::with_capacity(1024);
139 fn zero_1kb_mut_iter(b: &mut Bencher) {
141 let mut v = Vec::<u8>::with_capacity(1024);
153 fn random_inserts(b: &mut Bencher) {
154 let mut rng = crate::bench_rng();
156 let mut v = vec![(0, 0); 30];
159 v.insert(rng.gen::<usize>() % (l + 1), (1, 1));
165 fn random_removes(b: &mut Bencher) {
166 let mut rng = crate::bench_rng();
168 let mut v = vec![(0, 0); 130];
171 v.remove(rng.gen::<usize>() % l);
176 fn gen_ascending(len: usize) -> Vec<u64> {
177 (0..len as u64).collect()
180 fn gen_descending(len: usize) -> Vec<u64> {
181 (0..len as u64).rev().collect()
184 fn gen_random(len: usize) -> Vec<u64> {
185 let mut rng = crate::bench_rng();
186 (&mut rng).sample_iter(&Standard).take(len).collect()
189 fn gen_random_bytes(len: usize) -> Vec<u8> {
190 let mut rng = crate::bench_rng();
191 (&mut rng).sample_iter(&Standard).take(len).collect()
194 fn gen_mostly_ascending(len: usize) -> Vec<u64> {
195 let mut rng = crate::bench_rng();
196 let mut v = gen_ascending(len);
197 for _ in (0usize..).take_while(|x| x * x <= len) {
198 let x = rng.gen::<usize>() % len;
199 let y = rng.gen::<usize>() % len;
205 fn gen_mostly_descending(len: usize) -> Vec<u64> {
206 let mut rng = crate::bench_rng();
207 let mut v = gen_descending(len);
208 for _ in (0usize..).take_while(|x| x * x <= len) {
209 let x = rng.gen::<usize>() % len;
210 let y = rng.gen::<usize>() % len;
216 fn gen_strings(len: usize) -> Vec<String> {
217 let mut rng = crate::bench_rng();
220 let n = rng.gen::<usize>() % 20 + 1;
221 v.push((&mut rng).sample_iter(&Alphanumeric).take(n).collect());
226 fn gen_big_random(len: usize) -> Vec<[u64; 16]> {
227 let mut rng = crate::bench_rng();
228 (&mut rng).sample_iter(&Standard).map(|x| [x; 16]).take(len).collect()
232 ($f:ident, $name:ident, $gen:expr, $len:expr) => {
234 fn $name(b: &mut Bencher) {
236 b.iter(|| v.clone().$f());
237 b.bytes = $len * mem::size_of_val(&$gen(1)[0]) as u64;
242 macro_rules! sort_strings {
243 ($f:ident, $name:ident, $gen:expr, $len:expr) => {
245 fn $name(b: &mut Bencher) {
247 let v = v.iter().map(|s| &**s).collect::<Vec<&str>>();
248 b.iter(|| v.clone().$f());
249 b.bytes = $len * mem::size_of::<&str>() as u64;
254 macro_rules! sort_expensive {
255 ($f:ident, $name:ident, $gen:expr, $len:expr) => {
257 fn $name(b: &mut Bencher) {
260 let mut v = v.clone();
262 v.$f(|a: &u64, b: &u64| {
264 if count % 1_000_000_000 == 0 {
265 panic!("should not happen");
267 (*a as f64).cos().partial_cmp(&(*b as f64).cos()).unwrap()
271 b.bytes = $len * mem::size_of_val(&$gen(1)[0]) as u64;
276 macro_rules! sort_lexicographic {
277 ($f:ident, $name:ident, $gen:expr, $len:expr) => {
279 fn $name(b: &mut Bencher) {
281 b.iter(|| v.clone().$f(|x| x.to_string()));
282 b.bytes = $len * mem::size_of_val(&$gen(1)[0]) as u64;
287 sort!(sort, sort_small_ascending, gen_ascending, 10);
288 sort!(sort, sort_small_descending, gen_descending, 10);
289 sort!(sort, sort_small_random, gen_random, 10);
290 sort!(sort, sort_small_big, gen_big_random, 10);
291 sort!(sort, sort_medium_random, gen_random, 100);
292 sort!(sort, sort_large_ascending, gen_ascending, 10000);
293 sort!(sort, sort_large_descending, gen_descending, 10000);
294 sort!(sort, sort_large_mostly_ascending, gen_mostly_ascending, 10000);
295 sort!(sort, sort_large_mostly_descending, gen_mostly_descending, 10000);
296 sort!(sort, sort_large_random, gen_random, 10000);
297 sort!(sort, sort_large_big, gen_big_random, 10000);
298 sort_strings!(sort, sort_large_strings, gen_strings, 10000);
299 sort_expensive!(sort_by, sort_large_expensive, gen_random, 10000);
301 sort!(sort_unstable, sort_unstable_small_ascending, gen_ascending, 10);
302 sort!(sort_unstable, sort_unstable_small_descending, gen_descending, 10);
303 sort!(sort_unstable, sort_unstable_small_random, gen_random, 10);
304 sort!(sort_unstable, sort_unstable_small_big, gen_big_random, 10);
305 sort!(sort_unstable, sort_unstable_medium_random, gen_random, 100);
306 sort!(sort_unstable, sort_unstable_large_ascending, gen_ascending, 10000);
307 sort!(sort_unstable, sort_unstable_large_descending, gen_descending, 10000);
308 sort!(sort_unstable, sort_unstable_large_mostly_ascending, gen_mostly_ascending, 10000);
309 sort!(sort_unstable, sort_unstable_large_mostly_descending, gen_mostly_descending, 10000);
310 sort!(sort_unstable, sort_unstable_large_random, gen_random, 10000);
311 sort!(sort_unstable, sort_unstable_large_big, gen_big_random, 10000);
312 sort_strings!(sort_unstable, sort_unstable_large_strings, gen_strings, 10000);
313 sort_expensive!(sort_unstable_by, sort_unstable_large_expensive, gen_random, 10000);
315 sort_lexicographic!(sort_by_key, sort_by_key_lexicographic, gen_random, 10000);
316 sort_lexicographic!(sort_unstable_by_key, sort_unstable_by_key_lexicographic, gen_random, 10000);
317 sort_lexicographic!(sort_by_cached_key, sort_by_cached_key_lexicographic, gen_random, 10000);
319 macro_rules! reverse {
320 ($name:ident, $ty:ty, $f:expr) => {
322 fn $name(b: &mut Bencher) {
323 // odd length and offset by 1 to be as unaligned as possible
325 let mut v: Vec<_> = (0..1 + (n / mem::size_of::<$ty>() as u64)).map($f).collect();
326 b.iter(|| black_box(&mut v[1..]).reverse());
332 reverse!(reverse_u8, u8, |x| x as u8);
333 reverse!(reverse_u16, u16, |x| x as u16);
334 reverse!(reverse_u8x3, [u8; 3], |x| [x as u8, (x >> 8) as u8, (x >> 16) as u8]);
335 reverse!(reverse_u32, u32, |x| x as u32);
336 reverse!(reverse_u64, u64, |x| x as u64);
337 reverse!(reverse_u128, u128, |x| x as u128);
339 struct F64x4(f64, f64, f64, f64);
340 reverse!(reverse_simd_f64x4, F64x4, |x| {
345 macro_rules! rotate {
346 ($name:ident, $gen:expr, $len:expr, $mid:expr) => {
348 fn $name(b: &mut Bencher) {
349 let size = mem::size_of_val(&$gen(1)[0]);
350 let mut v = $gen($len * 8 / size);
351 b.iter(|| black_box(&mut v).rotate_left(($mid * 8 + size - 1) / size));
352 b.bytes = (v.len() * size) as u64;
357 rotate!(rotate_tiny_by1, gen_random, 16, 1);
358 rotate!(rotate_tiny_half, gen_random, 16, 16 / 2);
359 rotate!(rotate_tiny_half_plus_one, gen_random, 16, 16 / 2 + 1);
361 rotate!(rotate_medium_by1, gen_random, 9158, 1);
362 rotate!(rotate_medium_by727_u64, gen_random, 9158, 727);
363 rotate!(rotate_medium_by727_bytes, gen_random_bytes, 9158, 727);
364 rotate!(rotate_medium_by727_strings, gen_strings, 9158, 727);
365 rotate!(rotate_medium_half, gen_random, 9158, 9158 / 2);
366 rotate!(rotate_medium_half_plus_one, gen_random, 9158, 9158 / 2 + 1);
368 // Intended to use more RAM than the machine has cache
369 rotate!(rotate_huge_by1, gen_random, 5 * 1024 * 1024, 1);
370 rotate!(rotate_huge_by9199_u64, gen_random, 5 * 1024 * 1024, 9199);
371 rotate!(rotate_huge_by9199_bytes, gen_random_bytes, 5 * 1024 * 1024, 9199);
372 rotate!(rotate_huge_by9199_strings, gen_strings, 5 * 1024 * 1024, 9199);
373 rotate!(rotate_huge_by9199_big, gen_big_random, 5 * 1024 * 1024, 9199);
374 rotate!(rotate_huge_by1234577_u64, gen_random, 5 * 1024 * 1024, 1234577);
375 rotate!(rotate_huge_by1234577_bytes, gen_random_bytes, 5 * 1024 * 1024, 1234577);
376 rotate!(rotate_huge_by1234577_strings, gen_strings, 5 * 1024 * 1024, 1234577);
377 rotate!(rotate_huge_by1234577_big, gen_big_random, 5 * 1024 * 1024, 1234577);
378 rotate!(rotate_huge_half, gen_random, 5 * 1024 * 1024, 5 * 1024 * 1024 / 2);
379 rotate!(rotate_huge_half_plus_one, gen_random, 5 * 1024 * 1024, 5 * 1024 * 1024 / 2 + 1);