aboutsummaryrefslogtreecommitdiff
path: root/benches/bench.rs
diff options
context:
space:
mode:
authorDavid LeGare <legare@google.com>2022-03-02 16:21:23 +0000
committerDavid LeGare <legare@google.com>2022-03-02 16:21:23 +0000
commit8f2129788afc336eaee3610f16ec698e1c869d01 (patch)
tree8a0aaf450d87ced0b38394bff96d3d54d2ee92be /benches/bench.rs
parentc88ecc614cd11e05d6e0cd1dc9b93a5a48c5fccc (diff)
downloadsmallvec-8f2129788afc336eaee3610f16ec698e1c869d01.tar.gz
Update smallvec to 1.8.0
Test: cd external/rust/crates && atest --host -c Change-Id: I2a9bbf3cbe9a9458f13552e4c09e33f231a96b57
Diffstat (limited to 'benches/bench.rs')
-rw-r--r--benches/bench.rs11
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);
}
});
}