Enum rustc_middle::ty::PredicateKind
source · pub enum PredicateKind<'tcx> {
Trait(TraitPredicate<'tcx>),
RegionOutlives(RegionOutlivesPredicate<'tcx>),
TypeOutlives(TypeOutlivesPredicate<'tcx>),
Projection(ProjectionPredicate<'tcx>),
WellFormed(GenericArg<'tcx>),
ObjectSafe(DefId),
ClosureKind(DefId, SubstsRef<'tcx>, ClosureKind),
Subtype(SubtypePredicate<'tcx>),
Coerce(CoercePredicate<'tcx>),
ConstEvaluatable(Unevaluated<'tcx, ()>),
ConstEquate(Const<'tcx>, Const<'tcx>),
TypeWellFormedFromEnv(Ty<'tcx>),
}
Variants
Trait(TraitPredicate<'tcx>)
Corresponds to where Foo: Bar<A, B, C>
. Foo
here would be
the Self
type of the trait reference and A
, B
, and C
would be the type parameters.
RegionOutlives(RegionOutlivesPredicate<'tcx>)
where 'a: 'b
TypeOutlives(TypeOutlivesPredicate<'tcx>)
where T: 'a
Projection(ProjectionPredicate<'tcx>)
where <T as TraitRef>::Name == X
, approximately.
See the ProjectionPredicate
struct for details.
WellFormed(GenericArg<'tcx>)
No syntax: T
well-formed.
ObjectSafe(DefId)
Trait must be object-safe.
ClosureKind(DefId, SubstsRef<'tcx>, ClosureKind)
No direct syntax. May be thought of as where T: FnFoo<...>
for some substitutions ...
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.
ConstEvaluatable(Unevaluated<'tcx, ()>)
Constant initializer must evaluate successfully.
ConstEquate(Const<'tcx>, Const<'tcx>)
Constants must be equal. The first component is the const that is expected.
TypeWellFormedFromEnv(Ty<'tcx>)
Represents a type found in the environment that we can use for implied bounds.
Only used for Chalk.
Trait Implementations
sourceimpl<'tcx> Clone for PredicateKind<'tcx>
impl<'tcx> Clone for PredicateKind<'tcx>
sourcefn clone(&self) -> PredicateKind<'tcx>
fn clone(&self) -> PredicateKind<'tcx>
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresourceimpl<'tcx> Debug for PredicateKind<'tcx>
impl<'tcx> Debug for PredicateKind<'tcx>
sourceimpl<'tcx, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for PredicateKind<'tcx>
impl<'tcx, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for PredicateKind<'tcx>
sourceimpl<'tcx> Display for PredicateKind<'tcx>
impl<'tcx> Display for PredicateKind<'tcx>
sourceimpl<'tcx, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for PredicateKind<'tcx>
impl<'tcx, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for PredicateKind<'tcx>
sourceimpl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> EncodableWithShorthand<E> for PredicateKind<'tcx>
impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> EncodableWithShorthand<E> for PredicateKind<'tcx>
type Variant = PredicateKind<'tcx>
fn variant(&self) -> &Self::Variant
sourceimpl<'tcx> Hash for PredicateKind<'tcx>
impl<'tcx> Hash for PredicateKind<'tcx>
sourceimpl<'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
)
sourceimpl<'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>>
sourceimpl<'tcx> PartialEq<PredicateKind<'tcx>> for PredicateKind<'tcx>
impl<'tcx> PartialEq<PredicateKind<'tcx>> for PredicateKind<'tcx>
sourcefn eq(&self, other: &PredicateKind<'tcx>) -> bool
fn eq(&self, other: &PredicateKind<'tcx>) -> bool
sourceimpl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for PredicateKind<'tcx>
impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for PredicateKind<'tcx>
sourceimpl<'tcx> TypeFoldable<'tcx> for PredicateKind<'tcx>
impl<'tcx> TypeFoldable<'tcx> for PredicateKind<'tcx>
sourcefn try_fold_with<__F: FallibleTypeFolder<'tcx>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
fn try_fold_with<__F: FallibleTypeFolder<'tcx>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
sourcefn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
fn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
. Read moresourceimpl<'tcx> TypeVisitable<'tcx> for PredicateKind<'tcx>
impl<'tcx> TypeVisitable<'tcx> for PredicateKind<'tcx>
sourcefn visit_with<__V: TypeVisitor<'tcx>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
fn visit_with<__V: TypeVisitor<'tcx>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
sourcefn 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. Read moresourcefn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
true
if this self
has any regions that escape binder
(and
hence are not bound by it). Read morefn has_escaping_bound_vars(&self) -> bool
fn has_type_flags(&self, flags: TypeFlags) -> bool
fn has_projections(&self) -> bool
fn has_opaque_types(&self) -> bool
fn references_error(&self) -> bool
fn error_reported(&self) -> Option<ErrorGuaranteed>
fn has_param_types_or_consts(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_infer_types_or_consts(&self) -> bool
fn needs_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn needs_subst(&self) -> bool
sourcefn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
sourcefn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
sourcefn is_global(&self) -> bool
fn is_global(&self) -> bool
sourcefn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
sourcefn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization. Read moreimpl<'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
sourceimpl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [T]ⓘNotable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
sourcedefault fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_debug_str(&self, Ctxt) -> String
sourcedefault fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
default fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> 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. Read moresourceimpl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
impl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
default fn from_cycle_error(tcx: CTX) -> T
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
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:
Trait
: 31 bytesRegionOutlives
: 23 bytesTypeOutlives
: 23 bytesProjection
: 31 bytesWellFormed
: 15 bytesObjectSafe
: 11 bytesClosureKind
: 23 bytesSubtype
: 31 bytesCoerce
: 23 bytesConstEvaluatable
: 31 bytesConstEquate
: 23 bytesTypeWellFormedFromEnv
: 15 bytes