Struct FinalizedScalarEllipticCartesianProblem
pub struct FinalizedScalarEllipticCartesianProblem { /* private fields */ }Description
Finalized algebraic handoff for one resolved Cartesian scalar-elliptic realization.
The public boundary is deliberately method-neutral: an execution adapter
sees the immutable sparse system, asserted operator properties, sole
SolverPlan, and assembly evidence. FEM constraint recovery and TPFA
reconstruction remain opaque until an independently accepted
LinearSolution is returned.
Implementations§
§impl FinalizedScalarEllipticCartesianProblem
impl FinalizedScalarEllipticCartesianProblem
pub const fn method(&self) -> DiscretizationMethod
pub const fn method(&self) -> DiscretizationMethod
Numerical method whose method-native state is retained opaquely.
pub const fn portable_realization(&self) -> &PortableRealizationGraph
pub const fn portable_realization(&self) -> &PortableRealizationGraph
Equation-aware portable graph independently regenerated and checked by the finalizer that owns this exact canonical system.
pub fn operator_properties(&self) -> LinearOperatorProperties
pub fn operator_properties(&self) -> LinearOperatorProperties
Mathematical properties asserted by this resolved realization.
pub const fn solver_plan(&self) -> SolverPlan
pub const fn solver_plan(&self) -> SolverPlan
Exact backend-neutral solver policy selected by the Realization.
pub const fn vector_layout(&self) -> VectorLayoutKind
pub const fn vector_layout(&self) -> VectorLayoutKind
Replicated or explicitly distributed vector layout admitted by the resolved Realization.
pub fn canonical_csr_system_view(&self) -> &CanonicalCsrSystemView
pub fn canonical_csr_system_view(&self) -> &CanonicalCsrSystemView
Borrow the single captured complete-CSR mathematical source.
Distributed layout derivation and its execution adapter must consume this exact view. The view also supplies the host problem used by this handoff, so raw storage, distributed shards, and residual acceptance cannot select independent operator actions.
pub const fn assembly_report(&self) -> &AssemblyReport
pub const fn assembly_report(&self) -> &AssemblyReport
Accepted assembly placement and packet-shape evidence.
pub fn linear_problem(&self) -> Result<LinearProblem<'_>, Diagnostic>
pub fn linear_problem(&self) -> Result<LinearProblem<'_>, Diagnostic>
Borrow the finalized system through the common solver problem contract.
§Errors
Returns EQ0802 only if the already captured canonical view
contradicts its construction invariants.
pub fn finish(
self,
solution: LinearSolution,
) -> Result<ResolvedScalarEllipticCartesianSolution, Diagnostic>
pub fn finish( self, solution: LinearSolution, ) -> Result<ResolvedScalarEllipticCartesianSolution, Diagnostic>
Numerically reaccept and reconstruct one solution against this finalized problem.
Validation is intentionally repeated at the handoff. This proves that the supplied vector satisfies these finalized arrays under the selected plan and topology; it does not prove which system originally produced the vector. A vector that satisfies two systems is admissible to both. Durable system identity is deferred to artifact persistence.
§Errors
Returns EQ0807 for cross-wired plan/topology evidence and EQ0802
when the values do not satisfy the finalized system or its bounded
verification/reconstruction storage cannot be reserved.
Trait Implementations§
§impl Clone for FinalizedScalarEllipticCartesianProblem
impl Clone for FinalizedScalarEllipticCartesianProblem
§impl Debug for FinalizedScalarEllipticCartesianProblem
impl Debug for FinalizedScalarEllipticCartesianProblem
§impl PartialEq for FinalizedScalarEllipticCartesianProblem
impl PartialEq for FinalizedScalarEllipticCartesianProblem
§fn eq(&self, other: &FinalizedScalarEllipticCartesianProblem) -> bool
fn eq(&self, other: &FinalizedScalarEllipticCartesianProblem) -> bool
self and other values to be equal, and is used by ==.impl StructuralPartialEq for FinalizedScalarEllipticCartesianProblem
Auto Trait Implementations§
impl Freeze for FinalizedScalarEllipticCartesianProblem
impl RefUnwindSafe for FinalizedScalarEllipticCartesianProblem
impl Send for FinalizedScalarEllipticCartesianProblem
impl Sync for FinalizedScalarEllipticCartesianProblem
impl Unpin for FinalizedScalarEllipticCartesianProblem
impl UnsafeUnpin for FinalizedScalarEllipticCartesianProblem
impl UnwindSafe for FinalizedScalarEllipticCartesianProblem
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.