use statrs::distribution::{Beta, ContinuousCDF};
use crate::error::VeridictError;
pub fn jeffreys_ci(successes: u64, n: u64, confidence: f64) -> Result<(f64, f64), VeridictError> {
if !confidence.is_finite() || confidence <= 0.0 || confidence >= 1.0 {
return Err(VeridictError::InvalidConfidence(confidence));
}
if n == 0 || successes > n {
return Err(VeridictError::InvalidThreshold(format!(
"Jeffreys interval requires 0 <= successes <= trials and trials > 0, got \
successes={successes}, trials={n}"
)));
}
let alpha = 1.0 - confidence;
let x = successes as f64;
let n_f = n as f64;
let posterior = Beta::new(x + 0.5, n_f - x + 0.5)
.expect("jeffreys_ci: x + 0.5 and n - x + 0.5 are always positive for x in 0..=n");
let lower = if successes == 0 {
0.0
} else {
posterior.inverse_cdf(alpha / 2.0)
};
let upper = if successes == n {
1.0
} else {
posterior.inverse_cdf(1.0 - alpha / 2.0)
};
Ok((lower, upper))
}
#[cfg(test)]
mod tests {
use super::*;
fn assert_close(actual: f64, expected: f64, tol: f64) {
assert!(
(actual - expected).abs() < tol,
"expected {expected}, got {actual}"
);
}
#[test]
fn matches_verified_table() {
let cases = [
(5, 20, 0.95, (0.102398, 0.464195)),
(0, 10, 0.95, (0.000000, 0.217196)),
(50, 100, 0.95, (0.403174, 0.596826)),
(100, 100, 0.95, (0.975255, 1.000000)),
(1, 1, 0.95, (0.146746, 1.000000)),
(0, 1, 0.95, (0.000000, 0.853254)),
(7, 7, 0.99, (0.581439, 1.000000)),
];
for (x, n, confidence, (expected_lo, expected_hi)) in cases {
let (lo, hi) = jeffreys_ci(x, n, confidence).unwrap();
assert_close(lo, expected_lo, 1e-6);
assert_close(hi, expected_hi, 1e-6);
}
}
#[test]
fn rejects_invalid_confidence() {
for c in [0.0, 1.0, -0.5, 1.5, f64::NAN, f64::INFINITY] {
assert!(matches!(
jeffreys_ci(5, 10, c),
Err(VeridictError::InvalidConfidence(_))
));
}
}
#[test]
fn rejects_invalid_counts_without_panicking() {
assert!(jeffreys_ci(0, 0, 0.95).is_err());
assert!(jeffreys_ci(11, 10, 0.95).is_err());
}
#[test]
fn x_eq_n_eq_one_matches_closed_form_beta_quantile() {
let (lo, hi) = jeffreys_ci(1, 1, 0.95).unwrap();
assert_close(hi, 1.0, 1e-9);
let f = |x: f64| (2.0 / std::f64::consts::PI) * (x.sqrt().asin() - (x * (1.0 - x)).sqrt());
assert_close(f(lo), 0.025, 1e-9);
}
#[test]
fn x_eq_zero_n_eq_one_matches_closed_form_beta_quantile() {
let (lo, hi) = jeffreys_ci(0, 1, 0.95).unwrap();
assert_close(lo, 0.0, 1e-9);
let g = |x: f64| (2.0 / std::f64::consts::PI) * (x.sqrt().asin() + (x * (1.0 - x)).sqrt());
assert_close(g(hi), 0.975, 1e-9);
}
#[test]
fn symmetry_swaps_x_and_n_minus_x() {
let (x, n, c) = (5, 20, 0.95);
let (lo1, hi1) = jeffreys_ci(x, n, c).unwrap();
let (lo2, hi2) = jeffreys_ci(n - x, n, c).unwrap();
assert_close(lo1, 1.0 - hi2, 1e-9);
assert_close(hi1, 1.0 - lo2, 1e-9);
}
#[test]
fn all_wins_clamps_high_to_one() {
let (lo, hi) = jeffreys_ci(9, 9, 0.95).unwrap();
assert_close(hi, 1.0, 1e-9);
assert!(lo > 0.0 && lo < 1.0);
}
#[test]
fn all_losses_clamps_low_to_zero() {
let (lo, hi) = jeffreys_ci(0, 9, 0.95).unwrap();
assert_close(lo, 0.0, 1e-9);
assert!(hi > 0.0 && hi < 1.0);
}
#[test]
fn width_between_wilson_and_exact_for_interior_p() {
let (x, n, c) = (50, 100, 0.95);
let (w_lo, w_hi) = crate::stats::wilson::wilson_ci(x, n, c).unwrap();
let (j_lo, j_hi) = jeffreys_ci(x, n, c).unwrap();
let (cp_lo, cp_hi) = crate::stats::exact::clopper_pearson_ci(x, n, c).unwrap();
assert!((w_hi - w_lo) <= (j_hi - j_lo));
assert!((j_hi - j_lo) <= (cp_hi - cp_lo));
}
}