pub struct Record { /* private fields */ }
Expand description
Represents a de Bruijn graph record.
Implementations§
Source§impl Record
impl Record
Sourcepub fn new(coverage: u16, edges: Option<Edges>) -> Self
pub fn new(coverage: u16, edges: Option<Edges>) -> Self
Create an empty de Bruijn graph record.
Sourcepub fn fw_coverage(&self) -> u16
pub fn fw_coverage(&self) -> u16
Return the Record’s forward coverage.
Sourcepub fn rc_coverage(&self) -> u16
pub fn rc_coverage(&self) -> u16
Return the Record’s reverse complement coverage.
pub fn edges(&self) -> Edges
Sourcepub fn incoming_edges(&self) -> Vec<u8> ⓘ
pub fn incoming_edges(&self) -> Vec<u8> ⓘ
Return incoming edges
Sourcepub fn outgoing_edges(&self) -> Vec<u8> ⓘ
pub fn outgoing_edges(&self) -> Vec<u8> ⓘ
Return outgoing edges
Sourcepub fn increment_coverage(&mut self)
pub fn increment_coverage(&mut self)
Increment the coverage value by 1.
Sourcepub fn increment_fw_coverage(&mut self)
pub fn increment_fw_coverage(&mut self)
Increment the forward coverage value by 1.
Sourcepub fn increment_rc_coverage(&mut self)
pub fn increment_rc_coverage(&mut self)
Increment the reverse complement coverage value by 1.
Sourcepub fn set_coverage(&mut self, coverage: u16)
pub fn set_coverage(&mut self, coverage: u16)
Set the coverage value.
Sourcepub fn set_incoming_edge(&mut self, nucleotide: u8)
pub fn set_incoming_edge(&mut self, nucleotide: u8)
Set incoming edge.
Sourcepub fn set_outgoing_edge(&mut self, nucleotide: u8)
pub fn set_outgoing_edge(&mut self, nucleotide: u8)
Set outgoing edge.
Sourcepub fn out_degree(&self) -> u8
pub fn out_degree(&self) -> u8
The out-degree of a particular k-mer.
Sourcepub fn is_junction(&self) -> bool
pub fn is_junction(&self) -> bool
Identifies junctions in the graph
Trait Implementations§
impl Eq for Record
impl StructuralPartialEq for Record
Auto Trait Implementations§
impl Freeze for Record
impl RefUnwindSafe for Record
impl Send for Record
impl Sync for Record
impl Unpin for Record
impl UnwindSafe for Record
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,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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.