Struct rustc_trait_selection::infer::canonical::ir::Canonical

source ·
pub struct Canonical<I, V>
where I: Interner,
{ pub value: V, pub max_universe: UniverseIndex, pub defining_opaque_types: <I as Interner>::DefiningOpaqueTypes, pub variables: <I as Interner>::CanonicalVars, }
Expand description

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§

§value: V§max_universe: UniverseIndex§defining_opaque_types: <I as Interner>::DefiningOpaqueTypes§variables: <I as Interner>::CanonicalVars

Implementations§

source§

impl<I, V> Canonical<I, V>
where I: Interner,

source

pub fn unchecked_map<W>(self, map_op: impl FnOnce(V) -> W) -> Canonical<I, 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<I, T> = ...;
let b: Canonical<I, (T,)> = a.unchecked_map(|v| (v, ));

An example of an incorrect use of this:

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

pub fn unchecked_rebind<W>(self, value: W) -> Canonical<I, 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! See the comment of Canonical::unchecked_map for more details.

Trait Implementations§

source§

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

source§

fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, ()>>

source§

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

source§

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

source§

fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Binder<TyCtxt<'tcx>, FnSig<TyCtxt<'tcx>>>>>

source§

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Binder<TyCtxt<'tcx>, FnSig<TyCtxt<'tcx>>>>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Binder<TyCtxt<'tcx>, FnSig<TyCtxt<'tcx>>>>>]

source§

impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Clause<'tcx>>>

source§

fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Clause<'tcx>>>

source§

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Clause<'tcx>>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Clause<'tcx>>>]

source§

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

source§

fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>

source§

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>]

source§

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

source§

fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, FnSig<TyCtxt<'tcx>>>>

source§

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, FnSig<TyCtxt<'tcx>>>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, FnSig<TyCtxt<'tcx>>>>]

source§

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

source§

fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, NormalizationResult<'tcx>>>

source§

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, NormalizationResult<'tcx>>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, NormalizationResult<'tcx>>>]

source§

impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Ty<'tcx>>>

source§

fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Ty<'tcx>>>

source§

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Ty<'tcx>>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Ty<'tcx>>>]

source§

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

source§

fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>

source§

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>]

source§

impl<'tcx, V> CanonicalExt<'tcx, V> for Canonical<TyCtxt<'tcx>, V>

source§

fn instantiate( &self, tcx: TyCtxt<'tcx>, var_values: &CanonicalVarValues<TyCtxt<'tcx>>, ) -> V
where V: TypeFoldable<TyCtxt<'tcx>>,

Instantiate the wrapped value, replacing each canonical value with the value given in var_values.

source§

fn instantiate_projected<T>( &self, tcx: TyCtxt<'tcx>, var_values: &CanonicalVarValues<TyCtxt<'tcx>>, projection_fn: impl FnOnce(&V) -> T, ) -> T
where T: TypeFoldable<TyCtxt<'tcx>>,

Allows one to apply a instantiation to some subset of self.value. Invoke projection_fn with self.value to get a value V that is expressed in terms of the same canonical variables bound in self (usually this extracts from subset of self). Apply the instantiation var_values to this value V, replacing each of the canonical variables.

source§

impl<I, V> Clone for Canonical<I, V>
where I: Interner, V: Clone,

source§

fn clone(&self) -> Canonical<I, V>

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<I, V> Debug for Canonical<I, V>
where I: Interner, V: Debug,

source§

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

Formats the value using the given formatter. Read more
source§

impl<I, V, __D> Decodable<__D> for Canonical<I, V>
where I: Interner, __D: TyDecoder<I = I>, V: Decodable<__D>, <I as Interner>::DefiningOpaqueTypes: Decodable<__D>, <I as Interner>::CanonicalVars: Decodable<__D>,

source§

fn decode(__decoder: &mut __D) -> Canonical<I, V>

source§

impl<I, V> Display for Canonical<I, V>
where I: Interner, V: Display,

source§

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

Formats the value using the given formatter. Read more
source§

impl<I, V, __E> Encodable<__E> for Canonical<I, V>
where I: Interner, __E: TyEncoder<I = I>, V: Encodable<__E>, <I as Interner>::DefiningOpaqueTypes: Encodable<__E>, <I as Interner>::CanonicalVars: Encodable<__E>,

source§

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

source§

impl<I, V> Hash for Canonical<I, V>
where I: Interner, V: Hash,

source§

fn hash<__H>(&self, __state: &mut __H)
where __H: Hasher,

Feeds this value into the given Hasher. Read more
1.3.0 · source§

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

Feeds a slice of this type into the given Hasher. Read more
source§

impl<I, V, __CTX> HashStable<__CTX> for Canonical<I, V>
where I: Interner, V: HashStable<__CTX>, <I as Interner>::DefiningOpaqueTypes: HashStable<__CTX>, <I as Interner>::CanonicalVars: HashStable<__CTX>,

source§

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

source§

impl<'tcx> IsIdentity for Canonical<TyCtxt<'tcx>, UserType<'tcx>>

source§

fn is_identity(&self) -> bool

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

source§

impl<'tcx, T> Key for Canonical<TyCtxt<'tcx>, T>
where T: Clone,

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

source§

type Cache<V> = DefaultCache<Canonical<TyCtxt<'tcx>, T>, V>

