Struct rustc_type_ir::TraitRef
source · pub struct TraitRef<I: Interner> {
pub def_id: I::DefId,
pub args: I::GenericArgs,
_use_trait_ref_new_instead: (),
}
Expand description
A complete reference to a trait. These take numerous guises in syntax, but perhaps the most recognizable form is in a where-clause:
T: Foo<U>
This would be represented by a trait-reference where the DefId
is the
DefId
for the trait Foo
and the args define T
as parameter 0,
and U
as parameter 1.
Trait references also appear in object types like Foo<U>
, but in
that case the Self
parameter is absent from the generic parameters.
Fields§
§def_id: I::DefId
§args: I::GenericArgs
§_use_trait_ref_new_instead: ()
This field exists to prevent the creation of TraitRef
without
calling TraitRef::new_from_args
.
Implementations§
source§impl<I: Interner> TraitRef<I>
impl<I: Interner> TraitRef<I>
pub fn new_from_args( interner: I, trait_def_id: I::DefId, args: I::GenericArgs, ) -> Self
pub fn new( interner: I, trait_def_id: I::DefId, args: impl IntoIterator<Item: Into<I::GenericArg>>, ) -> Self
pub fn from_method( interner: I, trait_id: I::DefId, args: I::GenericArgs, ) -> TraitRef<I>
sourcepub fn identity(interner: I, def_id: I::DefId) -> TraitRef<I>
pub fn identity(interner: I, def_id: I::DefId) -> TraitRef<I>
Returns a TraitRef
of the form P0: Foo<P1..Pn>
where Pi
are the parameters defined on trait.
pub fn with_self_ty(self, interner: I, self_ty: I::Ty) -> Self
pub fn self_ty(&self) -> I::Ty
Trait Implementations§
source§impl<I: Interner, __CTX> HashStable<__CTX> for TraitRef<I>
impl<I: Interner, __CTX> HashStable<__CTX> for TraitRef<I>
fn hash_stable(&self, __hcx: &mut __CTX, __hasher: &mut StableHasher)
source§impl<I: Interner> PartialEq for TraitRef<I>
impl<I: Interner> PartialEq for TraitRef<I>
source§impl<I: Interner> Relate<I> for TraitRef<I>
impl<I: Interner> Relate<I> for TraitRef<I>
fn relate<R: TypeRelation<I>>( relation: &mut R, a: TraitRef<I>, b: TraitRef<I>, ) -> RelateResult<I, TraitRef<I>>
source§impl<I> TypeFoldable<I> for TraitRef<I>
impl<I> TypeFoldable<I> for TraitRef<I>
source§fn try_fold_with<__F: FallibleTypeFolder<I>>(
self,
__folder: &mut __F,
) -> Result<Self, __F::Error>
fn try_fold_with<__F: FallibleTypeFolder<I>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>
source§fn fold_with<F: TypeFolder<I>>(self, folder: &mut F) -> Self
fn fold_with<F: TypeFolder<I>>(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
.source§impl<I> TypeVisitable<I> for TraitRef<I>
impl<I> TypeVisitable<I> for TraitRef<I>
source§fn visit_with<__V: TypeVisitor<I>>(&self, __visitor: &mut __V) -> __V::Result
fn visit_with<__V: TypeVisitor<I>>(&self, __visitor: &mut __V) -> __V::Result
source§impl<I: Interner> UpcastFrom<I, TraitRef<I>> for TraitPredicate<I>
impl<I: Interner> UpcastFrom<I, TraitRef<I>> for TraitPredicate<I>
fn upcast_from(from: TraitRef<I>, _tcx: I) -> Self
impl<I: Interner> Copy for TraitRef<I>
impl<I: Interner> Eq for TraitRef<I>
Auto Trait Implementations§
impl<I> Freeze for TraitRef<I>
impl<I> RefUnwindSafe for TraitRef<I>
impl<I> Send for TraitRef<I>
impl<I> Sync for TraitRef<I>
impl<I> Unpin for TraitRef<I>
impl<I> UnwindSafe for TraitRef<I>
Blanket Implementations§
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: Copy,
impl<T> CloneToUninit for Twhere
T: Copy,
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default 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<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> 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<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_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<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<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,
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.