Struct compt::WrapGen
[−]
[src]
pub struct WrapGen<'a, T: CTreeIterator + 'a> { /* fields omitted */ }
Allows to traverse down from a visitor twice by creating a new visitor that borrows the other.
Methods
impl<'a, T: CTreeIterator + 'a> WrapGen<'a, T>
[src]
Trait Implementations
impl<'a, T: CTreeIterator + 'a> CTreeIterator for WrapGen<'a, T>
[src]
type Item = Bo<'a, T::Item>
fn next(self) -> (Self::Item, Option<(Self, Self)>)
[src]
Consume this visitor, and produce the element it was pointing to along with it's children visitors. Read more
fn zip<F: CTreeIterator>(self, f: F) -> Zip<Self, F>
[src]
Combine two tree visitors.
fn bfs_iter(self) -> BfsIter<Self>
[src]
Provides an iterator that returns each element in bfs order. A callback version is not provided because a queue would still need to be used, So it wouldnt be able to take advantage of the stack anyway. Read more
fn dfs_preorder_iter(self) -> DfsPreorderIter<Self>
[src]
Provides a dfs preorder iterator. Unlike the callback version, This one relies on dynamic allocation for its queue. Read more
fn dfs_preorder<F: FnMut(Self::Item)>(self, func: F)
[src]
Calls the closure in dfs preorder (left,right,root). Takes advantage of the callstack to do dfs. Read more
fn dfs_postorder<F: FnMut(Self::Item)>(self, func: F)
[src]
Calls the closure in dfs postorder (right,left,root). Takes advantage of the callstack to do dfs. Read more