Struct rustc_middle::ty::adt::AdtDef

pub struct AdtDef<'tcx>(pub Interned<'tcx, AdtDefData>);

Tuple Fields

0: Interned<'tcx, AdtDefData>

Implementations

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

impl<'tcx> AdtDef<'tcx>

pub fn is_struct(self) -> bool

Returns true if this is a struct.

pub fn is_union(self) -> bool

Returns true if this is a union.

pub fn is_enum(self) -> bool

Returns true if this is an enum.

pub fn is_variant_list_non_exhaustive(self) -> bool

Returns true if the variant list of this ADT is #[non_exhaustive].

pub fn adt_kind(self) -> AdtKind

Returns the kind of the ADT.

pub fn descr(self) -> &'static str

Returns a description of this abstract data type.

pub fn variant_descr(self) -> &'static str

Returns a description of a variant of this abstract data type.

pub fn has_ctor(self) -> bool

If this function returns true, it implies that is_struct must return true.

pub fn is_fundamental(self) -> bool

Returns true if this type is #[fundamental] for the purposes of coherence checking.

pub fn is_phantom_data(self) -> bool

Returns true if this is PhantomData<T>.

pub fn is_box(self) -> bool

Returns true if this is Box<T>.

pub fn is_unsafe_cell(self) -> bool

Returns true if this is UnsafeCell<T>.

pub fn is_manually_drop(self) -> bool

Returns true if this is ManuallyDrop<T>.

pub fn has_dtor(self, tcx: TyCtxt<'tcx>) -> bool

Returns true if this type has a destructor.

pub fn has_non_const_dtor(self, tcx: TyCtxt<'tcx>) -> bool

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>

pub fn all_fields(self) -> impl Iterator<Item = &'tcx FieldDef> + Clone

Returns an iterator over all fields contained by this ADT.

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.

pub fn variant_with_id(self, vid: DefId) -> &'tcx VariantDef

Return a VariantDef given a variant id.

pub fn variant_with_ctor_id(self, cid: DefId) -> &'tcx VariantDef

Return a VariantDef given a constructor id.

pub fn variant_index_with_id(self, vid: DefId) -> VariantIdx

Return the index of VariantDef given a variant id.

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>

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.

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 sized_constraint(self, tcx: TyCtxt<'tcx>) -> EarlyBinder<&'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

impl<'tcx> Clone for AdtDef<'tcx>

fn clone(&self) -> AdtDef<'tcx>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'tcx> Debug for AdtDef<'tcx>

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

Formats the value using the given formatter.

impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for AdtDef<'tcx>

fn decode(decoder: &mut D) -> Self

impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for AdtDef<'tcx>

fn encode(&self, e: &mut E)

impl<'tcx> Hash for AdtDef<'tcx>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where
    H: Hasher,
    Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for AdtDef<'tcx>

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

impl<'tcx> Ord for AdtDef<'tcx>

fn cmp(&self, other: &AdtDef<'tcx>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere
    Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere
    Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere
    Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl<'tcx> PartialEq<AdtDef<'tcx>> for AdtDef<'tcx>

fn eq(&self, other: &AdtDef<'tcx>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'tcx> PartialOrd<AdtDef<'tcx>> for AdtDef<'tcx>

fn partial_cmp(&self, other: &AdtDef<'tcx>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'tcx> TypeFoldable<'tcx> for AdtDef<'tcx>

AdtDefs are basically the same as a DefId.

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).

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.

impl<'tcx> TypeVisitable<'tcx> for AdtDef<'tcx>

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).

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.

fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool

Returns true if this type has any regions that escape binder (and hence are not bound by it).

fn has_escaping_bound_vars(&self) -> bool

Return 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.

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) -> Result<(), ErrorGuaranteed>

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 needs_infer(&self) -> bool

fn has_placeholders(&self) -> bool

fn needs_subst(&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.

fn has_erased_regions(&self) -> bool

fn has_erasable_regions(&self) -> bool

True if there are any un-erased free regions.

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.

fn has_late_bound_regions(&self) -> bool

True if there are any late-bound regions

fn has_non_region_late_bound(&self) -> bool

True if there are any late-bound non-region variables

fn has_late_bound_vars(&self) -> bool

True if there are any late-bound variables

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.

impl<'tcx> Copy for AdtDef<'tcx>

impl<'tcx> Eq for AdtDef<'tcx>

impl<'tcx> StructuralEq for AdtDef<'tcx>

impl<'tcx> StructuralPartialEq for AdtDef<'tcx>

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