|
| 1 | +// SPDX-License-Identifier: MPL-2.0 |
| 2 | + |
| 3 | +use std::collections::BTreeMap; |
| 4 | +use std::time::Duration; |
| 5 | + |
| 6 | +use criterion::*; |
| 7 | +use pubgrub::OfflineDependencyProvider; |
| 8 | +use version_ranges::Ranges; |
| 9 | + |
| 10 | +type Deps = BTreeMap<u32, BTreeMap<u8, BTreeMap<u32, Vec<(u8, u8)>>>>; |
| 11 | + |
| 12 | +fn bench(b: &mut Bencher, data: &str) { |
| 13 | + let dependencies = ron::de::from_str::<Deps>(data).unwrap(); |
| 14 | + |
| 15 | + let mut dependency_provider = OfflineDependencyProvider::<u32, Ranges<u8>>::new(); |
| 16 | + |
| 17 | + for (&p, vmap) in &dependencies { |
| 18 | + for (&v, dmap) in vmap { |
| 19 | + let deps_iter = dmap.iter().map(|(&d, intervals)| { |
| 20 | + let mut r = Ranges::empty(); |
| 21 | + for &(start, end) in intervals { |
| 22 | + r = r.r#union(&Ranges::from_range_bounds(start..=end)); |
| 23 | + } |
| 24 | + (d, r) |
| 25 | + }); |
| 26 | + dependency_provider.add_dependencies(p, v, deps_iter); |
| 27 | + } |
| 28 | + } |
| 29 | + |
| 30 | + if let Some((p, v)) = dependencies |
| 31 | + .first_key_value() |
| 32 | + .and_then(|(&p, vmap)| vmap.first_key_value().map(|(&v, _)| (p, v))) |
| 33 | + { |
| 34 | + b.iter(|| { |
| 35 | + let _ = pubgrub::resolve(&dependency_provider, p, v); |
| 36 | + }); |
| 37 | + } |
| 38 | +} |
| 39 | + |
| 40 | +fn bench_group(c: &mut Criterion) { |
| 41 | + let mut group = c.benchmark_group("bench"); |
| 42 | + group.measurement_time(Duration::from_secs(20)); |
| 43 | + |
| 44 | + for case in ["small", "medium", "large"] { |
| 45 | + let name = format!("backtracking_{case}"); |
| 46 | + let data = std::fs::read_to_string(format!("test-examples/{name}.ron")).unwrap(); |
| 47 | + group.bench_function(name, |b| { |
| 48 | + bench(b, &data); |
| 49 | + }); |
| 50 | + } |
| 51 | + |
| 52 | + group.finish(); |
| 53 | +} |
| 54 | + |
| 55 | +criterion_group!(benches, bench_group); |
| 56 | +criterion_main!(benches); |
0 commit comments