Skip to main content

## PredicateKind

# Enum PredicateKind

Source

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

## Variants§

§

### Clause(ClauseKind<I>)

Prove a clause

§

### DynCompatible(I::TraitId)

Trait must be dyn-compatible.

§

### Subtype(SubtypePredicate<I>)

`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<I>)

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

This should only be used inside of the new solver for `AliasRelate` and expects the `term` to be always be an unconstrained inference variable. It is used to normalize `alias` as much as possible. In case the alias is rigid - i.e. it cannot be normalized in the current environment - this constrains `term` to be equal to the alias itself.

It is likely more useful to think of this as a function `normalizes_to(alias)`, whose return value is written into `term`.

§

### 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> Clone for PredicateKind<I>
where I: Interner,

Source§

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

Returns a duplicate 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: Decoder> Decodable<__D> for PredicateKind<I>
where ClauseKind<I>: Decodable<__D>, I::TraitId: Decodable<__D>, SubtypePredicate<I>: Decodable<__D>, CoercePredicate<I>: Decodable<__D>, I::Const: Decodable<__D>, NormalizesTo<I>: Decodable<__D>, I::Term: Decodable<__D>,

Source§

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

Source§

### impl<I: Interner, __E: Encoder> Encodable<__E> for PredicateKind<I>
where ClauseKind<I>: Encodable<__E>, I::TraitId: Encodable<__E>, SubtypePredicate<I>: Encodable<__E>, CoercePredicate<I>: Encodable<__E>, I::Const: Encodable<__E>, NormalizesTo<I>: Encodable<__E>, I::Term: Encodable<__E>,

Source§

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

Source§

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

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

Source§

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

Source§

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

Source§

#### fn eq(&self, __other: &Self) -> bool

Tests for `self` and `other` values to be equal, and is used by `==`.
1.0.0 · Source§

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

Tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

### impl<I> TypeFoldable<I> for PredicateKind<I>
where I: Interner, ClauseKind<I>: TypeFoldable<I>, I::TraitId: TypeFoldable<I>, SubtypePredicate<I>: TypeFoldable<I>, CoercePredicate<I>: TypeFoldable<I>, I::Const: TypeFoldable<I>, NormalizesTo<I>: TypeFoldable<I>, I::Term: 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

The entry point for folding. To fold a value `t` with a folder `f` call: `t.fold_with(f)`. Read more
Source§

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

Source§

#### fn visit_with<__V: TypeVisitor<I>>(&self, __visitor: &mut __V) -> __V::Result

The entry point for visiting. To visit a value `t` with a visitor `v` call: `t.visit_with(v)`. Read more
Source§

### impl<I> Copy for PredicateKind<I>
where I: Interner,

Source§

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

## Auto Trait Implementations§

§

### impl<I> DynSend for PredicateKind<I>
where <I as Interner>::TraitId: DynSend, <I as Interner>::Const: DynSend, <I as Interner>::Term: DynSend, <I as Interner>::Ty: DynSend, <I as Interner>::Symbol: DynSend, <I as Interner>::Region: DynSend, <I as Interner>::GenericArgs: DynSend, <I as Interner>::DefId: DynSend,

§

### impl<I> DynSync for PredicateKind<I>
where <I as Interner>::TraitId: DynSync, <I as Interner>::Const: DynSync, <I as Interner>::Term: DynSync, <I as Interner>::Ty: DynSync, <I as Interner>::Symbol: DynSync, <I as Interner>::Region: DynSync, <I as Interner>::GenericArgs: DynSync, <I as Interner>::DefId: DynSync,

§

### impl<I> Freeze for PredicateKind<I>
where <I as Interner>::TraitId: Freeze, <I as Interner>::Const: Freeze, <I as Interner>::Term: Freeze, <I as Interner>::Ty: Freeze, <I as Interner>::Symbol: Freeze, <I as Interner>::Region: Freeze, <I as Interner>::GenericArgs: Freeze, <I as Interner>::DefId: Freeze,

§

### impl<I> RefUnwindSafe for PredicateKind<I>
where <I as Interner>::TraitId: RefUnwindSafe, <I as Interner>::Const: RefUnwindSafe, <I as Interner>::Term: RefUnwindSafe, <I as Interner>::Ty: RefUnwindSafe, <I as Interner>::Symbol: RefUnwindSafe, <I as Interner>::Region: RefUnwindSafe, <I as Interner>::GenericArgs: RefUnwindSafe, <I as Interner>::DefId: RefUnwindSafe,

§

### impl<I> Send for PredicateKind<I>
where <I as Interner>::TraitId: Send, <I as Interner>::Const: Send, <I as Interner>::Term: Send, <I as Interner>::Ty: Send, <I as Interner>::Symbol: Send, <I as Interner>::Region: Send, <I as Interner>::GenericArgs: Send, <I as Interner>::DefId: Send,

§

### impl<I> Sync for PredicateKind<I>
where <I as Interner>::TraitId: Sync, <I as Interner>::Const: Sync, <I as Interner>::Term: Sync, <I as Interner>::Ty: Sync, <I as Interner>::Symbol: Sync, <I as Interner>::Region: Sync, <I as Interner>::GenericArgs: Sync, <I as Interner>::DefId: Sync,

§

### impl<I> Unpin for PredicateKind<I>
where <I as Interner>::TraitId: Unpin, <I as Interner>::Const: Unpin, <I as Interner>::Term: Unpin, <I as Interner>::Ty: Unpin, <I as Interner>::Symbol: Unpin, <I as Interner>::Region: Unpin, <I as Interner>::GenericArgs: Unpin, <I as Interner>::DefId: Unpin,

§

### impl<I> UnsafeUnpin for PredicateKind<I>
where <I as Interner>::TraitId: UnsafeUnpin, <I as Interner>::Const: UnsafeUnpin, <I as Interner>::Term: UnsafeUnpin, <I as Interner>::Ty: UnsafeUnpin, <I as Interner>::Symbol: UnsafeUnpin, <I as Interner>::Region: UnsafeUnpin, <I as Interner>::GenericArgs: UnsafeUnpin, <I as Interner>::DefId: UnsafeUnpin,

§

### impl<I> UnwindSafe for PredicateKind<I>
where <I as Interner>::TraitId: UnwindSafe, <I as Interner>::Const: UnwindSafe, <I as Interner>::Term: UnwindSafe, <I as Interner>::Ty: UnwindSafe, <I as Interner>::Symbol: UnwindSafe, <I as Interner>::Region: UnwindSafe, <I as Interner>::GenericArgs: UnwindSafe, <I as Interner>::DefId: UnwindSafe,

## Blanket Implementations§

Source§

### impl<T> Aligned for T

Source§

#### const ALIGN: Alignment

Alignment of `Self`.
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> AnyEq for T
where T: Any + PartialEq,

Source§

#### fn equals(&self, other: &(dyn Any + 'static)) -> bool

Source§

#### fn as_any(&self) -> &(dyn Any + 'static)

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> CloneToUninit for T
where T: Clone,

Source§

#### unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (`clone_to_uninit`)
Performs copy-assignment from `self` to `dest`. 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<_>>())`.

