Struct rustc_middle::ty::Predicate

pub struct Predicate<'tcx>(Interned<'tcx, WithCachedTypeInfo<Binder<'tcx, PredicateKind<'tcx>>>>);

Use this rather than PredicateKind, whenever possible.

Tuple Fields

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

Implementations

impl<'tcx> Predicate<'tcx>

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

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

pub fn flags(self) -> TypeFlags

pub fn outer_exclusive_binder(self) -> DebruijnIndex

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.

pub fn without_const(self, tcx: TyCtxt<'tcx>) -> Self

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.

impl<'tcx> Predicate<'tcx>

pub fn subst_supertrait(
    self,
    tcx: TyCtxt<'tcx>,
    trait_ref: &PolyTraitRef<'tcx>
) -> Predicate<'tcx>

Performs a substitution suitable for going from a poly-trait-ref to supertraits that must hold if that poly-trait-ref holds. This is slightly different from a normal substitution in terms of what happens with bound regions. See lengthy comment below for details.

impl<'tcx> Predicate<'tcx>

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

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

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

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

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

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

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

Formats the value using the given formatter.

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

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

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

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

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

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

impl IntoDiagnosticArg for Predicate<'_>

fn into_diagnostic_arg(self) -> DiagnosticArgValue<'static>

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

type Lifted = Predicate<'tcx>

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

impl ParameterizedOverTcx for Predicate<'static>

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

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

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

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

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.

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

type Output = P

type Error = Error

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.

impl<'tcx> TypeSuperFoldable<'tcx> for Predicate<'tcx>

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

Provides a default fold for a 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).

fn super_fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self

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.

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

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

Provides a default visit for a 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).

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

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

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.

fn has_type_flags(&self, flags: TypeFlags) -> 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).

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.

fn has_projections(&self) -> bool

fn has_opaque_types(&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 needs_infer(&self) -> bool

fn has_placeholders(&self) -> bool

fn needs_subst(&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

fn has_erasable_regions(&self) -> bool

True if there are any un-erased free regions.

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.

fn has_late_bound_regions(&self) -> bool

True if there are any late-bound regions

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.

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

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

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

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

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