pub struct RowKappas {
pub k2: f64,
pub k3: f64,
pub k4: f64,
pub k2_1: f64,
pub k2_11: f64,
pub k3_1: f64,
}Expand description
The per-row expected cumulant scalars entering Lawley’s arrays.
Fields§
§k2: f64κ₂ = E[ℓ″] (= −Fisher weight).
k3: f64κ₃ = E[ℓ‴].
k4: f64κ₄ = E[ℓ⁗].
k2_1: f64κ₂’ = dκ₂/dη.
k2_11: f64κ₂’’ = d²κ₂/dη².
k3_1: f64κ₃’ = dκ₃/dη.
Implementations§
Source§impl RowKappas
impl RowKappas
Sourcepub fn weighted(self, w: f64) -> RowKappas
pub fn weighted(self, w: f64) -> RowKappas
Scale every cumulant by a prior weight w: a row observed with weight
w contributes w·ℓᵢ to the log-likelihood (for binomial data w
trials at the same η are exactly the sum of w independent Bernoulli
rows), so all six expected derivative cumulants scale linearly in w.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for RowKappas
impl RefUnwindSafe for RowKappas
impl Send for RowKappas
impl Sync for RowKappas
impl Unpin for RowKappas
impl UnsafeUnpin for RowKappas
impl UnwindSafe for RowKappas
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
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,
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.