pub struct Map<C, F> { /* private fields */ }
Expand description
Map iterator adapter
Trait Implementations§
source§impl<E, B, C: Visitor, F: Fn(C::Item, Option<C::NonLeafItem>) -> (B, Option<E>) + Clone> Visitor for Map<C, F>
impl<E, B, C: Visitor, F: Fn(C::Item, Option<C::NonLeafItem>) -> (B, Option<E>) + Clone> Visitor for Map<C, F>
§type NonLeafItem = E
type NonLeafItem = E
A NonLeafItem item can be returned for non leafs.
source§fn next(self) -> (Self::Item, Option<(Self::NonLeafItem, Self, Self)>)
fn next(self) -> (Self::Item, Option<(Self::NonLeafItem, Self, Self)>)
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 map<B, E, F: Fn(Self::Item, Option<Self::NonLeafItem>) -> (B, Option<E>)>(
self,
func: F
) -> Map<Self, F>
fn map<B, E, F: Fn(Self::Item, Option<Self::NonLeafItem>) -> (B, Option<E>)>(
self,
func: F
) -> Map<Self, F>
Map iterator adapter
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, Option<Self::NonLeafItem>))
fn dfs_preorder(self, func: impl FnMut(Self::Item, Option<Self::NonLeafItem>))
Calls the closure in dfs preorder (root,left,right).
Takes advantage of the callstack to do dfs. Read more
source§fn dfs_inorder(self, func: impl FnMut(Self::Item, Option<Self::NonLeafItem>))
fn dfs_inorder(self, func: impl FnMut(Self::Item, Option<Self::NonLeafItem>))
Calls the closure in dfs preorder (left,right,root).
Takes advantage of the callstack to do dfs. Read more