pub unsafe trait FixedDepthVisitor: Visitor { }
If implemented, then the level_remaining_hint must return the exact height of the tree.
If this is implemented, then the exact number of nodes that will be returned by a dfs or bfs traversal is known
so those iterators can implement TrustedLen in this case.
impl<'a, T: 'a> FixedDepthVisitor for compt::bfs_order::Vistr<'a, T>
[src]
impl<'a, T: 'a> FixedDepthVisitor for compt::bfs_order::VistrMut<'a, T>
[src]
impl<'a, T: 'a> FixedDepthVisitor for compt::dfs_order::Vistr<'a, T, InOrder>
[src]
impl<'a, T: 'a> FixedDepthVisitor for compt::dfs_order::Vistr<'a, T, PostOrder>
[src]
impl<'a, T: 'a> FixedDepthVisitor for compt::dfs_order::Vistr<'a, T, PreOrder>
[src]
impl<'a, T: 'a> FixedDepthVisitor for compt::dfs_order::VistrMut<'a, T, InOrder>
[src]
impl<'a, T: 'a> FixedDepthVisitor for compt::dfs_order::VistrMut<'a, T, PostOrder>
[src]
impl<'a, T: 'a> FixedDepthVisitor for compt::dfs_order::VistrMut<'a, T, PreOrder>
[src]
Loading content...