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 Visibility
impl Visibility
pub fn to_string(self, def_id: LocalDefId, tcx: TyCtxt<'_>) -> String
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>,
tcx: TyCtxt<'_>,
) -> bool
pub fn is_accessible_from( self, module: impl Into<DefId>, tcx: TyCtxt<'_>, ) -> 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>>,
tcx: TyCtxt<'_>,
) -> bool
pub fn is_at_least( self, vis: Visibility<impl Into<DefId>>, tcx: TyCtxt<'_>, ) -> 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, __D: SpanDecoder> Decodable<__D> for Visibility<Id>where
Id: Decodable<__D>,
impl<Id, __D: SpanDecoder> Decodable<__D> for Visibility<Id>where
Id: Decodable<__D>,
source§impl<Id, __E: SpanEncoder> Encodable<__E> for Visibility<Id>where
Id: Encodable<__E>,
impl<Id, __E: SpanEncoder> Encodable<__E> for Visibility<Id>where
Id: Encodable<__E>,
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 for Visibility<Id>
impl<Id: PartialEq> PartialEq for Visibility<Id>
impl<Id: Copy> Copy for Visibility<Id>
impl<Id: Eq> Eq for Visibility<Id>
impl<Id> StructuralPartialEq for Visibility<Id>
Auto Trait Implementations§
impl<Id> Freeze for Visibility<Id>where
Id: Freeze,
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(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§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
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<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§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> Filterable for T
impl<T> Filterable for T
source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
Creates a filterable data provider with the given name for debugging. Read more
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<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<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for 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.