pub struct Canonical<'tcx, V> {
pub max_universe: UniverseIndex,
pub variables: CanonicalVarInfos<'tcx>,
pub value: V,
}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
max_universe: UniverseIndexvariables: CanonicalVarInfos<'tcx>value: VImplementations
sourceimpl<'tcx, R> Canonical<'tcx, QueryResponse<'tcx, R>>
impl<'tcx, R> Canonical<'tcx, QueryResponse<'tcx, R>>
sourceimpl<'tcx, R> Canonical<'tcx, ParamEnvAnd<'tcx, R>>
impl<'tcx, R> Canonical<'tcx, ParamEnvAnd<'tcx, R>>
pub fn without_const(self) -> Self
sourceimpl<'tcx, V> Canonical<'tcx, V>
impl<'tcx, V> Canonical<'tcx, V>
sourcepub fn unchecked_map<W>(self, map_op: impl FnOnce(V) -> W) -> Canonical<'tcx, W>
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));sourceimpl<'tcx> Canonical<'tcx, UserType<'tcx>>
impl<'tcx> Canonical<'tcx, UserType<'tcx>>
sourcepub fn is_identity(&self) -> bool
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
sourceimpl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>
impl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]
sourceimpl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, NormalizationResult<'tcx>>>
impl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, NormalizationResult<'tcx>>>
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]
sourceimpl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>
impl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]
sourceimpl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, ()>>
impl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, ()>>
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]
sourceimpl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, PolyFnSig<'tcx>>>
impl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, PolyFnSig<'tcx>>>
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]
sourceimpl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, FnSig<'tcx>>>
impl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, FnSig<'tcx>>>
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]
sourceimpl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, Predicate<'tcx>>>
impl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, Predicate<'tcx>>>
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]
sourceimpl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, Ty<'tcx>>>
impl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for Canonical<'tcx, QueryResponse<'tcx, Ty<'tcx>>>
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]
sourceimpl<'tcx, V, __D: TyDecoder<'tcx>> Decodable<__D> for Canonical<'tcx, V> where
V: Decodable<__D>,
impl<'tcx, V, __D: TyDecoder<'tcx>> Decodable<__D> for Canonical<'tcx, V> where
V: Decodable<__D>,
sourceimpl<'tcx, V, __E: TyEncoder<'tcx>> Encodable<__E> for Canonical<'tcx, V> where
V: Encodable<__E>,
impl<'tcx, V, __E: TyEncoder<'tcx>> Encodable<__E> for Canonical<'tcx, V> where
V: Encodable<__E>,
sourceimpl<'tcx, '__ctx, V> HashStable<StableHashingContext<'__ctx>> for Canonical<'tcx, V> where
V: HashStable<StableHashingContext<'__ctx>>,
impl<'tcx, '__ctx, V> HashStable<StableHashingContext<'__ctx>> for Canonical<'tcx, V> where
V: HashStable<StableHashingContext<'__ctx>>,
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
sourceimpl<'tcx, V> TypeFoldable<'tcx> for Canonical<'tcx, V> where
V: TypeFoldable<'tcx>,
impl<'tcx, V> TypeFoldable<'tcx> for Canonical<'tcx, V> where
V: TypeFoldable<'tcx>,
fn try_super_fold_with<__F: FallibleTypeFolder<'tcx>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
fn super_visit_with<__F: TypeVisitor<'tcx>>(
&self,
__folder: &mut __F
) -> ControlFlow<__F::BreakTy>
sourcefn super_fold_with<F: TypeFolder<'tcx, Error = !>>(self, folder: &mut F) -> Self
fn super_fold_with<F: TypeFolder<'tcx, Error = !>>(self, folder: &mut F) -> Self
Consumers may find this more convenient to use with infallible folders than
try_super_fold_with, to which the
provided default definition delegates. Implementors should not override
this provided default definition, to ensure that the two methods are coherent
(provide a definition of try_super_fold_with instead). Read more
sourcefn fold_with<F: TypeFolder<'tcx, Error = !>>(self, folder: &mut F) -> Self
fn fold_with<F: TypeFolder<'tcx, Error = !>>(self, folder: &mut F) -> Self
Consumers may find this more convenient to use with infallible folders than
try_fold_with, to which the provided
default definition delegates. Implementors should not override this
provided default definition, to ensure that the two methods are coherent
(provide a definition of try_fold_with instead). Read more
fn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
fn visit_with<V: TypeVisitor<'tcx>>(
&self,
visitor: &mut V
) -> ControlFlow<V::BreakTy>
sourcefn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
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. Read more
sourcefn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
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). Read more
fn has_escaping_bound_vars(&self) -> bool
fn has_type_flags(&self, flags: TypeFlags) -> bool
fn has_projections(&self) -> bool
fn has_opaque_types(&self) -> bool
fn references_error(&self) -> bool
fn has_param_types_or_consts(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_infer_types_or_consts(&self) -> bool
fn needs_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn needs_subst(&self) -> bool
sourcefn has_free_regions(&self) -> bool
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. Read more
fn has_erased_regions(&self) -> bool
sourcefn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
True if there are any un-erased free regions.
sourcefn is_global(&self) -> bool
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. Read more
sourcefn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
True if there are any late-bound regions
sourcefn still_further_specializable(&self) -> bool
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. Read more
impl<'tcx, V: Copy> Copy for Canonical<'tcx, V>
impl<'tcx, V: Eq> Eq for Canonical<'tcx, V>
impl<'tcx, V> StructuralEq for Canonical<'tcx, V>
impl<'tcx, V> StructuralPartialEq for Canonical<'tcx, V>
Auto Trait Implementations
impl<'tcx, V> !RefUnwindSafe for Canonical<'tcx, V>
impl<'tcx, V> Send for Canonical<'tcx, V> where
V: Send,
impl<'tcx, V> Sync for Canonical<'tcx, V> where
V: Sync,
impl<'tcx, V> Unpin for Canonical<'tcx, V> where
V: Unpin,
impl<'tcx, V> !UnwindSafe for Canonical<'tcx, V>
Blanket Implementations
sourceimpl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T where
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T where
T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcepub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for T where
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for T where
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
pub default fn fingerprint_style() -> FingerprintStyle
sourcepub default fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
pub default fn to_fingerprint(&self, tcx: Ctxt) -> 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). Read more
pub default fn to_debug_str(&self, Ctxt) -> String
sourcepub default fn recover(
Ctxt,
&DepNode<<Ctxt as DepContext>::DepKind>
) -> Option<T>
pub default fn recover(
Ctxt,
&DepNode<<Ctxt as DepContext>::DepKind>
) -> 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. Read more
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<'tcx, T> Subst<'tcx> for T where
T: TypeFoldable<'tcx>,
impl<'tcx, T> Subst<'tcx> for T where
T: TypeFoldable<'tcx>,
fn subst_spanned(
self,
tcx: TyCtxt<'tcx>,
substs: &[GenericArg<'tcx>],
span: Option<Span>
) -> T
fn subst(self, tcx: TyCtxt<'tcx>, substs: &[GenericArg<'tcx>]) -> Self
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcepub fn to_owned(&self) -> T
pub fn to_owned(&self) -> T
Creates owned data from borrowed data, usually by cloning. Read more
sourcepub fn clone_into(&self, target: &mut T)
pub fn clone_into(&self, target: &mut T)
toowned_clone_into)Uses borrowed data to replace owned data, usually by cloning. Read more
impl<'a, T> Captures<'a> for T where
T: ?Sized,
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.