Struct gimli::EntriesTreeIter
[−]
[src]
pub struct EntriesTreeIter<'input, 'abbrev, 'unit, 'tree, Endian> where
'input: 'unit,
'abbrev: 'tree,
'unit: 'tree,
Endian: Endianity + 'unit, { /* fields omitted */ }
An iterator that allows recursive traversal of the Debugging Information Entry tree.
An EntriesTreeIter
for the root node of a tree can be obtained
via EntriesTree::iter
.
The items returned by this iterator are also EntriesTreeIter
s,
which allow traversal of grandchildren, etc.
Methods
impl<'input, 'abbrev, 'unit, 'tree, Endian> EntriesTreeIter<'input, 'abbrev, 'unit, 'tree, Endian> where
Endian: Endianity,
[src]
Endian: Endianity,
fn entry(
&self
) -> Option<&DebuggingInformationEntry<'input, 'abbrev, 'unit, Endian>>
&self
) -> Option<&DebuggingInformationEntry<'input, 'abbrev, 'unit, Endian>>
Returns the current entry in the tree.
This function should only be called when the EntriesTreeIter
is first created. This will return the parent entry of the iterator.
Once next
has been called, the result of this function is None
.
fn next<'me>(
&'me mut self
) -> Result<Option<EntriesTreeIter<'input, 'abbrev, 'unit, 'me, Endian>>>
&'me mut self
) -> Result<Option<EntriesTreeIter<'input, 'abbrev, 'unit, 'me, Endian>>>
Returns an iterator for the next child entry.
The returned iterator can be used to both obtain the child entry, and recursively iterate over the children of the child entry.
Returns None
if there are no more children.
Trait Implementations
impl<'input, 'abbrev, 'unit, 'tree, Endian: Debug> Debug for EntriesTreeIter<'input, 'abbrev, 'unit, 'tree, Endian> where
'input: 'unit,
'abbrev: 'tree,
'unit: 'tree,
Endian: Endianity + 'unit,
[src]
'input: 'unit,
'abbrev: 'tree,
'unit: 'tree,
Endian: Endianity + 'unit,