RootWalk
Defined in: boundary.rs:389
pub trait RootWalkA stepper that can be walked to a target, stopping at boundaries.
The three solvers answer the same three questions; this is what lets the walk below be written once.
Required Methods
Section titled “Required Methods”advance_to_roots()
Section titled “advance_to_roots()”fn advance_to_roots<F, E, B>(&mut self, t_target: f64, callback: F, check: E, roots: &mut RootSet<’_, <
::Sys as DynamicalSystem>::State> ) -> [Result<RootOutcome<B>, IntegrationError>](https://doc.rust-lang.org/std/result/enum.Result.html) where F: FnMut(f64, &<::Sys as DynamicalSystem>::State) , E: [Fn(f64, &<::Sys as DynamicalSystem>::State) -> ControlFlow<B>](https://doc.rust-lang.org/std/ops/function/trait.Fn.html)
Advance towards t_target, stopping at the first boundary in roots.
fn t(&self) -> f64
The time the stepper holds.
state()
Section titled “state()”fn state(&self) -> &<
::Sys as DynamicalSystem>::State
The state it holds.
into_state()
Section titled “into_state()”fn into_state(self) -> <
::Sys as DynamicalSystem>::State
Take that state.