Struct rustc_middle::ty::VariantDef
source · pub struct VariantDef {
pub def_id: DefId,
pub ctor: Option<(CtorKind, DefId)>,
pub name: Symbol,
pub discr: VariantDiscr,
pub fields: IndexVec<FieldIdx, FieldDef>,
flags: VariantFlags,
}
Expand description
Definition of a variant – a struct’s fields or an enum variant.
Fields§
§def_id: DefId
DefId
that identifies the variant itself.
If this variant belongs to a struct or union, then this is a copy of its DefId
.
ctor: Option<(CtorKind, DefId)>
DefId
that identifies the variant’s constructor.
If this variant is a struct variant, then this is None
.
name: Symbol
Variant or struct name.
discr: VariantDiscr
Discriminant of this variant.
fields: IndexVec<FieldIdx, FieldDef>
Fields of this variant.
flags: VariantFlags
Flags of the variant (e.g. is field list non-exhaustive)?
Implementations§
source§impl<'tcx> VariantDef
impl<'tcx> VariantDef
sourcepub fn inhabited_predicate(
&self,
tcx: TyCtxt<'tcx>,
adt: AdtDef<'_>
) -> InhabitedPredicate<'tcx>
pub fn inhabited_predicate( &self, tcx: TyCtxt<'tcx>, adt: AdtDef<'_> ) -> InhabitedPredicate<'tcx>
Calculates the forest of DefId
s from which this variant is visibly uninhabited.
source§impl VariantDef
impl VariantDef
sourcepub fn new(
name: Symbol,
variant_did: Option<DefId>,
ctor: Option<(CtorKind, DefId)>,
discr: VariantDiscr,
fields: IndexVec<FieldIdx, FieldDef>,
adt_kind: AdtKind,
parent_did: DefId,
recovered: bool,
is_field_list_non_exhaustive: bool
) -> Self
pub fn new( name: Symbol, variant_did: Option<DefId>, ctor: Option<(CtorKind, DefId)>, discr: VariantDiscr, fields: IndexVec<FieldIdx, FieldDef>, adt_kind: AdtKind, parent_did: DefId, recovered: bool, is_field_list_non_exhaustive: bool ) -> Self
Creates a new VariantDef
.
variant_did
is the DefId
that identifies the enum variant (if this VariantDef
represents an enum variant).
ctor_did
is the DefId
that identifies the constructor of unit or
tuple-variants/structs. If this is a struct
-variant then this should be None
.
parent_did
is the DefId
of the AdtDef
representing the enum or struct that
owns this variant. It is used for checking if a struct has #[non_exhaustive]
w/out having
to go through the redirect of checking the ctor’s attributes - but compiling a small crate
requires loading the AdtDef
s for all the structs in the universe (e.g., coherence for any
built-in trait), and we do not want to load attributes twice.
If someone speeds up attribute loading to not be a performance concern, they can
remove this hack and use the constructor DefId
everywhere.
sourcepub fn is_field_list_non_exhaustive(&self) -> bool
pub fn is_field_list_non_exhaustive(&self) -> bool
Is this field list non-exhaustive?
sourcepub fn is_recovered(&self) -> bool
pub fn is_recovered(&self) -> bool
Was this variant obtained as part of recovering from a syntactic error?
sourcepub fn ident(&self, tcx: TyCtxt<'_>) -> Ident
pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident
Computes the Ident
of this variant by looking up the Span
pub fn ctor_kind(&self) -> Option<CtorKind>
pub fn ctor_def_id(&self) -> Option<DefId>
sourcepub fn single_field(&self) -> &FieldDef
pub fn single_field(&self) -> &FieldDef
Returns the one field in this variant.
panic!
s if there are no fields or multiple fields.
Trait Implementations§
source§impl Debug for VariantDef
impl Debug for VariantDef
source§impl Hash for VariantDef
impl Hash for VariantDef
source§impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for VariantDef
impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for VariantDef
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )
source§impl PartialEq<VariantDef> for VariantDef
impl PartialEq<VariantDef> for VariantDef
impl Eq for VariantDef
Auto Trait Implementations§
impl RefUnwindSafe for VariantDef
impl Send for VariantDef
impl Sync for VariantDef
impl Unpin for VariantDef
impl UnwindSafe for VariantDef
Blanket Implementations§
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, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
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<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<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> 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: &[QueryInfo], _guar: ErrorGuaranteed ) -> 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: 64 bytes