pub struct ChildDecoder {
pub constant: f64,
pub centered_coeffs: Array1<f64>,
}Expand description
One child atom’s 1-D decoder for one output dimension, expressed on
the CENTERED factor basis plus an explicit constant — basis-agnostic,
no partition-of-unity assumption baked in. The child surface is
constant + φ̃(θ)ᵀ·centered_coeffs.
Fields§
§constant: f64§centered_coeffs: Array1<f64>Implementations§
Source§impl ChildDecoder
impl ChildDecoder
Sourcepub fn raw_coeffs_partition_of_unity(
&self,
means: ArrayView1<'_, f64>,
) -> Array1<f64>
pub fn raw_coeffs_partition_of_unity( &self, means: ArrayView1<'_, f64>, ) -> Array1<f64>
Fold the constant back into raw basis coefficients for a
partition-of-unity basis (Σ_j φ_j ≡ 1, e.g. B-splines):
constant + φ̃ᵀa = φᵀ(a + (constant − mᵀa)·1). For non-PoU bases
keep the explicit-constant form instead.
Trait Implementations§
Source§impl Clone for ChildDecoder
impl Clone for ChildDecoder
Source§fn clone(&self) -> ChildDecoder
fn clone(&self) -> ChildDecoder
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for ChildDecoder
impl RefUnwindSafe for ChildDecoder
impl Send for ChildDecoder
impl Sync for ChildDecoder
impl Unpin for ChildDecoder
impl UnsafeUnpin for ChildDecoder
impl UnwindSafe for ChildDecoder
Blanket Implementations§
impl<T> Allocation for T
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
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
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>
Converts
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>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.