diff options
author | Treehugger Robot <treehugger-gerrit@google.com> | 2022-03-08 20:32:59 +0000 |
---|---|---|
committer | Gerrit Code Review <noreply-gerritcodereview@google.com> | 2022-03-08 20:32:59 +0000 |
commit | 2b8efd428cb1e17fc33e343aad8bb4d4321d30e1 (patch) | |
tree | 8a0aaf450d87ced0b38394bff96d3d54d2ee92be /benches/bench.rs | |
parent | 38a95dd734eb4e673047a2fd4b9943a2cdd921d6 (diff) | |
parent | 8f2129788afc336eaee3610f16ec698e1c869d01 (diff) | |
download | smallvec-2b8efd428cb1e17fc33e343aad8bb4d4321d30e1.tar.gz |
Merge "Update smallvec to 1.8.0"
Diffstat (limited to 'benches/bench.rs')
-rw-r--r-- | benches/bench.rs | 11 |
1 files changed, 5 insertions, 6 deletions
diff --git a/benches/bench.rs b/benches/bench.rs index 7a3c07e..ad73226 100644 --- a/benches/bench.rs +++ b/benches/bench.rs @@ -159,12 +159,11 @@ fn gen_insert<V: Vector<u64>>(n: u64, b: &mut Bencher) { b.iter(|| { let mut vec = V::new(); - // Add one element, with each iteration we insert one before the end. - // This means that we benchmark the insertion operation and not the - // time it takes to `ptr::copy` the data. + // Always insert at position 0 so that we are subject to shifts of + // many different lengths. vec.push(0); for x in 0..n { - insert_noinline(&mut vec, x as _, x); + insert_noinline(&mut vec, 0, x); } vec }); @@ -179,8 +178,8 @@ fn gen_remove<V: Vector<u64>>(n: usize, b: &mut Bencher) { b.iter(|| { let mut vec = V::from_elem(0, n as _); - for x in (0..n - 1).rev() { - remove_noinline(&mut vec, x); + for _ in 0..n { + remove_noinline(&mut vec, 0); } }); } |