Struct gimli::read::EntriesTreeIter
source · pub struct EntriesTreeIter<'abbrev, 'unit, 'tree, R: Reader> {
tree: &'tree mut EntriesTree<'abbrev, 'unit, R>,
depth: isize,
empty: bool,
}
Expand description
An iterator that allows traversal of the children of an
EntriesTreeNode
.
The items returned by this iterator are also EntriesTreeNode
s,
which allow recursive traversal of grandchildren, etc.
Fields§
§tree: &'tree mut EntriesTree<'abbrev, 'unit, R>
§depth: isize
§empty: bool
Implementations§
source§impl<'abbrev, 'unit, 'tree, R: Reader> EntriesTreeIter<'abbrev, 'unit, 'tree, R>
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>
sourcepub fn next<'me>(
&'me mut self,
) -> Result<Option<EntriesTreeNode<'abbrev, 'unit, 'me, 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§
Auto Trait Implementations§
impl<'abbrev, 'unit, 'tree, R> Freeze for EntriesTreeIter<'abbrev, 'unit, 'tree, R>
impl<'abbrev, 'unit, 'tree, R> !RefUnwindSafe for EntriesTreeIter<'abbrev, 'unit, 'tree, R>
impl<'abbrev, 'unit, 'tree, R> Send for EntriesTreeIter<'abbrev, 'unit, 'tree, R>
impl<'abbrev, 'unit, 'tree, R> !Sync for EntriesTreeIter<'abbrev, 'unit, 'tree, R>
impl<'abbrev, 'unit, 'tree, R> Unpin for EntriesTreeIter<'abbrev, 'unit, 'tree, R>
impl<'abbrev, 'unit, 'tree, R> !UnwindSafe for EntriesTreeIter<'abbrev, 'unit, 'tree, R>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more