Struct RelCountData 

pub struct RelCountData { /* private fields */ }

Implementation of SummaryData<Tag>

Contains the relative number of observations for the k-mer (in percent) in group 1 and the absolute overall count, only validates count

Trait Implementations

impl Clone for RelCountData

fn clone(&self) -> RelCountData

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RelCountData

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for RelCountData

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for RelCountData

fn eq(&self, other: &RelCountData) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for RelCountData

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl SummaryData<u8> for RelCountData

fn print( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data

fn print_ol( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in for json

fn print_json( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in one line

fn sum(&self) -> Option<u32>

get the number of observations, returns None if data is insufficient

fn mem(&self) -> usize

get the size of the structure, including contents of boxed slices

fn valid(&self, config: &SummaryConfig) -> bool

check if node is valid according to: min kmer obs, group fraction, p-value

fn summarize<K: Kmer, F: Iterator<Item = KmerDataItem<K, Tag>>>( items: F, config: &SummaryConfig, ) -> (bool, Exts, Self)

summarize k-mers

fn summarizer() -> Summarizers

check summerizer kind

fn tags(&self) -> Option<Tags>

get Tags and the overall count, returns None if data is insufficient

fn ids(&self) -> Option<&[ID]>

get the IDs, returns None if data is insufficient

fn p_value(&self, _config: &SummaryConfig) -> Option<f32>

get the p-value, returns None if data is insufficient

fn fold_change(&self, _config: &SummaryConfig) -> Option<f32>

get the log2(fold change), returns None if data is insufficient

fn sample_count(&self) -> Option<usize>

get the number of samples the sequence was observed in, returns None if data is insufficient

fn edge_mults(&self) -> Option<&EdgeMult>

get the coverage of the node edges

fn quality(&self) -> Option<BaseQuality>

get the quality of the node k-mer

fn fix_edge_data(&mut self, _exts: Exts)

fix the EdgeMult by removing hanging edges

fn set_edge_mults(&mut self, _edge_mults: Option<EdgeMult>)

set the edge mults

fn mapped_ids(&self) -> Option<&[ID]>

get a reference to the mapped ids, returns None if data is insufficient

fn set_mapped_ids(&mut self, _mapped_ids: Box<[ID]>)

add mapped ids to the node data

fn mapped_edge_ids(&self) -> Option<&EdgeMap>

get a reference to the IDs mapped to the node edges, returns None id data is insuffivient

fn set_mapped_edge_ids(&mut self, _mapped_edge_ids: Option<EdgeMap>)

add mapped IDs to the node’s edges

fn join_test(&self, other: &Self) -> bool

check if the data can be joined into one

impl StructuralPartialEq for RelCountData