Enum rustc_middle::infer::canonical::CanonicalVarKind
source · pub enum CanonicalVarKind<'tcx> {
Ty(CanonicalTyVarKind),
PlaceholderTy(PlaceholderType),
Region(UniverseIndex),
PlaceholderRegion(PlaceholderRegion),
Const(UniverseIndex, Ty<'tcx>),
PlaceholderConst(PlaceholderConst<'tcx>, Ty<'tcx>),
}
Expand description
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(PlaceholderType)
A “placeholder” that represents “any type”.
Region(UniverseIndex)
Region variable '?R
.
PlaceholderRegion(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, Ty<'tcx>)
Some kind of const inference variable.
PlaceholderConst(PlaceholderConst<'tcx>, Ty<'tcx>)
A “placeholder” that represents “any const”.
Implementations§
source§impl<'tcx> CanonicalVarKind<'tcx>
impl<'tcx> CanonicalVarKind<'tcx>
pub fn universe(self) -> UniverseIndex
Trait Implementations§
source§impl<'tcx> Clone for CanonicalVarKind<'tcx>
impl<'tcx> Clone for CanonicalVarKind<'tcx>
source§fn clone(&self) -> CanonicalVarKind<'tcx>
fn clone(&self) -> CanonicalVarKind<'tcx>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<'tcx> Debug for CanonicalVarKind<'tcx>
impl<'tcx> Debug for CanonicalVarKind<'tcx>
source§impl<'tcx> Hash for CanonicalVarKind<'tcx>
impl<'tcx> Hash for CanonicalVarKind<'tcx>
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for CanonicalVarKind<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for CanonicalVarKind<'tcx>
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
source§impl<'tcx> PartialEq<CanonicalVarKind<'tcx>> for CanonicalVarKind<'tcx>
impl<'tcx> PartialEq<CanonicalVarKind<'tcx>> for CanonicalVarKind<'tcx>
source§fn eq(&self, other: &CanonicalVarKind<'tcx>) -> bool
fn eq(&self, other: &CanonicalVarKind<'tcx>) -> bool
source§impl<'tcx> TypeFoldable<'tcx> for CanonicalVarKind<'tcx>
impl<'tcx> TypeFoldable<'tcx> for CanonicalVarKind<'tcx>
source§fn 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>
source§impl<'tcx> TypeVisitable<'tcx> for CanonicalVarKind<'tcx>
impl<'tcx> TypeVisitable<'tcx> for CanonicalVarKind<'tcx>
source§fn 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>
source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
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 moresource§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
true
if this type has any regions that escape binder
(and
hence are not bound by it). Read moresource§fn has_escaping_bound_vars(&self) -> bool
fn has_escaping_bound_vars(&self) -> bool
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. Read morefn 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
source§fn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
source§fn is_global(&self) -> bool
fn is_global(&self) -> bool
source§fn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization. Read moreimpl<'tcx> Copy for CanonicalVarKind<'tcx>
impl<'tcx> Eq for CanonicalVarKind<'tcx>
impl<'tcx> StructuralEq for CanonicalVarKind<'tcx>
impl<'tcx> StructuralPartialEq for CanonicalVarKind<'tcx>
Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for CanonicalVarKind<'tcx>
impl<'tcx> !Send for CanonicalVarKind<'tcx>
impl<'tcx> !Sync for CanonicalVarKind<'tcx>
impl<'tcx> Unpin for CanonicalVarKind<'tcx>
impl<'tcx> !UnwindSafe for CanonicalVarKind<'tcx>
Blanket Implementations§
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [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<<Tcx as DepContext>::DepKind>
) -> Option<T>
default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> 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. Read moresource§impl<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>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
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, _: &[QueryInfo]) -> 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: 24 bytes
Size for each variant:
Ty
: 4 bytesPlaceholderTy
: 16 bytesRegion
: 4 bytesPlaceholderRegion
: 24 bytesConst
: 24 bytesPlaceholderConst
: 24 bytes