Enum rustc_infer::infer::canonical::ir::PredicateKind
source · pub enum PredicateKind<I>where
I: Interner,{
Clause(ClauseKind<I>),
ObjectSafe(<I as Interner>::DefId),
Subtype(SubtypePredicate<I>),
Coerce(CoercePredicate<I>),
ConstEquate(<I as Interner>::Const, <I as Interner>::Const),
Ambiguous,
NormalizesTo(NormalizesTo<I>),
AliasRelate(<I as Interner>::Term, <I as Interner>::Term, AliasRelationDirection),
}
Variants§
Clause(ClauseKind<I>)
Prove a clause
ObjectSafe(<I as Interner>::DefId)
Trait must be object-safe.
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 as Interner>::Const, <I as Interner>::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 an unconstrained inference variable.
The alias normalizes to term
. Unlike Projection
, this always fails if the
alias cannot be normalized in the current context. For the rigid alias
T as Trait>::Assoc
, Projection(<T as Trait>::Assoc, ?x)
constrains ?x
to <T as Trait>::Assoc
while NormalizesTo(<T as Trait>::Assoc, ?x)
results in NoSolution
.
AliasRelate(<I as Interner>::Term, <I as Interner>::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,
impl<I> Clone for PredicateKind<I>where
I: Interner,
source§fn clone(&self) -> PredicateKind<I>
fn clone(&self) -> PredicateKind<I>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<I> Debug for PredicateKind<I>where
I: Interner,
impl<I> Debug for PredicateKind<I>where
I: Interner,
source§impl<I, __D> Decodable<__D> for PredicateKind<I>where
I: Interner,
__D: TyDecoder<I = I>,
ClauseKind<I>: Decodable<__D>,
<I as Interner>::DefId: Decodable<__D>,
SubtypePredicate<I>: Decodable<__D>,
CoercePredicate<I>: Decodable<__D>,
<I as Interner>::Const: Decodable<__D>,
NormalizesTo<I>: Decodable<__D>,
<I as Interner>::Term: Decodable<__D>,
impl<I, __D> Decodable<__D> for PredicateKind<I>where
I: Interner,
__D: TyDecoder<I = I>,
ClauseKind<I>: Decodable<__D>,
<I as Interner>::DefId: Decodable<__D>,
SubtypePredicate<I>: Decodable<__D>,
CoercePredicate<I>: Decodable<__D>,
<I as Interner>::Const: Decodable<__D>,
NormalizesTo<I>: Decodable<__D>,
<I as Interner>::Term: Decodable<__D>,
fn decode(__decoder: &mut __D) -> PredicateKind<I>
source§impl<I, __E> Encodable<__E> for PredicateKind<I>where
I: Interner,
__E: TyEncoder<I = I>,
ClauseKind<I>: Encodable<__E>,
<I as Interner>::DefId: Encodable<__E>,
SubtypePredicate<I>: Encodable<__E>,
CoercePredicate<I>: Encodable<__E>,
<I as Interner>::Const: Encodable<__E>,
NormalizesTo<I>: Encodable<__E>,
<I as Interner>::Term: Encodable<__E>,
impl<I, __E> Encodable<__E> for PredicateKind<I>where
I: Interner,
__E: TyEncoder<I = I>,
ClauseKind<I>: Encodable<__E>,
<I as Interner>::DefId: Encodable<__E>,
SubtypePredicate<I>: Encodable<__E>,
CoercePredicate<I>: Encodable<__E>,
<I as Interner>::Const: Encodable<__E>,
NormalizesTo<I>: Encodable<__E>,
<I as Interner>::Term: Encodable<__E>,
source§impl<'tcx, E> EncodableWithShorthand<E> for PredicateKind<TyCtxt<'tcx>>
impl<'tcx, E> EncodableWithShorthand<E> for PredicateKind<TyCtxt<'tcx>>
type Variant = PredicateKind<TyCtxt<'tcx>>
fn variant(&self) -> &PredicateKind<TyCtxt<'tcx>>
source§impl<I> Hash for PredicateKind<I>where
I: Interner,
impl<I> Hash for PredicateKind<I>where
I: Interner,
source§impl<I, __CTX> HashStable<__CTX> for PredicateKind<I>where
I: Interner,
ClauseKind<I>: HashStable<__CTX>,
<I as Interner>::DefId: HashStable<__CTX>,
SubtypePredicate<I>: HashStable<__CTX>,
CoercePredicate<I>: HashStable<__CTX>,
<I as Interner>::Const: HashStable<__CTX>,
NormalizesTo<I>: HashStable<__CTX>,
<I as Interner>::Term: HashStable<__CTX>,
impl<I, __CTX> HashStable<__CTX> for PredicateKind<I>where
I: Interner,
ClauseKind<I>: HashStable<__CTX>,
<I as Interner>::DefId: HashStable<__CTX>,
SubtypePredicate<I>: HashStable<__CTX>,
CoercePredicate<I>: HashStable<__CTX>,
<I as Interner>::Const: HashStable<__CTX>,
NormalizesTo<I>: HashStable<__CTX>,
<I as Interner>::Term: HashStable<__CTX>,
fn hash_stable( &self, __hcx: &mut __CTX, __hasher: &mut StableHasher<SipHasher128>, )
source§impl<I> PartialEq for PredicateKind<I>where
I: Interner,
impl<I> PartialEq for PredicateKind<I>where
I: Interner,
source§impl<'tcx, P> Print<'tcx, P> for PredicateKind<TyCtxt<'tcx>>where
P: PrettyPrinter<'tcx>,
impl<'tcx, P> Print<'tcx, P> for PredicateKind<TyCtxt<'tcx>>where
P: PrettyPrinter<'tcx>,
source§impl<I> TypeFoldable<I> for PredicateKind<I>where
I: Interner,
ClauseKind<I>: TypeFoldable<I>,
<I as Interner>::DefId: TypeFoldable<I>,
SubtypePredicate<I>: TypeFoldable<I>,
CoercePredicate<I>: TypeFoldable<I>,
<I as Interner>::Const: TypeFoldable<I>,
NormalizesTo<I>: TypeFoldable<I>,
<I as Interner>::Term: TypeFoldable<I>,
impl<I> TypeFoldable<I> for PredicateKind<I>where
I: Interner,
ClauseKind<I>: TypeFoldable<I>,
<I as Interner>::DefId: TypeFoldable<I>,
SubtypePredicate<I>: TypeFoldable<I>,
CoercePredicate<I>: TypeFoldable<I>,
<I as Interner>::Const: TypeFoldable<I>,
NormalizesTo<I>: TypeFoldable<I>,
<I as Interner>::Term: TypeFoldable<I>,
source§fn try_fold_with<__F>(
self,
__folder: &mut __F,
) -> Result<PredicateKind<I>, <__F as FallibleTypeFolder<I>>::Error>where
__F: FallibleTypeFolder<I>,
fn try_fold_with<__F>(
self,
__folder: &mut __F,
) -> Result<PredicateKind<I>, <__F as FallibleTypeFolder<I>>::Error>where
__F: FallibleTypeFolder<I>,
source§fn fold_with<F>(self, folder: &mut F) -> Selfwhere
F: TypeFolder<I>,
fn fold_with<F>(self, folder: &mut F) -> Selfwhere
F: TypeFolder<I>,
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
.source§impl<I> TypeVisitable<I> for PredicateKind<I>where
I: Interner,
ClauseKind<I>: TypeVisitable<I>,
<I as Interner>::DefId: TypeVisitable<I>,
SubtypePredicate<I>: TypeVisitable<I>,
CoercePredicate<I>: TypeVisitable<I>,
<I as Interner>::Const: TypeVisitable<I>,
NormalizesTo<I>: TypeVisitable<I>,
<I as Interner>::Term: TypeVisitable<I>,
impl<I> TypeVisitable<I> for PredicateKind<I>where
I: Interner,
ClauseKind<I>: TypeVisitable<I>,
<I as Interner>::DefId: TypeVisitable<I>,
SubtypePredicate<I>: TypeVisitable<I>,
CoercePredicate<I>: TypeVisitable<I>,
<I as Interner>::Const: TypeVisitable<I>,
NormalizesTo<I>: TypeVisitable<I>,
<I as Interner>::Term: TypeVisitable<I>,
source§fn visit_with<__V>(
&self,
__visitor: &mut __V,
) -> <__V as TypeVisitor<I>>::Resultwhere
__V: TypeVisitor<I>,
fn visit_with<__V>(
&self,
__visitor: &mut __V,
) -> <__V as TypeVisitor<I>>::Resultwhere
__V: TypeVisitor<I>,
source§impl<'tcx> UpcastFrom<TyCtxt<'tcx>, PredicateKind<TyCtxt<'tcx>>> for Predicate<'tcx>
impl<'tcx> UpcastFrom<TyCtxt<'tcx>, PredicateKind<TyCtxt<'tcx>>> for Predicate<'tcx>
fn upcast_from( from: PredicateKind<TyCtxt<'tcx>>, tcx: TyCtxt<'tcx>, ) -> Predicate<'tcx>
impl<I> Copy for PredicateKind<I>where
I: Interner,
impl<I> Eq for PredicateKind<I>where
I: Interner,
Auto Trait Implementations§
impl<I> Freeze for PredicateKind<I>
impl<I> RefUnwindSafe for PredicateKind<I>where
<I as Interner>::DefId: RefUnwindSafe,
<I as Interner>::Const: RefUnwindSafe,
<I as Interner>::Term: RefUnwindSafe,
<I as Interner>::Ty: RefUnwindSafe,
<I as Interner>::GenericArg: RefUnwindSafe,
<I as Interner>::Region: RefUnwindSafe,
<I as Interner>::GenericArgs: RefUnwindSafe,
impl<I> Send for PredicateKind<I>
impl<I> Sync for PredicateKind<I>
impl<I> Unpin for PredicateKind<I>
impl<I> UnwindSafe for PredicateKind<I>where
<I as Interner>::DefId: UnwindSafe,
<I as Interner>::Const: UnwindSafe,
<I as Interner>::Term: UnwindSafe,
<I as Interner>::Ty: UnwindSafe,
<I as Interner>::GenericArg: UnwindSafe,
<I as Interner>::Region: UnwindSafe,
<I as Interner>::GenericArgs: UnwindSafe,
Blanket Implementations§
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'a mut [T]
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'a mut [T]
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
default fn fingerprint_style() -> FingerprintStyle
source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
DepNode
,
something which is needed when forcing DepNode
s 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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.source§impl<T> Filterable for T
impl<T> Filterable for T
source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moresource§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<'tcx, T> IsSuggestable<'tcx> for T
impl<'tcx, T> IsSuggestable<'tcx> for T
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
fn has_type_flags(&self, flags: TypeFlags) -> bool
source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
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 error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>
source§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
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
fn has_escaping_bound_vars(&self) -> bool
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 morefn has_aliases(&self) -> bool
fn has_opaque_types(&self) -> bool
fn has_coroutines(&self) -> bool
fn references_error(&self) -> bool
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 has_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn has_non_region_placeholders(&self) -> bool
fn has_param(&self) -> bool
source§fn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
source§fn is_global(&self) -> bool
fn is_global(&self) -> bool
source§fn has_bound_regions(&self) -> bool
fn has_bound_regions(&self) -> bool
source§fn has_non_region_bound_vars(&self) -> bool
fn has_non_region_bound_vars(&self) -> bool
source§fn has_bound_vars(&self) -> bool
fn has_bound_vars(&self) -> bool
source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization.source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for T
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.