Struct rustc_middle::ty::Predicate

source ·
pub struct Predicate<'tcx>(Interned<'tcx, WithCachedTypeInfo<Binder<'tcx, PredicateKind<'tcx>>>>);
Expand description

A statement that can be proven by a trait solver. This includes things that may show up in where clauses, such as trait predicates and projection predicates, and also things that are emitted as part of type checking such as ObjectSafe predicate which is emitted when a type is coerced to a trait object.

Use this rather than PredicateKind, whenever possible.

Tuple Fields§

§0: Interned<'tcx, WithCachedTypeInfo<Binder<'tcx, PredicateKind<'tcx>>>>

Implementations§

source§

impl<'tcx> Predicate<'tcx>

source

pub fn kind(self) -> Binder<'tcx, PredicateKind<'tcx>>

Gets the inner Binder<'tcx, PredicateKind<'tcx>>.

source

pub fn flags(self) -> TypeFlags

source

pub fn outer_exclusive_binder(self) -> DebruijnIndex

source

pub fn flip_polarity(self, tcx: TyCtxt<'tcx>) -> Option<Predicate<'tcx>>

Flips the polarity of a Predicate.

Given T: Trait predicate it returns T: !Trait and given T: !Trait returns T: Trait.

source

pub fn is_coinductive(self, tcx: TyCtxt<'tcx>) -> bool

source

pub fn allow_normalization(self) -> bool

Whether this projection can be soundly normalized.

Wf predicates must not be normalized, as normalization can remove required bounds which would cause us to unsoundly accept some programs. See #91068.

source§

impl<'tcx> Predicate<'tcx>

source

pub fn to_opt_poly_trait_pred(self) -> Option<PolyTraitPredicate<'tcx>>

source

pub fn to_opt_poly_projection_pred( self ) -> Option<PolyProjectionPredicate<'tcx>>

source

pub fn to_opt_type_outlives(self) -> Option<PolyTypeOutlivesPredicate<'tcx>>

source

pub fn as_clause(self) -> Option<Clause<'tcx>>

Matches a PredicateKind::Clause and turns it into a Clause, otherwise returns None.

source

pub fn expect_clause(self) -> Clause<'tcx>

Assert that the predicate is a clause.

Trait Implementations§

source§

impl<'tcx> Clone for Predicate<'tcx>

source§

fn clone(&self) -> Predicate<'tcx>

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl<'tcx> Debug for Predicate<'tcx>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Predicate<'tcx>

source§

fn decode(decoder: &mut D) -> Predicate<'tcx>

source§

impl<'tcx> Display for Predicate<'tcx>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Predicate<'tcx>

source§

fn encode(&self, e: &mut E)

source§

impl<'tcx> EraseType for Predicate<'tcx>

§

type Result = [u8; 8]

source§

impl<'tcx> Hash for Predicate<'tcx>

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for Predicate<'tcx>

source§

fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )

source§

impl IntoDiagnosticArg for Predicate<'_>

source§

impl<'a, 'tcx> Lift<'tcx> for Predicate<'a>

§

type Lifted = Predicate<'tcx>

source§

fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl ParameterizedOverTcx for Predicate<'static>

§

type Value<'tcx> = Predicate<'tcx>

source§

impl<'tcx> PartialEq<Predicate<'tcx>> for Predicate<'tcx>

source§

fn eq(&self, other: &Predicate<'tcx>) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for Predicate<'tcx>

§

type Output = P

§

type Error = Error

source§

fn print(&self, cx: P) -> Result<Self::Output, Self::Error>

source§

impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for Binder<'tcx, ClauseKind<'tcx>>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for Binder<'tcx, PredicateKind<'tcx>>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for Binder<'tcx, TraitRef<'tcx>>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for Clause<'tcx>

source§

fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for ClauseKind<'tcx>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for OutlivesPredicate<Ty<'tcx>, Region<'tcx>>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for PolyProjectionPredicate<'tcx>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for PolyRegionOutlivesPredicate<'tcx>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for PolyTraitPredicate<'tcx>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for PredicateKind<'tcx>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for ProjectionPredicate<'tcx>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for TraitPredicate<'tcx>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for TraitRef<'tcx>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Predicate<'tcx>

source§

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'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
source§

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> TypeSuperFoldable<TyCtxt<'tcx>> for Predicate<'tcx>

source§

fn try_super_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F ) -> Result<Self, F::Error>

Provides a default fold for a recursive type of interest. This should only be called within TypeFolder methods, when a non-custom traversal is desired for the value of the type of interest passed to that method. For example, in MyFolder::try_fold_ty(ty), it is valid to call ty.try_super_fold_with(self), but any other folding should be done with xyz.try_fold_with(self).
source§

fn super_fold_with<F>(self, folder: &mut F) -> Selfwhere F: TypeFolder<I>,

A convenient alternative to try_super_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_super_fold_with.
source§

impl<'tcx> TypeSuperVisitable<TyCtxt<'tcx>> for Predicate<'tcx>

source§

fn super_visit_with<V: TypeVisitor<TyCtxt<'tcx>>>( &self, visitor: &mut V ) -> ControlFlow<V::BreakTy>

Provides a default visit for a recursive type of interest. This should only be called within TypeVisitor methods, when a non-custom traversal is desired for the value of the type of interest passed to that method. For example, in MyVisitor::visit_ty(ty), it is valid to call ty.super_visit_with(self), but any other visiting should be done with xyz.visit_with(self).
source§

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Predicate<'tcx>

source§

fn visit_with<V: TypeVisitor<TyCtxt<'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
source§

impl<'tcx> Copy for Predicate<'tcx>

source§

impl<'tcx> Eq for Predicate<'tcx>

source§

impl<'tcx> StructuralEq for Predicate<'tcx>

source§

impl<'tcx> StructuralPartialEq for Predicate<'tcx>

Auto Trait Implementations§

§

impl<'tcx> !RefUnwindSafe for Predicate<'tcx>

§

impl<'tcx> Send for Predicate<'tcx>

§

impl<'tcx> Sync for Predicate<'tcx>

§

impl<'tcx> Unpin for Predicate<'tcx>

§

impl<'tcx> !UnwindSafe for Predicate<'tcx>

Blanket Implementations§

source§

impl<T> Aligned for T

source§

const ALIGN: Alignment = _

Alignment of Self.
source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere T: Copy,

source§

fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T

source§

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T> ) -> &'a mut [T]

