Struct socarel::IterInterface [−][src]
pub struct IterInterface<'a, T: NodeContent> { /* fields omitted */ }Expand description
Interface for tree iterators.
Implementations
pub fn sequential(&self) -> SequentialIter<'a, T>ⓘNotable traits for SequentialIter<'a, T>impl<'a, T: NodeContent> Iterator for SequentialIter<'a, T> type Item = (&'a Node<T>, usize);
pub fn sequential(&self) -> SequentialIter<'a, T>ⓘNotable traits for SequentialIter<'a, T>impl<'a, T: NodeContent> Iterator for SequentialIter<'a, T> type Item = (&'a Node<T>, usize);
Notable traits for SequentialIter<'a, T>
impl<'a, T: NodeContent> Iterator for SequentialIter<'a, T> type Item = (&'a Node<T>, usize);Get sequential iterator.
Iterates over the array that contains the nodes in sequential order. Even unlinked nodes.
Return
- Iterator.
pub fn inv_sequential(&self) -> InvSequentialIter<'a, T>ⓘNotable traits for InvSequentialIter<'a, T>impl<'a, 'b, T: NodeContent> Iterator for InvSequentialIter<'a, T> type Item = (&'a Node<T>, usize);
pub fn inv_sequential(&self) -> InvSequentialIter<'a, T>ⓘNotable traits for InvSequentialIter<'a, T>impl<'a, 'b, T: NodeContent> Iterator for InvSequentialIter<'a, T> type Item = (&'a Node<T>, usize);
Notable traits for InvSequentialIter<'a, T>
impl<'a, 'b, T: NodeContent> Iterator for InvSequentialIter<'a, T> type Item = (&'a Node<T>, usize);Get inverse sequential iterator.
Iterates over the array that contains the nodes in inverted sequential order. Even unlinked nodes.
Return
- Iterator.
pub fn inv_bfs(&self) -> InvBfsIter<'a, T>ⓘNotable traits for InvBfsIter<'a, T>impl<'a, T: NodeContent> Iterator for InvBfsIter<'a, T> type Item = (&'a Node<T>, usize);
pub fn inv_bfs(&self) -> InvBfsIter<'a, T>ⓘNotable traits for InvBfsIter<'a, T>impl<'a, T: NodeContent> Iterator for InvBfsIter<'a, T> type Item = (&'a Node<T>, usize);
Notable traits for InvBfsIter<'a, T>
impl<'a, T: NodeContent> Iterator for InvBfsIter<'a, T> type Item = (&'a Node<T>, usize);pub fn pre_dfs(&self) -> PreDfsIter<'a, T>ⓘNotable traits for PreDfsIter<'a, T>impl<'a, T: NodeContent> Iterator for PreDfsIter<'a, T> type Item = (&'a Node<T>, usize);
pub fn pre_dfs(&self) -> PreDfsIter<'a, T>ⓘNotable traits for PreDfsIter<'a, T>impl<'a, T: NodeContent> Iterator for PreDfsIter<'a, T> type Item = (&'a Node<T>, usize);
Notable traits for PreDfsIter<'a, T>
impl<'a, T: NodeContent> Iterator for PreDfsIter<'a, T> type Item = (&'a Node<T>, usize);pub fn inv_pre_dfs(&self) -> InvPreDfsIter<'a, T>ⓘNotable traits for InvPreDfsIter<'a, T>impl<'a, T: NodeContent> Iterator for InvPreDfsIter<'a, T> type Item = (&'a Node<T>, usize);
pub fn inv_pre_dfs(&self) -> InvPreDfsIter<'a, T>ⓘNotable traits for InvPreDfsIter<'a, T>impl<'a, T: NodeContent> Iterator for InvPreDfsIter<'a, T> type Item = (&'a Node<T>, usize);
Notable traits for InvPreDfsIter<'a, T>
impl<'a, T: NodeContent> Iterator for InvPreDfsIter<'a, T> type Item = (&'a Node<T>, usize);pub fn post_dfs(&self) -> PostDfsIter<'a, T>ⓘNotable traits for PostDfsIter<'a, T>impl<'a, T: NodeContent> Iterator for PostDfsIter<'a, T> type Item = (&'a Node<T>, usize);
pub fn post_dfs(&self) -> PostDfsIter<'a, T>ⓘNotable traits for PostDfsIter<'a, T>impl<'a, T: NodeContent> Iterator for PostDfsIter<'a, T> type Item = (&'a Node<T>, usize);
Notable traits for PostDfsIter<'a, T>
impl<'a, T: NodeContent> Iterator for PostDfsIter<'a, T> type Item = (&'a Node<T>, usize);pub fn inv_post_dfs(&self) -> InvPostDfsIter<'a, T>ⓘNotable traits for InvPostDfsIter<'a, T>impl<'a, T: NodeContent> Iterator for InvPostDfsIter<'a, T> type Item = (&'a Node<T>, usize);
pub fn inv_post_dfs(&self) -> InvPostDfsIter<'a, T>ⓘNotable traits for InvPostDfsIter<'a, T>impl<'a, T: NodeContent> Iterator for InvPostDfsIter<'a, T> type Item = (&'a Node<T>, usize);
Notable traits for InvPostDfsIter<'a, T>
impl<'a, T: NodeContent> Iterator for InvPostDfsIter<'a, T> type Item = (&'a Node<T>, usize);