Struct ImplicitTimeInitialDataEnvelopeV1
pub struct ImplicitTimeInitialDataEnvelopeV1 { /* private fields */ }Description
Versioned initial state/derivative data linked to one residual-native lowering.
A consistency-solve input and the accepted consistent pair are separate artifacts. This keeps backend output from silently replacing the supplied guess in run provenance.
Implementations§
§impl ImplicitTimeInitialDataEnvelopeV1
impl ImplicitTimeInitialDataEnvelopeV1
pub fn from_problem(
lowering: &GeneralImplicitTimeLoweringEnvelopeV1,
problem: &ImplicitDaeProblem<'_>,
) -> Result<ImplicitTimeInitialDataEnvelopeV1, Diagnostic>
pub fn from_problem( lowering: &GeneralImplicitTimeLoweringEnvelopeV1, problem: &ImplicitDaeProblem<'_>, ) -> Result<ImplicitTimeInitialDataEnvelopeV1, Diagnostic>
Capture the initial pair or consistency-solve guess from a validated residual-native problem.
§Errors
Returns EQ0901 if dimension or variable partition differs from the
linked lowering.
pub fn from_initialization(
lowering: &GeneralImplicitTimeLoweringEnvelopeV1,
initialization: &ImplicitDaeInitialization,
) -> Result<ImplicitTimeInitialDataEnvelopeV1, Diagnostic>
pub fn from_initialization( lowering: &GeneralImplicitTimeLoweringEnvelopeV1, initialization: &ImplicitDaeInitialization, ) -> Result<ImplicitTimeInitialDataEnvelopeV1, Diagnostic>
Capture one backend-accepted consistent initial pair.
§Errors
Returns EQ0901 if the accepted pair dimension differs from the linked
lowering.
pub fn from_checkpoint(
lowering: &GeneralImplicitTimeLoweringEnvelopeV1,
checkpoint: &ImplicitTimeCheckpointEnvelopeV1,
program: &KernelProgram,
) -> Result<ImplicitTimeInitialDataEnvelopeV1, Diagnostic>
pub fn from_checkpoint( lowering: &GeneralImplicitTimeLoweringEnvelopeV1, checkpoint: &ImplicitTimeCheckpointEnvelopeV1, program: &KernelProgram, ) -> Result<ImplicitTimeInitialDataEnvelopeV1, Diagnostic>
Convert one independently replayed accepted checkpoint into provided restart data.
§Errors
Returns EQ0901 if checkpoint content or canonical Operator-IR linkage
does not match the lowering/program pair.
pub fn from_json(
bytes: &[u8],
limits: TimeDecoderLimits,
) -> Result<ImplicitTimeInitialDataEnvelopeV1, Diagnostic>
pub fn from_json( bytes: &[u8], limits: TimeDecoderLimits, ) -> Result<ImplicitTimeInitialDataEnvelopeV1, Diagnostic>
Decode and locally validate initial data.
§Errors
Returns EQ0901 for oversized, malformed, unknown-version,
shape-mismatched, or non-finite data.
pub fn canonical_json(&self) -> Result<Vec<u8>, Diagnostic>
pub fn canonical_json(&self) -> Result<Vec<u8>, Diagnostic>
pub fn digest(&self) -> Result<ArtifactDigest, Diagnostic>
pub fn digest(&self) -> Result<ArtifactDigest, Diagnostic>
Domain-separated SHA-256 identity of this complete initial data.
§Errors
Returns EQ0901 if canonical serialization fails.
pub fn model_artifact(&self) -> ArtifactDigest
pub fn model_artifact(&self) -> ArtifactDigest
Referenced canonical model artifact.
pub fn lowering(&self) -> ArtifactDigest
pub fn lowering(&self) -> ArtifactDigest
Referenced residual-native lowering witness.
pub const fn semantic_revision(&self) -> u64
pub const fn semantic_revision(&self) -> u64
Semantic graph revision shared with the linked lowering.
pub const fn initial_condition(&self) -> InitialConditionPolicy
pub const fn initial_condition(&self) -> InitialConditionPolicy
Initial-condition treatment attached to these values.
pub fn derivative(&self) -> &[f64]
pub fn derivative(&self) -> &[f64]
Initial derivative or consistency-solve guess.
pub fn validate_against(
&self,
lowering: &GeneralImplicitTimeLoweringEnvelopeV1,
) -> Result<(), Diagnostic>
pub fn validate_against( &self, lowering: &GeneralImplicitTimeLoweringEnvelopeV1, ) -> Result<(), Diagnostic>
Revalidate lowering/model/revision linkage and state dimension.
§Errors
Returns EQ0901 for any linkage or shape drift.
Trait Implementations§
§impl Clone for ImplicitTimeInitialDataEnvelopeV1
impl Clone for ImplicitTimeInitialDataEnvelopeV1
§impl Debug for ImplicitTimeInitialDataEnvelopeV1
impl Debug for ImplicitTimeInitialDataEnvelopeV1
§impl PartialEq for ImplicitTimeInitialDataEnvelopeV1
impl PartialEq for ImplicitTimeInitialDataEnvelopeV1
§fn eq(&self, other: &ImplicitTimeInitialDataEnvelopeV1) -> bool
fn eq(&self, other: &ImplicitTimeInitialDataEnvelopeV1) -> bool
self and other values to be equal, and is used by ==.impl StructuralPartialEq for ImplicitTimeInitialDataEnvelopeV1
Auto Trait Implementations§
impl Freeze for ImplicitTimeInitialDataEnvelopeV1
impl RefUnwindSafe for ImplicitTimeInitialDataEnvelopeV1
impl Send for ImplicitTimeInitialDataEnvelopeV1
impl Sync for ImplicitTimeInitialDataEnvelopeV1
impl Unpin for ImplicitTimeInitialDataEnvelopeV1
impl UnsafeUnpin for ImplicitTimeInitialDataEnvelopeV1
impl UnwindSafe for ImplicitTimeInitialDataEnvelopeV1
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.