Expand description
Tree visitor that zips up two seperate visitors. If one of the iterators returns None for its children, this iterator will return None.
Implementations§
Trait Implementations§
source§impl<T1: Visitor, T2: Visitor> Visitor for Zip<T1, T2>
impl<T1: Visitor, T2: Visitor> Visitor for Zip<T1, T2>
§type Item = (<T1 as Visitor>::Item, <T2 as Visitor>::Item)
type Item = (<T1 as Visitor>::Item, <T2 as Visitor>::Item)
The common item produced for both leafs and non leafs.
source§fn next(self) -> (Self::Item, Option<[Self; 2]>)
fn next(self) -> (Self::Item, Option<[Self; 2]>)
Consume this visitor, and produce the element it was pointing to
along with it’s children visitors. Read more
source§fn level_remaining_hint(&self) -> (usize, Option<usize>)
fn level_remaining_hint(&self) -> (usize, Option<usize>)
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
source§fn with_depth(self, start_depth: Depth) -> LevelIter<Self>
fn with_depth(self, start_depth: Depth) -> LevelIter<Self>
Iterator Adapter to also produce the depth each iteration.
source§fn bfs_iter(self) -> BfsIter<Self> ⓘ
fn bfs_iter(self) -> BfsIter<Self> ⓘ
Provides an iterator that returns each element in bfs order.
source§fn dfs_preorder_iter(self) -> DfsPreOrderIter<Self> ⓘ
fn dfs_preorder_iter(self) -> DfsPreOrderIter<Self> ⓘ
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> ⓘ
source§fn dfs_preorder(self, func: impl FnMut(Self::Item))
fn dfs_preorder(self, func: impl FnMut(Self::Item))
Calls the closure in dfs preorder (root,left,right).
Takes advantage of the callstack to do dfs. Read more