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
sourceimpl 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_eff_vis(
&mut self,
def_id: LocalDefId,
eff_vis: &EffectiveVisibility,
tree: impl DefIdTree
)
pub fn set_public_at_level(
&mut self,
id: LocalDefId,
default_vis: impl FnOnce() -> Visibility,
level: Level
)
pub fn check_invariants(&self, tcx: TyCtxt<'_>, early: bool)
sourceimpl<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 update(
&mut self,
id: Id,
nominal_vis: Visibility,
default_vis: Visibility,
inherited_eff_vis: Option<EffectiveVisibility>,
level: Level,
tree: impl DefIdTree
) -> bool
Trait Implementations
sourceimpl<'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] ⓘ
sourceimpl<Id: Clone> Clone for EffectiveVisibilities<Id>
impl<Id: Clone> Clone for EffectiveVisibilities<Id>
sourcefn clone(&self) -> EffectiveVisibilities<Id>
fn clone(&self) -> EffectiveVisibilities<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 EffectiveVisibilities<Id>
impl<Id: Debug> Debug for EffectiveVisibilities<Id>
sourceimpl<Id> Default for EffectiveVisibilities<Id>
impl<Id> Default for EffectiveVisibilities<Id>
sourceimpl<'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
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<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
sourcedefault 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). Read more
default fn to_debug_str(&self, _: Tcx) -> String
sourcedefault fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
This method tries to recover the query key from the given
DepNode,
something which is needed when forcing DepNodes 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<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T
sourceimpl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error(tcx: Tcx, _: &[QueryInfo]) -> 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