pub enum FamilySpecKind {
Show 14 variants
GaussianIdentity,
PoissonLog,
GammaLog,
TweedieLog {
p: f64,
},
NegativeBinomialLog {
theta: f64,
},
BetaLogit {
phi: f64,
},
RoystonParmar,
BinomialLogit,
BinomialProbit,
BinomialCLogLog,
BinomialLatentCLogLog(LatentCLogLogState),
BinomialSas(SasLinkState),
BinomialBetaLogistic(SasLinkState),
BinomialMixture(MixtureLinkState),
}Expand description
Legal-only enumeration of the (ResponseFamily, InverseLink) cells the
engine recognises. LikelihoodSpec is the product type with ~40 nominal
cells (8 response variants × 5 inverse-link variants), but only the cells
listed here are honoured by the family math; the rest are silently masked
by fallback arms. FamilySpecKind is the canonical projection used by
naming, predicates, and dispatch.
Variants§
GaussianIdentity
PoissonLog
GammaLog
TweedieLog
NegativeBinomialLog
BetaLogit
RoystonParmar
BinomialLogit
BinomialProbit
BinomialCLogLog
BinomialLatentCLogLog(LatentCLogLogState)
BinomialSas(SasLinkState)
BinomialBetaLogistic(SasLinkState)
BinomialMixture(MixtureLinkState)
Implementations§
Source§impl FamilySpecKind
impl FamilySpecKind
Sourcepub const fn name(&self) -> &'static str
pub const fn name(&self) -> &'static str
Short identifier matching the legacy LikelihoodSpec::name() strings.
Sourcepub const fn pretty_name(&self) -> &'static str
pub const fn pretty_name(&self) -> &'static str
Human-readable label matching the legacy LikelihoodSpec::pretty_name() strings.
pub const fn is_binomial(&self) -> bool
pub const fn is_gaussian_identity(&self) -> bool
pub const fn is_royston_parmar(&self) -> bool
pub const fn is_latent_cloglog(&self) -> bool
pub const fn is_binomial_mixture(&self) -> bool
pub const fn is_binomial_sas(&self) -> bool
pub const fn is_binomial_beta_logistic(&self) -> bool
Sourcepub const fn supports_firth(&self) -> bool
pub const fn supports_firth(&self) -> bool
Coarse kind-level Firth eligibility: every binomial inverse link this enum can represent (Logit/Probit/CLogLog and the stateful LatentCLogLog/SAS/Beta-Logistic/Mixture links) carries a Fisher-weight jet, so kind-level Firth support is exactly binomial membership.
The authoritative, link-resolved gate is
LikelihoodSpec::supports_firth, which routes through
inverse_link_has_fisher_weight_jet. Keep this in agreement with that
predicate: a future binomial link without a Fisher-weight jet would make
this approximation diverge and must be handled at both sites.
Trait Implementations§
Source§impl Clone for FamilySpecKind
impl Clone for FamilySpecKind
Source§fn clone(&self) -> FamilySpecKind
fn clone(&self) -> FamilySpecKind
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for FamilySpecKind
impl Debug for FamilySpecKind
Source§impl<'de> Deserialize<'de> for FamilySpecKind
impl<'de> Deserialize<'de> for FamilySpecKind
Source§fn deserialize<__D>(
__deserializer: __D,
) -> Result<FamilySpecKind, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<FamilySpecKind, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
Source§impl PartialEq for FamilySpecKind
impl PartialEq for FamilySpecKind
Source§fn eq(&self, other: &FamilySpecKind) -> bool
fn eq(&self, other: &FamilySpecKind) -> bool
self and other values to be equal, and is used by ==.Source§impl Serialize for FamilySpecKind
impl Serialize for FamilySpecKind
Source§fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
impl StructuralPartialEq for FamilySpecKind
Auto Trait Implementations§
impl Freeze for FamilySpecKind
impl RefUnwindSafe for FamilySpecKind
impl Send for FamilySpecKind
impl Sync for FamilySpecKind
impl Unpin for FamilySpecKind
impl UnsafeUnpin for FamilySpecKind
impl UnwindSafe for FamilySpecKind
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
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>
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,
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>
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.