use crate::vol::ReadVol; use vek::*; pub trait RayForEach = FnMut(&V, Vec3); pub struct Ray<'a, V: ReadVol, F: FnMut(&V::Vox) -> bool, G: RayForEach> { vol: &'a V, from: Vec3, to: Vec3, until: F, for_each: Option, max_iter: usize, ignore_error: bool, } impl<'a, V, F, G> Ray<'a, V, F, G> where V: ReadVol, F: FnMut(&V::Vox) -> bool, G: RayForEach, { pub fn new(vol: &'a V, from: Vec3, to: Vec3, until: F) -> Self { Self { vol, from, to, until, for_each: None, max_iter: 100, ignore_error: false, } } pub fn until bool>(self, f: H) -> Ray<'a, V, H, G> { Ray { vol: self.vol, from: self.from, to: self.to, until: f, for_each: self.for_each, max_iter: self.max_iter, ignore_error: self.ignore_error, } } pub fn for_each>(self, f: H) -> Ray<'a, V, F, H> { Ray { for_each: Some(f), vol: self.vol, from: self.from, to: self.to, until: self.until, max_iter: self.max_iter, ignore_error: self.ignore_error, } } #[must_use] pub fn max_iter(mut self, max_iter: usize) -> Self { self.max_iter = max_iter; self } #[must_use] pub fn ignore_error(mut self) -> Self { self.ignore_error = true; self } pub fn cast(mut self) -> (f32, Result, V::Error>) { // TODO: Fully test this! const PLANCK: f32 = 0.001; let mut dist = 0.0; let dir = (self.to - self.from).normalized(); let max = (self.to - self.from).magnitude(); for _ in 0..self.max_iter { // Allow one iteration above max. if dist > max { break; } let pos = self.from + dir * dist; let ipos = pos.map(|e| e.floor() as i32); let vox = self.vol.get(ipos); // for_each if let Some(g) = &mut self.for_each { if let Ok(vox) = vox { g(vox, ipos); } } match vox.map(|vox| (vox, (self.until)(vox))) { Ok((vox, true)) => return (dist, Ok(Some(vox))), Err(err) if !self.ignore_error => return (dist, Err(err)), _ => {}, } let deltas = (dir.map(|e| if e < 0.0 { 0.0 } else { 1.0 }) - pos.map(|e| e.abs().fract())) / dir; dist += deltas.reduce(f32::min).max(PLANCK); } // The ray can go over the maximum magnitude in the last iteration dist = dist.min(max); (dist, Ok(None)) } }