Struct FinalizedResolvedFixedTopologyAleFsi
pub struct FinalizedResolvedFixedTopologyAleFsi<const D: usize> { /* private fields */ }Description
Fully replayed canonical/Realization/numerical ALE trajectory input.
The value owns one immutable reference mesh, exact material partition, physical boundary closure, sealed harmonic map, derived initial geometry, dimension-appropriate simplex quadrature, and the unchanged common nonlinear/linear plans.
Implementations§
§impl<const D: usize> FinalizedResolvedFixedTopologyAleFsi<D>
impl<const D: usize> FinalizedResolvedFixedTopologyAleFsi<D>
pub fn verify_accepted_jacobian(
&self,
previous: &AleFsiState<D>,
accepted: &AleFsiState<D>,
) -> Result<(usize, usize, usize, usize, f64), Diagnostic>
pub fn verify_accepted_jacobian( &self, previous: &AleFsiState<D>, accepted: &AleFsiState<D>, ) -> Result<(usize, usize, usize, usize, f64), Diagnostic>
Verify the accepted step against this authenticated Model/Plan and mesh.
pub const fn model(&self) -> OntologyId<Model>
pub const fn model(&self) -> OntologyId<Model>
Exact Semantic Model identity admitted by the resolved plan.
pub const fn semantic_revision(&self) -> SemanticRevision
pub const fn semantic_revision(&self) -> SemanticRevision
Exact admitted Semantic Model revision.
pub const fn realization_revision(&self) -> RealizationRevision
pub const fn realization_revision(&self) -> RealizationRevision
Independently selected Realization revision.
pub const fn mesh_artifact(&self) -> MeshArtifactReference
pub const fn mesh_artifact(&self) -> MeshArtifactReference
Exact authenticated immutable-mesh content reference.
pub const fn fields(&self) -> AleFsiFieldIdentities<D>
pub const fn fields(&self) -> AleFsiFieldIdentities<D>
Canonical Field roles represented by the numerical state.
pub const fn realization_graph(&self) -> &PortableRealizationGraph
pub const fn realization_graph(&self) -> &PortableRealizationGraph
Portable nonlinear graph from the exact resolved Realization.
pub const fn motion(&self) -> &P1HarmonicMeshMotionAction<D>
pub const fn motion(&self) -> &P1HarmonicMeshMotionAction<D>
Sole sealed harmonic motion action, including its solve evidence.
pub const fn initial_state(&self) -> &AleFsiState<D>
pub const fn initial_state(&self) -> &AleFsiState<D>
Initial physical state with geometry derived by Self::motion.
pub const fn step_plan(&self) -> &AleFsiStepPlan<D>
pub const fn step_plan(&self) -> &AleFsiStepPlan<D>
Common nonlinear, linear, material, scale, and time-step policy.
§impl FinalizedResolvedFixedTopologyAleFsi<2>
impl FinalizedResolvedFixedTopologyAleFsi<2>
pub fn solve(
self,
step_count: NonZeroStepCount,
backend: &dyn LinearSolverBackend,
) -> Result<AleFsiTrajectory<2>, Diagnostic>
pub fn solve( self, step_count: NonZeroStepCount, backend: &dyn LinearSolverBackend, ) -> Result<AleFsiTrajectory<2>, Diagnostic>
Execute the exact finalized trajectory with reference assembly.
Step count remains a Run choice and is intentionally absent from the Realization.
§Errors
Preserves solver, nonlinear, geometry, assembly, and acceptance diagnostics.
§impl FinalizedResolvedFixedTopologyAleFsi<3>
impl FinalizedResolvedFixedTopologyAleFsi<3>
pub fn solve(
self,
step_count: NonZeroStepCount,
backend: &dyn LinearSolverBackend,
) -> Result<AleFsiTrajectory<3>, Diagnostic>
pub fn solve( self, step_count: NonZeroStepCount, backend: &dyn LinearSolverBackend, ) -> Result<AleFsiTrajectory<3>, Diagnostic>
Execute the exact finalized trajectory with reference assembly.
Step count remains a Run choice and is intentionally absent from the Realization.
§Errors
Preserves solver, nonlinear, geometry, assembly, and acceptance diagnostics.
Trait Implementations§
§impl<const D: usize> Clone for FinalizedResolvedFixedTopologyAleFsi<D>
impl<const D: usize> Clone for FinalizedResolvedFixedTopologyAleFsi<D>
§impl<const D: usize> Debug for FinalizedResolvedFixedTopologyAleFsi<D>
impl<const D: usize> Debug for FinalizedResolvedFixedTopologyAleFsi<D>
§impl<const D: usize> PartialEq for FinalizedResolvedFixedTopologyAleFsi<D>
impl<const D: usize> PartialEq for FinalizedResolvedFixedTopologyAleFsi<D>
§fn eq(&self, other: &FinalizedResolvedFixedTopologyAleFsi<D>) -> bool
fn eq(&self, other: &FinalizedResolvedFixedTopologyAleFsi<D>) -> bool
self and other values to be equal, and is used by ==.impl<const D: usize> StructuralPartialEq for FinalizedResolvedFixedTopologyAleFsi<D>
Auto Trait Implementations§
impl<const D: usize> Freeze for FinalizedResolvedFixedTopologyAleFsi<D>
impl<const D: usize> RefUnwindSafe for FinalizedResolvedFixedTopologyAleFsi<D>
impl<const D: usize> Send for FinalizedResolvedFixedTopologyAleFsi<D>
impl<const D: usize> Sync for FinalizedResolvedFixedTopologyAleFsi<D>
impl<const D: usize> Unpin for FinalizedResolvedFixedTopologyAleFsi<D>
impl<const D: usize> UnsafeUnpin for FinalizedResolvedFixedTopologyAleFsi<D>
impl<const D: usize> UnwindSafe for FinalizedResolvedFixedTopologyAleFsi<D>
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
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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.