pub struct AliasTerm<I>where
I: Interner,{
pub args: <I as Interner>::GenericArgs,
pub def_id: <I as Interner>::DefId,
_use_alias_term_new_instead: (),
}
Expand description
Represents the unprojected term of a projection goal.
- For a projection, this would be
<Ty as Trait<...>>::N<...>
. - For an inherent projection, this would be
Ty::N<...>
. - For an opaque type, there is no explicit syntax.
Fields§
§args: <I as Interner>::GenericArgs
The parameters of the associated or opaque item.
For a projection, these are the generic parameters for the trait and the GAT parameters, if there are any.
For an inherent projection, they consist of the self type and the GAT parameters, if there are any.
For RPIT the generic parameters are for the generics of the function, while for TAIT it is used for the generic parameters of the alias.
def_id: <I as Interner>::DefId
The DefId
of the TraitItem
or ImplItem
for the associated type N
depending on whether
this is a projection or an inherent projection or the DefId
of the OpaqueType
item if
this is an opaque.
During codegen, interner.type_of(def_id)
can be used to get the type of the
underlying type if the type is an opaque.
Note that if this is an associated type, this is not the DefId
of the
TraitRef
containing this associated type, which is in interner.associated_item(def_id).container
,
aka. interner.parent(def_id)
.
_use_alias_term_new_instead: ()
Implementations§
source§impl<I> AliasTerm<I>where
I: Interner,
impl<I> AliasTerm<I>where
I: Interner,
pub fn new_from_args( interner: I, def_id: <I as Interner>::DefId, args: <I as Interner>::GenericArgs, ) -> AliasTerm<I>
pub fn new(
interner: I,
def_id: <I as Interner>::DefId,
args: impl IntoIterator- >,
) -> AliasTerm<I>
pub fn expect_ty(self, interner: I) -> AliasTy<I>
pub fn kind(self, interner: I) -> AliasTermKind
pub fn to_term(self, interner: I) -> <I as Interner>::Term
source§impl<I> AliasTerm<I>where
I: Interner,
impl<I> AliasTerm<I>where
I: Interner,
The following methods work only with (trait) associated type projections.
pub fn self_ty(self) -> <I as Interner>::Ty
pub fn with_self_ty( self, interner: I, self_ty: <I as Interner>::Ty, ) -> AliasTerm<I>
pub fn trait_def_id(self, interner: I) -> <I as Interner>::DefId
sourcepub fn trait_ref_and_own_args(
self,
interner: I,
) -> (TraitRef<I>, <I as Interner>::GenericArgsSlice)
pub fn trait_ref_and_own_args( self, interner: I, ) -> (TraitRef<I>, <I as Interner>::GenericArgsSlice)
Extracts the underlying trait reference and own args from this projection.
For example, if this is a projection of <T as StreamingIterator>::Item<'a>
,
then this function would return a T: StreamingIterator
trait reference and
['a]
as the own args.
sourcepub fn trait_ref(self, interner: I) -> TraitRef<I>
pub fn trait_ref(self, interner: I) -> TraitRef<I>
Extracts the underlying trait reference from this projection.
For example, if this is a projection of <T as Iterator>::Item
,
then this function would return a T: Iterator
trait reference.
WARNING: This will drop the args for generic associated types consider calling Self::trait_ref_and_own_args to get those as well.
Trait Implementations§
source§impl<I> From<UnevaluatedConst<I>> for AliasTerm<I>where
I: Interner,
impl<I> From<UnevaluatedConst<I>> for AliasTerm<I>where
I: Interner,
source§fn from(ct: UnevaluatedConst<I>) -> AliasTerm<I>
fn from(ct: UnevaluatedConst<I>) -> AliasTerm<I>
source§impl<I, __CTX> HashStable<__CTX> for AliasTerm<I>where
I: Interner,
<I as Interner>::GenericArgs: HashStable<__CTX>,
<I as Interner>::DefId: HashStable<__CTX>,
impl<I, __CTX> HashStable<__CTX> for AliasTerm<I>where
I: Interner,
<I as Interner>::GenericArgs: HashStable<__CTX>,
<I as Interner>::DefId: HashStable<__CTX>,
fn hash_stable( &self, __hcx: &mut __CTX, __hasher: &mut StableHasher<SipHasher128>, )
source§impl<I> TypeFoldable<I> for AliasTerm<I>where
I: Interner,
<I as Interner>::GenericArgs: TypeFoldable<I>,
<I as Interner>::DefId: TypeFoldable<I>,
impl<I> TypeFoldable<I> for AliasTerm<I>where
I: Interner,
<I as Interner>::GenericArgs: TypeFoldable<I>,
<I as Interner>::DefId: TypeFoldable<I>,
source§fn try_fold_with<__F>(
self,
__folder: &mut __F,
) -> Result<AliasTerm<I>, <__F as FallibleTypeFolder<I>>::Error>where
__F: FallibleTypeFolder<I>,
fn try_fold_with<__F>(
self,
__folder: &mut __F,
) -> Result<AliasTerm<I>, <__F as FallibleTypeFolder<I>>::Error>where
__F: FallibleTypeFolder<I>,
source§fn fold_with<F>(self, folder: &mut F) -> Selfwhere
F: TypeFolder<I>,
fn fold_with<F>(self, folder: &mut F) -> Selfwhere
F: TypeFolder<I>,
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
.source§impl<I> TypeVisitable<I> for AliasTerm<I>where
I: Interner,
<I as Interner>::GenericArgs: TypeVisitable<I>,
<I as Interner>::DefId: TypeVisitable<I>,
impl<I> TypeVisitable<I> for AliasTerm<I>where
I: Interner,
<I as Interner>::GenericArgs: TypeVisitable<I>,
<I as Interner>::DefId: TypeVisitable<I>,
source§fn visit_with<__V>(
&self,
__visitor: &mut __V,
) -> <__V as TypeVisitor<I>>::Resultwhere
__V: TypeVisitor<I>,
fn visit_with<__V>(
&self,
__visitor: &mut __V,
) -> <__V as TypeVisitor<I>>::Resultwhere
__V: TypeVisitor<I>,
impl<I> Copy for AliasTerm<I>where
I: Interner,
impl<I> Eq for AliasTerm<I>where
I: Interner,
Auto Trait Implementations§
impl<I> Freeze for AliasTerm<I>
impl<I> RefUnwindSafe for AliasTerm<I>
impl<I> Send for AliasTerm<I>
impl<I> Sync for AliasTerm<I>
impl<I> Unpin for AliasTerm<I>
impl<I> UnwindSafe for AliasTerm<I>
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> 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<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
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) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> 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.source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.source§impl<T> Filterable for T
impl<T> Filterable for T
source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moresource§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<'tcx, T> IsSuggestable<'tcx> for T
impl<'tcx, T> IsSuggestable<'tcx> for T
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
fn has_type_flags(&self, flags: TypeFlags) -> bool
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.fn error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>
source§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).source§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_aliases(&self) -> bool
fn has_opaque_types(&self) -> bool
fn has_coroutines(&self) -> bool
fn references_error(&self) -> bool
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 has_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn has_non_region_placeholders(&self) -> bool
fn has_param(&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_bound_regions(&self) -> bool
fn has_bound_regions(&self) -> bool
source§fn has_non_region_bound_vars(&self) -> bool
fn has_non_region_bound_vars(&self) -> bool
source§fn has_bound_vars(&self) -> bool
fn has_bound_vars(&self) -> bool
source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization.source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> 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, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
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.