Struct ScalarEllipticRunResult
pub struct ScalarEllipticRunResult { /* private fields */ }Description
Successful result and exact producer/verifier evidence.
Implementations§
§impl ScalarEllipticRunResult
impl ScalarEllipticRunResult
pub fn error_quadrature(&self) -> Result<QuadratureRule, Diagnostic>
pub fn error_quadrature(&self) -> Result<QuadratureRule, Diagnostic>
Quadrature used by accepted-field error metrics.
This is the tensor product of three-point Gauss–Legendre rules on the
two reference axes. Its nine points integrate polynomials through
degree five on each axis exactly. Callers can inspect
QuadratureRule::polynomial_exactness and the complete point set;
the rule is returned rather than being an implicit implementation
choice.
§Errors
Returns EQ0809 unless this result publishes the supported
two-dimensional, vertex-located Cartesian Q1 field layout.
pub fn l2_error<E>(&self, exact_solution: E) -> Result<f64, Diagnostic>where
E: Fn([f64; 2]) -> f64,
pub fn l2_error<E>(&self, exact_solution: E) -> Result<f64, Diagnostic>where
E: Fn([f64; 2]) -> f64,
Continuum L2 error of the accepted Q1 field against an exact solution.
exact_solution receives coherent-SI physical coordinates in the
published Cartesian axis order. The integral uses
Self::error_quadrature, which is exact when the squared pointwise
difference has degree at most five on each cell axis.
§Errors
Returns EQ0809 for an unsupported accepted field layout, or EQ0801
if the exact solution or accumulated error is non-finite.
pub fn quadrature_l_infinity_error<E>(
&self,
exact_solution: E,
) -> Result<f64, Diagnostic>where
E: Fn([f64; 2]) -> f64,
pub fn quadrature_l_infinity_error<E>(
&self,
exact_solution: E,
) -> Result<f64, Diagnostic>where
E: Fn([f64; 2]) -> f64,
Quadrature-sampled L-infinity error of the accepted Q1 field.
exact_solution receives coherent-SI physical coordinates in the
published Cartesian axis order. This is the largest pointwise error at
the nine per-cell points returned by Self::error_quadrature; a
finite rule cannot claim the essential supremum of an arbitrary caller
function between those points.
§Errors
Returns EQ0809 for an unsupported accepted field layout, or EQ0801
if the exact solution or sampled error is non-finite.
§impl ScalarEllipticRunResult
impl ScalarEllipticRunResult
pub const fn plan(&self) -> &ScalarEllipticRunPlan
pub const fn plan(&self) -> &ScalarEllipticRunPlan
Exact plan replayed immediately before allocation.
pub const fn elapsed(&self) -> Duration
pub const fn elapsed(&self) -> Duration
Wall duration measured by this local application operation.
pub const fn field(&self) -> ScalarFieldSummary
pub const fn field(&self) -> ScalarFieldSummary
Bounded primary field summary.
pub fn field_values(&self) -> &[f64]
pub fn field_values(&self) -> &[f64]
Complete accepted primary Field values in canonical location order.
pub fn into_field_values(self) -> Vec<f64>
pub fn into_field_values(self) -> Vec<f64>
Consume this result into its complete primary Field values.
pub const fn balance(&self) -> ScalarEllipticBalanceEvidence
pub const fn balance(&self) -> ScalarEllipticBalanceEvidence
Recovered continuous conservation evidence.
pub const fn assembly(&self) -> AssemblyReport
pub const fn assembly(&self) -> AssemblyReport
Accepted local assembly placement and shape evidence.
pub const fn run_manifest(&self) -> &RunManifestV2
pub const fn run_manifest(&self) -> &RunManifestV2
Versioned Model, Realization, and actual execution provenance.
pub const fn solve(&self) -> &SolveReport
pub const fn solve(&self) -> &SolveReport
Independently accepted linear solve report.
pub const fn receipt(&self) -> &ExecutionReceipt
pub const fn receipt(&self) -> &ExecutionReceipt
Immutable deployment, operator, plan, and execution-DAG evidence.
Trait Implementations§
§impl Debug for ScalarEllipticRunResult
impl Debug for ScalarEllipticRunResult
§impl PartialEq for ScalarEllipticRunResult
impl PartialEq for ScalarEllipticRunResult
§fn eq(&self, other: &ScalarEllipticRunResult) -> bool
fn eq(&self, other: &ScalarEllipticRunResult) -> bool
self and other values to be equal, and is used by ==.impl StructuralPartialEq for ScalarEllipticRunResult
Auto Trait Implementations§
impl Freeze for ScalarEllipticRunResult
impl RefUnwindSafe for ScalarEllipticRunResult
impl Send for ScalarEllipticRunResult
impl Sync for ScalarEllipticRunResult
impl Unpin for ScalarEllipticRunResult
impl UnsafeUnpin for ScalarEllipticRunResult
impl UnwindSafe for ScalarEllipticRunResult
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
§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.