Enum rustc_middle::ty::PredicateKind

pub enum PredicateKind<'tcx> {
    Clause(ClauseKind<'tcx>),
    ObjectSafe(DefId),
    ClosureKind(DefId, GenericArgsRef<'tcx>, ClosureKind),
    Subtype(SubtypePredicate<'tcx>),
    Coerce(CoercePredicate<'tcx>),
    ConstEquate(Const<'tcx>, Const<'tcx>),
    Ambiguous,
    AliasRelate(Term<'tcx>, Term<'tcx>, AliasRelationDirection),
}

Variants

Clause(ClauseKind<'tcx>)

Prove a clause

ObjectSafe(DefId)

Trait must be object-safe.

ClosureKind(DefId, GenericArgsRef<'tcx>, ClosureKind)

No direct syntax. May be thought of as where T: FnFoo<...> for some generic args ... and T being a closure type. Satisfied (or refuted) once we know the closure’s kind.

Subtype(SubtypePredicate<'tcx>)

T1 <: T2

This obligation is created most often when we have two unresolved type variables and hence don’t have enough information to process the subtyping obligation yet.

Coerce(CoercePredicate<'tcx>)

T1 coerced to T2

Like a subtyping obligation, this is created most often when we have two unresolved type variables and hence don’t have enough information to process the coercion obligation yet. At the moment, we actually process coercions very much like subtyping and don’t handle the full coercion logic.

ConstEquate(Const<'tcx>, Const<'tcx>)

Constants must be equal. The first component is the const that is expected.

Ambiguous

A marker predicate that is always ambiguous. Used for coherence to mark opaque types as possibly equal to each other but ambiguous.

AliasRelate(Term<'tcx>, Term<'tcx>, AliasRelationDirection)

Separate from ClauseKind::Projection which is used for normalization in new solver. This predicate requires two terms to be equal to eachother.

Only used for new solver

Trait Implementations

impl<'tcx> Clone for PredicateKind<'tcx>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'tcx> Debug for PredicateKind<'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 PredicateKind<'tcx>

fn decode(__decoder: &mut __D) -> Self

impl<'tcx> Display for PredicateKind<'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 PredicateKind<'tcx>

fn encode(&self, __encoder: &mut __E)

impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> EncodableWithShorthand<E> for PredicateKind<'tcx>

type Variant = PredicateKind<'tcx>

fn variant(&self) -> &Self::Variant

impl<'tcx> Hash for PredicateKind<'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 PredicateKind<'tcx>

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

impl<'tcx, '__lifted> Lift<'__lifted> for PredicateKind<'tcx>

type Lifted = PredicateKind<'__lifted>

fn lift_to_tcx( self, __tcx: TyCtxt<'__lifted> ) -> Option<PredicateKind<'__lifted>>

impl<'tcx> PartialEq<PredicateKind<'tcx>> for PredicateKind<'tcx>

fn eq(&self, other: &PredicateKind<'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 PredicateKind<'tcx>

type Output = P

type Error = Error

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

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

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

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

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

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.

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

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

impl<'tcx> Copy for PredicateKind<'tcx>

impl<'tcx> Eq for PredicateKind<'tcx>

impl<'tcx> StructuralEq for PredicateKind<'tcx>

impl<'tcx> StructuralPartialEq for PredicateKind<'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: 32 bytes

Size for each variant:

• Clause: 32 bytes
• ObjectSafe: 16 bytes
• ClosureKind: 32 bytes
• Subtype: 32 bytes
• Coerce: 24 bytes
• ConstEquate: 24 bytes
• Ambiguous: 0 bytes
• AliasRelate: 32 bytes