pub struct ResolvedDuchonChart {
pub spec: DuchonBasisSpec,
pub centers: Array2<f64>,
pub identifiability_transform: Option<Array2<f64>>,
}Expand description
A DuchonBasisSpec with every ψ-invariant chart decision resolved against
the data, plus the artifacts those decisions produced.
See duchon_resolve_chart.
Fields§
§spec: DuchonBasisSpecThe input spec with center_strategy realized to UserProvided,
nullspace_order degraded to the effective order, aniso_log_scales
auto-seeded, radial_reparam set to the adopted V, and
identifiability frozen to the realized transform.
build_duchon_basis(data, &resolved.spec) reproduces
build_duchon_basis(data, spec) — same design, same penalties, same
metadata — because every decision the second build would re-make is
already pinned in the first.
centers: Array2<f64>The realized centers (periodic images expanded).
identifiability_transform: Option<Array2<f64>>The realized identifiability transform, None when the spec asks for
no constraint.
Trait Implementations§
Source§impl Clone for ResolvedDuchonChart
impl Clone for ResolvedDuchonChart
Source§fn clone(&self) -> ResolvedDuchonChart
fn clone(&self) -> ResolvedDuchonChart
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 ResolvedDuchonChart
impl RefUnwindSafe for ResolvedDuchonChart
impl Send for ResolvedDuchonChart
impl Sync for ResolvedDuchonChart
impl Unpin for ResolvedDuchonChart
impl UnsafeUnpin for ResolvedDuchonChart
impl UnwindSafe for ResolvedDuchonChart
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.