Struct rustc_middle::ty::Predicate

pub struct Predicate<'tcx> {
    inner: &'tcx PredicateInner<'tcx>,
}

Fields

inner: &'tcx PredicateInner<'tcx>

Implementations

impl<'tcx> Predicate<'tcx>

pub fn kind(self) -> &'tcx PredicateKind<'tcx>

pub fn skip_binders(self) -> PredicateAtom<'tcx>

Returns the inner PredicateAtom.

The returned atom may contain unbound variables bound to binders skipped in this method. It is safe to reapply binders to the given atom.

Note that this method panics in case this predicate has unbound variables.

pub fn skip_binders_unchecked(self) -> PredicateAtom<'tcx>

Returns the inner PredicateAtom.

Note that this method does not check if the predicate has unbound variables.

Rebinding the returned atom can causes the previously bound variables to end up at the wrong binding level.

pub fn bound_atom(self, tcx: TyCtxt<'tcx>) -> Binder<PredicateAtom<'tcx>>

Allows using a Binder<PredicateAtom<'tcx>> even if the given predicate previously contained unbound variables by shifting these variables outwards.

impl<'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.

impl<'tcx> Predicate<'tcx>

pub fn to_opt_poly_trait_ref(self) -> Option<PolyTraitRef<'tcx>>

pub fn to_opt_type_outlives(self) -> Option<PolyTypeOutlivesPredicate<'tcx>>

Trait Implementations

impl<'tcx> Clone for Predicate<'tcx>

fn clone(&self) -> Predicate<'tcx>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'tcx> Copy for Predicate<'tcx>

impl<'tcx> Debug for Predicate<'tcx>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'tcx, D: TyDecoder<'tcx>> Decodable<D> for Predicate<'tcx>

fn decode(decoder: &mut D) -> Result<Predicate<'tcx>, D::Error>

impl<'tcx> Display for Predicate<'tcx>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'tcx, E: TyEncoder<'tcx>> Encodable<E> for Predicate<'tcx>

fn encode(&self, e: &mut E) -> Result<(), E::Error>

impl<'tcx, E: TyEncoder<'tcx>> EncodableWithShorthand<'tcx, E> for Predicate<'tcx>

type Variant = PredicateKind<'tcx>

fn variant(&self) -> &Self::Variant

impl<'tcx> Eq for Predicate<'tcx>

impl<'_> Hash for Predicate<'_>

fn hash<H: Hasher>(&self, s: &mut H)

Feeds this value into the given [Hasher].

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].

impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for Predicate<'tcx>

fn hash_stable(
    &self,
    hcx: &mut StableHashingContext<'a>,
    hasher: &mut StableHasher
)

impl<'tcx, '__lifted> Lift<'__lifted> for Predicate<'tcx>

type Lifted = Predicate<'__lifted>

fn lift_to_tcx(&self, __tcx: TyCtxt<'__lifted>) -> Option<Predicate<'__lifted>>

impl<'tcx> PartialEq<Predicate<'tcx>> for Predicate<'tcx>

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=.

impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for Predicate<'tcx>

type Output = P

type Error = Error

fn print(&self, cx: P) -> Result<Self::Output, Self::Error>

impl<'tcx> TypeFoldable<'tcx> for Predicate<'tcx>

fn super_fold_with<F: TypeFolder<'tcx>>(&self, folder: &mut F) -> Self

fn super_visit_with<V: TypeVisitor<'tcx>>(&self, visitor: &mut V) -> bool

fn visit_with<V: TypeVisitor<'tcx>>(&self, visitor: &mut V) -> bool

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.

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

fn fold_with<F: TypeFolder<'tcx>>(&self, folder: &mut F) -> Self

fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool

Returns true if this self has any regions that escape binder (and hence are not bound by it).

fn has_escaping_bound_vars(&self) -> bool

fn has_projections(&self) -> bool

fn has_opaque_types(&self) -> bool

fn references_error(&self) -> bool

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

fn needs_infer(&self) -> bool

fn has_placeholders(&self) -> bool

fn needs_subst(&self) -> bool

fn has_re_placeholders(&self) -> bool

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.

fn has_erased_regions(&self) -> bool

fn has_erasable_regions(&self) -> bool

True if there are any un-erased free regions.

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.

fn has_late_bound_regions(&self) -> bool

True if there are any late-bound regions

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.

fn visit_tys_shallow(&self, visit: impl FnMut(Ty<'tcx>) -> bool) -> bool

A visitor that does not recurse into types, works like fn walk_shallow in Ty.