Struct TraitPredicate

pub struct TraitPredicate<I: Interner> {
    pub trait_ref: TraitRef<I>,
    pub polarity: PredicatePolarity,
}

Fields

trait_ref: TraitRef<I>

polarity: PredicatePolarity

If polarity is Positive: we are proving that the trait is implemented.

If polarity is Negative: we are proving that a negative impl of this trait exists. (Note that coherence also checks whether negative impls of supertraits exist via a series of predicates.)

If polarity is Reserved: that’s a bug.

Implementations

impl<I: Interner> TraitPredicate<I>

pub fn with_self_ty(self, interner: I, self_ty: I::Ty) -> Self

pub fn def_id(self) -> I::DefId

pub fn self_ty(self) -> I::Ty

Trait Implementations

impl<I> Clone for TraitPredicate<I>

where I: Interner,

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Interner> Debug for TraitPredicate<I>

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

Formats the value using the given formatter.

impl<I: Interner, __D: TyDecoder<I = I>> Decodable<__D> for TraitPredicate<I>

where TraitRef<I>: Decodable<__D>,

fn decode(__decoder: &mut __D) -> Self

impl<I: Interner> Display for TraitPredicate<I>

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

Formats the value using the given formatter.

impl<I: Interner, __E: TyEncoder<I = I>> Encodable<__E> for TraitPredicate<I>

where TraitRef<I>: Encodable<__E>,

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

impl<I> Hash for TraitPredicate<I>

where I: Interner,

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

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: Interner, __CTX> HashStable<__CTX> for TraitPredicate<I>

where TraitRef<I>: HashStable<__CTX>,

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

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

where I: Interner, J: Interner, TraitRef<I>: Lift<J, Lifted = TraitRef<J>>, PredicatePolarity: Lift<J, Lifted = PredicatePolarity>,

type Lifted = TraitPredicate<J>

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

impl<I> PartialEq for TraitPredicate<I>

where I: Interner,

fn eq(&self, __other: &Self) -> 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<I: Interner> Relate<I> for TraitPredicate<I>

fn relate<R: TypeRelation<I>>( relation: &mut R, a: TraitPredicate<I>, b: TraitPredicate<I>, ) -> RelateResult<I, TraitPredicate<I>>

impl<I> TypeFoldable<I> for TraitPredicate<I>

where I: Interner, TraitRef<I>: TypeFoldable<I>,

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

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

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

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 TraitPredicate<I>

where I: Interner, TraitRef<I>: TypeVisitable<I>,

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

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

impl<I: Interner> UpcastFrom<I, TraitRef<I>> for TraitPredicate<I>

fn upcast_from(from: TraitRef<I>, _tcx: I) -> Self

impl<I> Copy for TraitPredicate<I>

where I: Interner,

impl<I> Eq for TraitPredicate<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.