Source§

#### type Output = R

Source§

### impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

#### fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

### impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

#### fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

### impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

#### fn equivalent(&self, key: &K) -> bool

Compare self to `key` and return `true` if they are equal.
Source§

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

Source§

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

Returns the argument unchanged.

Source§

### impl<T> Instrument for T

Source§

#### fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided `Span`, returning an `Instrumented` wrapper. Read more
Source§

#### fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current `Span`, returning an `Instrumented` wrapper. Read more
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> IntoEither for T

Source§

#### fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts `self` into a `Left` variant of `Either<Self, Self>` if `into_left` is `true`. Converts `self` into a `Right` variant of `Either<Self, Self>` otherwise. Read more
Source§

#### fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts `self` into a `Left` variant of `Either<Self, Self>` if `into_left(&self)` returns `true`. Converts `self` into a `Right` variant of `Either<Self, Self>` otherwise. Read more
Source§

### impl<T> Pointable for T

Source§

#### const ALIGN: usize

The alignment of pointer.
Source§

#### type Init = T

The type for initializers.
Source§

#### unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

#### unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

#### unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

#### unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

### impl<T> Same for T

Source§

#### type Output = T

Should always be `Self`
Source§

### impl<T> ToOwned for T
where T: Clone,

Source§

#### 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>,

Source§

#### 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>,

Source§

#### 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<I, T> TypeVisitableExt<I> for T
where I: Interner, T: TypeVisitable<I>,

Source§

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

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 error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>

Source§

#### fn non_region_error_reported( &self, ) -> Result<(), <I as Interner>::ErrorGuaranteed>

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_aliases(&self) -> bool

Source§

#### fn has_opaque_types(&self) -> bool

Source§

#### fn has_coroutines(&self) -> bool

Source§

#### fn references_error(&self) -> bool

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_bound_regions(&self) -> bool

True if there are any late-bound regions
Source§

#### fn has_non_region_bound_vars(&self) -> bool

True if there are any late-bound non-region variables
Source§

#### fn has_bound_vars(&self) -> bool

True if there are any 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§

#### fn has_non_region_error(&self) -> bool

True if a type or const error is reachable
Source§

### impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

Source§

#### fn upcast(self, interner: I) -> U

Source§

### impl<I, T> UpcastFrom<I, T> for T

Source§

#### fn upcast_from(from: T, _tcx: I) -> T

Source§

### impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

#### fn vzip(self) -> V

Source§

### impl<T> WithSubscriber for T

Source§

#### fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided `Subscriber` to this type, returning a `WithDispatch` wrapper. Read more
Source§

#### fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default `Subscriber` to this type, returning a `WithDispatch` wrapper. Read more
Source§

### impl<T> ErasedDestructor for T
where T: 'static,

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