Enum ExistentialPredicate

pub enum ExistentialPredicate<I>
where
    I: Interner,
{
    Trait(ExistentialTraitRef<I>),
    Projection(ExistentialProjection<I>),
    AutoTrait(<I as Interner>::DefId),
}

Variants

Trait(ExistentialTraitRef<I>)

E.g., Iterator.

Projection(ExistentialProjection<I>)

E.g., Iterator::Item = T.

AutoTrait(<I as Interner>::DefId)

E.g., Send.

Trait Implementations

impl<I> Clone for ExistentialPredicate<I>

where I: Interner,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

where I: Interner, __D: TyDecoder<I = I>, ExistentialTraitRef<I>: Decodable<__D>, ExistentialProjection<I>: Decodable<__D>, <I as Interner>::DefId: Decodable<__D>,

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

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

where I: Interner, __E: TyEncoder<I = I>, ExistentialTraitRef<I>: Encodable<__E>, ExistentialProjection<I>: Encodable<__E>, <I as Interner>::DefId: Encodable<__E>,

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

impl<'tcx> ExistentialPredicateStableCmpExt<'tcx> for ExistentialPredicate<TyCtxt<'tcx>>

fn stable_cmp( &self, tcx: TyCtxt<'tcx>, other: &ExistentialPredicate<TyCtxt<'tcx>>, ) -> Ordering

Compares via an ordering that will not change if modules are reordered or other changes are made to the tree. In particular, this ordering is preserved across incremental compilations.

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

where I: Interner, ExistentialTraitRef<I>: HashStable<__CTX>, ExistentialProjection<I>: HashStable<__CTX>, <I as Interner>::DefId: HashStable<__CTX>,

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

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

where I: Interner, J: Interner, ExistentialTraitRef<I>: Lift<J, Lifted = ExistentialTraitRef<J>>, ExistentialProjection<I>: Lift<J, Lifted = ExistentialProjection<J>>, <I as Interner>::DefId: Lift<J, Lifted = <J as Interner>::DefId>,

type Lifted = ExistentialPredicate<J>

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

impl<I> PartialEq for ExistentialPredicate<I>

where I: Interner,

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

where P: PrettyPrinter<'tcx>,

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

impl<I> TypeFoldable<I> for ExistentialPredicate<I>

where I: Interner, ExistentialTraitRef<I>: TypeFoldable<I>, ExistentialProjection<I>: TypeFoldable<I>, <I as Interner>::DefId: TypeFoldable<I>,

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

where I: Interner, ExistentialTraitRef<I>: TypeVisitable<I>, ExistentialProjection<I>: TypeVisitable<I>, <I as Interner>::DefId: 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> Copy for ExistentialPredicate<I>

where I: Interner,

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