pub struct PenaltyCandidate {
pub matrix: Array2<f64>,
pub nullspace_dim_hint: usize,
pub source: PenaltySource,
pub normalization_scale: f64,
pub kronecker_factors: Option<Vec<Array2<f64>>>,
pub op: Option<Arc<dyn PenaltyOp>>,
}Fields§
§matrix: Array2<f64>§nullspace_dim_hint: usize§source: PenaltySource§normalization_scale: f64§kronecker_factors: Option<Vec<Array2<f64>>>Optional Kronecker factors whose product equals matrix.
When present, spectral decomposition can be done per-factor
(O(Σ q_j³) instead of O((Π q_j)³)).
op: Option<Arc<dyn PenaltyOp>>Optional operator-form handle whose as_dense() matches matrix. When
populated by the closed-form factories, this is propagated through to
CanonicalPenaltyBlock so downstream consumers can use exact matvec
algebra without rebuilding the dense Gram. When None, only the dense
matrix path is available.
Trait Implementations§
Source§impl Clone for PenaltyCandidate
impl Clone for PenaltyCandidate
Source§fn clone(&self) -> PenaltyCandidate
fn clone(&self) -> PenaltyCandidate
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 PenaltyCandidate
impl !RefUnwindSafe for PenaltyCandidate
impl Send for PenaltyCandidate
impl Sync for PenaltyCandidate
impl Unpin for PenaltyCandidate
impl UnsafeUnpin for PenaltyCandidate
impl !UnwindSafe for PenaltyCandidate
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
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,
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
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.