Trait compt::FixedDepthVisitor

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.

Implementors

impl<'a, T: 'a> FixedDepthVisitor for compt::bfs_order::Vistr<'a, T>

impl<'a, T: 'a> FixedDepthVisitor for compt::bfs_order::VistrMut<'a, T>

impl<'a, T: 'a> FixedDepthVisitor for compt::dfs_order::Vistr<'a, T, InOrder>

impl<'a, T: 'a> FixedDepthVisitor for compt::dfs_order::Vistr<'a, T, PostOrder>

impl<'a, T: 'a> FixedDepthVisitor for compt::dfs_order::Vistr<'a, T, PreOrder>

impl<'a, T: 'a> FixedDepthVisitor for compt::dfs_order::VistrMut<'a, T, InOrder>

impl<'a, T: 'a> FixedDepthVisitor for compt::dfs_order::VistrMut<'a, T, PostOrder>

impl<'a, T: 'a> FixedDepthVisitor for compt::dfs_order::VistrMut<'a, T, PreOrder>

impl<B, C: FixedDepthVisitor, F: Fn(C::Item) -> B + Clone> FixedDepthVisitor for Map<C, F>

impl<T1: FixedDepthVisitor, T2: FixedDepthVisitor> FixedDepthVisitor for Zip<T1, T2>

impl<T: FixedDepthVisitor> FixedDepthVisitor for Flip<T>

impl<T: FixedDepthVisitor> FixedDepthVisitor for LevelIter<T>