pub mod cubic_spline;
pub mod lagrange;
pub mod linear;
mod search;
pub mod spatial;
pub use cubic_spline::CubicSplineInterpolation;
pub use lagrange::LagrangeInterpolation;
pub use linear::LinearInterpolation;
pub use spatial::{bilinear, bilinear_index_space, trilinear, trilinear_index_space};
use eunomia::RealField;
use leto::{LetoError, Result};
pub trait Interpolation1D<T: RealField>: Send + Sync {
fn interpolate(&self, x: T) -> Result<T>;
fn bounds(&self) -> (T, T);
fn interpolate_many(&self, xs: &[T]) -> Result<Vec<T>> {
xs.iter().map(|&x| self.interpolate(x)).collect()
}
}
pub(super) fn check_bounds<T: RealField>(x: T, lo: T, hi: T) -> Result<()> {
if x < lo || x > hi {
Err(LetoError::InvalidInput(
"query point is outside the data range".into(),
))
} else {
Ok(())
}
}
pub(super) fn validate_nodes<T: RealField>(x_data: &[T], min_len: usize) -> Result<()> {
if x_data.len() < min_len {
return Err(LetoError::InvalidInput(format!(
"Need at least {min_len} points for interpolation"
)));
}
if !x_data.windows(2).all(|w| w[0] < w[1]) {
return Err(LetoError::InvalidInput(
"x_data must be strictly increasing (no duplicate nodes)".into(),
));
}
Ok(())
}