pub struct PmlData<'a> {
pub design: &'a [f64],
pub offset: &'a [f64],
pub counts: &'a [f64],
pub cell_index: &'a [usize],
pub subject_start: &'a [usize],
pub subject_total: &'a [f64],
}Expand description
One gene’s data, in the layout NEBULA’s C++ expects.
Cells must already be grouped by subject, which is what makes
subject_start a valid block partition. Only the positive counts are
stored: counts[i] is the count in cell cell_index[i].
Fields§
§design: &'a [f64]Design matrix, row-major n_cells * n_beta.
offset: &'a [f64]Log offset per cell, length n_cells.
counts: &'a [f64]The positive counts, in increasing cell order.
cell_index: &'a [usize]Cell index of each entry of counts, zero-based and increasing.
subject_start: &'a [usize]Start of each subject’s block plus a trailing n_cells, length k + 1.
subject_total: &'a [f64]Total count per subject, length k. nebula’s cumsumy.
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl<'a> Freeze for PmlData<'a>
impl<'a> RefUnwindSafe for PmlData<'a>
impl<'a> Send for PmlData<'a>
impl<'a> Sync for PmlData<'a>
impl<'a> Unpin for PmlData<'a>
impl<'a> UnsafeUnpin for PmlData<'a>
impl<'a> UnwindSafe for PmlData<'a>
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.