Struct rustc_middle::infer::canonical::Canonical

pub struct Canonical<'tcx, V> {
    pub max_universe: UniverseIndex,
    pub variables: CanonicalVarInfos<'tcx>,
    pub value: V,
}

A "canonicalized" type V is one where all free inference variables have been rewritten to "canonical vars". These are numbered starting from 0 in order of first appearance.

Fields

max_universe: UniverseIndex

variables: CanonicalVarInfos<'tcx>

value: V

Implementations

impl<'tcx, R> Canonical<'tcx, QueryResponse<'tcx, R>>

pub fn is_proven(&self) -> bool

pub fn is_ambiguous(&self) -> bool

impl<'tcx, V> Canonical<'tcx, V>

pub fn unchecked_map<W>(self, map_op: impl FnOnce(V) -> W) -> Canonical<'tcx, W>

Allows you to map the value of a canonical while keeping the same set of bound variables.

WARNING: This function is very easy to mis-use, hence the name! In particular, the new value W must use all the same type/region variables in precisely the same order as the original! (The ordering is defined by the TypeFoldable implementation of the type in question.)

An example of a correct use of this:

let a: Canonical<'_, T> = ...;
let b: Canonical<'_, (T,)> = a.unchecked_map(|v| (v, ));

An example of an incorrect use of this:

let a: Canonical<'tcx, T> = ...;
let ty: Ty<'tcx> = ...;
let b: Canonical<'tcx, (T, Ty<'tcx>)> = a.unchecked_map(|v| (v, ty));

impl<'tcx> Canonical<'tcx, UserType<'tcx>>

pub fn is_identity(&self) -> bool

Returns true if this represents a substitution of the form [?0, ?1, ?2], i.e., each thing is mapped to a canonical variable with the same index.

Trait Implementations

impl<'tcx> ArenaAllocatable<'tcx, Canonical<'tcx, QueryResponse<'tcx, &'tcx TyS<'tcx>>>> for Canonical<'tcx, QueryResponse<'tcx, Ty<'tcx>>>

pub fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self

pub fn allocate_from_iter<'a>(
    arena: &'a Arena<'tcx>,
    iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]

impl<'tcx> ArenaAllocatable<'tcx, Canonical<'tcx, QueryResponse<'tcx, ()>>> for Canonical<'tcx, QueryResponse<'tcx, ()>>

pub fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self

pub fn allocate_from_iter<'a>(
    arena: &'a Arena<'tcx>,
    iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]

impl<'tcx> ArenaAllocatable<'tcx, Canonical<'tcx, QueryResponse<'tcx, Binder<FnSig<'tcx>>>>> for Canonical<'tcx, QueryResponse<'tcx, PolyFnSig<'tcx>>>

pub fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self

pub fn allocate_from_iter<'a>(
    arena: &'a Arena<'tcx>,
    iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]

impl<'tcx> ArenaAllocatable<'tcx, Canonical<'tcx, QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>> for Canonical<'tcx, QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>

pub fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self

pub fn allocate_from_iter<'a>(
    arena: &'a Arena<'tcx>,
    iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]

impl<'tcx> ArenaAllocatable<'tcx, Canonical<'tcx, QueryResponse<'tcx, FnSig<'tcx>>>> for Canonical<'tcx, QueryResponse<'tcx, FnSig<'tcx>>>

pub fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self

pub fn allocate_from_iter<'a>(
    arena: &'a Arena<'tcx>,
    iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]

impl<'tcx> ArenaAllocatable<'tcx, Canonical<'tcx, QueryResponse<'tcx, NormalizationResult<'tcx>>>> for Canonical<'tcx, QueryResponse<'tcx, NormalizationResult<'tcx>>>

pub fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self

pub fn allocate_from_iter<'a>(
    arena: &'a Arena<'tcx>,
    iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]

impl<'tcx> ArenaAllocatable<'tcx, Canonical<'tcx, QueryResponse<'tcx, Predicate<'tcx>>>> for Canonical<'tcx, QueryResponse<'tcx, Predicate<'tcx>>>

pub fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self

pub fn allocate_from_iter<'a>(
    arena: &'a Arena<'tcx>,
    iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]

