Struct BaseGraph 

pub struct BaseGraph<K, D> {
    pub sequences: PackedDnaStringSet,
    pub exts: Vec<Exts>,
    pub data: Vec<D>,
    pub stranded: bool,
    /* private fields */
}

A compressed DeBruijn graph carrying auxiliary data on each node of type D. This type does not carry the sorted index arrays the allow the graph to be walked efficiently. The DeBruijnGraph type wraps this type and add those vectors.

Fields

sequences: PackedDnaStringSet

exts: Vec<Exts>

data: Vec<D>

stranded: bool

Implementations

impl<K, D> BaseGraph<K, D>

pub fn new(stranded: bool) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn combine<I: Iterator<Item = BaseGraph<K, D>>>(graphs: I) -> Self

pub fn shrink_to_fit(&mut self)

shrink the storage of the BaseGraph to fit its contents

impl<K: Kmer, D> BaseGraph<K, D>

pub fn add<R: Borrow<u8>, S: IntoIterator<Item = R>>( &mut self, sequence: S, exts: Exts, data: D, )

impl<K: Kmer + Send + Sync, D> BaseGraph<K, D>

pub fn finish(self) -> DebruijnGraph<K, D>

impl<K: Kmer, D> BaseGraph<K, D>

pub fn finish_serial(self) -> DebruijnGraph<K, D>

Trait Implementations

impl<K: Clone, D: Clone> Clone for BaseGraph<K, D>

fn clone(&self) -> BaseGraph<K, D>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, D: Debug> Debug for BaseGraph<K, D>

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

Formats the value using the given formatter.

impl<'de, K, D> Deserialize<'de> for BaseGraph<K, D>

where D: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K, D> Serialize for BaseGraph<K, D>

where D: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.