Struct rustc_middle::ty::OutlivesPredicate

pub struct OutlivesPredicate<A, B>(pub A, pub B);

A: B

Tuple Fields

0: A

1: B

Trait Implementations

impl<A: Clone, B: Clone> Clone for OutlivesPredicate<A, B>

fn clone(&self) -> OutlivesPredicate<A, B>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Debug, B: Debug> Debug for OutlivesPredicate<A, B>

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

Formats the value using the given formatter.

impl<'tcx, A, B, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for OutlivesPredicate<A, B>where A: Decodable<__D>, B: Decodable<__D>,

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

impl<'tcx> Display for OutlivesPredicate<Region<'tcx>, Region<'tcx>>

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

Formats the value using the given formatter.

impl<'tcx> Display for OutlivesPredicate<Ty<'tcx>, Region<'tcx>>

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

Formats the value using the given formatter.

impl<'tcx, A, B, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for OutlivesPredicate<A, B>where A: Encodable<__E>, B: Encodable<__E>,

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

impl<A: Hash, B: Hash> Hash for OutlivesPredicate<A, B>

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<'__ctx, A, B> HashStable<StableHashingContext<'__ctx>> for OutlivesPredicate<A, B>where A: HashStable<StableHashingContext<'__ctx>>, B: HashStable<StableHashingContext<'__ctx>>,

fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )

impl<'__lifted, A, B> Lift<'__lifted> for OutlivesPredicate<A, B>where A: Lift<'__lifted>, B: Lift<'__lifted>,

type Lifted = OutlivesPredicate<<A as Lift<'__lifted>>::Lifted, <B as Lift<'__lifted>>::Lifted>

fn lift_to_tcx( self, __tcx: TyCtxt<'__lifted> ) -> Option<OutlivesPredicate<A::Lifted, B::Lifted>>

impl<A: Ord, B: Ord> Ord for OutlivesPredicate<A, B>

fn cmp(&self, other: &OutlivesPredicate<A, B>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl<A: PartialEq, B: PartialEq> PartialEq<OutlivesPredicate<A, B>> for OutlivesPredicate<A, B>

fn eq(&self, other: &OutlivesPredicate<A, B>) -> bool

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

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

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

impl<A: PartialOrd, B: PartialOrd> PartialOrd<OutlivesPredicate<A, B>> for OutlivesPredicate<A, B>

fn partial_cmp(&self, other: &OutlivesPredicate<A, B>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'tcx, T, U, P: PrettyPrinter<'tcx>> Print<'tcx, P> for OutlivesPredicate<T, U>where T: Print<'tcx, P, Output = P, Error = P::Error>, U: Print<'tcx, P, Output = P, Error = P::Error>,

type Output = P

type Error = Error

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

impl<'tcx> ToPredicate<'tcx, Predicate<'tcx>> for OutlivesPredicate<Ty<'tcx>, Region<'tcx>>

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

impl<'tcx, A, B> TypeFoldable<TyCtxt<'tcx>> for OutlivesPredicate<A, B>where A: TypeFoldable<TyCtxt<'tcx>>, B: TypeFoldable<TyCtxt<'tcx>>,

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( 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>(self, folder: &mut F) -> Selfwhere 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<'tcx, A, B> TypeVisitable<TyCtxt<'tcx>> for OutlivesPredicate<A, B>where A: TypeVisitable<TyCtxt<'tcx>>, B: TypeVisitable<TyCtxt<'tcx>>,

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V ) -> ControlFlow<__V::BreakTy>

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

impl<A: Copy, B: Copy> Copy for OutlivesPredicate<A, B>

impl<A: Eq, B: Eq> Eq for OutlivesPredicate<A, B>

impl<A, B> StructuralEq for OutlivesPredicate<A, B>

impl<A, B> StructuralPartialEq for OutlivesPredicate<A, B>

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.