# Enum rustc_type_ir::predicate_kind::PredicateKind

source ·

    pub enum PredicateKind<I: Interner> {
        Clause(ClauseKind<I>),
        ObjectSafe(I::DefId),
        Subtype(I::SubtypePredicate),
        Coerce(I::CoercePredicate),
        ConstEquate(I::Const, I::Const),
        Ambiguous,
        NormalizesTo(I::NormalizesTo),
        AliasRelate(I::Term, I::Term, AliasRelationDirection),
    }

## Variants§

§

### Clause(ClauseKind<I>)

Prove a clause

§

### ObjectSafe(I::DefId)

Trait must be object-safe.

§

### Subtype(I::SubtypePredicate)

`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(I::CoercePredicate)

`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(I::Const, I::Const)

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.

§

### NormalizesTo(I::NormalizesTo)

The alias normalizes to `term`. Unlike `Projection`, this always fails if the alias cannot be normalized in the current context.

`Projection(<T as Trait>::Assoc, ?x)` results in `?x == <T as Trait>::Assoc` while `NormalizesTo(<T as Trait>::Assoc, ?x)` results in `NoSolution`.

Only used in the new solver.

§

### AliasRelate(I::Term, I::Term, 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§

source§

### impl<I: Interner> Clone for PredicateKind<I>

source§

#### fn clone(&self) -> Self

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<I: Interner> Debug for PredicateKind<I>

source§

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

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

### impl<I: Interner, __D: TyDecoder<I = I>> Decodable<__D> for PredicateKind<I>
where ClauseKind<I>: Decodable<__D>, I::DefId: Decodable<__D>, I::SubtypePredicate: Decodable<__D>, I::CoercePredicate: Decodable<__D>, I::Const: Decodable<__D>, I::NormalizesTo: Decodable<__D>, I::Term: Decodable<__D>,

source§

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

source§

### impl<I: Interner, __E: TyEncoder<I = I>> Encodable<__E> for PredicateKind<I>
where ClauseKind<I>: Encodable<__E>, I::DefId: Encodable<__E>, I::SubtypePredicate: Encodable<__E>, I::CoercePredicate: Encodable<__E>, I::Const: Encodable<__E>, I::NormalizesTo: Encodable<__E>, I::Term: Encodable<__E>,

source§

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

source§

### impl<I: Interner> Hash for PredicateKind<I>

source§

#### fn hash<__HI>(&self, __state: &mut __HI)
where __HI: Hasher,

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<I: Interner, __CTX> HashStable<__CTX> for PredicateKind<I>
where ClauseKind<I>: HashStable<__CTX>, I::DefId: HashStable<__CTX>, I::SubtypePredicate: HashStable<__CTX>, I::CoercePredicate: HashStable<__CTX>, I::Const: HashStable<__CTX>, I::NormalizesTo: HashStable<__CTX>, I::Term: HashStable<__CTX>,

source§

#### fn hash_stable(&self, __hcx: &mut __CTX, __hasher: &mut StableHasher)

source§

### impl<I: Interner> PartialEq for PredicateKind<I>

source§

#### fn eq(&self, other: &Self) -> 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<I: Interner> TypeFoldable<I> for PredicateKind<I>
where I::DefId: TypeFoldable<I>, I::Const: TypeFoldable<I>, I::GenericArgs: TypeFoldable<I>, I::Term: TypeFoldable<I>, I::CoercePredicate: TypeFoldable<I>, I::SubtypePredicate: TypeFoldable<I>, I::NormalizesTo: TypeFoldable<I>, ClauseKind<I>: TypeFoldable<I>,

source§

#### fn try_fold_with<F: FallibleTypeFolder<I>>( 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: TypeFolder<I>>(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`.
source§

### impl<I: Interner> TypeVisitable<I> for PredicateKind<I>
where I::DefId: TypeVisitable<I>, I::Const: TypeVisitable<I>, I::GenericArgs: TypeVisitable<I>, I::Term: TypeVisitable<I>, I::CoercePredicate: TypeVisitable<I>, I::SubtypePredicate: TypeVisitable<I>, I::NormalizesTo: TypeVisitable<I>, ClauseKind<I>: TypeVisitable<I>,

source§

