Struct rustc_middle::middle::privacy::EffectiveVisibilities
source · pub struct EffectiveVisibilities<Id = LocalDefId> {
map: FxHashMap<Id, EffectiveVisibility>,
}
Expand description
Holds a map of effective visibilities for reachable HIR nodes.
Fields§
§map: FxHashMap<Id, EffectiveVisibility>
Implementations§
source§impl EffectiveVisibilities
impl EffectiveVisibilities
pub fn is_public_at_level(&self, id: LocalDefId, level: Level) -> bool
sourcepub fn is_reachable(&self, id: LocalDefId) -> bool
pub fn is_reachable(&self, id: LocalDefId) -> bool
See Level::Reachable
.
sourcepub fn is_exported(&self, id: LocalDefId) -> bool
pub fn is_exported(&self, id: LocalDefId) -> bool
See Level::Reexported
.
sourcepub fn is_directly_public(&self, id: LocalDefId) -> bool
pub fn is_directly_public(&self, id: LocalDefId) -> bool
See Level::Direct
.
pub fn public_at_level(&self, id: LocalDefId) -> Option<Level>
pub fn update_root(&mut self)
pub fn update_eff_vis( &mut self, def_id: LocalDefId, eff_vis: &EffectiveVisibility, tcx: TyCtxt<'_> )
pub fn check_invariants(&self, tcx: TyCtxt<'_>)
source§impl<Id: Eq + Hash> EffectiveVisibilities<Id>
impl<Id: Eq + Hash> EffectiveVisibilities<Id>
pub fn iter(&self) -> impl Iterator<Item = (&Id, &EffectiveVisibility)>
pub fn effective_vis(&self, id: Id) -> Option<&EffectiveVisibility>
pub fn effective_vis_or_private( &mut self, id: Id, lazy_private_vis: impl FnOnce() -> Visibility ) -> &EffectiveVisibility
pub fn update( &mut self, id: Id, max_vis: Option<Visibility>, lazy_private_vis: impl FnOnce() -> Visibility, inherited_effective_vis: EffectiveVisibility, level: Level, tcx: TyCtxt<'_> ) -> bool
Trait Implementations§
source§impl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for EffectiveVisibilities
impl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for EffectiveVisibilities
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]
source§impl<Id: Clone> Clone for EffectiveVisibilities<Id>
impl<Id: Clone> Clone for EffectiveVisibilities<Id>
source§fn clone(&self) -> EffectiveVisibilities<Id>
fn clone(&self) -> EffectiveVisibilities<Id>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<Id: Debug> Debug for EffectiveVisibilities<Id>
impl<Id: Debug> Debug for EffectiveVisibilities<Id>
source§impl<Id> Default for EffectiveVisibilities<Id>
impl<Id> Default for EffectiveVisibilities<Id>
source§impl<'a> HashStable<StableHashingContext<'a>> for EffectiveVisibilities
impl<'a> HashStable<StableHashingContext<'a>> for EffectiveVisibilities
fn hash_stable( &self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher )
Auto Trait Implementations§
impl<Id> RefUnwindSafe for EffectiveVisibilities<Id>where Id: RefUnwindSafe,
impl<Id> Send for EffectiveVisibilities<Id>where Id: Send,
impl<Id> Sync for EffectiveVisibilities<Id>where Id: Sync,
impl<Id> Unpin for EffectiveVisibilities<Id>where Id: Unpin,
impl<Id> UnwindSafe for EffectiveVisibilities<Id>where Id: UnwindSafe,
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
Mutably borrows from an owned value. Read more
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> 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).
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> 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.source§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<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> 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: &[QueryInfo], _guar: ErrorGuaranteed ) -> T
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