Struct compt::bfs_order::Vistr [−][src]
pub struct Vistr<'a, T: 'a> { /* fields omitted */ }
Expand description
Tree visitor that returns a mutable reference to each element in the tree. Tree visitor that returns a mutable reference to each element in the tree.
Trait Implementations
Consume this visitor, and produce the element it was pointing to along with it’s children visitors. Read more
Return the levels remaining including the one that will be produced by consuming this iterator. So if you first made this object from the root for a tree of size 5, it should return 5. Think of is as height-depth. This is used to make good allocations when doing dfs and bfs. Defaults to (0,None) Read more
Iterator Adapter to also produce the depth each iteration.
fn dfs_preorder_iter(self) -> DfsPreOrderIter<Self>ⓘNotable traits for DfsPreOrderIter<C>impl<C: Visitor> Iterator for DfsPreOrderIter<C> type Item = C::Item;
fn dfs_preorder_iter(self) -> DfsPreOrderIter<Self>ⓘNotable traits for DfsPreOrderIter<C>impl<C: Visitor> Iterator for DfsPreOrderIter<C> type Item = C::Item;
impl<C: Visitor> Iterator for DfsPreOrderIter<C> type Item = C::Item;
Provides a dfs preorder iterator. Unlike the callback version, This one relies on dynamic allocation for its stack. Read more
fn dfs_inorder_iter(self) -> DfsInOrderIter<Self>ⓘNotable traits for DfsInOrderIter<C>impl<C: Visitor> Iterator for DfsInOrderIter<C> type Item = C::Item;
impl<C: Visitor> Iterator for DfsInOrderIter<C> type Item = C::Item;
Calls the closure in dfs preorder (root,left,right). Takes advantage of the callstack to do dfs. Read more
Calls the closure in dfs preorder (left,right,root). Takes advantage of the callstack to do dfs. Read more
Calls the closure in dfs preorder (left,right,root). Takes advantage of the callstack to do dfs. Read more