Struct rustc_middle::ty::GenericArg
source · pub struct GenericArg<'tcx> {
ptr: NonNull<()>,
marker: PhantomData<(Ty<'tcx>, Region<'tcx>, Const<'tcx>)>,
}
Expand description
An entity in the Rust type system, which can be one of
several kinds (types, lifetimes, and consts).
To reduce memory usage, a GenericArg
is an interned pointer,
with the lowest 2 bits being reserved for a tag to
indicate the type (Ty
, Region
, or Const
) it points to.
Note: the PartialEq
, Eq
and Hash
derives are only valid because Ty
,
Region
and Const
are all interned.
Fields§
§ptr: NonNull<()>
§marker: PhantomData<(Ty<'tcx>, Region<'tcx>, Const<'tcx>)>
Implementations§
source§impl<'tcx> GenericArg<'tcx>
impl<'tcx> GenericArg<'tcx>
sourcepub fn walk(self) -> TypeWalker<'tcx> ⓘ
pub fn walk(self) -> TypeWalker<'tcx> ⓘ
Iterator that walks self
and any types reachable from
self
, in depth-first order. Note that just walks the types
that appear in self
, it does not descend into the fields of
structs or variants. For example:
isize => { isize }
Foo<Bar<isize>> => { Foo<Bar<isize>>, Bar<isize>, isize }
[isize] => { [isize], isize }
sourcepub fn walk_shallow(
self,
visited: &mut SsoHashSet<GenericArg<'tcx>>
) -> impl Iterator<Item = GenericArg<'tcx>>
pub fn walk_shallow( self, visited: &mut SsoHashSet<GenericArg<'tcx>> ) -> impl Iterator<Item = GenericArg<'tcx>>
Iterator that walks the immediate children of self
. Hence
Foo<Bar<i32>, u32>
yields the sequence [Bar<i32>, u32]
(but not i32
, like walk
).
Iterator only walks items once. It accepts visited set, updates it with all visited types and skips any types that are already there.
source§impl<'tcx> GenericArg<'tcx>
impl<'tcx> GenericArg<'tcx>
pub fn unpack(self) -> GenericArgKind<'tcx>
pub fn as_type(self) -> Option<Ty<'tcx>>
pub fn as_region(self) -> Option<Region<'tcx>>
pub fn as_const(self) -> Option<Const<'tcx>>
sourcepub fn expect_region(self) -> Region<'tcx>
pub fn expect_region(self) -> Region<'tcx>
Unpack the GenericArg
as a region when it is known certainly to be a region.
sourcepub fn expect_ty(self) -> Ty<'tcx>
pub fn expect_ty(self) -> Ty<'tcx>
Unpack the GenericArg
as a type when it is known certainly to be a type.
This is true in cases where GenericArgs
is used in places where the kinds are known
to be limited (e.g. in tuples, where the only parameters are type parameters).
sourcepub fn expect_const(self) -> Const<'tcx>
pub fn expect_const(self) -> Const<'tcx>
Unpack the GenericArg
as a const when it is known certainly to be a const.
pub fn is_non_region_infer(self) -> bool
Trait Implementations§
source§impl<'tcx> Clone for GenericArg<'tcx>
impl<'tcx> Clone for GenericArg<'tcx>
source§fn clone(&self) -> GenericArg<'tcx>
fn clone(&self) -> GenericArg<'tcx>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<'tcx> Debug for GenericArg<'tcx>
impl<'tcx> Debug for GenericArg<'tcx>
source§impl<'tcx> DebugWithInfcx<TyCtxt<'tcx>> for GenericArg<'tcx>
impl<'tcx> DebugWithInfcx<TyCtxt<'tcx>> for GenericArg<'tcx>
source§impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for GenericArg<'tcx>
impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for GenericArg<'tcx>
fn decode(d: &mut D) -> GenericArg<'tcx>
source§impl<'tcx> Display for GenericArg<'tcx>
impl<'tcx> Display for GenericArg<'tcx>
source§impl<'tcx> From<Const<'tcx>> for GenericArg<'tcx>
impl<'tcx> From<Const<'tcx>> for GenericArg<'tcx>
source§fn from(c: Const<'tcx>) -> GenericArg<'tcx>
fn from(c: Const<'tcx>) -> GenericArg<'tcx>
source§impl<'tcx> From<Region<'tcx>> for GenericArg<'tcx>
impl<'tcx> From<Region<'tcx>> for GenericArg<'tcx>
source§fn from(r: Region<'tcx>) -> GenericArg<'tcx>
fn from(r: Region<'tcx>) -> GenericArg<'tcx>
source§impl<'tcx> From<Term<'tcx>> for GenericArg<'tcx>
impl<'tcx> From<Term<'tcx>> for GenericArg<'tcx>
source§impl<'tcx> From<Ty<'tcx>> for GenericArg<'tcx>
impl<'tcx> From<Ty<'tcx>> for GenericArg<'tcx>
source§fn from(ty: Ty<'tcx>) -> GenericArg<'tcx>
fn from(ty: Ty<'tcx>) -> GenericArg<'tcx>
source§impl<'tcx> Hash for GenericArg<'tcx>
impl<'tcx> Hash for GenericArg<'tcx>
source§impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for GenericArg<'tcx>
impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for GenericArg<'tcx>
fn hash_stable( &self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher )
source§impl<'tcx> IntoDiagArg for GenericArg<'tcx>
impl<'tcx> IntoDiagArg for GenericArg<'tcx>
fn into_diag_arg(self) -> DiagArgValue
source§impl<'tcx> Key for GenericArg<'tcx>
impl<'tcx> Key for GenericArg<'tcx>
type CacheSelector = DefaultCacheSelector<GenericArg<'tcx>>
source§fn default_span(&self, _: TyCtxt<'_>) -> Span
fn default_span(&self, _: TyCtxt<'_>) -> Span
self
, what span should we use?source§fn key_as_def_id(&self) -> Option<DefId>
fn key_as_def_id(&self) -> Option<DefId>
fn ty_def_id(&self) -> Option<DefId>
source§impl<'a, 'tcx> Lift<'tcx> for GenericArg<'a>
impl<'a, 'tcx> Lift<'tcx> for GenericArg<'a>
type Lifted = GenericArg<'tcx>
fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>
source§impl<'tcx> Ord for GenericArg<'tcx>
impl<'tcx> Ord for GenericArg<'tcx>
source§fn cmp(&self, other: &GenericArg<'tcx>) -> Ordering
fn cmp(&self, other: &GenericArg<'tcx>) -> Ordering
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 GenericArg<'tcx>
impl<'tcx> PartialEq for GenericArg<'tcx>
source§fn eq(&self, other: &GenericArg<'tcx>) -> bool
fn eq(&self, other: &GenericArg<'tcx>) -> bool
self
and other
values to be equal, and is used
by ==
.source§impl<'tcx> PartialOrd for GenericArg<'tcx>
impl<'tcx> PartialOrd for GenericArg<'tcx>
source§fn partial_cmp(&self, other: &GenericArg<'tcx>) -> Option<Ordering>
fn partial_cmp(&self, other: &GenericArg<'tcx>) -> Option<Ordering>
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 GenericArg<'tcx>
impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for GenericArg<'tcx>
source§impl<'tcx> Relate<'tcx> for GenericArg<'tcx>
impl<'tcx> Relate<'tcx> for GenericArg<'tcx>
fn relate<R: TypeRelation<'tcx>>( relation: &mut R, a: GenericArg<'tcx>, b: GenericArg<'tcx> ) -> RelateResult<'tcx, GenericArg<'tcx>>
source§impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for GenericArg<'tcx>
impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for GenericArg<'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 GenericArg<'tcx>
impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for GenericArg<'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 GenericArg<'tcx>
impl<'tcx> DynSend for GenericArg<'tcx>
impl<'tcx> DynSync for GenericArg<'tcx>
impl<'tcx> Eq for GenericArg<'tcx>
impl<'tcx> Send for GenericArg<'tcx>
impl<'tcx> StructuralPartialEq for GenericArg<'tcx>
impl<'tcx> Sync for GenericArg<'tcx>
Auto Trait Implementations§
impl<'tcx> Freeze for GenericArg<'tcx>
impl<'tcx> !RefUnwindSafe for GenericArg<'tcx>
impl<'tcx> Unpin for GenericArg<'tcx>
impl<'tcx> !UnwindSafe for GenericArg<'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: 8 bytes