Struct rustc_middle::middle::privacy::AccessLevels
source · [−]pub struct AccessLevels<Id = LocalDefId> {
map: FxHashMap<Id, EffectiveVisibility>,
}
Expand description
Holds a map of accessibility levels for reachable HIR nodes.
Fields
map: FxHashMap<Id, EffectiveVisibility>
Implementations
sourceimpl<Id: Hash + Eq + Copy> AccessLevels<Id>
impl<Id: Hash + Eq + Copy> AccessLevels<Id>
pub fn is_public_at_level(&self, id: Id, tag: AccessLevel) -> bool
sourcepub fn is_reachable(&self, id: Id) -> bool
pub fn is_reachable(&self, id: Id) -> bool
See AccessLevel::Reachable
.
sourcepub fn is_exported(&self, id: Id) -> bool
pub fn is_exported(&self, id: Id) -> bool
See AccessLevel::Exported
.
pub fn get_access_level(&self, id: Id) -> Option<AccessLevel>
pub fn set_access_level(&mut self, id: Id, tag: AccessLevel)
pub fn get_effective_vis(&self, id: Id) -> Option<&EffectiveVisibility>
pub fn iter(&self) -> impl Iterator<Item = (&Id, &EffectiveVisibility)>
pub fn map_id<OutId: Hash + Eq + Copy>(
&self,
f: impl Fn(Id) -> OutId
) -> AccessLevels<OutId>
Trait Implementations
sourceimpl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for AccessLevels
impl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for AccessLevels
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]ⓘNotable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]
sourceimpl<Id: Clone> Clone for AccessLevels<Id>
impl<Id: Clone> Clone for AccessLevels<Id>
sourcefn clone(&self) -> AccessLevels<Id>
fn clone(&self) -> AccessLevels<Id>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresourceimpl<Id: Debug> Debug for AccessLevels<Id>
impl<Id: Debug> Debug for AccessLevels<Id>
sourceimpl<Id> Default for AccessLevels<Id>
impl<Id> Default for AccessLevels<Id>
sourceimpl<'a> HashStable<StableHashingContext<'a>> for AccessLevels
impl<'a> HashStable<StableHashingContext<'a>> for AccessLevels
fn hash_stable(
&self,
hcx: &mut StableHashingContext<'a>,
hasher: &mut StableHasher
)
Auto Trait Implementations
impl<Id> RefUnwindSafe for AccessLevels<Id>where
Id: RefUnwindSafe,
impl<Id> Send for AccessLevels<Id>where
Id: Send,
impl<Id> Sync for AccessLevels<Id>where
Id: Sync,
impl<Id> Unpin for AccessLevels<Id>where
Id: Unpin,
impl<Id> UnwindSafe for AccessLevels<Id>where
Id: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
sourcedefault fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
This method turns the parameters of a DepNodeConstructor into an opaque
Fingerprint to be used in DepNode.
Not all DepNodeParams support being turned into a Fingerprint (they
don’t need to if the corresponding DepNode is anonymous). Read more
default fn to_debug_str(&self, Ctxt) -> String
sourcedefault fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
default fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
This method tries to recover the query key from the given
DepNode
,
something which is needed when forcing DepNode
s during red-green
evaluation. The query system will only call this method if
fingerprint_style()
is not FingerprintStyle::Opaque
.
It is always valid to return None
here, in which case incremental
compilation will treat the query as having changed instead of forcing it. Read moresourceimpl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
impl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
default fn from_cycle_error(tcx: CTX) -> T
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
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: 32 bytes