Struct goblin::mach::symbols::Symbols [−][src]
pub struct Symbols<'a> { /* fields omitted */ }
Expand description
A zero-copy “nlist” style symbol table (“stab”), including the string table
Implementations
Creates a new symbol table with count
elements, from the start
offset, using the string table at strtab
, with a default ctx.
Beware, this will provide incorrect results if you construct this on a 32-bit mach binary, using a 64-bit machine; use parse
instead if you want 32/64 bit support
pub fn iter(&self) -> SymbolIterator<'a>ⓘNotable traits for SymbolIterator<'a>
impl<'a> Iterator for SymbolIterator<'a> type Item = Result<(&'a str, Nlist)>;
Trait Implementations
type Item = <SymbolIterator<'a> as Iterator>::Item
type Item = <SymbolIterator<'a> as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = SymbolIterator<'a>
type IntoIter = SymbolIterator<'a>
Which kind of iterator are we turning this into?
Auto Trait Implementations
impl<'a> RefUnwindSafe for Symbols<'a>
impl<'a> UnwindSafe for Symbols<'a>