source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T, R> CollectAndApply<T, R> for T

source§

fn collect_and_apply<I, F>(iter: I, f: F) -> Rwhere I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to f(&iter.collect::<Vec<_>>()).

§

type Output = R

source§

impl<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

source§

default fn fingerprint_style() -> FingerprintStyle

source§

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).
source§

default fn to_debug_str(&self, _: Tcx) -> String

source§

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 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.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<P> IntoQueryParam<P> for P

source§

impl<'tcx, T> IsSuggestable<'tcx> for Twhere T: TypeVisitable<TyCtxt<'tcx>> + TypeFoldable<TyCtxt<'tcx>>,

source§

fn is_suggestable(self, tcx: TyCtxt<'tcx>, infer_suggestable: bool) -> bool

Whether this makes sense to suggest in a diagnostic. Read more
source§

fn make_suggestable( self, tcx: TyCtxt<'tcx>, infer_suggestable: bool ) -> Option<T>

source§

impl<T> MaybeResult<T> for T

§

type Error = !

source§

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

source§

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<'tcx, T> ToPredicate<'tcx, T> for T

source§

fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T

source§

impl<T> ToString for Twhere T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<'tcx, T> TypeVisitableExt<'tcx> for Twhere T: TypeVisitable<TyCtxt<'tcx>>,

source§

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

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

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 more
source§

fn has_type_flags(&self, flags: TypeFlags) -> bool

source§

fn has_projections(&self) -> bool

source§

fn has_inherent_projections(&self) -> bool

source§

fn has_opaque_types(&self) -> bool

source§

fn has_generators(&self) -> bool

source§

fn references_error(&self) -> bool

source§

fn error_reported(&self) -> Result<(), ErrorGuaranteed>

source§

fn has_non_region_param(&self) -> bool

source§

fn has_infer_regions(&self) -> bool

source§

fn has_infer_types(&self) -> bool

source§

fn has_non_region_infer(&self) -> bool

source§

fn has_infer(&self) -> bool

source§

fn has_placeholders(&self) -> bool

source§

fn has_non_region_placeholders(&self) -> bool

source§

fn has_param(&self) -> bool

source§

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.
source§

fn has_erased_regions(&self) -> bool

source§

fn has_erasable_regions(&self) -> bool

True if there are any un-erased free regions.
source§

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

True if there are any late-bound regions
source§

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

True if there are any late-bound variables
source§

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,

source§

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: 8 bytes