pub struct LocalTermRealization<'a> {
pub design: DesignMatrix,
pub metadata: &'a BasisMetadata,
pub active_penalties: &'a [ActivePenalty],
pub dropped_penalties: Vec<DroppedPenaltyInfo>,
pub linear_constraints_local: Option<&'a LinearInequalityConstraints>,
pub joint_null_rotation: Option<&'a JointNullRotation>,
pub termname: &'a str,
}Expand description
One smooth term as a TERM-LOCAL build leaves it, on its way into a collection gauge. Grouped rather than passed loose because these seven are one object — a realization — and splitting them across a call boundary is how the design and its chart came apart in the first place (#2747).
Fields§
§design: DesignMatrixThe rebuilt block, with the basis chart and any joint-null Q applied.
metadata: &'a BasisMetadataThe local build’s metadata; the gauge’s transform is composed into it.
active_penalties: &'a [ActivePenalty]§dropped_penalties: Vec<DroppedPenaltyInfo>§linear_constraints_local: Option<&'a LinearInequalityConstraints>§joint_null_rotation: Option<&'a JointNullRotation>The rotation the local build applied to design and reported
separately. It is folded into the returned metadata.
termname: &'a strAuto Trait Implementations§
impl<'a> !RefUnwindSafe for LocalTermRealization<'a>
impl<'a> !UnwindSafe for LocalTermRealization<'a>
impl<'a> Freeze for LocalTermRealization<'a>
impl<'a> Send for LocalTermRealization<'a>
impl<'a> Sync for LocalTermRealization<'a>
impl<'a> Unpin for LocalTermRealization<'a>
impl<'a> UnsafeUnpin for LocalTermRealization<'a>
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.