source§

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?
source§

fn key_as_def_id(&self) -> Option<DefId>

If the key is a DefId or DefId–equivalent, return that DefId. Otherwise, return None.
source§

fn ty_def_id(&self) -> Option<DefId>

source§

impl<I, V> PartialEq for Canonical<I, V>
where I: Interner, V: PartialEq,

source§

fn eq(&self, __other: &Canonical<I, V>) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<I, V> TypeFoldable<I> for Canonical<I, V>

source§

fn try_fold_with<__F>( self, __folder: &mut __F, ) -> Result<Canonical<I, V>, <__F as FallibleTypeFolder<I>>::Error>
where __F: FallibleTypeFolder<I>,

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f). Read more
source§

fn fold_with<F>(self, folder: &mut F) -> Self
where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.
source§

impl<I, V> TypeVisitable<I> for Canonical<I, V>

source§

fn visit_with<__V>( &self, __visitor: &mut __V, ) -> <__V as TypeVisitor<I>>::Result
where __V: TypeVisitor<I>,

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v). Read more
source§

impl<I, V> Copy for Canonical<I, V>
where I: Interner, V: Copy,

source§

impl<I, V> Eq for Canonical<I, V>
where I: Interner, V: Eq,

Auto Trait Implementations§

§

impl<I, V> Freeze for Canonical<I, V>

§

impl<I, V> RefUnwindSafe for Canonical<I, V>

§

impl<I, V> Send for Canonical<I, V>

§

impl<I, V> Sync for Canonical<I, V>

§

impl<I, V> Unpin for Canonical<I, V>

§

impl<I, V> UnwindSafe for Canonical<I, V>

Blanket Implementations§

source§

impl<T> Aligned for T

source§

const ALIGN: Alignment = _

Alignment of Self.
source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> AnyEq for T
where T: Any + PartialEq,

source§

fn equals(&self, other: &(dyn Any + 'static)) -> bool

source§

fn as_any(&self) -> &(dyn Any + 'static)

source§

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T
where T: Copy,

source§

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

source§

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

source§

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T
where T: Copy,

source§

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

source§

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

source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> CloneToUninit for T
where T: Clone,

source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<T, R> CollectAndApply<T, R> for T

source§

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to f(&iter.collect::<Vec<_>>()).

source§

type Output = R

source§

impl<Tcx, T> DepNodeParams<Tcx> for T
where Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

source§

default fn fingerprint_style() -> FingerprintStyle

source§

default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).
source§

default fn to_debug_str(&self, _: Tcx) -> String

source§

default fn recover(_: Tcx, _: &DepNode) -> Option<T>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes 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<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> Filterable for T

source§

fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>

Creates a filterable data provider with the given name for debugging. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

impl<P> IntoQueryParam<P> for P

source§

impl<'tcx, T> IsSuggestable<'tcx> for T
where T: TypeVisitable<TyCtxt<'tcx>> + TypeFoldable<TyCtxt<'tcx>>,

source§

fn is_suggestable(self, tcx: TyCtxt<'tcx>, infer_suggestable: bool) -> bool

Whether this makes sense to suggest in a diagnostic. Read more
source§

fn make_suggestable( self, tcx: TyCtxt<'tcx>, infer_suggestable: bool, placeholder: Option<Ty<'tcx>>, ) -> Option<T>

source§

impl<T> MaybeResult<T> for T

source§

type Error = !

source§

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

source§

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

source§

impl<T> Same for T

source§

type Output = T

Should always be Self
source§

impl<T> ToOwned for T
where T: Clone,

source§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T> ToString for T
where T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

source§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<I, T> TypeVisitableExt<I> for T
where I: Interner, T: TypeVisitable<I>,

source§

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

source§

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.
source§

fn error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>

source§

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

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

fn has_escaping_bound_vars(&self) -> bool

Return 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 more
source§

fn has_aliases(&self) -> bool

source§

fn has_opaque_types(&self) -> bool

source§

fn has_coroutines(&self) -> bool

source§

fn references_error(&self) -> bool

source§

fn has_non_region_param(&self) -> bool

source§

fn has_infer_regions(&self) -> bool

source§

fn has_infer_types(&self) -> bool

source§

fn has_non_region_infer(&self) -> bool

source§

fn has_infer(&self) -> bool

source§

fn has_placeholders(&self) -> bool

source§

fn has_non_region_placeholders(&self) -> bool

source§

fn has_param(&self) -> bool

source§

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.
source§

fn has_erased_regions(&self) -> bool

source§

fn has_erasable_regions(&self) -> bool

True if there are any un-erased free regions.
source§

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.
source§

fn has_bound_regions(&self) -> bool

True if there are any late-bound regions
source§

fn has_non_region_bound_vars(&self) -> bool

True if there are any late-bound non-region variables
source§

fn has_bound_vars(&self) -> bool

True if there are any bound variables
source§

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.
source§

impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

source§

fn upcast(self, interner: I) -> U

source§

impl<I, T> UpcastFrom<I, T> for T

source§

fn upcast_from(from: T, _tcx: I) -> T

source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V

source§

impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

source§

default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

impl<'a, T> Captures<'a> for T
where T: ?Sized,

source§

impl<T> ErasedDestructor for T
where T: 'static,

source§

impl<T> MaybeSendSync for T

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.