pub struct SmoothStructureAnalysis {
pub ownership_order: Vec<usize>,
pub term_feature_cols: Vec<Vec<usize>>,
pub term_owners: Vec<Vec<usize>>,
}Expand description
Static (spec-only) description of the hierarchical smooth-ownership decomposition.
This is the single source of truth for the deterministic ownership policy that
apply_global_smooth_identifiability uses during the fit: the processing order of
smooth terms, the feature columns each term spans, the candidate lower-order owners of
each term (nested/duplicate feature sets), and the basis-family rank used as a
tie-breaker. The fit engine consumes this structure and additionally applies a numerical
cross-residual overlap test on the realized design columns; the CLI structure-warning
path consumes the same structure for diagnostic messages, so both paths agree on which
smooths own which subspaces.
Fields§
§ownership_order: Vec<usize>Smooth-term indices sorted into ownership-processing order (lowest priority first): lower-order / narrower smooths come first and own their subspaces.
term_feature_cols: Vec<Vec<usize>>term_feature_cols[idx] are the sorted, deduplicated feature columns that smooth term
idx spans (indexed by the original smooth-term index, not by ownership_order).
term_owners: Vec<Vec<usize>>term_owners[idx] are the indices of prior (in ownership_order) smooth terms whose
feature set is a subset of term idx’s feature set, i.e. candidate owners of idx.
The list is given in ownership-processing order.
Auto Trait Implementations§
impl Freeze for SmoothStructureAnalysis
impl RefUnwindSafe for SmoothStructureAnalysis
impl Send for SmoothStructureAnalysis
impl Sync for SmoothStructureAnalysis
impl Unpin for SmoothStructureAnalysis
impl UnsafeUnpin for SmoothStructureAnalysis
impl UnwindSafe for SmoothStructureAnalysis
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
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>
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>
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>
self from the equivalent element of its
superset. Read moreSource§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).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.