use contracts::debug_ensures; use crate::{ board::{connectivity::BandIndex, Board}, draw::{Draw, DrawException}, layout::{ bend::LooseBendIndex, dot::FixedDotIndex, graph::{GetNet, MakePrimitive}, guide::{BareHead, Head, HeadTrait, SegbendHead}, rules::RulesTrait, }, mesh::{Mesh, VertexIndex}, }; #[derive(Debug)] pub struct Trace { pub path: Vec, pub head: Head, pub band: BandIndex, pub width: f64, } pub struct Tracer<'a, R: RulesTrait> { pub board: &'a mut Board, pub mesh: &'a Mesh, } impl<'a, R: RulesTrait> Tracer<'a, R> { pub fn new(board: &'a mut Board, mesh: &'a Mesh) -> Self { Tracer { board, mesh } } pub fn start(&mut self, from: FixedDotIndex, width: f64) -> Trace { let band = self.board.start_band(from); Trace { path: vec![from.into()], head: BareHead { dot: from }.into(), band, width, } } pub fn finish( &mut self, trace: &mut Trace, into: FixedDotIndex, width: f64, ) -> Result<(), DrawException> { self.draw().finish_in_dot(trace.head, into, width)?; Ok(self.board.finish_band(trace.band, into)) } #[debug_ensures(ret.is_ok() -> trace.path.len() == path.len())] pub fn rework_path( &mut self, trace: &mut Trace, path: &[VertexIndex], width: f64, ) -> Result<(), DrawException> { let prefix_length = trace .path .iter() .zip(path) .take_while(|(v1, v2)| v1 == v2) .count(); let length = trace.path.len(); self.undo_path(trace, length - prefix_length); self.path(trace, &path[prefix_length..], width) } #[debug_ensures(ret.is_ok() -> trace.path.len() == old(trace.path.len() + path.len()))] pub fn path( &mut self, trace: &mut Trace, path: &[VertexIndex], width: f64, ) -> Result<(), DrawException> { for (i, vertex) in path.iter().enumerate() { if let Err(err) = self.step(trace, *vertex, width) { self.undo_path(trace, i); return Err(err); } } Ok(()) } #[debug_ensures(trace.path.len() == old(trace.path.len() - step_count))] pub fn undo_path(&mut self, trace: &mut Trace, step_count: usize) { for _ in 0..step_count { self.undo_step(trace); } } #[debug_ensures(ret.is_ok() -> trace.path.len() == old(trace.path.len() + 1))] #[debug_ensures(ret.is_err() -> trace.path.len() == old(trace.path.len()))] pub fn step( &mut self, trace: &mut Trace, to: VertexIndex, width: f64, ) -> Result<(), DrawException> { trace.head = self.wrap(trace.head, to, width)?.into(); trace.path.push(to); Ok::<(), DrawException>(()) } fn wrap( &mut self, head: Head, around: VertexIndex, width: f64, ) -> Result { match around { VertexIndex::FixedDot(dot) => self.wrap_around_fixed_dot(head, dot, width), VertexIndex::FixedBend(_fixed_bend) => todo!(), VertexIndex::LooseBend(loose_bend) => { self.wrap_around_loose_bend(head, loose_bend, width) } } } fn wrap_around_fixed_dot( &mut self, head: Head, around: FixedDotIndex, width: f64, ) -> Result { let head = self.draw().segbend_around_dot(head, around.into(), width)?; Ok(head) } fn wrap_around_loose_bend( &mut self, head: Head, around: LooseBendIndex, width: f64, ) -> Result { let head = self .draw() .segbend_around_bend(head, around.into(), width)?; Ok(head) } #[debug_ensures(trace.path.len() == old(trace.path.len() - 1))] pub fn undo_step(&mut self, trace: &mut Trace) { if let Head::Segbend(head) = trace.head { trace.head = self.draw().undo_segbend(head).unwrap(); } else { panic!(); } trace.path.pop(); } fn draw(&mut self) -> Draw { Draw::new(&mut self.board) } }