Struct rustc_middle::ty::sty::AliasTy
source · pub struct AliasTy<'tcx> {
pub args: GenericArgsRef<'tcx>,
pub def_id: DefId,
_use_alias_ty_new_instead: (),
}
Expand description
Represents the projection of an associated type.
- 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: GenericArgsRef<'tcx>
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: 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, tcx.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 tcx.associated_item(def_id).container
,
aka. tcx.parent(def_id)
.
_use_alias_ty_new_instead: ()
This field exists to prevent the creation of AliasTy
without using
AliasTy::new.
Implementations§
source§impl<'tcx> AliasTy<'tcx>
impl<'tcx> AliasTy<'tcx>
pub fn new( tcx: TyCtxt<'tcx>, def_id: DefId, args: impl IntoIterator<Item: Into<GenericArg<'tcx>>> ) -> AliasTy<'tcx>
pub fn kind(self, tcx: TyCtxt<'tcx>) -> AliasKind
sourcepub fn opt_kind(self, tcx: TyCtxt<'tcx>) -> Option<AliasKind>
pub fn opt_kind(self, tcx: TyCtxt<'tcx>) -> Option<AliasKind>
FIXME: rename AliasTy
to AliasTerm
and always handle
constants. This function can then be removed.
pub fn to_ty(self, tcx: TyCtxt<'tcx>) -> Ty<'tcx>
source§impl<'tcx> AliasTy<'tcx>
impl<'tcx> AliasTy<'tcx>
The following methods work only with trait associated type projections.
pub fn trait_def_id(self, tcx: TyCtxt<'tcx>) -> DefId
sourcepub fn trait_ref_and_own_args(
self,
tcx: TyCtxt<'tcx>
) -> (TraitRef<'tcx>, &'tcx [GenericArg<'tcx>])
pub fn trait_ref_and_own_args( self, tcx: TyCtxt<'tcx> ) -> (TraitRef<'tcx>, &'tcx [GenericArg<'tcx>])
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, tcx: TyCtxt<'tcx>) -> TraitRef<'tcx>
pub fn trait_ref(self, tcx: TyCtxt<'tcx>) -> TraitRef<'tcx>
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.
source§impl<'tcx> AliasTy<'tcx>
impl<'tcx> AliasTy<'tcx>
The following methods work only with inherent associated type projections.
sourcepub fn rebase_inherent_args_onto_impl(
self,
impl_args: GenericArgsRef<'tcx>,
tcx: TyCtxt<'tcx>
) -> GenericArgsRef<'tcx>
pub fn rebase_inherent_args_onto_impl( self, impl_args: GenericArgsRef<'tcx>, tcx: TyCtxt<'tcx> ) -> GenericArgsRef<'tcx>
Transform the generic parameters to have the given impl
args as the base and the GAT args on top of that.
Does the following transformation:
[Self, P_0...P_m] -> [I_0...I_n, P_0...P_m]
I_i impl args
P_j GAT args
Trait Implementations§
source§impl<'tcx> DebugWithInfcx<TyCtxt<'tcx>> for AliasTy<'tcx>
impl<'tcx> DebugWithInfcx<TyCtxt<'tcx>> for AliasTy<'tcx>
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for AliasTy<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for AliasTy<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )
source§impl<'tcx> Ord for AliasTy<'tcx>
impl<'tcx> Ord for AliasTy<'tcx>
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
source§impl<'tcx> PartialEq for AliasTy<'tcx>
impl<'tcx> PartialEq for AliasTy<'tcx>
source§impl<'tcx> PartialOrd for AliasTy<'tcx>
impl<'tcx> PartialOrd for AliasTy<'tcx>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read moresource§impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for AliasTy<'tcx>
impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for AliasTy<'tcx>
source§impl<'tcx> Relate<'tcx> for AliasTy<'tcx>
impl<'tcx> Relate<'tcx> for AliasTy<'tcx>
fn relate<R: TypeRelation<'tcx>>( relation: &mut R, a: AliasTy<'tcx>, b: AliasTy<'tcx> ) -> RelateResult<'tcx, AliasTy<'tcx>>
source§impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for AliasTy<'tcx>
impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for AliasTy<'tcx>
source§fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F ) -> Result<Self, __F::Error>
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<'tcx> TypeVisitable<TyCtxt<'tcx>> for AliasTy<'tcx>
impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for AliasTy<'tcx>
source§fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>(
&self,
__visitor: &mut __V
) -> __V::Result
fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V ) -> __V::Result
impl<'tcx> Copy for AliasTy<'tcx>
impl<'tcx> Eq for AliasTy<'tcx>
impl<'tcx> StructuralPartialEq for AliasTy<'tcx>
Auto Trait Implementations§
impl<'tcx> DynSend for AliasTy<'tcx>
impl<'tcx> DynSync for AliasTy<'tcx>
impl<'tcx> Freeze for AliasTy<'tcx>
impl<'tcx> !RefUnwindSafe for AliasTy<'tcx>
impl<'tcx> Send for AliasTy<'tcx>
impl<'tcx> Sync for AliasTy<'tcx>
impl<'tcx> Unpin for AliasTy<'tcx>
impl<'tcx> !UnwindSafe for AliasTy<'tcx>
Blanket Implementations§
§impl<T> AnyEq for T
impl<T> AnyEq for 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<'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, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
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
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.§impl<T> Filterable for T
impl<T> Filterable for T
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<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
§impl<T> Pointable for T
impl<T> Pointable 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<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_projections(&self) -> bool
fn has_inherent_projections(&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<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: 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: 16 bytes