Struct DiffsolTimeBackend
pub struct DiffsolTimeBackend;Description
Stateless Diffsol adapter for admitted first-order time problems.
Implementations§
§impl DiffsolTimeBackend
impl DiffsolTimeBackend
pub const fn new() -> DiffsolTimeBackend
pub const fn new() -> DiffsolTimeBackend
Construct the stateless adapter.
pub fn admit(
&self,
equation_class: TimeEquationClass,
method: TimeMethod,
) -> Result<(), Diagnostic>
pub fn admit( &self, equation_class: TimeEquationClass, method: TimeMethod, ) -> Result<(), Diagnostic>
Check one equation-class/method pair without constructing a problem.
Tsitouras 5(4) admits only explicit ODEs. BDF admits ODEs and full- or rank-deficient mass matrices. A general implicit DAE is never rewritten to fit Diffsol’s first-order mass-matrix form.
§Errors
Returns EQ0807 when the pair is outside the adapter contract.
pub fn solve(
&self,
problem: &TimeProblem<'_>,
plan: &TimePlan,
) -> Result<TimeSolution, Diagnostic>
pub fn solve( &self, problem: &TimeProblem<'_>, plan: &TimePlan, ) -> Result<TimeSolution, Diagnostic>
Solve one validated first-order problem at the requested output times.
Internal adaptive steps are owned by Diffsol and do not replace Eqiora
model time or event ordering. Returned buffers are copied into an
Eqiora-owned TimeSolution.
§Errors
Returns stable Eqiora diagnostics for admission, callback, setup, or integration failures.
pub fn solve_forward_sensitivities(
&self,
problem: &ForwardSensitivityProblem<'_>,
plan: &TimePlan,
sensitivity_plan: &ForwardSensitivityPlan,
) -> Result<ForwardSensitivitySolution, Diagnostic>
pub fn solve_forward_sensitivities( &self, problem: &ForwardSensitivityProblem<'_>, plan: &TimePlan, sensitivity_plan: &ForwardSensitivityPlan, ) -> Result<ForwardSensitivitySolution, Diagnostic>
Integrate continuous forward sensitivities from the same primal/JVP seam.
Parameter effects enter as f_p dp and y0_p dp actions supplied by
eqiora_time::ParametricTimeSystem. Mass-matrix problems are admitted
only after that contract proves M_p dp = 0; no dual-number simulator
or Diffsol type enters the public contract.
§Errors
Returns a stable diagnostic for invalid controls, unsupported equation/method pairs, callback failures, or integration failures.
pub fn propose_first_root(
&self,
problem: &TimeProblem<'_>,
roots: &RegisteredRootProblem<'_>,
plan: &TimePlan,
) -> Result<Option<RootProposal>, Diagnostic>
pub fn propose_first_root( &self, problem: &TimeProblem<'_>, roots: &RegisteredRootProblem<'_>, plan: &TimePlan, ) -> Result<Option<RootProposal>, Diagnostic>
Localize the first zero crossing before the plan’s final output time.
The result is only a numerical proposal. Root direction, simultaneous
grouping, priority, and reset commit are owned by Eqiora’s hybrid
scheduler. A reset therefore restarts the same TimeProblem explicitly
rather than invoking Diffsol’s automatic-reset semantics.
The first admitted slice is an explicit ODE; Ok(None) means the search
horizon was reached without a root.
§Errors
Returns stable admission, callback, setup, and integration diagnostics.
Trait Implementations§
§impl Clone for DiffsolTimeBackend
impl Clone for DiffsolTimeBackend
§impl Debug for DiffsolTimeBackend
impl Debug for DiffsolTimeBackend
§impl Default for DiffsolTimeBackend
impl Default for DiffsolTimeBackend
§fn default() -> DiffsolTimeBackend
fn default() -> DiffsolTimeBackend
impl Copy for DiffsolTimeBackend
Auto Trait Implementations§
impl Freeze for DiffsolTimeBackend
impl RefUnwindSafe for DiffsolTimeBackend
impl Send for DiffsolTimeBackend
impl Sync for DiffsolTimeBackend
impl Unpin for DiffsolTimeBackend
impl UnsafeUnpin for DiffsolTimeBackend
impl UnwindSafe for DiffsolTimeBackend
Blanket Implementations§
Source§impl<T> Any for Twhere
T: 'static + ?Sized,
impl<T> Any for Twhere
T: 'static + ?Sized,
§impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
§fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
§impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
§type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
§fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
Source§impl<T> Borrow<T> for Twhere
T: ?Sized,
impl<T> Borrow<T> for Twhere
T: ?Sized,
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T, Dst> ConvAsUtil<Dst> for T
impl<T, Dst> ConvAsUtil<Dst> for T
§fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§impl<T> ConvUtil for T
impl<T> ConvUtil for T
§fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
§fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
§fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> Twhere
Self: Distribution<T>,
Source§impl<T> From<T> for T
impl<T> From<T> for T
Source§impl<T, U> Into<U> for Twhere
U: From<T>,
impl<T, U> Into<U> for Twhere
U: From<T>,
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>
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>where
F: FnOnce(&Self) -> bool,
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where
F: FnOnce(&Self) -> bool,
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 more§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> Same for T
impl<T> Same for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.