Struct rustc_middle::ty::TyS

pub(crate) struct TyS<'tcx> {
    kind: TyKind<'tcx>,
    flags: TypeFlags,
    outer_exclusive_binder: DebruijnIndex,
}

Represents a type.

IMPORTANT:

• This is a very “dumb” struct (with no derives and no impls).
• Values of this type are always interned and thus unique, and are stored as an Interned<TyS>.
• Ty (which contains a reference to a Interned<TyS>) or Interned<TyS> should be used everywhere instead of TyS. In particular, Ty has most of the relevant methods.

Fields

kind: TyKind<'tcx>

This field shouldn’t be used directly and may be removed in the future. Use Ty::kind() instead.

flags: TypeFlags

This field provides fast access to information that is also contained in kind.

This field shouldn’t be used directly and may be removed in the future. Use Ty::flags() instead.

outer_exclusive_binder: DebruijnIndex

This field provides fast access to information that is also contained in kind.

This is a kind of confusing thing: it stores the smallest binder such that

(a) the binder itself captures nothing but (b) all the late-bound things within the type are captured by some sub-binder.

So, for a type without any late-bound things, like u32, this will be innermost, because that is the innermost binder that captures nothing. But for a type &'D u32, where 'D is a late-bound region with De Bruijn index D, this would be D + 1 – the binder itself does not capture D, but D is captured by an inner binder.

We call this concept an “exclusive” binder D because all De Bruijn indices within the type are contained within 0..D (exclusive).

Trait Implementations

impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for TyS<'tcx>

fn hash_stable(
    &self,
    hcx: &mut StableHashingContext<'a>,
    hasher: &mut StableHasher
)

impl<'tcx> Ord for TyS<'tcx>

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

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

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

Restrict a value to a certain interval.

impl<'tcx> PartialEq<TyS<'tcx>> for TyS<'tcx>

fn eq(&self, other: &TyS<'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<TyS<'tcx>> for TyS<'tcx>

fn partial_cmp(&self, other: &TyS<'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> Eq for TyS<'tcx>

impl<'tcx> StructuralEq for TyS<'tcx>

impl<'tcx> StructuralPartialEq for TyS<'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: 40 bytes