pub struct PenaltyIdx(/* private fields */);Expand description
Index into the canonical penalty list &[CanonicalPenalty] — equivalently,
the position of a smoothing parameter in the ρ / λ vector.
Penalty/ρ indices are not interchangeable with SmoothTermIdx (a smooth
term can carry multiple canonical penalties — e.g. tensor-product double
penalties — and structural penalties don’t correspond to any smooth term).
Keeping them as separate newtypes makes the historical bug pattern
“indexed rho with a smooth-term ordinal” impossible to express.
Implementations§
Trait Implementations§
Source§impl Clone for PenaltyIdx
impl Clone for PenaltyIdx
Source§fn clone(&self) -> PenaltyIdx
fn clone(&self) -> PenaltyIdx
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 moreimpl Copy for PenaltyIdx
Source§impl Debug for PenaltyIdx
impl Debug for PenaltyIdx
Source§impl<'de> Deserialize<'de> for PenaltyIdx
impl<'de> Deserialize<'de> for PenaltyIdx
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl Display for PenaltyIdx
impl Display for PenaltyIdx
impl Eq for PenaltyIdx
Source§impl Hash for PenaltyIdx
impl Hash for PenaltyIdx
Source§impl Ord for PenaltyIdx
impl Ord for PenaltyIdx
Source§fn cmp(&self, other: &PenaltyIdx) -> Ordering
fn cmp(&self, other: &PenaltyIdx) -> Ordering
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl PartialEq for PenaltyIdx
impl PartialEq for PenaltyIdx
Source§fn eq(&self, other: &PenaltyIdx) -> bool
fn eq(&self, other: &PenaltyIdx) -> bool
Tests for
self and other values to be equal, and is used by ==.Source§impl PartialOrd for PenaltyIdx
impl PartialOrd for PenaltyIdx
Source§impl Serialize for PenaltyIdx
impl Serialize for PenaltyIdx
impl StructuralPartialEq for PenaltyIdx
Auto Trait Implementations§
impl Freeze for PenaltyIdx
impl RefUnwindSafe for PenaltyIdx
impl Send for PenaltyIdx
impl Sync for PenaltyIdx
impl Unpin for PenaltyIdx
impl UnsafeUnpin for PenaltyIdx
impl UnwindSafe for PenaltyIdx
Blanket Implementations§
impl<T> Boilerplate 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,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
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,
impl<T> RuleType for T
impl<T> Scalar 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.