-
Notifications
You must be signed in to change notification settings - Fork 373
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
707 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,333 @@ | ||
use criterion::{criterion_group, criterion_main, Criterion}; | ||
|
||
use itertools::Itertools as _; | ||
|
||
use re_query_cache2::FlatVecDeque; | ||
|
||
// --- | ||
|
||
#[global_allocator] | ||
static GLOBAL: mimalloc::MiMalloc = mimalloc::MiMalloc; | ||
|
||
criterion_group!( | ||
benches, | ||
range, | ||
insert, | ||
insert_many, | ||
insert_deque, | ||
remove, | ||
remove_range | ||
); | ||
criterion_main!(benches); | ||
|
||
// --- | ||
|
||
// `cargo test` also runs the benchmark setup code, so make sure they run quickly: | ||
#[cfg(debug_assertions)] | ||
mod constants { | ||
pub const INITIAL_VALUES_PER_ENTRY: usize = 1; | ||
pub const INITIAL_NUM_ENTRIES: usize = 1; | ||
pub const ADDED_VALUES_PER_ENTRY: usize = 1; | ||
pub const ADDED_NUM_ENTRIES: usize = 1; | ||
} | ||
|
||
#[cfg(not(debug_assertions))] | ||
mod constants { | ||
pub const INITIAL_VALUES_PER_ENTRY: usize = 1000; | ||
pub const INITIAL_NUM_ENTRIES: usize = 100; | ||
pub const ADDED_VALUES_PER_ENTRY: usize = 1000; | ||
pub const ADDED_NUM_ENTRIES: usize = 5; | ||
} | ||
|
||
#[allow(clippy::wildcard_imports)] | ||
use self::constants::*; | ||
|
||
// --- | ||
|
||
fn range(c: &mut Criterion) { | ||
if std::env::var("CI").is_ok() { | ||
return; | ||
} | ||
|
||
let mut group = c.benchmark_group("flat_vec_deque"); | ||
group.throughput(criterion::Throughput::Elements( | ||
(ADDED_NUM_ENTRIES * ADDED_VALUES_PER_ENTRY) as _, | ||
)); | ||
|
||
{ | ||
group.bench_function("range/prefilled/front", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let v: FlatVecDeque<i64> = base.clone(); | ||
v.range(0..ADDED_NUM_ENTRIES) | ||
.map(ToOwned::to_owned) | ||
.collect_vec() | ||
}); | ||
}); | ||
group.bench_function("range/prefilled/middle", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let v: FlatVecDeque<i64> = base.clone(); | ||
v.range( | ||
INITIAL_NUM_ENTRIES / 2 - ADDED_NUM_ENTRIES / 2 | ||
..INITIAL_NUM_ENTRIES / 2 + ADDED_NUM_ENTRIES / 2, | ||
) | ||
.map(ToOwned::to_owned) | ||
.collect_vec() | ||
}); | ||
}); | ||
group.bench_function("range/prefilled/back", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let v: FlatVecDeque<i64> = base.clone(); | ||
v.range(INITIAL_NUM_ENTRIES - ADDED_NUM_ENTRIES..INITIAL_NUM_ENTRIES) | ||
.map(ToOwned::to_owned) | ||
.collect_vec() | ||
}); | ||
}); | ||
} | ||
} | ||
|
||
fn insert(c: &mut Criterion) { | ||
if std::env::var("CI").is_ok() { | ||
return; | ||
} | ||
|
||
let added = (0..ADDED_VALUES_PER_ENTRY as i64).collect_vec(); | ||
|
||
let mut group = c.benchmark_group("flat_vec_deque"); | ||
group.throughput(criterion::Throughput::Elements(added.len() as _)); | ||
|
||
{ | ||
group.bench_function("insert/empty", |b| { | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = FlatVecDeque::new(); | ||
v.insert(0, added.clone()); | ||
v | ||
}); | ||
}); | ||
} | ||
|
||
{ | ||
group.bench_function("insert/prefilled/front", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.insert(0, added.clone()); | ||
v | ||
}); | ||
}); | ||
group.bench_function("insert/prefilled/middle", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.insert(INITIAL_NUM_ENTRIES / 2, added.clone()); | ||
v | ||
}); | ||
}); | ||
group.bench_function("insert/prefilled/back", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.insert(INITIAL_NUM_ENTRIES, added.clone()); | ||
v | ||
}); | ||
}); | ||
} | ||
} | ||
|
||
fn insert_many(c: &mut Criterion) { | ||
if std::env::var("CI").is_ok() { | ||
return; | ||
} | ||
|
||
let added = (0..ADDED_NUM_ENTRIES as i64) | ||
.map(|_| (0..ADDED_VALUES_PER_ENTRY as i64).collect_vec()) | ||
.collect_vec(); | ||
|
||
let mut group = c.benchmark_group("flat_vec_deque"); | ||
group.throughput(criterion::Throughput::Elements( | ||
(ADDED_NUM_ENTRIES * ADDED_VALUES_PER_ENTRY) as _, | ||
)); | ||
|
||
{ | ||
group.bench_function("insert_many/empty", |b| { | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = FlatVecDeque::new(); | ||
v.insert_many(0, added.clone()); | ||
v | ||
}); | ||
}); | ||
} | ||
|
||
{ | ||
group.bench_function("insert_many/prefilled/front", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.insert_many(0, added.clone()); | ||
v | ||
}); | ||
}); | ||
group.bench_function("insert_many/prefilled/middle", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.insert_many(INITIAL_NUM_ENTRIES / 2, added.clone()); | ||
v | ||
}); | ||
}); | ||
group.bench_function("insert_many/prefilled/back", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.insert_many(INITIAL_NUM_ENTRIES, added.clone()); | ||
v | ||
}); | ||
}); | ||
} | ||
} | ||
|
||
fn insert_deque(c: &mut Criterion) { | ||
if std::env::var("CI").is_ok() { | ||
return; | ||
} | ||
|
||
let mut added: FlatVecDeque<i64> = FlatVecDeque::new(); | ||
for i in 0..ADDED_NUM_ENTRIES { | ||
added.insert(i, (0..ADDED_VALUES_PER_ENTRY as i64).collect_vec()); | ||
} | ||
|
||
let added = FlatVecDeque::from_vecs( | ||
std::iter::repeat_with(|| (0..ADDED_VALUES_PER_ENTRY as i64).collect_vec()) | ||
.take(ADDED_NUM_ENTRIES), | ||
); | ||
|
||
let mut group = c.benchmark_group("flat_vec_deque"); | ||
group.throughput(criterion::Throughput::Elements( | ||
(ADDED_NUM_ENTRIES * ADDED_VALUES_PER_ENTRY) as _, | ||
)); | ||
|
||
{ | ||
group.bench_function("insert_deque/empty", |b| { | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = FlatVecDeque::new(); | ||
v.insert_deque(0, added.clone()); | ||
v | ||
}); | ||
}); | ||
} | ||
|
||
{ | ||
group.bench_function("insert_deque/prefilled/front", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.insert_deque(0, added.clone()); | ||
v | ||
}); | ||
}); | ||
group.bench_function("insert_deque/prefilled/middle", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.insert_deque(INITIAL_NUM_ENTRIES / 2, added.clone()); | ||
v | ||
}); | ||
}); | ||
group.bench_function("insert_deque/prefilled/back", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.insert_deque(INITIAL_NUM_ENTRIES, added.clone()); | ||
v | ||
}); | ||
}); | ||
} | ||
} | ||
|
||
fn remove(c: &mut Criterion) { | ||
if std::env::var("CI").is_ok() { | ||
return; | ||
} | ||
|
||
let mut group = c.benchmark_group("flat_vec_deque"); | ||
group.throughput(criterion::Throughput::Elements(1)); | ||
|
||
{ | ||
group.bench_function("remove/prefilled/front", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.remove(0); | ||
v | ||
}); | ||
}); | ||
group.bench_function("remove/prefilled/middle", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.remove(INITIAL_NUM_ENTRIES / 2); | ||
v | ||
}); | ||
}); | ||
group.bench_function("remove/prefilled/back", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.remove(INITIAL_NUM_ENTRIES - 1); | ||
v | ||
}); | ||
}); | ||
} | ||
} | ||
|
||
fn remove_range(c: &mut Criterion) { | ||
if std::env::var("CI").is_ok() { | ||
return; | ||
} | ||
|
||
let mut group = c.benchmark_group("flat_vec_deque"); | ||
group.throughput(criterion::Throughput::Elements( | ||
(ADDED_NUM_ENTRIES * ADDED_VALUES_PER_ENTRY) as _, | ||
)); | ||
|
||
{ | ||
group.bench_function("remove_range/prefilled/front", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.remove_range(0..ADDED_NUM_ENTRIES); | ||
v | ||
}); | ||
}); | ||
group.bench_function("remove_range/prefilled/middle", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.remove_range( | ||
INITIAL_NUM_ENTRIES / 2 - ADDED_NUM_ENTRIES / 2 | ||
..INITIAL_NUM_ENTRIES / 2 + ADDED_NUM_ENTRIES / 2, | ||
); | ||
v | ||
}); | ||
}); | ||
group.bench_function("remove_range/prefilled/back", |b| { | ||
let base = create_prefilled(); | ||
b.iter(|| { | ||
let mut v: FlatVecDeque<i64> = base.clone(); | ||
v.remove_range(INITIAL_NUM_ENTRIES - ADDED_NUM_ENTRIES..INITIAL_NUM_ENTRIES); | ||
v | ||
}); | ||
}); | ||
} | ||
} | ||
|
||
// --- | ||
|
||
fn create_prefilled() -> FlatVecDeque<i64> { | ||
FlatVecDeque::from_vecs( | ||
std::iter::repeat_with(|| (0..INITIAL_VALUES_PER_ENTRY as i64).collect_vec()) | ||
.take(INITIAL_NUM_ENTRIES), | ||
) | ||
} |
Oops, something went wrong.