use ferrochart_core::error::{Error, Result};
#[derive(Clone, Copy, Debug, PartialEq)]
pub struct PriceLevels {
step: f64,
}
impl PriceLevels {
pub fn new(tick_size: f64, row_size: u32) -> Result<Self> {
let step = tick_size * f64::from(row_size);
if !(tick_size.is_finite() && tick_size > 0.0) || row_size == 0 || !step.is_finite() {
return Err(Error::InvalidArgument(
"tick_size must be finite and positive, row_size at least 1",
));
}
Ok(Self { step })
}
pub fn step(&self) -> f64 {
self.step
}
pub fn level(&self, price: f64) -> Option<i32> {
let l = (price / self.step + 0.5).floor();
(l.is_finite() && l >= f64::from(i32::MIN) && l <= f64::from(i32::MAX)).then_some(l as i32)
}
pub fn price(&self, level: i32) -> f64 {
f64::from(level) * self.step
}
pub fn edges(&self, level: i32) -> (f64, f64) {
let p = self.price(level);
(p - self.step / 2.0, p + self.step / 2.0)
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn rejects_bad_grids() {
for (tick, rows) in [
(0.0, 1),
(-1.0, 1),
(f64::NAN, 1),
(f64::INFINITY, 1),
(1.0, 0),
] {
assert!(PriceLevels::new(tick, rows).is_err(), "{tick} {rows}");
}
let l = PriceLevels::new(1.0, 1).unwrap();
assert_eq!(l.level(f64::NAN), None);
assert_eq!(l.level(1e300), None);
assert_eq!(l.level(-0.6), Some(-1));
assert_eq!(l.level(-0.5), Some(0));
}
}