pub struct PathFollowing {
pub max_steps: usize,
pub continuation: PseudoArcLengthContinuation,
}Expand description
Generic path-following algorithm with event detection.
Runs pseudo-arclength continuation for up to max_steps steps,
detecting fold and bifurcation events along the way.
Fields§
§max_steps: usizeMaximum number of continuation steps.
continuation: PseudoArcLengthContinuationContinuation stepper configuration.
Implementations§
Source§impl PathFollowing
impl PathFollowing
Sourcepub fn new(max_steps: usize, continuation: PseudoArcLengthContinuation) -> Self
pub fn new(max_steps: usize, continuation: PseudoArcLengthContinuation) -> Self
Create a new path follower.
Auto Trait Implementations§
impl Freeze for PathFollowing
impl RefUnwindSafe for PathFollowing
impl Send for PathFollowing
impl Sync for PathFollowing
impl Unpin for PathFollowing
impl UnsafeUnpin for PathFollowing
impl UnwindSafe for PathFollowing
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.