pub struct AdtDef<'tcx>(pub Interned<'tcx, AdtDefData>);
Tuple Fields
0: Interned<'tcx, AdtDefData>
Implementations
sourceimpl<'tcx> AdtDef<'tcx>
impl<'tcx> AdtDef<'tcx>
sourcefn uninhabited_from(
self,
tcx: TyCtxt<'tcx>,
substs: SubstsRef<'tcx>,
param_env: ParamEnv<'tcx>
) -> DefIdForest<'tcx>
fn uninhabited_from(
self,
tcx: TyCtxt<'tcx>,
substs: SubstsRef<'tcx>,
param_env: ParamEnv<'tcx>
) -> DefIdForest<'tcx>
Calculates the forest of DefId
s from which this ADT is visibly uninhabited.
sourceimpl<'tcx> AdtDef<'tcx>
impl<'tcx> AdtDef<'tcx>
pub fn did(self) -> DefId
pub fn variants(self) -> &'tcx IndexVec<VariantIdx, VariantDef>
pub fn variant(self, idx: VariantIdx) -> &'tcx VariantDef
pub fn flags(self) -> AdtFlags
pub fn repr(self) -> ReprOptions
sourceimpl<'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_manually_drop(self) -> bool
pub fn is_manually_drop(self) -> bool
Returns true
if this is ManuallyDrop<T>
.
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.
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
) -> Option<Discr<'tcx>>
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>
sourcepub fn sized_constraint(self, tcx: TyCtxt<'tcx>) -> &'tcx [Ty<'tcx>]
pub fn sized_constraint(self, tcx: TyCtxt<'tcx>) -> &'tcx [Ty<'tcx>]
Returns a list of types such that Self: Sized
if and only
if that type is Sized
, or TyErr
if this type is recursive.
Oddly enough, checking that the sized-constraint is Sized
is
actually more expressive than checking all members:
the Sized
trait is inductive, so an associated type that references
Self
would prevent its containing ADT from being Sized
.
Due to normalization being eager, this applies even if the associated type is behind a pointer (e.g., issue #31299).
Trait Implementations
sourceimpl<'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
)
sourceimpl<'tcx> Ord for AdtDef<'tcx>
impl<'tcx> Ord for AdtDef<'tcx>
sourceimpl<'tcx> PartialOrd<AdtDef<'tcx>> for AdtDef<'tcx>
impl<'tcx> PartialOrd<AdtDef<'tcx>> for AdtDef<'tcx>
sourcefn partial_cmp(&self, other: &AdtDef<'tcx>) -> Option<Ordering>
fn partial_cmp(&self, other: &AdtDef<'tcx>) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self
and other
) and is used by the <
operator. Read more
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
sourceimpl<'tcx> TypeFoldable<'tcx> for AdtDef<'tcx>
impl<'tcx> TypeFoldable<'tcx> for AdtDef<'tcx>
AdtDefs are basically the same as a DefId.
sourcefn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
_folder: &mut F
) -> Result<Self, F::Error>
fn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
_folder: &mut F
) -> Result<Self, F::Error>
The entry point for folding. To fold a value t
with a folder f
call: t.try_fold_with(f)
. Read more
sourcefn visit_with<V: TypeVisitor<'tcx>>(
&self,
_visitor: &mut V
) -> ControlFlow<V::BreakTy>
fn visit_with<V: TypeVisitor<'tcx>>(
&self,
_visitor: &mut V
) -> ControlFlow<V::BreakTy>
The entry point for visiting. To visit a value t
with a visitor v
call: t.visit_with(v)
. Read more
sourcefn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
fn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
A convenient alternative to try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
. Read more
sourcefn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
Returns 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. Read more
sourcefn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
Returns true
if this self
has any regions that escape binder
(and
hence are not bound by it). Read more
fn has_escaping_bound_vars(&self) -> bool
fn has_type_flags(&self, flags: TypeFlags) -> bool
fn has_projections(&self) -> bool
fn has_opaque_types(&self) -> bool
fn references_error(&self) -> bool
fn error_reported(&self) -> Option<ErrorGuaranteed>
fn has_param_types_or_consts(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_infer_types_or_consts(&self) -> bool
fn needs_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn needs_subst(&self) -> bool
sourcefn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
“Free” regions in this context means that it has any region that is not (a) erased or (b) late-bound. Read more
fn has_erased_regions(&self) -> bool
sourcefn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
True if there are any un-erased free regions.
sourcefn is_global(&self) -> bool
fn is_global(&self) -> bool
Indicates whether this value references only ‘global’ generic parameters that are the same regardless of what fn we are in. This is used for caching. Read more
sourcefn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
True if there are any late-bound regions
sourcefn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
Indicates whether this value still has parameters/placeholders/inference variables
which could be replaced later, in a way that would change the results of impl
specialization. Read more
impl<'tcx> Copy for AdtDef<'tcx>
impl<'tcx> Eq for AdtDef<'tcx>
impl<'tcx> StructuralEq for AdtDef<'tcx>
impl<'tcx> StructuralPartialEq for AdtDef<'tcx>
Auto Trait Implementations
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
sourceimpl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T where
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T where
T: Copy,
fn allocate_on(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [T]ⓘNotable traits for &[u8]impl<'_> Read for &[u8]impl<'_> Write for &mut [u8]
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
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<Ctxt, T> DepNodeParams<Ctxt> for T where
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for T where
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
sourcedefault fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_fingerprint(&self, tcx: Ctxt) -> 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, Ctxt) -> String
sourcedefault fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
default fn recover(Ctxt, &DepNode<<Ctxt 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 more
sourceimpl<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>>::Output where
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
impl<'a, T> Captures<'a> for T where
T: ?Sized,
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