pub struct Checkpointing<'a, Eqn, Method>where
Method: OdeSolverMethod<'a, Eqn>,
Eqn: OdeEquations,{ /* private fields */ }
Implementations§
Source§impl<'a, Eqn, Method> Checkpointing<'a, Eqn, Method>where
Method: OdeSolverMethod<'a, Eqn>,
Eqn: OdeEquations,
impl<'a, Eqn, Method> Checkpointing<'a, Eqn, Method>where
Method: OdeSolverMethod<'a, Eqn>,
Eqn: OdeEquations,
pub fn new( solver: Method, start_idx: usize, checkpoints: Vec<Method::State>, segment: Option<HermiteInterpolator<Eqn::V>>, ) -> Self
pub fn last_t(&self) -> Eqn::T
pub fn last_h(&self) -> Option<Eqn::T>
pub fn problem(&self) -> &'a OdeSolverProblem<Eqn>
pub fn interpolate(&self, t: Eqn::T, y: &mut Eqn::V) -> Result<(), DiffsolError>
Trait Implementations§
Source§impl<'a, Eqn, Method> Clone for Checkpointing<'a, Eqn, Method>where
Method: OdeSolverMethod<'a, Eqn>,
Eqn: OdeEquations,
impl<'a, Eqn, Method> Clone for Checkpointing<'a, Eqn, Method>where
Method: OdeSolverMethod<'a, Eqn>,
Eqn: OdeEquations,
Auto Trait Implementations§
impl<'a, Eqn, Method> !Freeze for Checkpointing<'a, Eqn, Method>
impl<'a, Eqn, Method> !RefUnwindSafe for Checkpointing<'a, Eqn, Method>
impl<'a, Eqn, Method> Send for Checkpointing<'a, Eqn, Method>
impl<'a, Eqn, Method> !Sync for Checkpointing<'a, Eqn, Method>
impl<'a, Eqn, Method> Unpin for Checkpointing<'a, Eqn, Method>
impl<'a, Eqn, Method> UnwindSafe for Checkpointing<'a, Eqn, Method>where
Method: UnwindSafe,
<Method as OdeSolverMethod<'a, Eqn>>::State: UnwindSafe,
<Eqn as Op>::V: UnwindSafe,
<Eqn as Op>::T: UnwindSafe,
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<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
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.