Struct SymbolTable 

pub struct SymbolTable {
    pub by_name: HashMap<String, SymbolInfo>,
}

Owned name → info map. BTreeMap would give deterministic iteration order but we want O(1) lookup by symbol name in the JumpTable construction step, so HashMap it is.

Fields

by_name: HashMap<String, SymbolInfo>

Implementations

impl SymbolTable

pub fn count_kind(&self, kind: SymbolKind) -> usize

Number of symbols of the given kind. Mostly a test convenience.

Trait Implementations

impl Clone for SymbolTable

fn clone(&self) -> SymbolTable

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SymbolTable

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

Formats the value using the given formatter.

impl Default for SymbolTable

fn default() -> SymbolTable

Returns the “default value” for a type.

impl Eq for SymbolTable

impl PartialEq for SymbolTable

fn eq(&self, other: &SymbolTable) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for SymbolTable