Struct TraitPredicate

pub struct TraitPredicate<I>
where
    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> TraitPredicate<I>

where I: Interner,

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

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

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

Trait Implementations

impl<I> Clone for TraitPredicate<I>

where I: Interner,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

where I: Interner, __D: TyDecoder<I = I>, TraitRef<I>: Decodable<__D>,

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

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

where I: Interner, __E: TyEncoder<I = I>, TraitRef<I>: Encodable<__E>,

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

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

where I: Interner, TraitRef<I>: HashStable<__CTX>,

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

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

impl<I> PartialEq for TraitPredicate<I>

where I: Interner,

fn eq(&self, __other: &TraitPredicate<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 TraitPredicate<TyCtxt<'tcx>>

where P: PrettyPrinter<'tcx>,

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

impl<'tcx> PrintTraitPredicateExt<'tcx> for TraitPredicate<TyCtxt<'tcx>>

fn print_modifiers_and_trait_path(self) -> TraitPredPrintModifiersAndPath<'tcx>

impl<I> Relate<I> for TraitPredicate<I>

where I: Interner,

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

where R: TypeRelation<I>,

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

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

fn try_fold_with<__F>( self, __folder: &mut __F, ) -> Result<TraitPredicate<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 TraitPredicate<I>

where I: Interner, TraitRef<I>: 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<I> UpcastFrom<I, TraitRef<I>> for TraitPredicate<I>

where I: Interner,

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

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

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

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

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

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.