Struct ResolveCtx 

pub struct ResolveCtx<'a> {
    pub symbols: &'a SymbolTable,
    pub current_module: Option<String>,
}

Resolver state. Carries the symbol table the pass resolves against and the module prefix the current item lives in. The prefix matters for entry items that declare module Main — the symbol table stores them under FnKey::entry / TypeKey::entry, but the source-level references inside their bodies still use the interior name, so the resolver needs both candidates to match Phase B’s canonical resolution rules.

Fields

symbols: &'a SymbolTable

current_module: Option<String>

Implementations

impl<'a> ResolveCtx<'a>

pub fn new(symbols: &'a SymbolTable) -> Self

pub fn resolve_fn_id(&self, name: &str) -> Option<FnId>

Resolve a fn reference to a FnId. Tries (in order):

1. Qualified: Module.fn → FnKey::in_module(Module, fn).
2. Current module: fn → FnKey::in_module(current, fn).
3. Current-as-entry: when the qualified prefix matches the current module, also probe FnKey::entry(fn) (entry items live under entry scope in the symbol table even when they declare module X).
4. Entry: fn → FnKey::entry(fn).

pub fn resolve_type_id(&self, name: &str) -> Option<TypeId>

Type-side equivalent of Self::resolve_fn_id.

Resolution order (first match wins):

1. prefix.name matches TypeKey::in_module(prefix, name).
2. prefix.name with prefix == current_module matches the entry-scope TypeKey::entry(name) (Aver lets a self-referencing module spell its own type with the qualified form).
3. Bare name in current_module (TypeKey::in_module(current, name)).
4. Bare name in entry scope (TypeKey::entry(name)).
5. Bare name searched across every scope via crate::ir::SymbolTable::type_id_by_bare_name — handles the cross-module case where module A references type Val declared in module B without qualification. Returns None when ambiguous (caller must qualify).

pub fn resolve_user_ctor( &self, dotted: &str, ) -> Option<(CtorId, TypeId, String)>

Resolve a "Type.Variant" constructor reference to a (CtorId, TypeId, variant_name) triple.