Enum rustc_middle::ty::PredicateKind
source · 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§
source§impl<'tcx> Clone for PredicateKind<'tcx>
impl<'tcx> Clone for PredicateKind<'tcx>
source§fn clone(&self) -> PredicateKind<'tcx>
fn clone(&self) -> PredicateKind<'tcx>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<'tcx> Debug for PredicateKind<'tcx>
impl<'tcx> Debug for PredicateKind<'tcx>
source§impl<'tcx> Display for PredicateKind<'tcx>
impl<'tcx> Display for PredicateKind<'tcx>
source§impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> EncodableWithShorthand<E> for PredicateKind<'tcx>
impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> EncodableWithShorthand<E> for PredicateKind<'tcx>
source§impl<'tcx> Hash for PredicateKind<'tcx>
impl<'tcx> Hash for PredicateKind<'tcx>
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for PredicateKind<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for PredicateKind<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )
source§impl<'tcx, '__lifted> Lift<'__lifted> for PredicateKind<'tcx>
impl<'tcx, '__lifted> Lift<'__lifted> for PredicateKind<'tcx>
type Lifted = PredicateKind<'__lifted>
fn lift_to_tcx( self, __tcx: TyCtxt<'__lifted> ) -> Option<PredicateKind<'__lifted>>
source§impl<'tcx> PartialEq<PredicateKind<'tcx>> for PredicateKind<'tcx>
impl<'tcx> PartialEq<PredicateKind<'tcx>> for PredicateKind<'tcx>
source§fn eq(&self, other: &PredicateKind<'tcx>) -> bool
fn eq(&self, other: &PredicateKind<'tcx>) -> bool
self
and other
values to be equal, and is used
by ==
.source§impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for PredicateKind<'tcx>
impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for PredicateKind<'tcx>
source§impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for PredicateKind<'tcx>
impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for PredicateKind<'tcx>
fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>
source§impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for PredicateKind<'tcx>
impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for PredicateKind<'tcx>
source§fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F ) -> Result<Self, __F::Error>
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<'tcx> TypeVisitable<TyCtxt<'tcx>> for PredicateKind<'tcx>
impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for PredicateKind<'tcx>
source§fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V ) -> ControlFlow<__V::BreakTy>
impl<'tcx> Copy for PredicateKind<'tcx>
impl<'tcx> Eq for PredicateKind<'tcx>
impl<'tcx> StructuralEq for PredicateKind<'tcx>
impl<'tcx> StructuralPartialEq for PredicateKind<'tcx>
Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for PredicateKind<'tcx>
impl<'tcx> Send for PredicateKind<'tcx>
impl<'tcx> Sync for PredicateKind<'tcx>
impl<'tcx> Unpin for PredicateKind<'tcx>
impl<'tcx> !UnwindSafe for PredicateKind<'tcx>
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<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, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
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<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<'tcx, T> IsSuggestable<'tcx> for Twhere
T: TypeVisitable<TyCtxt<'tcx>> + TypeFoldable<TyCtxt<'tcx>>,
impl<'tcx, T> IsSuggestable<'tcx> for Twhere T: TypeVisitable<TyCtxt<'tcx>> + TypeFoldable<TyCtxt<'tcx>>,
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T
source§impl<'tcx, T> TypeVisitableExt<'tcx> for Twhere
T: TypeVisitable<TyCtxt<'tcx>>,
impl<'tcx, T> TypeVisitableExt<'tcx> for Twhere T: TypeVisitable<TyCtxt<'tcx>>,
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.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_type_flags(&self, flags: TypeFlags) -> bool
fn has_projections(&self) -> bool
fn has_inherent_projections(&self) -> bool
fn has_opaque_types(&self) -> bool
fn has_generators(&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 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_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
source§fn has_non_region_late_bound(&self) -> bool
fn has_non_region_late_bound(&self) -> bool
source§fn has_late_bound_vars(&self) -> bool
fn has_late_bound_vars(&self) -> bool
source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization.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: &[QueryInfo], _guar: ErrorGuaranteed ) -> T
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 bytesObjectSafe
: 16 bytesClosureKind
: 32 bytesSubtype
: 32 bytesCoerce
: 24 bytesConstEquate
: 24 bytesAmbiguous
: 0 bytesAliasRelate
: 32 bytes