Struct LocalLinearActionIr
pub struct LocalLinearActionIr { /* private fields */ }Description
One shape-homogeneous batch of anonymous entity-local linear maps.
Coefficients are stored in entity-major, row-major order. Inputs and outputs use the corresponding packed entity-major order. The IR owns no mesh identity, global numbering, gather/scatter rule, or backend type. Heterogeneous discretizations lower to an ordered collection of batches instead of weakening this contract with per-entity dynamic shape.
Implementations§
§impl LocalLinearActionIr
impl LocalLinearActionIr
pub fn new(
rows: usize,
columns: usize,
coefficients: Vec<f64>,
) -> Result<LocalLinearActionIr, Diagnostic>
pub fn new( rows: usize, columns: usize, coefficients: Vec<f64>, ) -> Result<LocalLinearActionIr, Diagnostic>
Construct a finite, non-empty uniform batch.
§Errors
Returns EQ0701 when either local dimension is zero, the coefficient
count is not a positive multiple of the local matrix size, arithmetic
overflows, or a coefficient is non-finite.
pub const fn entity_count(&self) -> usize
pub const fn entity_count(&self) -> usize
Number of local maps in the batch.
pub fn coefficients(&self) -> &[f64]
pub fn coefficients(&self) -> &[f64]
Entity-major, row-major coefficients.
pub const fn input_len(&self) -> usize
pub const fn input_len(&self) -> usize
Required packed input length.
Construction proves this product is representable.
pub const fn output_len(&self) -> usize
pub const fn output_len(&self) -> usize
Required packed output length.
Construction proves this product is representable.
pub fn apply_reference(
&self,
input: &[f64],
output: &mut [f64],
) -> Result<(), Diagnostic>
pub fn apply_reference( &self, input: &[f64], output: &mut [f64], ) -> Result<(), Diagnostic>
Evaluate with the auditable reference expression order.
Each output starts from positive zero and accumulates columns in ascending local order using separate multiplication and addition. This defines the reproducible oracle; accelerated fast policies may use a different expression tree and must be compared under a stated tolerance.
§Errors
Returns EQ0702 for incompatible buffer lengths and EQ0505 for a
non-finite input or result.
Trait Implementations§
§impl Clone for LocalLinearActionIr
impl Clone for LocalLinearActionIr
§impl Debug for LocalLinearActionIr
impl Debug for LocalLinearActionIr
§impl PartialEq for LocalLinearActionIr
impl PartialEq for LocalLinearActionIr
§fn eq(&self, other: &LocalLinearActionIr) -> bool
fn eq(&self, other: &LocalLinearActionIr) -> bool
self and other values to be equal, and is used by ==.impl StructuralPartialEq for LocalLinearActionIr
Auto Trait Implementations§
impl Freeze for LocalLinearActionIr
impl RefUnwindSafe for LocalLinearActionIr
impl Send for LocalLinearActionIr
impl Sync for LocalLinearActionIr
impl Unpin for LocalLinearActionIr
impl UnsafeUnpin for LocalLinearActionIr
impl UnwindSafe for LocalLinearActionIr
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.