Struct compt::Wrap

pub struct Wrap<'a, T: 'a> { /* fields omitted */ }

Allows to traverse down from a visitor twice by creating a new visitor that borrows the other.

Methods

impl<'a, T: 'a> Wrap<'a, T>

fn new(a: &'a mut LevelIter<DownTMut<T>>) -> Wrap<'a, T>

Trait Implementations

impl<'a, T: 'a> CTreeIterator for Wrap<'a, T>

type Item = (LevelDesc, &'a mut T)

fn next(self) -> (Self::Item, Option<(Self, Self)>)

Consume this visitor, and produce the element it was pointing to along with it's children visitors.

fn zip<F: CTreeIterator>(self, f: F) -> ZippedDownTMut<Self, F>

Combine two tree visitors.

fn dfs_preorder<F: FnMut(Self::Item)>(self, func: F)

Calls the closure in dfs preorder (left,right,root).

fn dfs_postorder<F: FnMut(Self::Item)>(self, func: F)

Calls the closure in dfs postorder (right,left,root).