impl<'tcx> ArenaAllocatable<'tcx, Canonical<'tcx, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>> for Canonical<'tcx, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>

pub fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self

pub fn allocate_from_iter<'a>(
    arena: &'a Arena<'tcx>,
    iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]

impl<'tcx, V: Clone> Clone for Canonical<'tcx, V>

pub fn clone(&self) -> Canonical<'tcx, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'tcx, V: Copy> Copy for Canonical<'tcx, V>

impl<'tcx, V: Debug> Debug for Canonical<'tcx, V>

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

Formats the value using the given formatter.

impl<'tcx, V, __D: TyDecoder<'tcx>> Decodable<__D> for Canonical<'tcx, V> where
    V: Decodable<__D>, 

pub fn decode(__decoder: &mut __D) -> Result<Self, <__D as Decoder>::Error>

impl<'tcx, V, __E: TyEncoder<'tcx>> Encodable<__E> for Canonical<'tcx, V> where
    V: Encodable<__E>, 

pub fn encode(&self, __encoder: &mut __E) -> Result<(), <__E as Encoder>::Error>

impl<'tcx, V: Eq> Eq for Canonical<'tcx, V>

impl<'tcx, V: Hash> Hash for Canonical<'tcx, V>

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<'tcx, '__ctx, V> HashStable<StableHashingContext<'__ctx>> for Canonical<'tcx, V> where
    V: HashStable<StableHashingContext<'__ctx>>, 

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

impl<'tcx, T> Key for Canonical<'tcx, T>

Canonical query goals correspond to abstract trait operations that are not tied to any crate in particular.

type CacheSelector = DefaultCacheSelector

pub fn query_crate(&self) -> CrateNum

Given an instance of this key, what crate is it referring to? This is used to find the provider.

pub fn default_span(&self, _tcx: TyCtxt<'_>) -> Span

In the event that a cycle occurs, if no explicit span has been given for a query with key self, what span should we use?

impl<'tcx, '__lifted, V> Lift<'__lifted> for Canonical<'tcx, V> where
    V: Lift<'__lifted>, 

type Lifted = Canonical<'__lifted, V::Lifted>

pub fn lift_to_tcx(
    self,
    __tcx: TyCtxt<'__lifted>
) -> Option<Canonical<'__lifted, V::Lifted>>

impl<'tcx, V: PartialEq> PartialEq<Canonical<'tcx, V>> for Canonical<'tcx, V>

pub fn eq(&self, other: &Canonical<'tcx, V>) -> bool

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

pub fn ne(&self, other: &Canonical<'tcx, V>) -> bool

This method tests for !=.

impl<'tcx, V> StructuralEq for Canonical<'tcx, V>

impl<'tcx, V> StructuralPartialEq for Canonical<'tcx, V>

impl<'tcx, V> TypeFoldable<'tcx> for Canonical<'tcx, V> where
    V: TypeFoldable<'tcx>, 

pub fn super_fold_with<__F: TypeFolder<'tcx>>(self, __folder: &mut __F) -> Self

pub fn super_visit_with<__F: TypeVisitor<'tcx>>(
    &self,
    __folder: &mut __F
) -> ControlFlow<__F::BreakTy>

pub fn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self

pub fn visit_with<V: TypeVisitor<'tcx>>(
    &self,
    visitor: &mut V
) -> ControlFlow<V::BreakTy>

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

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

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

pub fn has_escaping_bound_vars(&self) -> bool

pub fn has_type_flags(&self, flags: TypeFlags) -> bool

pub fn has_projections(&self) -> bool

pub fn has_opaque_types(&self) -> bool

pub fn references_error(&self) -> bool

pub fn has_param_types_or_consts(&self) -> bool

pub fn has_infer_regions(&self) -> bool

pub fn has_infer_types(&self) -> bool

pub fn has_infer_types_or_consts(&self) -> bool

pub fn needs_infer(&self) -> bool

pub fn has_placeholders(&self) -> bool

pub fn needs_subst(&self) -> bool

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

pub fn has_erased_regions(&self) -> bool

pub fn has_erasable_regions(&self) -> bool

True if there are any un-erased free regions.

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

pub fn has_late_bound_regions(&self) -> bool

True if there are any late-bound regions

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