Enum rustc_type_ir::CanonicalVarKind

pub enum CanonicalVarKind<I: Interner> {
    Ty(CanonicalTyVarKind),
    PlaceholderTy(I::PlaceholderTy),
    Region(UniverseIndex),
    PlaceholderRegion(I::PlaceholderRegion),
    Const(UniverseIndex, I::Ty),
    Effect,
    PlaceholderConst(I::PlaceholderConst, I::Ty),
}

Describes the “kind” of the canonical variable. This is a “kind” in the type-theory sense of the term – i.e., a “meta” type system that analyzes type-like values.

Variants

Ty(CanonicalTyVarKind)

Some kind of type inference variable.

PlaceholderTy(I::PlaceholderTy)

A “placeholder” that represents “any type”.

Region(UniverseIndex)

Region variable '?R.

PlaceholderRegion(I::PlaceholderRegion)

A “placeholder” that represents “any region”. Created when you are solving a goal like for<'a> T: Foo<'a> to represent the bound region 'a.

Const(UniverseIndex, I::Ty)

Some kind of const inference variable.

Effect

Effect variable '?E.

PlaceholderConst(I::PlaceholderConst, I::Ty)

A “placeholder” that represents “any const”.

Implementations

impl<I: Interner> CanonicalVarKind<I>

pub fn universe(self) -> UniverseIndex

pub fn with_updated_universe(self, ui: UniverseIndex) -> CanonicalVarKind<I>

Replaces the universe of this canonical variable with ui.

In case this is a float or int variable, this causes an ICE if the updated universe is not the root.

Trait Implementations

impl<I: Interner> Clone for CanonicalVarKind<I>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Interner> Debug for CanonicalVarKind<I>

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

Formats the value using the given formatter.

impl<I: Interner, __D: TyDecoder<I = I>> Decodable<__D> for CanonicalVarKind<I>

where I::PlaceholderTy: Decodable<__D>, I::PlaceholderRegion: Decodable<__D>, I::Ty: Decodable<__D>, I::PlaceholderConst: Decodable<__D>,

fn decode(__decoder: &mut __D) -> Self

impl<I: Interner, __E: TyEncoder<I = I>> Encodable<__E> for CanonicalVarKind<I>

where I::PlaceholderTy: Encodable<__E>, I::PlaceholderRegion: Encodable<__E>, I::Ty: Encodable<__E>, I::PlaceholderConst: Encodable<__E>,

fn encode(&self, __encoder: &mut __E)

impl<I: Interner> Hash for CanonicalVarKind<I>

fn hash<__HI>(&self, __state: &mut __HI)

where __HI: Hasher,

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<I: Interner, __CTX> HashStable<__CTX> for CanonicalVarKind<I>

where I::PlaceholderTy: HashStable<__CTX>, I::PlaceholderRegion: HashStable<__CTX>, I::Ty: HashStable<__CTX>, I::PlaceholderConst: HashStable<__CTX>,

fn hash_stable(&self, __hcx: &mut __CTX, __hasher: &mut StableHasher)

impl<I: Interner> PartialEq for CanonicalVarKind<I>

fn eq(&self, other: &Self) -> 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<I: Interner> TypeFoldable<I> for CanonicalVarKind<I>

where I::Ty: TypeFoldable<I>,

fn try_fold_with<F: FallibleTypeFolder<I>>( 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<I>>(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<I: Interner> TypeVisitable<I> for CanonicalVarKind<I>

where I::Ty: TypeVisitable<I>,

fn visit_with<V: TypeVisitor<I>>( &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).

impl<I: Interner> Copy for CanonicalVarKind<I>

impl<I: Interner> Eq for CanonicalVarKind<I>

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.