Struct ra_ap_hir::SemanticsScope

pub struct SemanticsScope<'a> {
    pub db: &'a dyn HirDatabase,
    // some fields omitted
}

SemanticScope encapsulates the notion of a scope (the set of visible names) at a particular program point.

It is a bit tricky, as scopes do not really exist inside the compiler. Rather, the compiler directly computes for each reference the definition it refers to. It might transiently compute the explicit scope map while doing so, but, generally, this is not something left after the analysis.

However, we do very much need explicit scopes for IDE purposes – completion, at its core, lists the contents of the current scope. The notion of scope is also useful to answer questions like “what would be the meaning of this piece of code if we inserted it into this position?”.

So SemanticsScope is constructed from a specific program point (a syntax node or just a raw offset) and provides access to the set of visible names on a somewhat best-effort basis.

Note that if you are wondering “what does this specific existing name mean?”, you’d better use the resolve_ family of methods.

Fields

db: &'a dyn HirDatabase

Implementations

impl<'a> SemanticsScope<'a>

pub fn module(&self) -> Option<Module>

pub fn krate(&self) -> Option<Crate>

pub fn traits_in_scope(&self) -> FxHashSet<TraitId>

Note: FxHashSet<TraitId> should be treated as an opaque type, passed into `Type

pub fn process_all_names(&self, f: &mut dyn FnMut(Name, ScopeDef))

pub fn speculative_resolve(&self, path: &Path) -> Option<PathResolution>

Resolve a path as-if it was written at the given scope. This is necessary a heuristic, as it doesn’t take hygiene into account.

Trait Implementations

impl<'a> Debug for SemanticsScope<'a>

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

Formats the value using the given formatter.