Struct SymbolTable 

pub struct SymbolTable {
    pub symbols: BTreeMap<SymbolId, SymbolInfo>,
    pub dependencies: BTreeMap<SymbolId, BTreeSet<SymbolId>>,
    /* private fields */
}

Symbol table for efficient lookups and validation

Fields

symbols: BTreeMap<SymbolId, SymbolInfo>

Map from SymbolId to symbol information

dependencies: BTreeMap<SymbolId, BTreeSet<SymbolId>>

Dependencies between symbols

Implementations

impl SymbolTable

pub fn new() -> Self

pub fn register(&mut self, symbol: SymbolInfo)

Register a new symbol in the table

pub fn get(&self, id: &SymbolId) -> Option<&SymbolInfo>

Lookup symbol by ID

pub fn get_by_path(&self, path: &[String]) -> Option<&SymbolInfo>

Lookup symbol by name path

pub fn get_by_kind<'a>( &'a self, kind: &'a SymbolKind, ) -> impl Iterator<Item = &'a SymbolInfo> + 'a

Get all symbols of a specific kind

pub fn add_dependency(&mut self, dependent: SymbolId, dependency: SymbolId)

Add dependency relationship

pub fn get_dependencies(&self, id: &SymbolId) -> Option<&BTreeSet<SymbolId>>

Get dependencies of a symbol

pub fn topological_sort(&self) -> Result<Vec<SymbolId>, Vec<SymbolId>>

Topological sort for dependency resolution

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() -> Self

Returns the “default value” for a type.

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 Eq for SymbolTable

impl StructuralPartialEq for SymbolTable