pub struct Node<'a, K: Kmer + 'a, D: 'a> {
pub node_id: usize,
pub graph: &'a DebruijnGraph<K, D>,
}Expand description
Unbranched sequence in the DeBruijn graph
Fields§
§node_id: usize§graph: &'a DebruijnGraph<K, D>Implementations§
Source§impl<'a, K: Kmer, D: Debug> Node<'a, K, D>
impl<'a, K: Kmer, D: Debug> Node<'a, K, D>
pub fn is_empty(&self) -> bool
Sourcepub fn sequence(&self) -> DnaStringSlice<'a>
pub fn sequence(&self) -> DnaStringSlice<'a>
Sequence of the node
Sourcepub fn l_edges(&self) -> SmallVec<[(u8, usize, Dir, bool); 4]>
pub fn l_edges(&self) -> SmallVec<[(u8, usize, Dir, bool); 4]>
Edges leaving the left side of the node in the format (base, target_node id, incoming side of target node, whether target node is flipped)
Source§impl<K: Kmer, SD: Debug> Node<'_, K, SD>
impl<K: Kmer, SD: Debug> Node<'_, K, SD>
Sourcepub fn edge_dot_default<DI>(
&self,
colors: &Colors<'_, SD, DI>,
base: u8,
incoming_dir: Dir,
flipped: bool,
) -> Stringwhere
SD: SummaryData<DI>,
pub fn edge_dot_default<DI>(
&self,
colors: &Colors<'_, SD, DI>,
base: u8,
incoming_dir: Dir,
flipped: bool,
) -> Stringwhere
SD: SummaryData<DI>,
get default format for dot edges based on node data
Sourcepub fn node_dot_default<DI>(
&self,
colors: &Colors<'_, SD, DI>,
config: &SummaryConfig,
translator: &Translator,
outline: bool,
translate_id_groups: bool,
) -> Stringwhere
SD: SummaryData<DI>,
pub fn node_dot_default<DI>(
&self,
colors: &Colors<'_, SD, DI>,
config: &SummaryConfig,
translator: &Translator,
outline: bool,
translate_id_groups: bool,
) -> Stringwhere
SD: SummaryData<DI>,
get default format for dot nodes, based on node data
pub fn edge_json_default<DI>(
&self,
target_node_id: usize,
base: u8,
incoming_dir: Dir,
flipped: bool,
) -> Stringwhere
SD: SummaryData<DI>,
Sourcepub fn node_json_default<DI>(
&self,
colors: &Colors<'_, SD, DI>,
config: &SummaryConfig,
translator: &Translator,
translate_id_groups: bool,
) -> Stringwhere
SD: SummaryData<DI>,
pub fn node_json_default<DI>(
&self,
colors: &Colors<'_, SD, DI>,
config: &SummaryConfig,
translator: &Translator,
translate_id_groups: bool,
) -> Stringwhere
SD: SummaryData<DI>,
get default properties for json nodes, based on node data
Trait Implementations§
Auto Trait Implementations§
impl<'a, K, D> Freeze for Node<'a, K, D>
impl<'a, K, D> RefUnwindSafe for Node<'a, K, D>where
K: RefUnwindSafe,
D: RefUnwindSafe,
impl<'a, K, D> Send for Node<'a, K, D>
impl<'a, K, D> Sync for Node<'a, K, D>
impl<'a, K, D> Unpin for Node<'a, K, D>
impl<'a, K, D> UnsafeUnpin for Node<'a, K, D>
impl<'a, K, D> UnwindSafe for Node<'a, K, D>where
K: RefUnwindSafe,
D: RefUnwindSafe,
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> 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.