1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43
|
use std::collections::HashSet;
use test::Bencher;
#[bench]
fn set_difference(b: &mut Bencher) {
let small: HashSet<_> = (0..10).collect();
let large: HashSet<_> = (0..100).collect();
b.iter(|| small.difference(&large).count());
}
#[bench]
fn set_is_subset(b: &mut Bencher) {
let small: HashSet<_> = (0..10).collect();
let large: HashSet<_> = (0..100).collect();
b.iter(|| small.is_subset(&large));
}
#[bench]
fn set_intersection(b: &mut Bencher) {
let small: HashSet<_> = (0..10).collect();
let large: HashSet<_> = (0..100).collect();
b.iter(|| small.intersection(&large).count());
}
#[bench]
fn set_symmetric_difference(b: &mut Bencher) {
let small: HashSet<_> = (0..10).collect();
let large: HashSet<_> = (0..100).collect();
b.iter(|| small.symmetric_difference(&large).count());
}
#[bench]
fn set_union(b: &mut Bencher) {
let small: HashSet<_> = (0..10).collect();
let large: HashSet<_> = (0..100).collect();
b.iter(|| small.union(&large).count());
}
|