Struct rustc_middle::ty::Predicate
source · pub struct Predicate<'tcx>(Interned<'tcx, PredicateS<'tcx>>);
Expand description
Use this rather than PredicateS
, whenever possible.
Tuple Fields
0: Interned<'tcx, PredicateS<'tcx>>
Implementations
sourceimpl<'tcx> Predicate<'tcx>
impl<'tcx> Predicate<'tcx>
sourcepub fn kind(self) -> Binder<'tcx, PredicateKind<'tcx>>
pub fn kind(self) -> Binder<'tcx, PredicateKind<'tcx>>
Gets the inner Binder<'tcx, PredicateKind<'tcx>>
.
pub fn flags(self) -> TypeFlags
pub fn outer_exclusive_binder(self) -> DebruijnIndex
sourcepub fn flip_polarity(self, tcx: TyCtxt<'tcx>) -> Option<Predicate<'tcx>>
pub fn flip_polarity(self, tcx: TyCtxt<'tcx>) -> Option<Predicate<'tcx>>
Flips the polarity of a Predicate.
Given T: Trait
predicate it returns T: !Trait
and given T: !Trait
returns T: Trait
.
pub fn without_const(self, tcx: TyCtxt<'tcx>) -> Self
sourcepub fn allow_normalization(self) -> bool
pub fn allow_normalization(self) -> bool
Whether this projection can be soundly normalized.
Wf predicates must not be normalized, as normalization can remove required bounds which would cause us to unsoundly accept some programs. See #91068.
sourceimpl<'tcx> Predicate<'tcx>
impl<'tcx> Predicate<'tcx>
sourcepub fn subst_supertrait(
self,
tcx: TyCtxt<'tcx>,
trait_ref: &PolyTraitRef<'tcx>
) -> Predicate<'tcx>
pub fn subst_supertrait(
self,
tcx: TyCtxt<'tcx>,
trait_ref: &PolyTraitRef<'tcx>
) -> Predicate<'tcx>
Performs a substitution suitable for going from a poly-trait-ref to supertraits that must hold if that poly-trait-ref holds. This is slightly different from a normal substitution in terms of what happens with bound regions. See lengthy comment below for details.
sourceimpl<'tcx> Predicate<'tcx>
impl<'tcx> Predicate<'tcx>
pub fn to_opt_poly_trait_pred(self) -> Option<PolyTraitPredicate<'tcx>>
pub fn to_opt_poly_projection_pred(
self
) -> Option<PolyProjectionPredicate<'tcx>>
pub fn to_opt_type_outlives(self) -> Option<PolyTypeOutlivesPredicate<'tcx>>
Trait Implementations
sourceimpl<'a, 'tcx> HashStable<StableHashingContext<'a>> for Predicate<'tcx>
impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for Predicate<'tcx>
fn hash_stable(
&self,
hcx: &mut StableHashingContext<'a>,
hasher: &mut StableHasher
)
sourceimpl IntoDiagnosticArg for Predicate<'_>
impl IntoDiagnosticArg for Predicate<'_>
fn into_diagnostic_arg(self) -> DiagnosticArgValue<'static>
sourceimpl ParameterizedOverTcx for Predicate<'static>
impl ParameterizedOverTcx for Predicate<'static>
sourceimpl<'tcx> PartialEq<Predicate<'tcx>> for Predicate<'tcx>
impl<'tcx> PartialEq<Predicate<'tcx>> for Predicate<'tcx>
sourceimpl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for Predicate<'tcx>
impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for Predicate<'tcx>
sourceimpl<'tcx> ToPredicate<'tcx> for Predicate<'tcx>
impl<'tcx> ToPredicate<'tcx> for Predicate<'tcx>
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> Predicate<'tcx>
sourceimpl<'tcx> TypeFoldable<'tcx> for Predicate<'tcx>
impl<'tcx> TypeFoldable<'tcx> for Predicate<'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> TypeSuperFoldable<'tcx> for Predicate<'tcx>
impl<'tcx> TypeSuperFoldable<'tcx> for Predicate<'tcx>
sourcefn try_super_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
fn try_super_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
TypeFolder
methods, when a non-custom traversal is
desired for the value of the type of interest passed to that method.
For example, in MyFolder::try_fold_ty(ty)
, it is valid to call
ty.try_super_fold_with(self)
, but any other folding should be done
with xyz.try_fold_with(self)
. Read moresourcefn super_fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
fn super_fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
try_super_fold_with
for use with
infallible folders. Do not override this method, to ensure coherence
with try_super_fold_with
. Read moresourceimpl<'tcx> TypeSuperVisitable<'tcx> for Predicate<'tcx>
impl<'tcx> TypeSuperVisitable<'tcx> for Predicate<'tcx>
sourcefn super_visit_with<V: TypeVisitor<'tcx>>(
&self,
visitor: &mut V
) -> ControlFlow<V::BreakTy>
fn super_visit_with<V: TypeVisitor<'tcx>>(
&self,
visitor: &mut V
) -> ControlFlow<V::BreakTy>
TypeVisitor
methods, when a non-custom traversal is
desired for the value of the type of interest passed to that method.
For example, in MyVisitor::visit_ty(ty)
, it is valid to call
ty.super_visit_with(self)
, but any other visiting should be done
with xyz.visit_with(self)
. Read moresourceimpl<'tcx> TypeVisitable<'tcx> for Predicate<'tcx>
impl<'tcx> TypeVisitable<'tcx> for Predicate<'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 morefn has_type_flags(&self, flags: TypeFlags) -> bool
sourcefn 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_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 Predicate<'tcx>
impl<'tcx> Eq for Predicate<'tcx>
impl<'tcx> StructuralEq for Predicate<'tcx>
impl<'tcx> StructuralPartialEq for Predicate<'tcx>
Auto Trait Implementations
impl<'tcx> !RefUnwindSafe for Predicate<'tcx>
impl<'tcx> Send for Predicate<'tcx>
impl<'tcx> Sync for Predicate<'tcx>
impl<'tcx> Unpin for Predicate<'tcx>
impl<'tcx> !UnwindSafe for Predicate<'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: 8 bytes