pub struct SparseColMoments {
pub indices: Vec<u32>,
pub values: Vec<f32>,
pub mean: f64,
pub sd: f64,
}Expand description
One sparse column reduced to what sparse_pairwise_correlations needs.
The stored entries are kept as they arrive; nothing here densifies, so the
memory is O(nnz) per column rather than O(n_rows).
Fields§
§indices: Vec<u32>Row indices of the stored entries. Ascending order is not required.
values: Vec<f32>Values at those indices. The raw values for Pearson, the zero-shifted ranks for Spearman. Every non-stored position is exactly zero in both cases, which is what makes the closed forms below valid.
mean: f64Mean over all n_rows entries, structural zeros included.
sd: f64Standard deviation over all n_rows entries, sample (n - 1)
denominator.
Trait Implementations§
Source§impl Clone for SparseColMoments
impl Clone for SparseColMoments
Auto Trait Implementations§
impl Freeze for SparseColMoments
impl RefUnwindSafe for SparseColMoments
impl Send for SparseColMoments
impl Sync for SparseColMoments
impl Unpin for SparseColMoments
impl UnsafeUnpin for SparseColMoments
impl UnwindSafe for SparseColMoments
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.