pub struct TopTable {
pub index: Vec<usize>,
pub log_fc: Vec<f64>,
pub ci_lower: Option<Vec<f64>>,
pub ci_upper: Option<Vec<f64>>,
pub ave_expr: Option<Vec<f64>>,
pub t: Vec<f64>,
pub p_value: Vec<f64>,
pub adj_p_value: Vec<f64>,
pub b: Vec<f64>,
}Expand description
A ranked table for one coefficient.
Every vector is the same length and in the table’s order;
TopTable::index maps back to the original gene.
Fields§
§index: Vec<usize>Original gene index of each row.
log_fc: Vec<f64>Log fold change, the coefficient itself.
ci_lower: Option<Vec<f64>>Lower end of the confidence interval, when one was asked for.
ci_upper: Option<Vec<f64>>Upper end of the confidence interval.
ave_expr: Option<Vec<f64>>Average expression, from MArrayLm::amean. None when the fit has
none.
t: Vec<f64>Moderated t.
p_value: Vec<f64>Two-sided p-value.
adj_p_value: Vec<f64>Benjamini-Hochberg adjusted p-value, computed over all genes before
any thinning, so it does not depend on number or p_value.
b: Vec<f64>Log-odds of differential expression.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for TopTable
impl RefUnwindSafe for TopTable
impl Send for TopTable
impl Sync for TopTable
impl Unpin for TopTable
impl UnsafeUnpin for TopTable
impl UnwindSafe for TopTable
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.