Struct rustc_middle::middle::stability::Index

source ·

pub struct Index {
    pub stab_map: LocalDefIdMap<Stability>,
    pub const_stab_map: LocalDefIdMap<ConstStability>,
    pub default_body_stab_map: LocalDefIdMap<DefaultBodyStability>,
    pub depr_map: LocalDefIdMap<DeprecationEntry>,
    pub implications: UnordMap<Symbol, Symbol>,
}

Expand description

A stability index, giving the stability level for items and methods.

Fields§

§stab_map: LocalDefIdMap<Stability>

This is mostly a cache, except the stabilities of local items are filled by the annotator.

§const_stab_map: LocalDefIdMap<ConstStability>§default_body_stab_map: LocalDefIdMap<DefaultBodyStability>§depr_map: LocalDefIdMap<DeprecationEntry>§implications: UnordMap<Symbol, Symbol>

Mapping from feature name to feature name based on the implied_by field of #[unstable] attributes. If a #[unstable(feature = "implier", implied_by = "impliee")] attribute exists, then this map will have a impliee -> implier entry.

This mapping is necessary unless both the #[stable] and #[unstable] attributes should specify their implications (both implies and implied_by). If only one of the two attributes do (as in the current implementation, implied_by in #[unstable]), then this mapping is necessary for diagnostics. When a “unnecessary feature attribute” error is reported, only the #[stable] attribute information is available, so the map is necessary to know that the feature implies another feature. If it were reversed, and the #[stable] attribute had an implies meta item, then a map would be necessary when avoiding a “use of unstable feature” error for a feature that was implied.

Struct rustc_middle::middle::stability::Index

Fields§

Implementations§

impl Index

pub fn local_stability(&self, def_id: LocalDefId) -> Option<Stability>

pub fn local_const_stability( &self, def_id: LocalDefId ) -> Option<ConstStability>

pub fn local_default_body_stability( &self, def_id: LocalDefId ) -> Option<DefaultBodyStability>

pub fn local_deprecation_entry( &self, def_id: LocalDefId ) -> Option<DeprecationEntry>

Trait Implementations§

impl Debug for Index

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for Index

fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )

Auto Trait Implementations§

impl DynSend for Index

impl DynSync for Index

impl Freeze for Index

impl RefUnwindSafe for Index

impl Send for Index

impl Sync for Index

impl Unpin for Index

impl UnwindSafe for Index

Blanket Implementations§

impl<T> Aligned for T

const ALIGN: Alignment = _

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T, R> CollectAndApply<T, R> for T

fn collect_and_apply<I, F>(iter: I, f: F) -> Rwhere I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

type Output = R

impl<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

default fn fingerprint_style() -> FingerprintStyle

default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint

default fn to_debug_str(&self, _: Tcx) -> String

default fn recover(_: Tcx, _: &DepNode) -> Option<T>

impl<T> Filterable for T

fn filterable( self, filter_name: &'static str ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>

impl<T> From<T> for T

fn from(t: T) -> T

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

fn in_current_span(self) -> Instrumented<Self>

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<P> IntoQueryParam<P> for P

fn into_query_param(self) -> P

impl<T> MaybeResult<T> for T

type Error = !

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

impl<T> Pointable for T

const ALIGN: usize = _

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

impl<T> Same for T

type Output = T

impl<'tcx, T> ToPredicate<'tcx, T> for T

fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

fn vzip(self) -> V

impl<Tcx, T> Value<Tcx> for Twhere Tcx: DepContext,

default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed ) -> T

impl<T> WithSubscriber for T

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where S: Into<Dispatch>,

fn with_current_subscriber(self) -> WithDispatch<Self>

impl<'a, T> Captures<'a> for Twhere T: ?Sized,

impl<T> ErasedDestructor for Twhere T: 'static,

impl<'ctx> HashStable<StableHashingContext<'ctx>> for Index

fn hash_stable( &self, hcx: &mut StableHashingContext<'ctx>, __hasher: &mut StableHasher )

impl<T> Any for T
where T: 'static + ?Sized,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

impl<Tcx, T> DepNodeParams<Tcx> for T
where Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

impl<T, U> Into<U> for T
where U: From<T>,

impl<T, U> TryFrom<U> for T
where U: Into<T>,

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

impl<'a, T> Captures<'a> for T
where T: ?Sized,

impl<T> ErasedDestructor for T
where T: 'static,

impl<T> MaybeSendSync for T
where T: Send + Sync,