Struct rustc_middle::ty::subst::GenericArg
source · [−]pub struct GenericArg<'tcx> {
ptr: NonZeroUsize,
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: NonZeroUsize
marker: PhantomData<(Ty<'tcx>, Region<'tcx>, Const<'tcx>)>
Implementations
sourceimpl<'tcx> GenericArg<'tcx>
impl<'tcx> GenericArg<'tcx>
pub fn unpack(self) -> GenericArgKind<'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 Substs
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.
sourceimpl<'tcx> GenericArg<'tcx>
impl<'tcx> GenericArg<'tcx>
sourcepub fn walk(self) -> TypeWalker<'tcx>ⓘNotable traits for TypeWalker<'tcx>impl<'tcx> Iterator for TypeWalker<'tcx> type Item = GenericArg<'tcx>;
pub fn walk(self) -> TypeWalker<'tcx>ⓘNotable traits for TypeWalker<'tcx>impl<'tcx> Iterator for TypeWalker<'tcx> type Item = GenericArg<'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.
Trait Implementations
sourceimpl<'tcx> Clone for GenericArg<'tcx>
impl<'tcx> Clone for GenericArg<'tcx>
sourcefn clone(&self) -> GenericArg<'tcx>
fn clone(&self) -> GenericArg<'tcx>
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresourceimpl<'tcx> Debug for GenericArg<'tcx>
impl<'tcx> Debug for GenericArg<'tcx>
sourceimpl<'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>
sourceimpl<'tcx> Display for GenericArg<'tcx>
impl<'tcx> Display for GenericArg<'tcx>
sourceimpl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for GenericArg<'tcx>
impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for GenericArg<'tcx>
sourceimpl<'tcx> From<Const<'tcx>> for GenericArg<'tcx>
impl<'tcx> From<Const<'tcx>> for GenericArg<'tcx>
sourcefn from(c: Const<'tcx>) -> GenericArg<'tcx>
fn from(c: Const<'tcx>) -> GenericArg<'tcx>
sourceimpl<'tcx> From<Region<'tcx>> for GenericArg<'tcx>
impl<'tcx> From<Region<'tcx>> for GenericArg<'tcx>
sourcefn from(r: Region<'tcx>) -> GenericArg<'tcx>
fn from(r: Region<'tcx>) -> GenericArg<'tcx>
sourceimpl<'tcx> From<Ty<'tcx>> for GenericArg<'tcx>
impl<'tcx> From<Ty<'tcx>> for GenericArg<'tcx>
sourcefn from(ty: Ty<'tcx>) -> GenericArg<'tcx>
fn from(ty: Ty<'tcx>) -> GenericArg<'tcx>
sourceimpl<'tcx> Hash for GenericArg<'tcx>
impl<'tcx> Hash for GenericArg<'tcx>
sourceimpl<'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
)
sourceimpl<'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>
sourceimpl<'tcx> Ord for GenericArg<'tcx>
impl<'tcx> Ord for GenericArg<'tcx>
sourcefn cmp(&self, other: &GenericArg<'tcx>) -> Ordering
fn cmp(&self, other: &GenericArg<'tcx>) -> Ordering
1.21.0 · sourcefn max(self, other: Self) -> Self
fn max(self, other: Self) -> Self
1.21.0 · sourcefn min(self, other: Self) -> Self
fn min(self, other: Self) -> Self
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
sourceimpl<'tcx> PartialEq<GenericArg<'tcx>> for GenericArg<'tcx>
impl<'tcx> PartialEq<GenericArg<'tcx>> for GenericArg<'tcx>
sourcefn eq(&self, other: &GenericArg<'tcx>) -> bool
fn eq(&self, other: &GenericArg<'tcx>) -> bool
sourceimpl<'tcx> PartialOrd<GenericArg<'tcx>> for GenericArg<'tcx>
impl<'tcx> PartialOrd<GenericArg<'tcx>> for GenericArg<'tcx>
sourcefn partial_cmp(&self, other: &GenericArg<'tcx>) -> Option<Ordering>
fn partial_cmp(&self, other: &GenericArg<'tcx>) -> Option<Ordering>
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read moresourceimpl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for GenericArg<'tcx>
impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for GenericArg<'tcx>
sourceimpl<'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>>
sourceimpl<'tcx> TypeFoldable<'tcx> for GenericArg<'tcx>
impl<'tcx> TypeFoldable<'tcx> for GenericArg<'tcx>
sourcefn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
fn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
sourcefn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
fn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
. Read moresourceimpl<'tcx> TypeVisitable<'tcx> for GenericArg<'tcx>
impl<'tcx> TypeVisitable<'tcx> for GenericArg<'tcx>
sourcefn visit_with<V: TypeVisitor<'tcx>>(
&self,
visitor: &mut V
) -> ControlFlow<V::BreakTy>
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
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 moresourcefn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
true
if this self
has any regions that escape binder
(and
hence are not bound by it). Read morefn 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 error_reported(&self) -> Option<ErrorGuaranteed>
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
fn has_erased_regions(&self) -> bool
sourcefn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
sourcefn is_global(&self) -> bool
fn is_global(&self) -> bool
sourcefn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
sourcefn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization. Read moreimpl<'tcx> Copy for GenericArg<'tcx>
impl<'tcx> Eq for GenericArg<'tcx>
impl<'tcx> StructuralEq for GenericArg<'tcx>
impl<'tcx> StructuralPartialEq for GenericArg<'tcx>
Auto Trait Implementations
impl<'tcx> !RefUnwindSafe for GenericArg<'tcx>
impl<'tcx> Send for GenericArg<'tcx>
impl<'tcx> Sync for GenericArg<'tcx>
impl<'tcx> Unpin for GenericArg<'tcx>
impl<'tcx> !UnwindSafe for GenericArg<'tcx>
Blanket Implementations
sourceimpl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [T]ⓘNotable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
sourcedefault fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_debug_str(&self, Ctxt) -> String
sourcedefault fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
default fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> 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. Read moresourceimpl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
impl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
default fn from_cycle_error(tcx: CTX) -> T
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
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