Struct Machine 

pub struct Machine { /* private fields */ }

One compiled node and every call site’s state, run over any span of the grid in order. A span continues exactly where the last ended, so blocks write the samples one run would.

Implementations

impl Machine

pub fn over(spanned: &Spanned, at: i64) -> Result<Machine, SampleError>

Stepping from at, each span’s own program from where it starts.

pub fn width(&self) -> usize

pub fn stateful(&self) -> bool

pub fn bytes(&self) -> usize

pub fn run_to( &mut self, to: i64, reads: &[Window<'_>], own: &mut Tape, ) -> Result<(), SampleError>

pub fn run_on( &mut self, to: i64, reads: &[Window<'_>], own: &mut Tape, ) -> Result<(), SampleError>

run_to, the filters’ frames kept.

pub fn solver(&self, site: usize) -> Option<&dyn Solver>

Call site site’s solver as it stands now, where that site is one.

pub fn filter(&self, site: usize) -> Option<&FilterSite>

pub fn state(&self) -> MachineState

pub fn restart(&mut self)

pub fn accepts(&self, held: &MachineState) -> bool

Whether carry takes held: the same sites, a varying parameter’s values aside.

pub fn carry(&mut self, held: &MachineState) -> bool

Takes held’s state whole where its sites are these; false, and nothing taken, else.