pub struct RandomInterceptFit {
pub beta: Vec<f64>,
pub se: Vec<f64>,
pub t_stat: Vec<f64>,
pub df: Vec<f64>,
pub p_value: Vec<f64>,
pub sigma_sq: f64,
pub sigma_b_sq: f64,
pub lambda: f64,
pub singular: bool,
pub bracket_exhausted: bool,
}Expand description
A fitted single-random-intercept model.
Fields§
§beta: Vec<f64>Fixed-effect coefficients.
se: Vec<f64>Standard errors of the coefficients.
t_stat: Vec<f64>Wald t statistics.
df: Vec<f64>Denominator degrees of freedom per coefficient. Satterthwaite by
default, n - p when it is switched off, and NaN when the variance
ratio ran past its bracket, which withholds the inference either way.
p_value: Vec<f64>Two-sided p-values.
sigma_sq: f64Residual variance.
sigma_b_sq: f64Between-group variance.
lambda: f64The fitted variance ratio sigma_b^2 / sigma^2.
singular: boolWhether the fit landed on the lambda = 0 boundary. lme4 calls this
singular. The model has collapsed to ordinary least squares; the
coefficients are still the right answer for the data.
bracket_exhausted: boolWhether the search ran out of bracket at the far end.
Trait Implementations§
Source§impl Clone for RandomInterceptFit
impl Clone for RandomInterceptFit
Auto Trait Implementations§
impl Freeze for RandomInterceptFit
impl RefUnwindSafe for RandomInterceptFit
impl Send for RandomInterceptFit
impl Sync for RandomInterceptFit
impl Unpin for RandomInterceptFit
impl UnsafeUnpin for RandomInterceptFit
impl UnwindSafe for RandomInterceptFit
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
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.