Struct ComponentScalarization
pub struct ComponentScalarization { /* private fields */ }Description
Operator-lowering proof that shaped residuals mean componentwise zero.
Semantic expression nodes remain shaped. This lowered form alone expands roots into deterministic scalar rows; it does not add component-selection nodes to canonical meaning.
Implementations§
§impl ComponentScalarization
impl ComponentScalarization
pub fn lower<I>(
residual: &TypedResidual<I>,
) -> Result<ComponentScalarization, Diagnostic>where
I: Clone + Eq,
pub fn lower<I>(
residual: &TypedResidual<I>,
) -> Result<ComponentScalarization, Diagnostic>where
I: Clone + Eq,
Scalarize one fully typed pointwise residual.
Rows are ordered by Relation root, then row-major component index. A scalar root contributes one row with an empty index. Spatial operators fail closed because their scalarization belongs to a discretized Operator lowering, not this pointwise contract.
§Errors
Returns EQ0701 for shape cardinality mismatch, unrepresentable row
count, inconsistent repeated-symbol shape, a non-pointwise expression,
or an invalid exact component coordinate.
pub fn rows(&self) -> &[ComponentScalarRow]
pub fn rows(&self) -> &[ComponentScalarRow]
Deterministic scalar residual rows.
pub fn evaluate(
&self,
resolve: impl FnMut(&ScalarSymbolCoordinate) -> Option<f64>,
) -> Result<Vec<f64>, Diagnostic>
pub fn evaluate( &self, resolve: impl FnMut(&ScalarSymbolCoordinate) -> Option<f64>, ) -> Result<Vec<f64>, Diagnostic>
Evaluate every row through one shaped-coordinate resolver.
§Errors
Returns EQ0702 when a coordinate is missing, or the underlying scalar
Operator IR diagnostic for non-finite arithmetic.
Trait Implementations§
§impl Clone for ComponentScalarization
impl Clone for ComponentScalarization
§impl Debug for ComponentScalarization
impl Debug for ComponentScalarization
§impl PartialEq for ComponentScalarization
impl PartialEq for ComponentScalarization
§fn eq(&self, other: &ComponentScalarization) -> bool
fn eq(&self, other: &ComponentScalarization) -> bool
self and other values to be equal, and is used by ==.impl StructuralPartialEq for ComponentScalarization
Auto Trait Implementations§
impl Freeze for ComponentScalarization
impl RefUnwindSafe for ComponentScalarization
impl Send for ComponentScalarization
impl Sync for ComponentScalarization
impl Unpin for ComponentScalarization
impl UnsafeUnpin for ComponentScalarization
impl UnwindSafe for ComponentScalarization
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.