use std::cmp::Ordering;
pub(super) fn find_interval<T: PartialOrd + Copy>(x_data: &[T], x: &T) -> Option<usize> {
match x_data.binary_search_by(|p| {
if p < x {
Ordering::Less
} else if p > x {
Ordering::Greater
} else {
Ordering::Equal
}
}) {
Ok(idx) => Some(idx.min(x_data.len().saturating_sub(2))),
Err(idx) => {
if idx == 0 || idx >= x_data.len() {
None
} else {
Some(idx - 1)
}
}
}
}