pub struct LocalSmoothTermBuild {
pub dim: usize,
pub design: DesignMatrix,
pub affine_offset: Option<Array1<f64>>,
pub active_penalties: Vec<ActivePenalty>,
pub joint_null_rotation: Option<JointNullRotation>,
pub dropped_penalties: Vec<DroppedPenaltyInfo>,
pub metadata: BasisMetadata,
pub linear_constraints: Option<LinearInequalityConstraints>,
pub box_reparam: bool,
pub kronecker_factored: Option<KroneckerFactoredBasis>,
}Fields§
§dim: usize§design: DesignMatrix§affine_offset: Option<Array1<f64>>Fixed row-wise term contribution for an affine basis chart.
active_penalties: Vec<ActivePenalty>§joint_null_rotation: Option<JointNullRotation>Joint-null absorption rotation for this smooth. Some(rotation)
records Q = [U_range | U_null] spanning null(Σ_k penalties[k]),
the joint null across all active penalty blocks on this smooth.
None means the joint penalty is full-rank (joint nullity = 0) or
there are no penalties. Stage-2 commit A: plumbing only — populated
by commit B, applied by commit D.
dropped_penalties: Vec<DroppedPenaltyInfo>§metadata: BasisMetadata§linear_constraints: Option<LinearInequalityConstraints>§box_reparam: bool§kronecker_factored: Option<KroneckerFactoredBasis>Auto Trait Implementations§
impl !Freeze for LocalSmoothTermBuild
impl !RefUnwindSafe for LocalSmoothTermBuild
impl !UnwindSafe for LocalSmoothTermBuild
impl Send for LocalSmoothTermBuild
impl Sync for LocalSmoothTermBuild
impl Unpin for LocalSmoothTermBuild
impl UnsafeUnpin for LocalSmoothTermBuild
Blanket Implementations§
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> 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.