Struct SemanticLayer 

pub struct SemanticLayer { /* private fields */ }

The resolve-time consumption path’s built-once layer: freshness, plus a (file, name_line, member) compatibility join index over every admitted occurrence, with identity translation applied lazily per lookup. Built by load.

Implementations

impl SemanticLayer

pub fn load(root: &Path) -> Option<SemanticLayer>

Reads this checkout’s admitted compiler-facts artifact and builds the layer. None when no artifact is admitted (the ordinary “no engine ever ran here” state) or its bytes do not parse as this module expects; both are fail-open, not errors – the whole run proceeds as a syntax-only build.

pub fn is_fresh(&self) -> bool

Whether the whole artifact is fresh – consulted once per map run, not per reference.

pub fn site_keys(&self) -> impl Iterator<Item = &(String, usize, String)>

Every distinct (file, name_line, member) compatibility key this layer indexes – discovered.rs’s own iteration surface, walked once per admitted artifact rather than once per extractor reference.

pub fn lookup( &self, index: &DefIndex, file: &str, line: usize, member: &str, caller_arg_count: Option<usize>, ) -> LookupOutcome

Looks up the compatibility join key (file, name_line, member). Freshness is checked first (a stale artifact never confirms anything, regardless of what any individual site says). More than one matching site is not automatically an ambiguity: caller_arg_count, the reference’s own argument count when the call syntax carries one (None for a property read, which never disambiguates), is compared against each candidate’s target_overload_signature – the exact identity carried alongside this compatibility key, not folded into it. When exactly one candidate’s own arity matches, that candidate alone is resolved, the same way a single hit would be; two same-line overloads of one member survive as distinct facts through this path rather than collapsing together. Only when arity cannot narrow the set to one (no caller arg count, no signature, more than one survivor, or a genuine tie) do disagreeing targets collapse to an ambiguous outcome rather than picking one arbitrarily – the key is a compatibility join, not the fact’s own identity, so more than one unresolved hit at it is a real ambiguity this consumer introduces, not one the compiler itself reported.