pub struct RankedRow {
pub name: String,
pub score: f64,
pub delta: f64,
pub evidence_ratio: f64,
pub edf: f64,
}Fields§
§name: String§score: f64§delta: f64Cost gap from the winning model on the SAME scale used to order the
ranking (ranking_score, the Occam-penalised conditional AIC,
issue #1362). The winner is argmin ranking_score, so this
is >= 0 for every row by construction — it never contradicts the
declared winner (issue #1465). score still carries the raw REML/LAML
diagnostic on its own explicitly labelled scale.
evidence_ratio: f64Akaike evidence ratio of the winner over this row on the ranking scale.
delta is a conditional-AIC gap (a −2·log / deviance-scale quantity), so
the evidence ratio is exp(½·delta) >= 1 (Burnham & Anderson), NOT
exp(delta) — the latter squares the intended ratio (issues #1465, #2124).
This is NOT a Bayes factor and was renamed away from that word: a Bayes
factor is a ratio of prior-integrated marginal likelihoods, whereas this
is the relative likelihood exp(−ΔAIC/2), which integrates over no
prior and must not be read against Jeffreys / Kass–Raftery thresholds.
The raw REML/LAML score_table keeps the Laplace-approximate
marginal-likelihood diagnostic on its own labelled scale.
edf: f64Trait Implementations§
Auto Trait Implementations§
impl Freeze for RankedRow
impl RefUnwindSafe for RankedRow
impl Send for RankedRow
impl Sync for RankedRow
impl Unpin for RankedRow
impl UnsafeUnpin for RankedRow
impl UnwindSafe for RankedRow
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
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> ⓘ
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,
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.