Struct rustc_middle::ty::sty::TraitRef
source · pub struct TraitRef<'tcx> {
pub def_id: DefId,
pub args: GenericArgsRef<'tcx>,
pub(super) _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 substitutions.
Fields§
§def_id: DefId
§args: GenericArgsRef<'tcx>
§_use_trait_ref_new_instead: ()
This field exists to prevent the creation of TraitRef
without
calling TraitRef::new
.
Implementations§
source§impl<'tcx> TraitRef<'tcx>
impl<'tcx> TraitRef<'tcx>
pub fn print_only_trait_path(self) -> TraitRefPrintOnlyTraitPath<'tcx>
pub fn print_only_trait_name(self) -> TraitRefPrintOnlyTraitName<'tcx>
source§impl<'tcx> TraitRef<'tcx>
impl<'tcx> TraitRef<'tcx>
pub fn new( tcx: TyCtxt<'tcx>, trait_def_id: DefId, args: impl IntoIterator<Item: Into<GenericArg<'tcx>>> ) -> Self
pub fn from_lang_item( tcx: TyCtxt<'tcx>, trait_lang_item: LangItem, span: Span, args: impl IntoIterator<Item: Into<GenericArg<'tcx>>> ) -> Self
pub fn from_method( tcx: TyCtxt<'tcx>, trait_id: DefId, args: GenericArgsRef<'tcx> ) -> TraitRef<'tcx>
sourcepub fn identity(tcx: TyCtxt<'tcx>, def_id: DefId) -> TraitRef<'tcx>
pub fn identity(tcx: TyCtxt<'tcx>, def_id: DefId) -> TraitRef<'tcx>
Returns a TraitRef
of the form P0: Foo<P1..Pn>
where Pi
are the parameters defined on trait.
pub fn with_self_ty(self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> Self
pub fn self_ty(&self) -> Ty<'tcx>
Trait Implementations§
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for TraitRef<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for TraitRef<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )
source§impl<'tcx> IntoDiagnosticArg for TraitRef<'tcx>
impl<'tcx> IntoDiagnosticArg for TraitRef<'tcx>
fn into_diagnostic_arg(self) -> DiagnosticArgValue<'static>
source§impl<'tcx> Ord for TraitRef<'tcx>
impl<'tcx> Ord for TraitRef<'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<TraitRef<'tcx>> for TraitRef<'tcx>
impl<'tcx> PartialEq<TraitRef<'tcx>> for TraitRef<'tcx>
source§impl<'tcx> PartialOrd<TraitRef<'tcx>> for TraitRef<'tcx>
impl<'tcx> PartialOrd<TraitRef<'tcx>> for TraitRef<'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 TraitRef<'tcx>
impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for TraitRef<'tcx>
source§impl<'tcx> Relate<'tcx> for TraitRef<'tcx>
impl<'tcx> Relate<'tcx> for TraitRef<'tcx>
fn relate<R: TypeRelation<'tcx>>( relation: &mut R, a: TraitRef<'tcx>, b: TraitRef<'tcx> ) -> RelateResult<'tcx, TraitRef<'tcx>>
source§impl<'tcx> ToPredicate<'tcx, Clause<'tcx>> for TraitRef<'tcx>
impl<'tcx> ToPredicate<'tcx, Clause<'tcx>> for TraitRef<'tcx>
fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Clause<'tcx>
source§impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for TraitRef<'tcx>
impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for TraitRef<'tcx>
fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>
source§impl<'tcx> ToPredicate<'tcx, TraitPredicate<'tcx>> for TraitRef<'tcx>
impl<'tcx> ToPredicate<'tcx, TraitPredicate<'tcx>> for TraitRef<'tcx>
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> TraitPredicate<'tcx>
source§impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for TraitRef<'tcx>
impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for TraitRef<'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 TraitRef<'tcx>
impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for TraitRef<'tcx>
source§fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V ) -> ControlFlow<__V::BreakTy>
impl<'tcx> Copy for TraitRef<'tcx>
impl<'tcx> Eq for TraitRef<'tcx>
impl<'tcx> StructuralEq for TraitRef<'tcx>
impl<'tcx> StructuralPartialEq for TraitRef<'tcx>
Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for TraitRef<'tcx>
impl<'tcx> Send for TraitRef<'tcx>
impl<'tcx> Sync for TraitRef<'tcx>
impl<'tcx> Unpin for TraitRef<'tcx>
impl<'tcx> !UnwindSafe for TraitRef<'tcx>
Blanket Implementations§
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
source§impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
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<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<'tcx, T> IsSuggestable<'tcx> for Twhere
T: TypeVisitable<TyCtxt<'tcx>> + TypeFoldable<TyCtxt<'tcx>>,
impl<'tcx, T> IsSuggestable<'tcx> for Twhere T: TypeVisitable<TyCtxt<'tcx>> + TypeFoldable<TyCtxt<'tcx>>,
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> 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<'tcx, T> TypeVisitableExt<'tcx> for Twhere
T: TypeVisitable<TyCtxt<'tcx>>,
impl<'tcx, T> TypeVisitableExt<'tcx> for Twhere T: TypeVisitable<TyCtxt<'tcx>>,
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.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_type_flags(&self, flags: TypeFlags) -> bool
fn has_projections(&self) -> bool
fn has_inherent_projections(&self) -> bool
fn has_opaque_types(&self) -> bool
fn has_generators(&self) -> bool
fn references_error(&self) -> bool
fn error_reported(&self) -> Result<(), ErrorGuaranteed>
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_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
source§fn has_non_region_late_bound(&self) -> bool
fn has_non_region_late_bound(&self) -> bool
source§fn has_late_bound_vars(&self) -> bool
fn has_late_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: &[QueryInfo], _guar: ErrorGuaranteed ) -> 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