EventSolout

Struct EventSolout 

Source
pub struct EventSolout<'a, T: Real, Y: State<T>, E: Event<T, Y>> { /* private fields */ }
Expand description

Solout implementation that evaluates user-provided Event objects similar to SciPy events.

The EventSolout monitors the sign of event.event(t, y) across solver steps. When a sign change consistent with the configured CrossingDirection is detected, a Brent-Dekker root finding procedure is applied (using the solver’s interpolation) to locate the event time with high accuracy. The event point (t_event, y_event) is then appended to the solution. Depending on the EventConfig::terminate setting the integration may terminate after collecting the specified number of events.

Implementations§

Source§

impl<'a, T: Real, Y: State<T>, E: Event<T, Y>> EventSolout<'a, T, Y, E>

Source

pub fn new(event: &'a E, t0: T, tf: T) -> Self

Trait Implementations§

Source§

impl<'a, T, Y, E> Solout<T, Y> for EventSolout<'a, T, Y, E>
where T: Real, Y: State<T>, E: Event<T, Y>,

Source§

fn solout<I>( &mut self, t_curr: T, t_prev: T, y_curr: &Y, y_prev: &Y, interpolator: &mut I, solution: &mut Solution<T, Y>, ) -> ControlFlag<T, Y>
where I: Interpolation<T, Y>,

Solout function to choose which points to output during the solving process. Read more

Auto Trait Implementations§

§

impl<'a, T, Y, E> Freeze for EventSolout<'a, T, Y, E>
where T: Freeze,

§

impl<'a, T, Y, E> RefUnwindSafe for EventSolout<'a, T, Y, E>

§

impl<'a, T, Y, E> Send for EventSolout<'a, T, Y, E>
where E: Sync, Y: Send,

§

impl<'a, T, Y, E> Sync for EventSolout<'a, T, Y, E>
where E: Sync, Y: Sync,

§

impl<'a, T, Y, E> Unpin for EventSolout<'a, T, Y, E>
where T: Unpin, Y: Unpin,

§

impl<'a, T, Y, E> UnwindSafe for EventSolout<'a, T, Y, E>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.