#### fn visit_with<V: TypeVisitor<I>>( &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<I: Interner> Copy for PredicateKind<I>

source§

### impl<I: Interner> Eq for PredicateKind<I>

## Auto Trait Implementations§

§

### impl<I> RefUnwindSafe for PredicateKind<I>
where <I as Interner>::CoercePredicate: RefUnwindSafe, <I as Interner>::Const: RefUnwindSafe, <I as Interner>::DefId: RefUnwindSafe, <I as Interner>::GenericArg: RefUnwindSafe, <I as Interner>::NormalizesTo: RefUnwindSafe, <I as Interner>::ProjectionPredicate: RefUnwindSafe, <I as Interner>::RegionOutlivesPredicate: RefUnwindSafe, <I as Interner>::SubtypePredicate: RefUnwindSafe, <I as Interner>::Term: RefUnwindSafe, <I as Interner>::TraitPredicate: RefUnwindSafe, <I as Interner>::Ty: RefUnwindSafe, <I as Interner>::TypeOutlivesPredicate: RefUnwindSafe,

§

### impl<I> Send for PredicateKind<I>
where <I as Interner>::CoercePredicate: Send, <I as Interner>::Const: Send, <I as Interner>::DefId: Send, <I as Interner>::GenericArg: Send, <I as Interner>::NormalizesTo: Send, <I as Interner>::ProjectionPredicate: Send, <I as Interner>::RegionOutlivesPredicate: Send, <I as Interner>::SubtypePredicate: Send, <I as Interner>::Term: Send, <I as Interner>::TraitPredicate: Send, <I as Interner>::Ty: Send, <I as Interner>::TypeOutlivesPredicate: Send,

§

### impl<I> Sync for PredicateKind<I>
where <I as Interner>::CoercePredicate: Sync, <I as Interner>::Const: Sync, <I as Interner>::DefId: Sync, <I as Interner>::GenericArg: Sync, <I as Interner>::NormalizesTo: Sync, <I as Interner>::ProjectionPredicate: Sync, <I as Interner>::RegionOutlivesPredicate: Sync, <I as Interner>::SubtypePredicate: Sync, <I as Interner>::Term: Sync, <I as Interner>::TraitPredicate: Sync, <I as Interner>::Ty: Sync, <I as Interner>::TypeOutlivesPredicate: Sync,

§

### impl<I> Unpin for PredicateKind<I>
where <I as Interner>::CoercePredicate: Unpin, <I as Interner>::Const: Unpin, <I as Interner>::DefId: Unpin, <I as Interner>::GenericArg: Unpin, <I as Interner>::NormalizesTo: Unpin, <I as Interner>::ProjectionPredicate: Unpin, <I as Interner>::RegionOutlivesPredicate: Unpin, <I as Interner>::SubtypePredicate: Unpin, <I as Interner>::Term: Unpin, <I as Interner>::TraitPredicate: Unpin, <I as Interner>::Ty: Unpin, <I as Interner>::TypeOutlivesPredicate: Unpin,

§

### impl<I> UnwindSafe for PredicateKind<I>
where <I as Interner>::CoercePredicate: UnwindSafe, <I as Interner>::Const: UnwindSafe, <I as Interner>::DefId: UnwindSafe, <I as Interner>::GenericArg: UnwindSafe, <I as Interner>::NormalizesTo: UnwindSafe, <I as Interner>::ProjectionPredicate: UnwindSafe, <I as Interner>::RegionOutlivesPredicate: UnwindSafe, <I as Interner>::SubtypePredicate: UnwindSafe, <I as Interner>::Term: UnwindSafe, <I as Interner>::TraitPredicate: UnwindSafe, <I as Interner>::Ty: UnwindSafe, <I as Interner>::TypeOutlivesPredicate: UnwindSafe,

## Blanket Implementations§

source§

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

source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
source§

### impl<T> Borrow<T> for T
where T: ?Sized,

source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

### impl<T> BorrowMut<T> for T
where 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) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

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

§

#### type Output = R

source§

### impl<T> From<T> for T

source§

#### fn from(t: T) -> T

Returns the argument unchanged.

source§

### impl<T, U> Into<U> for T
where 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<T> ToOwned for T
where 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<T, U> TryFrom<U> for T
where 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 T
where 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.

## Layout§

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.