pub struct IDSumData { /* private fields */ }Expand description
the IDs the k-mer was observed with and its number of observations ID could be gene-, read-, or orthogroup-ID
Trait Implementations§
Source§impl<'de> Deserialize<'de> for IDSumData
impl<'de> Deserialize<'de> for IDSumData
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl SummaryData<IDTag> for IDSumData
impl SummaryData<IDTag> for IDSumData
Source§fn print(
&self,
translator: &Translator,
config: &SummaryConfig,
id_group_translator: Option<&HashMap<ID, ID>>,
) -> String
fn print( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String
format the node data
Source§fn print_ol(
&self,
translator: &Translator,
config: &SummaryConfig,
id_group_translator: Option<&HashMap<ID, ID>>,
) -> String
fn print_ol( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String
format the node data in for json
Source§fn print_json(
&self,
translator: &Translator,
config: &SummaryConfig,
id_group_translator: Option<&HashMap<ID, ID>>,
) -> String
fn print_json( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String
format the node data in one line
Source§fn sum(&self) -> Option<u32>
fn sum(&self) -> Option<u32>
get the number of observations, returns
None if data is insufficientSource§fn valid(&self, config: &SummaryConfig) -> bool
fn valid(&self, config: &SummaryConfig) -> bool
check if node is valid according to: min kmer obs, group fraction, p-value
Source§fn summarize<K: Kmer, F: Iterator<Item = KmerDataItem<K, IDTag>>>(
items: F,
config: &SummaryConfig,
) -> (bool, Exts, Self)
fn summarize<K: Kmer, F: Iterator<Item = KmerDataItem<K, IDTag>>>( items: F, config: &SummaryConfig, ) -> (bool, Exts, Self)
summarize k-mers
Source§fn summarizer() -> Summarizers
fn summarizer() -> Summarizers
check summerizer kind
get
Tags and the overall count, returns None if data is insufficientSource§fn p_value(&self, _config: &SummaryConfig) -> Option<f32>
fn p_value(&self, _config: &SummaryConfig) -> Option<f32>
get the p-value, returns
None if data is insufficientSource§fn fold_change(&self, _config: &SummaryConfig) -> Option<f32>
fn fold_change(&self, _config: &SummaryConfig) -> Option<f32>
get the log2(fold change), returns
None if data is insufficientSource§fn sample_count(&self) -> Option<usize>
fn sample_count(&self) -> Option<usize>
get the number of samples the sequence was observed in, returns
None if data is insufficientSource§fn edge_mults(&self) -> Option<&EdgeMult>
fn edge_mults(&self) -> Option<&EdgeMult>
get the coverage of the node edges
Source§fn quality(&self) -> Option<BaseQuality>
fn quality(&self) -> Option<BaseQuality>
get the quality of the node k-mer
Source§fn fix_edge_data(&mut self, _exts: Exts)
fn fix_edge_data(&mut self, _exts: Exts)
fix the
EdgeMult by removing hanging edgesSource§fn set_edge_mults(&mut self, _edge_mults: Option<EdgeMult>)
fn set_edge_mults(&mut self, _edge_mults: Option<EdgeMult>)
set the edge mults
Source§fn mapped_ids(&self) -> Option<&[ID]>
fn mapped_ids(&self) -> Option<&[ID]>
get a reference to the mapped ids, returns
None if data is insufficientSource§fn set_mapped_ids(&mut self, _mapped_ids: Box<[ID]>)
fn set_mapped_ids(&mut self, _mapped_ids: Box<[ID]>)
add mapped ids to the node data
Source§fn mapped_edge_ids(&self) -> Option<&EdgeMap>
fn mapped_edge_ids(&self) -> Option<&EdgeMap>
get a reference to the IDs mapped to the node edges, returns
None id data is insuffivientSource§fn set_mapped_edge_ids(&mut self, _mapped_edge_ids: Option<EdgeMap>)
fn set_mapped_edge_ids(&mut self, _mapped_edge_ids: Option<EdgeMap>)
add mapped IDs to the node’s edges
impl StructuralPartialEq for IDSumData
Auto Trait Implementations§
impl Freeze for IDSumData
impl RefUnwindSafe for IDSumData
impl Send for IDSumData
impl Sync for IDSumData
impl Unpin for IDSumData
impl UnsafeUnpin for IDSumData
impl UnwindSafe for IDSumData
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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 more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.