pub(crate) struct Module<'ra>(pub(crate) Interned<'ra, ModuleData<'ra>>);Expand description
All modules are unique and allocated on a same arena, so we can use referential equality to compare them.
Tuple Fields§
§0: Interned<'ra, ModuleData<'ra>>Implementations§
Source§impl<'ra> Module<'ra>
impl<'ra> Module<'ra>
pub(crate) fn for_each_child<'tcx, R: AsRef<Resolver<'ra, 'tcx>>>( self, resolver: &R, f: impl FnMut(&R, Macros20NormalizedIdent, Namespace, Interned<'ra, NameBindingData<'ra>>), )
pub(crate) fn for_each_child_mut<'tcx, R: AsMut<Resolver<'ra, 'tcx>>>( self, resolver: &mut R, f: impl FnMut(&mut R, Macros20NormalizedIdent, Namespace, Interned<'ra, NameBindingData<'ra>>), )
Sourcepub(crate) fn ensure_traits<'tcx>(
self,
resolver: &impl AsRef<Resolver<'ra, 'tcx>>,
)
pub(crate) fn ensure_traits<'tcx>( self, resolver: &impl AsRef<Resolver<'ra, 'tcx>>, )
This modifies self in place. The traits will be stored in self.traits.
pub(crate) fn res(self) -> Option<Res<NodeId>>
pub(crate) fn def_id(self) -> DefId
pub(crate) fn opt_def_id(self) -> Option<DefId>
pub(crate) fn is_normal(self) -> bool
pub(crate) fn is_trait(self) -> bool
pub(crate) fn nearest_item_scope(self) -> Module<'ra>
Sourcepub(crate) fn nearest_parent_mod(self) -> DefId
pub(crate) fn nearest_parent_mod(self) -> DefId
The DefId of the nearest mod item ancestor (which may be this module).
This may be the crate root.
pub(crate) fn is_ancestor_of(self, other: Self) -> bool
Trait Implementations§
impl<'ra> Copy for Module<'ra>
impl<'ra> Eq for Module<'ra>
impl<'ra> StructuralPartialEq for Module<'ra>
Auto Trait Implementations§
impl<'ra> !DynSend for Module<'ra>
impl<'ra> !DynSync for Module<'ra>
impl<'ra> Freeze for Module<'ra>
impl<'ra> !RefUnwindSafe for Module<'ra>
impl<'ra> !Send for Module<'ra>
impl<'ra> !Sync for Module<'ra>
impl<'ra> Unpin for Module<'ra>
impl<'ra> !UnwindSafe for Module<'ra>
Blanket Implementations§
Source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]
Source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]
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
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§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>
Converts
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>
Converts
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 moreSource§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
Source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
Source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
Source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
Source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
Source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
Source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<T> ErasedDestructor for Twhere
T: 'static,
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 8 bytes