Struct hir::SemanticsScope
source · pub struct SemanticsScope<'a> {
pub db: &'a dyn HirDatabase,
/* private fields */
}
Expand description
SemanticsScope
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§
source§impl SemanticsScope<'_>
impl SemanticsScope<'_>
pub fn module(&self) -> Module
pub fn krate(&self) -> Crate
sourcepub fn visible_traits(&self) -> VisibleTraits
pub fn visible_traits(&self) -> VisibleTraits
Note: VisibleTraits
should be treated as an opaque type, passed into `Type
sourcepub fn process_all_names(&self, f: &mut dyn FnMut(Name, ScopeDef))
pub fn process_all_names(&self, f: &mut dyn FnMut(Name, ScopeDef))
Calls the passed closure f
on all names in scope.
sourcepub fn speculative_resolve(&self, ast_path: &Path) -> Option<PathResolution>
pub fn speculative_resolve(&self, ast_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.
sourcepub fn assoc_type_shorthand_candidates<R>(
&self,
resolution: &PathResolution,
cb: impl FnMut(&Name, TypeAlias) -> Option<R>,
) -> Option<R>
pub fn assoc_type_shorthand_candidates<R>( &self, resolution: &PathResolution, cb: impl FnMut(&Name, TypeAlias) -> Option<R>, ) -> Option<R>
Iterates over associated types that may be specified after the given path (using
Ty::Assoc
syntax).
pub fn extern_crates(&self) -> impl Iterator<Item = (Name, Module)> + '_
pub fn extern_crate_decls(&self) -> impl Iterator<Item = Name> + '_
pub fn has_same_self_type(&self, other: &SemanticsScope<'_>) -> bool
Trait Implementations§
Auto Trait Implementations§
impl<'a> Freeze for SemanticsScope<'a>
impl<'a> !RefUnwindSafe for SemanticsScope<'a>
impl<'a> !Send for SemanticsScope<'a>
impl<'a> !Sync for SemanticsScope<'a>
impl<'a> Unpin for SemanticsScope<'a>
impl<'a> !UnwindSafe for SemanticsScope<'a>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
§impl<T> Cast for T
impl<T> Cast for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more