Enum rustc_middle::ty::Visibility
source · pub enum Visibility<Id = LocalDefId> {
Public,
Restricted(Id),
}
Variants§
Public
Visible everywhere (including in other crates).
Restricted(Id)
Visible only in the given crate-local module.
Implementations§
source§impl<Id> Visibility<Id>
impl<Id> Visibility<Id>
source§impl<Id: Into<DefId>> Visibility<Id>
impl<Id: Into<DefId>> Visibility<Id>
pub fn to_def_id(self) -> Visibility<DefId>
sourcepub fn is_accessible_from(
self,
module: impl Into<DefId>,
tree: impl DefIdTree
) -> bool
pub fn is_accessible_from(
self,
module: impl Into<DefId>,
tree: impl DefIdTree
) -> bool
Returns true
if an item with this visibility is accessible from the given module.
sourcepub fn is_at_least(
self,
vis: Visibility<impl Into<DefId>>,
tree: impl DefIdTree
) -> bool
pub fn is_at_least(
self,
vis: Visibility<impl Into<DefId>>,
tree: impl DefIdTree
) -> bool
Returns true
if this visibility is at least as accessible as the given visibility
source§impl Visibility<DefId>
impl Visibility<DefId>
pub fn expect_local(self) -> Visibility
sourcepub fn is_visible_locally(self) -> bool
pub fn is_visible_locally(self) -> bool
Returns true
if this item is visible anywhere in the local crate.
Trait Implementations§
source§impl<Id: Clone> Clone for Visibility<Id>
impl<Id: Clone> Clone for Visibility<Id>
source§fn clone(&self) -> Visibility<Id>
fn clone(&self) -> Visibility<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 Visibility<Id>
impl<Id: Debug> Debug for Visibility<Id>
source§impl<Id: Hash> Hash for Visibility<Id>
impl<Id: Hash> Hash for Visibility<Id>
source§impl<'__ctx, Id> HashStable<StableHashingContext<'__ctx>> for Visibility<Id>where
Id: HashStable<StableHashingContext<'__ctx>>,
impl<'__ctx, Id> HashStable<StableHashingContext<'__ctx>> for Visibility<Id>where
Id: HashStable<StableHashingContext<'__ctx>>,
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
source§impl ParameterizedOverTcx for Visibility<DefIndex>
impl ParameterizedOverTcx for Visibility<DefIndex>
type Value<'tcx> = Visibility<DefIndex>
source§impl<Id: PartialEq> PartialEq<Visibility<Id>> for Visibility<Id>
impl<Id: PartialEq> PartialEq<Visibility<Id>> for Visibility<Id>
source§fn eq(&self, other: &Visibility<Id>) -> bool
fn eq(&self, other: &Visibility<Id>) -> bool
impl<Id: Copy> Copy for Visibility<Id>
impl<Id: Eq> Eq for Visibility<Id>
impl<Id> StructuralEq for Visibility<Id>
impl<Id> StructuralPartialEq for Visibility<Id>
Auto Trait Implementations§
impl<Id> RefUnwindSafe for Visibility<Id>where
Id: RefUnwindSafe,
impl<Id> Send for Visibility<Id>where
Id: Send,
impl<Id> Sync for Visibility<Id>where
Id: Sync,
impl<Id> Unpin for Visibility<Id>where
Id: Unpin,
impl<Id> UnwindSafe for Visibility<Id>where
Id: UnwindSafe,
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<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [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). Read more
default fn to_debug_str(&self, _: Tcx) -> String
source§default 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 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 moresource§impl<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,
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, _: &[QueryInfo]) -> T
Layout§
Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.