Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Improvements to bench tests #7

Merged
merged 3 commits into from Jan 26, 2023
Merged

Improvements to bench tests #7

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
f1f6c32
Fix test label
febo Nov 15, 2022
84c8232
Separate insert step from the remove benchmark
febo Nov 16, 2022
08001cf
Add lookup tests
febo Nov 16, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
127 changes: 108 additions & 19 deletions benches/bench.rs
View file
Open in desktop
Expand Up @@ -220,10 +220,10 @@ mod bench_tests {
let mut m = BTreeMap::new();
let mut slice: Vec<u128> = (0..1000).collect();
slice.shuffle(&mut rng);
for v in 0..1000 {
m.insert(v as u128, rng.gen::<u128>());
}
b.iter(|| {
for v in 0..1000 {
m.insert(v as u128, rng.gen::<u128>());
}
for k in slice.iter() {
m.remove(k);
}
Expand All @@ -236,10 +236,10 @@ mod bench_tests {
let mut m = HashMap::new();
let mut slice: Vec<u128> = (0..1000).collect();
slice.shuffle(&mut rng);
for v in 0..1000 {
m.insert(v as u128, rng.gen::<u128>());
}
b.iter(|| {
for v in 0..1000 {
m.insert(v as u128, rng.gen::<u128>());
}
for k in slice.iter() {
m.remove(k);
}
Expand All @@ -253,10 +253,10 @@ mod bench_tests {
let m = RBTree::new_from_slice(buf.as_mut_slice());
let mut slice: Vec<u128> = (0..1000).collect();
slice.shuffle(&mut rng);
for v in 0..1000 {
m.insert(v as u128, rng.gen::<u128>());
}
b.iter(|| {
for v in 0..1000 {
m.insert(v as u128, rng.gen::<u128>());
}
for k in slice.iter() {
m.remove(k);
}
Expand All @@ -270,10 +270,10 @@ mod bench_tests {
let m = SHashMap::new_from_slice(buf.as_mut_slice());
let mut slice: Vec<u128> = (0..1000).collect();
slice.shuffle(&mut rng);
for v in 0..1000 {
m.insert(v as u128, rng.gen::<u128>());
}
b.iter(|| {
for v in 0..1000 {
m.insert(v as u128, rng.gen::<u128>());
}
for k in slice.iter() {
m.remove(k);
}
Expand All @@ -287,30 +287,119 @@ mod bench_tests {
let m = CritbitTree::new_from_slice(buf.as_mut_slice());
let mut slice: Vec<u128> = (0..1000).collect();
slice.shuffle(&mut rng);
for v in 0..1000 {
m.insert(v as u128, rng.gen::<u128>());
}
b.iter(|| {
for v in 0..1000 {
m.insert(v as u128, rng.gen::<u128>());
}
for k in slice.iter() {
m.remove(k);
}
})
}

#[bench]
fn bench_sokoban_avl_tree_remove_u128(b: &mut Bencher) {
fn bench_sokoban_avl_tree_remove_1000_u128(b: &mut Bencher) {
let mut rng = rand::thread_rng();
let mut buf = vec![0u8; std::mem::size_of::<AVLTreeMap>()];
let m = AVLTreeMap::new_from_slice(buf.as_mut_slice());
let mut slice: Vec<u128> = (0..1000).collect();
slice.shuffle(&mut rng);
for v in 0..1000 {
m.insert(v as u128, rng.gen::<u128>());
}
b.iter(|| {
for v in 0..1000 {
m.insert(v as u128, rng.gen::<u128>());
}
for k in slice.iter() {
m.remove(k);
}
})
}


#[bench]
fn bench_std_btree_map_lookup_20000_u128(b: &mut Bencher) {
let mut rng = rand::thread_rng();
let mut m = BTreeMap::new();
for v in 0..20000 {
m.insert(v as u128, rng.gen::<u128>());
}
b.iter(|| {
for v in 0..20000 {
m.get(&v);
}
})
}

#[bench]
fn bench_std_hash_map_lookup_20000_u128(b: &mut Bencher) {
let mut rng = rand::thread_rng();
let mut m = HashMap::new();
for v in 0..20000 {
m.insert(v as u128, rng.gen::<u128>());
}
b.iter(|| {
for v in 0..20000 {
m.get(&v);
}
})
}

#[bench]
fn bench_sokoban_red_black_tree_lookup_20000_u128(b: &mut Bencher) {
let mut rng = rand::thread_rng();
let mut buf = vec![0u8; std::mem::size_of::<RBTree>()];
let m = RBTree::new_from_slice(buf.as_mut_slice());
for v in 0..20000 {
m.insert(v as u128, rng.gen::<u128>());
}
b.iter(|| {
for v in 0..20000 {
m.get(&v);
}
})
}

#[bench]
fn bench_sokoban_hash_map_lookup_20000_u128(b: &mut Bencher) {
let mut rng = rand::thread_rng();
let mut buf = vec![0u8; std::mem::size_of::<SHashMap>()];
let m = SHashMap::new_from_slice(buf.as_mut_slice());
for v in 0..20000 {
m.insert(v as u128, rng.gen::<u128>());
}
b.iter(|| {
for v in 0..20000 {
m.get(&v);
}
})
}

#[bench]
fn bench_sokoban_critbit_lookup_20000_u128(b: &mut Bencher) {
let mut rng = rand::thread_rng();
let mut buf = vec![0u8; std::mem::size_of::<CritbitTree>()];
let m = CritbitTree::new_from_slice(buf.as_mut_slice());
for v in 0..20000 {
m.insert(v as u128, rng.gen::<u128>());
}
b.iter(|| {
for v in 0..20000 {
m.get(&v);
}
})
}

#[bench]
fn bench_sokoban_avl_tree_lookup_20000_u128(b: &mut Bencher) {
let mut rng = rand::thread_rng();
let mut buf = vec![0u8; std::mem::size_of::<AVLTreeMap>()];
let m = AVLTreeMap::new_from_slice(buf.as_mut_slice());
for v in 0..20000 {
m.insert(v as u128, rng.gen::<u128>());
}
b.iter(|| {
for v in 0..20000 {
m.get(&v);
}
})
}
}