Struct rustc_middle::ty::TraitPredicate
source · pub struct TraitPredicate<'tcx> {
pub trait_ref: TraitRef<'tcx>,
pub polarity: ImplPolarity,
}
Fields§
§trait_ref: TraitRef<'tcx>
§polarity: ImplPolarity
If polarity is Positive: we are proving that the trait is implemented.
If polarity is Negative: we are proving that a negative impl of this trait exists. (Note that coherence also checks whether negative impls of supertraits exist via a series of predicates.)
If polarity is Reserved: that’s a bug.
Implementations§
source§impl<'tcx> TraitPredicate<'tcx>
impl<'tcx> TraitPredicate<'tcx>
pub fn print_modifiers_and_trait_path( self ) -> TraitPredPrintModifiersAndPath<'tcx>
Trait Implementations§
source§impl<'tcx> Clone for TraitPredicate<'tcx>
impl<'tcx> Clone for TraitPredicate<'tcx>
source§fn clone(&self) -> TraitPredicate<'tcx>
fn clone(&self) -> TraitPredicate<'tcx>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<'tcx> Debug for TraitPredicate<'tcx>
impl<'tcx> Debug for TraitPredicate<'tcx>
source§impl<'tcx> Display for TraitPredicate<'tcx>
impl<'tcx> Display for TraitPredicate<'tcx>
source§impl<'tcx> Hash for TraitPredicate<'tcx>
impl<'tcx> Hash for TraitPredicate<'tcx>
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for TraitPredicate<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for TraitPredicate<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )
source§impl<'tcx, '__lifted> Lift<'__lifted> for TraitPredicate<'tcx>
impl<'tcx, '__lifted> Lift<'__lifted> for TraitPredicate<'tcx>
type Lifted = TraitPredicate<'__lifted>
fn lift_to_tcx( self, __tcx: TyCtxt<'__lifted> ) -> Option<TraitPredicate<'__lifted>>
source§impl<'tcx> PartialEq<TraitPredicate<'tcx>> for TraitPredicate<'tcx>
impl<'tcx> PartialEq<TraitPredicate<'tcx>> for TraitPredicate<'tcx>
source§fn eq(&self, other: &TraitPredicate<'tcx>) -> bool
fn eq(&self, other: &TraitPredicate<'tcx>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for TraitPredicate<'tcx>
impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for TraitPredicate<'tcx>
source§impl<'tcx> Relate<'tcx> for TraitPredicate<'tcx>
impl<'tcx> Relate<'tcx> for TraitPredicate<'tcx>
fn relate<R: TypeRelation<'tcx>>( relation: &mut R, a: TraitPredicate<'tcx>, b: TraitPredicate<'tcx> ) -> RelateResult<'tcx, TraitPredicate<'tcx>>
source§impl<'tcx> ToPredicate<'tcx, Clause<'tcx>> for TraitPredicate<'tcx>
impl<'tcx> ToPredicate<'tcx, Clause<'tcx>> for TraitPredicate<'tcx>
fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Clause<'tcx>
source§impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for TraitPredicate<'tcx>
impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for TraitPredicate<'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 TraitPredicate<'tcx>
impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for TraitPredicate<'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>,
A convenient alternative to
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 TraitPredicate<'tcx>
impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for TraitPredicate<'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 TraitPredicate<'tcx>
impl<'tcx> Eq for TraitPredicate<'tcx>
impl<'tcx> StructuralEq for TraitPredicate<'tcx>
impl<'tcx> StructuralPartialEq for TraitPredicate<'tcx>
Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for TraitPredicate<'tcx>
impl<'tcx> Send for TraitPredicate<'tcx>
impl<'tcx> Sync for TraitPredicate<'tcx>
impl<'tcx> Unpin for TraitPredicate<'tcx>
impl<'tcx> !UnwindSafe for TraitPredicate<'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
Mutably borrows from an owned value. Read more
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
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).
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
This method tries to recover the query key from the given
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
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.source§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
Returns
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
Return
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
“Free” regions in this context means that it has any region
that is not (a) erased or (b) late-bound.
fn has_erased_regions(&self) -> bool
source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
True if there are any un-erased free regions.
source§fn 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.
source§fn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
True if there are any late-bound regions
source§fn has_non_region_late_bound(&self) -> bool
fn has_non_region_late_bound(&self) -> bool
True if there are any late-bound non-region variables
source§fn has_late_bound_vars(&self) -> bool
fn has_late_bound_vars(&self) -> bool
True if there are any late-bound variables
source§fn 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.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: 24 bytes