Struct ProjectionPredicate

pub struct ProjectionPredicate<I>
where
    I: Interner,
{
    pub projection_term: AliasTerm<I>,
    pub term: <I as Interner>::Term,
}

This kind of predicate has no direct correspondent in the syntax, but it roughly corresponds to the syntactic forms:

1. T: TraitRef<..., Item = Type>
2. <T as TraitRef<...>>::Item == Type (NYI)

In particular, form #1 is “desugared” to the combination of a normal trait predicate (T: TraitRef<...>) and one of these predicates. Form #2 is a broader form in that it also permits equality between arbitrary types. Processing an instance of Form #2 eventually yields one of these ProjectionPredicate instances to normalize the LHS.

Fields

projection_term: AliasTerm<I>

term: <I as Interner>::Term

Implementations

impl<I> ProjectionPredicate<I>

where I: Interner,

pub fn self_ty(self) -> <I as Interner>::Ty

pub fn with_self_ty( self, interner: I, self_ty: <I as Interner>::Ty, ) -> ProjectionPredicate<I>

pub fn trait_def_id(self, interner: I) -> <I as Interner>::DefId

pub fn def_id(self) -> <I as Interner>::DefId

Trait Implementations

impl<I> Clone for ProjectionPredicate<I>

where I: Interner,

fn clone(&self) -> ProjectionPredicate<I>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I> Debug for ProjectionPredicate<I>

where I: Interner,

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

Formats the value using the given formatter.

impl<I, __D> Decodable<__D> for ProjectionPredicate<I>

where I: Interner, __D: TyDecoder<I = I>, AliasTerm<I>: Decodable<__D>, <I as Interner>::Term: Decodable<__D>,

fn decode(__decoder: &mut __D) -> ProjectionPredicate<I>

impl<I> Display for ProjectionPredicate<I>

where I: Interner,

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

Formats the value using the given formatter.

impl<I, __E> Encodable<__E> for ProjectionPredicate<I>

where I: Interner, __E: TyEncoder<I = I>, AliasTerm<I>: Encodable<__E>, <I as Interner>::Term: Encodable<__E>,

fn encode(&self, __encoder: &mut __E)

impl<I> Hash for ProjectionPredicate<I>

where I: Interner,

fn hash<__H>(&self, __state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<I, __CTX> HashStable<__CTX> for ProjectionPredicate<I>

where I: Interner, AliasTerm<I>: HashStable<__CTX>, <I as Interner>::Term: HashStable<__CTX>,

fn hash_stable( &self, __hcx: &mut __CTX, __hasher: &mut StableHasher<SipHasher128>, )

impl<I, J> Lift<J> for ProjectionPredicate<I>

where I: Interner, J: Interner, AliasTerm<I>: Lift<J, Lifted = AliasTerm<J>>, <I as Interner>::Term: Lift<J, Lifted = <J as Interner>::Term>,

type Lifted = ProjectionPredicate<J>

fn lift_to_interner(self, interner: J) -> Option<ProjectionPredicate<J>>

impl<I> PartialEq for ProjectionPredicate<I>

where I: Interner,

fn eq(&self, __other: &ProjectionPredicate<I>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'tcx, P> Print<'tcx, P> for ProjectionPredicate<TyCtxt<'tcx>>

where P: PrettyPrinter<'tcx>,

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

impl<I> TypeFoldable<I> for ProjectionPredicate<I>

where I: Interner, AliasTerm<I>: TypeFoldable<I>, <I as Interner>::Term: TypeFoldable<I>,

fn try_fold_with<__F>( self, __folder: &mut __F, ) -> Result<ProjectionPredicate<I>, <__F as FallibleTypeFolder<I>>::Error>

where __F: FallibleTypeFolder<I>,

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

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

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<I> TypeVisitable<I> for ProjectionPredicate<I>

where I: Interner, AliasTerm<I>: TypeVisitable<I>, <I as Interner>::Term: TypeVisitable<I>,

fn visit_with<__V>( &self, __visitor: &mut __V, ) -> <__V as TypeVisitor<I>>::Result

where __V: TypeVisitor<I>,

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, ProjectionPredicate<TyCtxt<'tcx>>> for Clause<'tcx>

fn upcast_from( from: ProjectionPredicate<TyCtxt<'tcx>>, tcx: TyCtxt<'tcx>, ) -> Clause<'tcx>

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, ProjectionPredicate<TyCtxt<'tcx>>> for Predicate<'tcx>

fn upcast_from( from: ProjectionPredicate<TyCtxt<'tcx>>, tcx: TyCtxt<'tcx>, ) -> Predicate<'tcx>

impl<I> Copy for ProjectionPredicate<I>

where I: Interner,

impl<I> Eq for ProjectionPredicate<I>

where I: Interner,

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.