use super::DissimilarityMatrixView;
use crate::{Error, Result};
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub enum MetricPolicy {
Check,
Assume,
Unchecked,
}
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub enum MetricValidation {
Checked,
Assumed,
Unchecked,
}
pub fn validate_metric(
input: DissimilarityMatrixView<'_>,
policy: MetricPolicy,
) -> Result<MetricValidation> {
validate_metric_with(input.len(), policy, |a, b| Ok(input.get(a, b).unwrap()))
}
pub(crate) fn validate_metric_with(
n: usize,
policy: MetricPolicy,
mut distance: impl FnMut(usize, usize) -> Result<f64>,
) -> Result<MetricValidation> {
validate_metric_with_checkpoints(n, policy, &mut distance, &mut || Ok(()))
}
pub(crate) fn validate_metric_with_checkpoints(
n: usize,
policy: MetricPolicy,
mut distance: impl FnMut(usize, usize) -> Result<f64>,
checkpoint: &mut impl FnMut() -> Result<()>,
) -> Result<MetricValidation> {
match policy {
MetricPolicy::Assume => return Ok(MetricValidation::Assumed),
MetricPolicy::Unchecked => return Ok(MetricValidation::Unchecked),
MetricPolicy::Check => {}
}
for c in 0..n {
for b in 0..c {
for a in 0..b {
let x = distance(a, b)?;
let y = distance(a, c)?;
let z = distance(b, c)?;
for (long, first, second) in [(x, y, z), (y, x, z), (z, x, y)] {
checkpoint()?;
if exceeds_sum(long, first, second) {
return Err(Error::InvalidMetric {
vertices: [a, b, c],
});
}
}
}
}
}
Ok(MetricValidation::Checked)
}
fn exceeds_sum(c: f64, a: f64, b: f64) -> bool {
let hi = a.max(b);
let lo = a.min(b);
let sum = hi + lo;
if !sum.is_finite() {
return false;
}
let error = lo - (sum - hi);
c > sum || (c == sum && error < 0.0)
}