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: NonZeroUsizemarker: 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>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
sourceimpl<'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>
Converts to this type from the input type.
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>
Converts to this type from the input type.
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>
Converts to this type from the input type.
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
Compares and returns the maximum of two values. Read more
1.21.0 · sourcefn min(self, other: Self) -> Self
fn min(self, other: Self) -> Self
Compares and returns the minimum of two values. Read more
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Self where
Self: PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Self where
Self: PartialOrd<Self>,
Restrict a value to a certain interval. Read more
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
This method tests for self and other values to be equal, and is used
by ==. Read more
sourcefn ne(&self, other: &GenericArg<'tcx>) -> bool
fn ne(&self, other: &GenericArg<'tcx>) -> bool
This method tests for !=.
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>
This method returns an ordering between self and other values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self and other) and is used by the <=
operator. Read more
sourceimpl<'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>
The entry point for folding. To fold a value t with a folder f
call: t.try_fold_with(f). Read more
sourcefn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
fn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
A convenient alternative to try_fold_with for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with. Read more
sourceimpl<'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>
The entry point for visiting. To visit a value t with a visitor v
call: t.visit_with(v). Read more
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 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
“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> 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 T where
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T where
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 T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
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,
default fn fingerprint_style() -> FingerprintStyle
sourcedefault fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
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
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>
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, 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>>::Output where
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
impl<'a, T> Captures<'a> for T where
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