yggdrasil/discrete_range_map
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

remove benches as they aren't compatible with v0.2.0 unfortunately

Browse Source
This commit is contained in:
ripytide 2023-04-18 16:28:19 +01:00
parent 29047ed3a1
commit f6c15d111e
No known key found for this signature in database
GPG Key ID: B2629F9EC7C2FE8C
2 changed files with 0 additions and 150 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

77
benches/insert.rs
View File

@ -1,77 +0,0 @@
#![feature(test)]
extern crate test;
use test::Bencher;
extern crate range_bounds_map;
use range_bounds_map::*;
/// linear multiplier for work done by benchmarks
const REPEAT: usize = 120;
#[bench]
fn bench_insert_strict(b: &mut Bencher) {
b.iter(|| {
let mut map = RangeBoundsMap::new();
for i in 0..REPEAT {
let r = i..=i;
map.insert_strict(r, i).expect("insert failed");
}
});
}
#[bench]
fn bench_insert_merge_touching(b: &mut Bencher) {
b.iter(|| {
let mut map = RangeBoundsMap::new();
for i in 0..REPEAT / 2 {
let r1 = (10 * i)..(10 * i + 1);
let r2 = (10 * i + 1)..(10 * i + 2);
map.insert_merge_touching(r1, true)
.expect("Failed to insert");
map.insert_merge_touching(r2, true)
.expect("Failed to insert");
}
})
}
#[bench]
fn bench_insert_merge_overlapping(b: &mut Bencher) {
b.iter(|| {
let mut map = RangeBoundsMap::new();
for i in 0..REPEAT / 2 {
let r1 = (10 * i)..(10 * i + 1);
let r2 = (10 * i)..(10 * i + 2);
map.insert_merge_overlapping(r1, true)
.expect("Failed to insert");
map.insert_merge_overlapping(r2, true)
.expect("Failed to insert");
}
})
}
#[bench]
fn bench_insert_merge_touching_or_overlapping(b: &mut Bencher) {
b.iter(|| {
let mut map = RangeBoundsMap::new();
for i in 0..REPEAT / 2 {
let r1 = (10 * i + 1)..(10 * i + 2);
let r2 = (10 * i)..(10 * i + 4);
map.insert_merge_touching_or_overlapping(r1, 1)
.expect("Failed to insert");
map.insert_merge_touching_or_overlapping(r2, 2)
.expect("Failed to insert");
}
})
}
#[bench]
fn bench_insert_overwrite(b: &mut Bencher) {
b.iter(|| {
let mut map = RangeBoundsMap::new();
for i in 0..REPEAT {
let r = i..i + 2;
map.insert_overwrite(r, i).expect("insert failed");
}
});
}

73
benches/operations.rs
View File

@ -1,73 +0,0 @@
#![feature(test)]
use std::ops::{Bound, Range};
extern crate test;
use test::Bencher;
extern crate range_bounds_map;
use range_bounds_map::*;
/// linear multiplier for work done by benchmarks
const REPEAT: usize = 120;
/// utility for constructing identity [i,i]->i map for benches
fn build_identity_map(n: usize) -> RangeBoundsMap<usize, Range<usize>, usize> {
let mut map = RangeBoundsMap::new();
for i in 0..n {
map.insert_strict(i..i + 1, i).expect("insert failed");
}
map
}
#[bench]
fn bench_overlaps(b: &mut Bencher) {
let map = build_identity_map(REPEAT);
b.iter(|| for _ in map.overlapping(&(0..REPEAT)) {})
}
#[bench]
fn bench_iter(b: &mut Bencher) {
let map = build_identity_map(REPEAT);
b.iter(|| for _ in map.iter() {})
}
#[bench]
fn bench_remove_overlapping(b: &mut Bencher) {
let map = build_identity_map(REPEAT);
b.iter(|| {
let mut map = map.clone();
for _ in map.remove_overlapping(&(0..REPEAT)) {}
})
}
#[bench]
fn bench_cut(b: &mut Bencher) {
let map = build_identity_map(REPEAT);
b.iter(|| {
let mut map = map.clone();
for _ in map.cut(&(0..REPEAT)).expect("Failed to cut") {}
})
}
#[bench]
fn bench_gaps(b: &mut Bencher) {
let map = build_identity_map(REPEAT);
b.iter(|| for _ in map.gaps(&(0..REPEAT)) {})
}
#[bench]
fn bench_split_off(b: &mut Bencher) {
let map = build_identity_map(REPEAT);
b.iter(|| {
let mut map = map.clone();
map.split_off(Bound::Included(REPEAT / 2))
.expect("Failed to split");
})
}
#[bench]
fn bench_overlapping_trimmed(b: &mut Bencher) {
let map = build_identity_map(REPEAT);
b.iter(|| for _ in map.overlapping_trimmed(&(1..REPEAT - 1)) {})
}