pub struct OdeSolverProblem<Eqn: OdeEquations> {
pub eqn: Rc<Eqn>,
pub rtol: Eqn::T,
pub atol: Rc<Eqn::V>,
pub t0: Eqn::T,
pub h0: Eqn::T,
pub integrate_out: bool,
pub sens_rtol: Option<Eqn::T>,
pub sens_atol: Option<Rc<Eqn::V>>,
pub out_rtol: Option<Eqn::T>,
pub out_atol: Option<Rc<Eqn::V>>,
pub param_rtol: Option<Eqn::T>,
pub param_atol: Option<Rc<Eqn::V>>,
}
Fields§
§eqn: Rc<Eqn>
§rtol: Eqn::T
§atol: Rc<Eqn::V>
§t0: Eqn::T
§h0: Eqn::T
§integrate_out: bool
§sens_rtol: Option<Eqn::T>
§sens_atol: Option<Rc<Eqn::V>>
§out_rtol: Option<Eqn::T>
§out_atol: Option<Rc<Eqn::V>>
§param_rtol: Option<Eqn::T>
§param_atol: Option<Rc<Eqn::V>>
Implementations§
source§impl<Eqn: OdeEquations> OdeSolverProblem<Eqn>
impl<Eqn: OdeEquations> OdeSolverProblem<Eqn>
pub fn default_rtol() -> Eqn::T
pub fn default_atol(nstates: usize) -> Eqn::V
pub fn output_in_error_control(&self) -> bool
pub fn set_params(&mut self, p: Eqn::V) -> Result<(), DiffsolError>
Trait Implementations§
source§impl<Eqn: OdeEquations> Clone for OdeSolverProblem<Eqn>
impl<Eqn: OdeEquations> Clone for OdeSolverProblem<Eqn>
Auto Trait Implementations§
impl<Eqn> Freeze for OdeSolverProblem<Eqn>
impl<Eqn> RefUnwindSafe for OdeSolverProblem<Eqn>where
<Eqn as OdeEquations>::T: RefUnwindSafe,
Eqn: RefUnwindSafe,
<Eqn as OdeEquations>::V: RefUnwindSafe,
impl<Eqn> !Send for OdeSolverProblem<Eqn>
impl<Eqn> !Sync for OdeSolverProblem<Eqn>
impl<Eqn> Unpin for OdeSolverProblem<Eqn>
impl<Eqn> UnwindSafe for OdeSolverProblem<Eqn>where
<Eqn as OdeEquations>::T: UnwindSafe,
Eqn: RefUnwindSafe,
<Eqn as OdeEquations>::V: RefUnwindSafe,
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§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)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.