Struct EntriesTreeIter 

pub struct EntriesTreeIter<'abbrev, 'unit, 'tree, R: Reader> {
    tree: &'tree mut EntriesTree<'abbrev, 'unit, R>,
    depth: isize,
    empty: bool,
}

An iterator that allows traversal of the children of an EntriesTreeNode.

The items returned by this iterator are also EntriesTreeNodes, which allow recursive traversal of grandchildren, etc.

Fields

tree: &'tree mut EntriesTree<'abbrev, 'unit, R>

depth: isize

empty: bool

Implementations

impl<'abbrev, 'unit, 'tree, R: Reader> EntriesTreeIter<'abbrev, 'unit, 'tree, R>

fn new( tree: &'tree mut EntriesTree<'abbrev, 'unit, R>, depth: isize, ) -> EntriesTreeIter<'abbrev, 'unit, 'tree, R>

pub fn next<'me>( &'me mut self, ) -> Result<Option<EntriesTreeNode<'abbrev, 'unit, 'me, R>>>

Returns an EntriesTreeNode for the next child entry.

Returns None if there are no more children.

Trait Implementations

impl<'abbrev, 'unit, 'tree, R: Debug + Reader> Debug for EntriesTreeIter<'abbrev, 'unit, 'tree, R>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.