Struct omnitigs::unitigs::NodeUnitigs [−][src]
pub struct NodeUnitigs<Graph: GraphBase> { /* fields omitted */ }
A structure storing a vector of node-centric unitigs.
Implementations
impl<Graph: StaticGraph> NodeUnitigs<Graph>
[src]
pub fn compute(graph: &Graph) -> Self
[src]
Computes the maximal unitigs of a graph.
The unitigs are computed both node- and edge-centric. That means that parallel edges are counted as separate unitig each, and bivalent nodes are counted as unitigs as well.
If the graph is a cycle, it outputs an arbitrary subwalk.
Trait Implementations
impl<Graph: GraphBase> Debug for NodeUnitigs<Graph> where
Graph::NodeIndex: Debug,
[src]
Graph::NodeIndex: Debug,
impl<Graph: GraphBase, IndexType> Index<IndexType> for NodeUnitigs<Graph> where
Vec<NodeUnitig<Graph>>: Index<IndexType>,
[src]
Vec<NodeUnitig<Graph>>: Index<IndexType>,
type Output = <Vec<NodeUnitig<Graph>> as Index<IndexType>>::Output
The returned type after indexing.
fn index(&self, index: IndexType) -> &Self::Output
[src]
impl<Graph: GraphBase> IntoIterator for NodeUnitigs<Graph>
[src]
type Item = NodeUnitig<Graph>
The type of the elements being iterated over.
type IntoIter = IntoIter<NodeUnitig<Graph>>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Self::IntoIter
[src]
impl<'a, Graph: 'a + GraphBase> Sequence<'a, NodeUnitig<Graph>, [NodeUnitig<Graph>]> for NodeUnitigs<Graph> where
Graph::NodeIndex: 'a,
[src]
Graph::NodeIndex: 'a,
type Iterator = Iter<'a, NodeUnitig<Graph>>
The iterator type of the sequence.
fn iter(&'a self) -> Self::Iterator
[src]
fn len(&self) -> usize
[src]
pub fn prefix(&'a self, len: usize) -> &'a Subsequence
[src]
pub fn suffix(&'a self, len: usize) -> &'a Subsequence
[src]
pub fn is_empty(&self) -> bool
[src]
pub fn first(&'a self) -> Option<&'a Item>
[src]
pub fn last(&'a self) -> Option<&'a Item>
[src]
pub fn is_proper_subsequence_of(&'a self, other: &Self) -> bool where
Item: Eq,
[src]
Item: Eq,
pub fn contains(&'a self, item: &Item) -> bool where
Item: Eq,
[src]
Item: Eq,
pub fn forward_merge_iter_assume_mergeable(
&'a self,
suffix: &'a Self
) -> Chain<Self::Iterator, Skip<Self::Iterator>> where
Item: Eq,
[src]
&'a self,
suffix: &'a Self
) -> Chain<Self::Iterator, Skip<Self::Iterator>> where
Item: Eq,
pub fn backward_merge_iter_assume_mergeable(
&'a self,
suffix: &'a Self
) -> Chain<Self::Iterator, Skip<Self::Iterator>> where
Item: Eq,
[src]
&'a self,
suffix: &'a Self
) -> Chain<Self::Iterator, Skip<Self::Iterator>> where
Item: Eq,
pub fn to_debug_string(&'a self) -> String where
Item: Debug,
[src]
Item: Debug,
Auto Trait Implementations
impl<Graph> RefUnwindSafe for NodeUnitigs<Graph> where
<Graph as GraphBase>::EdgeIndex: RefUnwindSafe,
<Graph as GraphBase>::NodeIndex: RefUnwindSafe,
<Graph as GraphBase>::EdgeIndex: RefUnwindSafe,
<Graph as GraphBase>::NodeIndex: RefUnwindSafe,
impl<Graph> Send for NodeUnitigs<Graph> where
<Graph as GraphBase>::EdgeIndex: Send,
<Graph as GraphBase>::NodeIndex: Send,
<Graph as GraphBase>::EdgeIndex: Send,
<Graph as GraphBase>::NodeIndex: Send,
impl<Graph> Sync for NodeUnitigs<Graph> where
<Graph as GraphBase>::EdgeIndex: Sync,
<Graph as GraphBase>::NodeIndex: Sync,
<Graph as GraphBase>::EdgeIndex: Sync,
<Graph as GraphBase>::NodeIndex: Sync,
impl<Graph> Unpin for NodeUnitigs<Graph> where
<Graph as GraphBase>::EdgeIndex: Unpin,
<Graph as GraphBase>::NodeIndex: Unpin,
<Graph as GraphBase>::EdgeIndex: Unpin,
<Graph as GraphBase>::NodeIndex: Unpin,
impl<Graph> UnwindSafe for NodeUnitigs<Graph> where
<Graph as GraphBase>::EdgeIndex: UnwindSafe,
<Graph as GraphBase>::NodeIndex: UnwindSafe,
<Graph as GraphBase>::EdgeIndex: UnwindSafe,
<Graph as GraphBase>::NodeIndex: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,