pub struct AdtDef<'tcx>(pub Interned<'tcx, AdtDefData>);
Tuple Fields§
§0: Interned<'tcx, AdtDefData>
Implementations§
source§impl<'tcx> AdtDef<'tcx>
impl<'tcx> AdtDef<'tcx>
pub fn did(self) -> DefId
pub fn variants(self) -> &'tcx IndexSlice<VariantIdx, VariantDef>
pub fn variant(self, idx: VariantIdx) -> &'tcx VariantDef
pub fn flags(self) -> AdtFlags
pub fn repr(self) -> ReprOptions
source§impl<'tcx> AdtDef<'tcx>
impl<'tcx> AdtDef<'tcx>
sourcepub fn is_variant_list_non_exhaustive(self) -> bool
pub fn is_variant_list_non_exhaustive(self) -> bool
Returns true
if the variant list of this ADT is #[non_exhaustive]
.
sourcepub fn variant_descr(self) -> &'static str
pub fn variant_descr(self) -> &'static str
Returns a description of a variant of this abstract data type.
sourcepub fn has_ctor(self) -> bool
pub fn has_ctor(self) -> bool
If this function returns true
, it implies that is_struct
must return true
.
sourcepub fn is_fundamental(self) -> bool
pub fn is_fundamental(self) -> bool
Returns true
if this type is #[fundamental]
for the purposes
of coherence checking.
sourcepub fn is_phantom_data(self) -> bool
pub fn is_phantom_data(self) -> bool
Returns true
if this is PhantomData<T>
.
sourcepub fn is_unsafe_cell(self) -> bool
pub fn is_unsafe_cell(self) -> bool
Returns true
if this is UnsafeCell<T>
.
sourcepub fn is_manually_drop(self) -> bool
pub fn is_manually_drop(self) -> bool
Returns true
if this is ManuallyDrop<T>
.
sourcepub fn is_anonymous(self) -> bool
pub fn is_anonymous(self) -> bool
Returns true
if this is an anonymous adt
pub fn has_non_const_dtor(self, tcx: TyCtxt<'tcx>) -> bool
sourcepub fn non_enum_variant(self) -> &'tcx VariantDef
pub fn non_enum_variant(self) -> &'tcx VariantDef
Asserts this is a struct or union and returns its unique variant.
pub fn predicates(self, tcx: TyCtxt<'tcx>) -> GenericPredicates<'tcx>
sourcepub fn all_fields(self) -> impl Iterator<Item = &'tcx FieldDef> + Clone
pub fn all_fields(self) -> impl Iterator<Item = &'tcx FieldDef> + Clone
Returns an iterator over all fields contained by this ADT (nested unnamed fields are not expanded).
sourcepub fn is_payloadfree(self) -> bool
pub fn is_payloadfree(self) -> bool
Whether the ADT lacks fields. Note that this includes uninhabited enums,
e.g., enum Void {}
is considered payload free as well.
sourcepub fn variant_with_id(self, vid: DefId) -> &'tcx VariantDef
pub fn variant_with_id(self, vid: DefId) -> &'tcx VariantDef
Return a VariantDef
given a variant id.
sourcepub fn variant_with_ctor_id(self, cid: DefId) -> &'tcx VariantDef
pub fn variant_with_ctor_id(self, cid: DefId) -> &'tcx VariantDef
Return a VariantDef
given a constructor id.
sourcepub fn variant_index_with_id(self, vid: DefId) -> VariantIdx
pub fn variant_index_with_id(self, vid: DefId) -> VariantIdx
Return the index of VariantDef
given a variant id.
sourcepub fn variant_index_with_ctor_id(self, cid: DefId) -> VariantIdx
pub fn variant_index_with_ctor_id(self, cid: DefId) -> VariantIdx
Return the index of VariantDef
given a constructor id.
pub fn variant_of_res(self, res: Res) -> &'tcx VariantDef
pub fn eval_explicit_discr( self, tcx: TyCtxt<'tcx>, expr_did: DefId, ) -> Result<Discr<'tcx>, ErrorGuaranteed>
pub fn discriminants( self, tcx: TyCtxt<'tcx>, ) -> impl Iterator<Item = (VariantIdx, Discr<'tcx>)> + Captures<'tcx>
pub fn variant_range(self) -> Range<VariantIdx>
sourcepub fn discriminant_for_variant(
self,
tcx: TyCtxt<'tcx>,
variant_index: VariantIdx,
) -> Discr<'tcx>
pub fn discriminant_for_variant( self, tcx: TyCtxt<'tcx>, variant_index: VariantIdx, ) -> Discr<'tcx>
Computes the discriminant value used by a specific variant.
Unlike discriminants
, this is (amortized) constant-time,
only doing at most one query for evaluating an explicit
discriminant (the last one before the requested variant),
assuming there are no constant-evaluation errors there.
sourcepub fn discriminant_def_for_variant(
self,
variant_index: VariantIdx,
) -> (Option<DefId>, u32)
pub fn discriminant_def_for_variant( self, variant_index: VariantIdx, ) -> (Option<DefId>, u32)
Yields a DefId
for the discriminant and an offset to add to it
Alternatively, if there is no explicit discriminant, returns the
inferred discriminant directly.
pub fn destructor(self, tcx: TyCtxt<'tcx>) -> Option<Destructor>
pub fn async_destructor(self, tcx: TyCtxt<'tcx>) -> Option<AsyncDestructor>
sourcepub fn sized_constraint(
self,
tcx: TyCtxt<'tcx>,
) -> Option<EarlyBinder<'tcx, Ty<'tcx>>>
pub fn sized_constraint( self, tcx: TyCtxt<'tcx>, ) -> Option<EarlyBinder<'tcx, Ty<'tcx>>>
Returns a type such that Self: Sized
if and only if that type is Sized
,
or None
if the type is always sized.
Trait Implementations§
source§impl<'tcx> AdtDef<TyCtxt<'tcx>> for AdtDef<'tcx>
impl<'tcx> AdtDef<TyCtxt<'tcx>> for AdtDef<'tcx>
fn def_id(self) -> DefId
fn is_struct(self) -> bool
source§fn struct_tail_ty(
self,
interner: TyCtxt<'tcx>,
) -> Option<EarlyBinder<'tcx, Ty<'tcx>>>
fn struct_tail_ty( self, interner: TyCtxt<'tcx>, ) -> Option<EarlyBinder<'tcx, Ty<'tcx>>>
fn is_phantom_data(self) -> bool
fn all_field_tys( self, tcx: TyCtxt<'tcx>, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = Ty<'tcx>>>
fn sized_constraint( self, tcx: TyCtxt<'tcx>, ) -> Option<EarlyBinder<'tcx, Ty<'tcx>>>
fn is_fundamental(self) -> bool
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for AdtDef<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for AdtDef<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )
source§impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for AdtDef<'tcx>
impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for AdtDef<'tcx>
source§fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(
&self,
_visitor: &mut V,
) -> V::Result
fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>( &self, _visitor: &mut V, ) -> V::Result
impl<'tcx> Copy for AdtDef<'tcx>
impl<'tcx> Eq for AdtDef<'tcx>
impl<'tcx> StructuralPartialEq for AdtDef<'tcx>
Auto Trait Implementations§
impl<'tcx> DynSend for AdtDef<'tcx>
impl<'tcx> DynSync for AdtDef<'tcx>
impl<'tcx> Freeze for AdtDef<'tcx>
impl<'tcx> RefUnwindSafe for AdtDef<'tcx>
impl<'tcx> Send for AdtDef<'tcx>
impl<'tcx> Sync for AdtDef<'tcx>
impl<'tcx> Unpin for AdtDef<'tcx>
impl<'tcx> UnwindSafe for AdtDef<'tcx>
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
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)
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
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
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
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>
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>
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>
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<T> Pointable for T
impl<T> Pointable for T
source§impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
fn has_type_flags(&self, flags: TypeFlags) -> bool
source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
true
if self
has any late-bound regions that are either
bound by binder
or bound by some binder outside of binder
.
If binder
is ty::INNERMOST
, this indicates whether
there are any late-bound regions that appear free.fn error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>
source§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
true
if this type has any regions that escape binder
(and
hence are not bound by it).source§fn has_escaping_bound_vars(&self) -> bool
fn has_escaping_bound_vars(&self) -> bool
true
if this type has regions that are not a part of the type.
For example, for<'a> fn(&'a i32)
return false
, while fn(&'a i32)
would return true
. The latter can occur when traversing through the
former. Read morefn has_aliases(&self) -> bool
fn has_opaque_types(&self) -> bool
fn has_coroutines(&self) -> bool
fn references_error(&self) -> bool
fn has_non_region_param(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_non_region_infer(&self) -> bool
fn has_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn has_non_region_placeholders(&self) -> bool
fn has_param(&self) -> bool
source§fn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
source§fn is_global(&self) -> bool
fn is_global(&self) -> bool
source§fn has_bound_regions(&self) -> bool
fn has_bound_regions(&self) -> bool
source§fn has_non_region_bound_vars(&self) -> bool
fn has_non_region_bound_vars(&self) -> bool
source§fn has_bound_vars(&self) -> bool
fn has_bound_vars(&self) -> bool
source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization.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: 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: 8 bytes