Struct trees::bfs::BfsForest

pub struct BfsForest<Iter> {
    pub iter: Iter,
    pub size: Size,
}

Forest iterator for breadth first search.

Fields

iter: Iter

size: Size

Implementations

impl<Item, Iter> BfsForest<Splitted<Iter>> where
    Iter: Iterator<Item = Item>, 

pub fn from<Treelike>(treelike: Treelike, size: Size) -> Self where
    Treelike: IntoIterator<Item = Item, IntoIter = Iter>, 

impl<Iter> BfsForest<Iter>

pub fn wrap(self) -> Bfs<Iter>

pub fn map<B, F, T>(self, mut f: F) -> BfsForest<impl Iterator<Item = Visit<B>>> where
    Iter: Iterator<Item = Visit<T>>,
    F: FnMut(T) -> B, 

Takes a closure and creates another BfsForest which calls that closure on each Visit::data.

Examples

use trees::Forest;

let forest = Forest::<i32>::from_tuple(( 0, (1,2,3), (4,5,6), ));
assert_eq!( Forest::from( forest.bfs() ),
    Forest::<&i32>::from_tuple(( &0, (&1,&2,&3), (&4,&5,&6), )));
assert_eq!( Forest::from( forest.bfs().map( ToOwned::to_owned )),
    Forest::<i32>::from_tuple(( 0, (1,2,3), (4,5,6), )));

Trait Implementations

impl<T, Iter> From<BfsForest<Iter>> for Forest<T> where
    Iter: Iterator<Item = Visit<T>>, 

fn from(forest_iter: BfsForest<Iter>) -> Self

Performs the conversion.