mirror of
https://github.com/sharkdp/hyperfine.git
synced 2026-10-30 08:40:18 +00:00
195 lines
6.1 KiB
Rust
195 lines
6.1 KiB
Rust
use std::cmp::Ordering;
|
|
|
|
use super::benchmark_result::BenchmarkResult;
|
|
use crate::{
|
|
options::SortOrder,
|
|
quantity::{self, Ratio, Time, Zero},
|
|
};
|
|
|
|
#[derive(Debug)]
|
|
pub struct BenchmarkResultWithRelativeSpeed<'a> {
|
|
pub result: &'a BenchmarkResult,
|
|
pub relative_speed: f64,
|
|
pub relative_speed_stddev: Option<f64>,
|
|
pub is_reference: bool,
|
|
// Less means faster
|
|
pub relative_ordering: Ordering,
|
|
}
|
|
|
|
pub fn compare_mean_time(l: &BenchmarkResult, r: &BenchmarkResult) -> Ordering {
|
|
l.mean_wall_clock_time()
|
|
.partial_cmp(&r.mean_wall_clock_time())
|
|
.unwrap_or(Ordering::Equal)
|
|
}
|
|
|
|
pub fn fastest_of(results: &[BenchmarkResult]) -> &BenchmarkResult {
|
|
results
|
|
.iter()
|
|
.min_by(|&l, &r| compare_mean_time(l, r))
|
|
.expect("at least one benchmark result")
|
|
}
|
|
|
|
fn compute_relative_speeds<'a>(
|
|
results: &'a [BenchmarkResult],
|
|
reference: &'a BenchmarkResult,
|
|
sort_order: SortOrder,
|
|
) -> Vec<BenchmarkResultWithRelativeSpeed<'a>> {
|
|
let mut results: Vec<_> = results
|
|
.iter()
|
|
.map(|result| {
|
|
let is_reference = result == reference;
|
|
let relative_ordering = compare_mean_time(result, reference);
|
|
|
|
if result.mean_wall_clock_time() == Time::zero() {
|
|
return BenchmarkResultWithRelativeSpeed {
|
|
result,
|
|
relative_speed: if is_reference { 1.0 } else { f64::INFINITY },
|
|
relative_speed_stddev: None,
|
|
is_reference,
|
|
relative_ordering,
|
|
};
|
|
}
|
|
|
|
let ratio = match relative_ordering {
|
|
Ordering::Less => reference.mean_wall_clock_time() / result.mean_wall_clock_time(),
|
|
Ordering::Equal => Ratio::new::<quantity::ratio>(1.0),
|
|
Ordering::Greater => {
|
|
result.mean_wall_clock_time() / reference.mean_wall_clock_time()
|
|
}
|
|
};
|
|
|
|
// https://en.wikipedia.org/wiki/Propagation_of_uncertainty#Example_formulas
|
|
// Covariance assumed to be 0, i.e. variables are assumed to be independent
|
|
let ratio_stddev = match (
|
|
result.measurements.stddev(),
|
|
reference.measurements.stddev(),
|
|
) {
|
|
(Some(result_stddev), Some(fastest_stddev)) => Some(
|
|
ratio
|
|
* ((result_stddev / result.mean_wall_clock_time())
|
|
.powi(uom::typenum::P2::new())
|
|
+ (fastest_stddev / reference.mean_wall_clock_time())
|
|
.powi(uom::typenum::P2::new()))
|
|
.sqrt(),
|
|
),
|
|
_ => None,
|
|
};
|
|
|
|
BenchmarkResultWithRelativeSpeed {
|
|
result,
|
|
relative_speed: ratio.get::<quantity::ratio>(),
|
|
relative_speed_stddev: ratio_stddev.map(|r| r.get::<quantity::ratio>()),
|
|
is_reference,
|
|
relative_ordering,
|
|
}
|
|
})
|
|
.collect();
|
|
|
|
match sort_order {
|
|
SortOrder::Command => {}
|
|
SortOrder::MeanTime => {
|
|
results.sort_unstable_by(|r1, r2| compare_mean_time(r1.result, r2.result));
|
|
}
|
|
}
|
|
|
|
results
|
|
}
|
|
|
|
pub fn compute_with_check_from_reference<'a>(
|
|
results: &'a [BenchmarkResult],
|
|
reference: &'a BenchmarkResult,
|
|
sort_order: SortOrder,
|
|
) -> Option<Vec<BenchmarkResultWithRelativeSpeed<'a>>> {
|
|
if fastest_of(results).mean_wall_clock_time() == Time::zero()
|
|
|| reference.mean_wall_clock_time() == Time::zero()
|
|
{
|
|
return None;
|
|
}
|
|
|
|
Some(compute_relative_speeds(results, reference, sort_order))
|
|
}
|
|
|
|
pub fn compute_with_check(
|
|
results: &[BenchmarkResult],
|
|
sort_order: SortOrder,
|
|
) -> Option<Vec<BenchmarkResultWithRelativeSpeed<'_>>> {
|
|
let fastest = fastest_of(results);
|
|
|
|
if fastest.mean_wall_clock_time() == Time::zero() {
|
|
return None;
|
|
}
|
|
|
|
Some(compute_relative_speeds(results, fastest, sort_order))
|
|
}
|
|
|
|
/// Same as compute_with_check, potentially resulting in relative speeds of infinity
|
|
pub fn compute(
|
|
results: &[BenchmarkResult],
|
|
sort_order: SortOrder,
|
|
) -> Vec<BenchmarkResultWithRelativeSpeed<'_>> {
|
|
let fastest = fastest_of(results);
|
|
|
|
compute_relative_speeds(results, fastest, sort_order)
|
|
}
|
|
|
|
#[cfg(test)]
|
|
fn create_result(name: &str, mean: f64) -> BenchmarkResult {
|
|
use std::collections::BTreeMap;
|
|
|
|
use crate::benchmark::measurement::{Measurement, Measurements};
|
|
use crate::quantity::{second, Time};
|
|
|
|
BenchmarkResult {
|
|
command: name.into(),
|
|
command_with_unused_parameters: name.into(),
|
|
measurements: Measurements {
|
|
measurements: vec![Measurement {
|
|
time_wall_clock: Time::new::<second>(mean),
|
|
time_user: Time::new::<second>(mean),
|
|
..Default::default()
|
|
}],
|
|
},
|
|
parameters: BTreeMap::new(),
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn test_compute_relative_speed() {
|
|
use approx::assert_relative_eq;
|
|
|
|
let results = vec![
|
|
create_result("cmd1", 3.0),
|
|
create_result("cmd2", 2.0),
|
|
create_result("cmd3", 5.0),
|
|
];
|
|
|
|
let annotated_results = compute_with_check(&results, SortOrder::Command).unwrap();
|
|
|
|
assert_relative_eq!(1.5, annotated_results[0].relative_speed);
|
|
assert_relative_eq!(1.0, annotated_results[1].relative_speed);
|
|
assert_relative_eq!(2.5, annotated_results[2].relative_speed);
|
|
}
|
|
|
|
#[test]
|
|
fn test_compute_relative_speed_with_reference() {
|
|
use approx::assert_relative_eq;
|
|
|
|
let results = vec![create_result("cmd2", 2.0), create_result("cmd3", 5.0)];
|
|
let reference = create_result("cmd2", 4.0);
|
|
|
|
let annotated_results =
|
|
compute_with_check_from_reference(&results, &reference, SortOrder::Command).unwrap();
|
|
|
|
assert_relative_eq!(2.0, annotated_results[0].relative_speed);
|
|
assert_relative_eq!(1.25, annotated_results[1].relative_speed);
|
|
}
|
|
|
|
#[test]
|
|
fn test_compute_relative_speed_for_zero_times() {
|
|
let results = vec![create_result("cmd1", 1.0), create_result("cmd2", 0.0)];
|
|
|
|
let annotated_results = compute_with_check(&results, SortOrder::Command);
|
|
|
|
assert!(annotated_results.is_none());
|
|
}
|