Struct compt::LevelIter

pub struct LevelIter<T: CTreeIterator> { /* fields omitted */ }

A wrapper iterator that will additionally return the depth of each element.

Methods

impl<T: CTreeIterator> LevelIter<T>

fn new(a: T, leveld: LevelDesc) -> LevelIter<T>

Trait Implementations

impl<T: CTreeIterator> CTreeIterator for LevelIter<T>

type Item = (LevelDesc, T::Item)

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) -> Zip<Self, F>

Combine two tree visitors.

fn bfs_iter(self) -> BfsIter<Self>

Provides an iterator that returns each element in bfs order. A callback version is not provided because a queue would still need to be used, So it wouldnt be able to take advantage of the stack anyway.

fn dfs_preorder_iter(self) -> DfsPreorderIter<Self>

Provides a dfs preorder iterator. Unlike the callback version, This one relies on dynamic allocation for its queue.

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

Calls the closure in dfs preorder (left,right,root). Takes advantage of the callstack to do dfs.

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

Calls the closure in dfs postorder (right,left,root). Takes advantage of the callstack to do dfs.